./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-libowfat/build_fullname_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 91b1670e Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/termination-libowfat/build_fullname_true-termination.c.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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-91b1670 [2018-11-28 23:17:36,035 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 23:17:36,037 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 23:17:36,048 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 23:17:36,049 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 23:17:36,054 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 23:17:36,055 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 23:17:36,058 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 23:17:36,061 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 23:17:36,062 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 23:17:36,063 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 23:17:36,063 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 23:17:36,065 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 23:17:36,066 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 23:17:36,067 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 23:17:36,068 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 23:17:36,069 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 23:17:36,071 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 23:17:36,073 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 23:17:36,075 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 23:17:36,076 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 23:17:36,078 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 23:17:36,087 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 23:17:36,087 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 23:17:36,087 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 23:17:36,089 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 23:17:36,092 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 23:17:36,093 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 23:17:36,094 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 23:17:36,095 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 23:17:36,095 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 23:17:36,096 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 23:17:36,096 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 23:17:36,096 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 23:17:36,097 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 23:17:36,098 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 23:17:36,098 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-28 23:17:36,128 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 23:17:36,129 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 23:17:36,134 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 23:17:36,135 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 23:17:36,135 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 23:17:36,136 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 23:17:36,136 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 23:17:36,136 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 23:17:36,136 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 23:17:36,137 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 23:17:36,137 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 23:17:36,137 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 23:17:36,137 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 23:17:36,137 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 23:17:36,138 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 23:17:36,138 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 23:17:36,138 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 23:17:36,138 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 23:17:36,138 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 23:17:36,138 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 23:17:36,139 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 23:17:36,139 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 23:17:36,139 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 23:17:36,139 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 23:17:36,139 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 23:17:36,140 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 23:17:36,140 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 23:17:36,140 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 23:17:36,141 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 23:17:36,141 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d5a9d2464f90cb604e81a75f4f55e926d182d9fa [2018-11-28 23:17:36,186 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 23:17:36,203 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 23:17:36,208 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 23:17:36,210 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 23:17:36,211 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 23:17:36,212 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-libowfat/build_fullname_true-termination.c.i [2018-11-28 23:17:36,270 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79a49e86a/6c1e68f585ad4764bc5ec0f62fede3f0/FLAGd82b298bd [2018-11-28 23:17:36,853 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 23:17:36,854 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-libowfat/build_fullname_true-termination.c.i [2018-11-28 23:17:36,871 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79a49e86a/6c1e68f585ad4764bc5ec0f62fede3f0/FLAGd82b298bd [2018-11-28 23:17:37,134 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79a49e86a/6c1e68f585ad4764bc5ec0f62fede3f0 [2018-11-28 23:17:37,139 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 23:17:37,141 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 23:17:37,143 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 23:17:37,143 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 23:17:37,148 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 23:17:37,149 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:17:37" (1/1) ... [2018-11-28 23:17:37,152 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@787a80ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:17:37, skipping insertion in model container [2018-11-28 23:17:37,153 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:17:37" (1/1) ... [2018-11-28 23:17:37,161 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 23:17:37,214 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 23:17:37,626 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:17:37,651 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 23:17:37,708 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:17:37,848 INFO L195 MainTranslator]: Completed translation [2018-11-28 23:17:37,849 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:17:37 WrapperNode [2018-11-28 23:17:37,849 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 23:17:37,850 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 23:17:37,850 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 23:17:37,850 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 23:17:37,861 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:17:37" (1/1) ... [2018-11-28 23:17:37,883 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:17:37" (1/1) ... [2018-11-28 23:17:37,912 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 23:17:37,912 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 23:17:37,913 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 23:17:37,913 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 23:17:37,924 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:17:37" (1/1) ... [2018-11-28 23:17:37,925 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:17:37" (1/1) ... [2018-11-28 23:17:37,938 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:17:37" (1/1) ... [2018-11-28 23:17:37,938 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:17:37" (1/1) ... [2018-11-28 23:17:37,960 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:17:37" (1/1) ... [2018-11-28 23:17:37,966 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:17:37" (1/1) ... [2018-11-28 23:17:37,968 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:17:37" (1/1) ... [2018-11-28 23:17:37,972 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 23:17:37,972 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 23:17:37,972 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 23:17:37,972 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 23:17:37,973 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:17:37" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:17:38,037 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 23:17:38,038 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 23:17:38,038 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 23:17:38,038 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 23:17:38,038 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 23:17:38,038 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 23:17:38,626 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 23:17:38,627 INFO L280 CfgBuilder]: Removed 15 assue(true) statements. [2018-11-28 23:17:38,627 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:17:38 BoogieIcfgContainer [2018-11-28 23:17:38,627 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 23:17:38,628 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 23:17:38,628 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 23:17:38,631 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 23:17:38,632 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:17:38,632 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 11:17:37" (1/3) ... [2018-11-28 23:17:38,633 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3f9a52b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:17:38, skipping insertion in model container [2018-11-28 23:17:38,633 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:17:38,634 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:17:37" (2/3) ... [2018-11-28 23:17:38,634 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3f9a52b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:17:38, skipping insertion in model container [2018-11-28 23:17:38,634 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:17:38,635 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:17:38" (3/3) ... [2018-11-28 23:17:38,637 INFO L375 chiAutomizerObserver]: Analyzing ICFG build_fullname_true-termination.c.i [2018-11-28 23:17:38,699 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 23:17:38,699 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 23:17:38,700 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 23:17:38,700 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 23:17:38,700 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 23:17:38,700 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 23:17:38,700 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 23:17:38,700 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 23:17:38,700 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 23:17:38,715 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states. [2018-11-28 23:17:38,739 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2018-11-28 23:17:38,740 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:17:38,740 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:17:38,748 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:17:38,748 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 23:17:38,748 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 23:17:38,749 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states. [2018-11-28 23:17:38,751 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2018-11-28 23:17:38,752 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:17:38,752 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:17:38,752 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:17:38,752 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 23:17:38,762 INFO L794 eck$LassoCheckResult]: Stem: 25#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8#L-1true havoc main_#res;havoc main_#t~nondet19, main_#t~nondet20, main_#t~malloc21.base, main_#t~malloc21.offset, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_~dir_len~0, main_~file_len~0, main_~dir~0.base, main_~dir~0.offset, main_~file~0.base, main_~file~0.offset, main_~output~0.base, main_~output~0.offset;main_~dir_len~0 := main_#t~nondet19;havoc main_#t~nondet19; 9#L532true assume !(main_~dir_len~0 < 1);main_~file_len~0 := main_#t~nondet20;havoc main_#t~nondet20; 20#L534true assume !(main_~file_len~0 < 1);call main_#t~malloc21.base, main_#t~malloc21.offset := #Ultimate.alloc(main_~dir_len~0);main_~dir~0.base, main_~dir~0.offset := main_#t~malloc21.base, main_#t~malloc21.offset;call write~int(0, main_~dir~0.base, main_~dir~0.offset + (main_~dir_len~0 - 1), 1);call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.alloc(main_~file_len~0);main_~file~0.base, main_~file~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call write~int(0, main_~file~0.base, main_~file~0.offset + (main_~file_len~0 - 1), 1);call main_#t~malloc23.base, main_#t~malloc23.offset := #Ultimate.alloc(2 + (main_~dir_len~0 + main_~file_len~0));main_~output~0.base, main_~output~0.offset := main_#t~malloc23.base, main_#t~malloc23.offset;build_fullname_#in~fullname.base, build_fullname_#in~fullname.offset, build_fullname_#in~directory.base, build_fullname_#in~directory.offset, build_fullname_#in~filename.base, build_fullname_#in~filename.offset := main_~output~0.base, main_~output~0.offset, main_~dir~0.base, main_~dir~0.offset, main_~file~0.base, main_~file~0.offset;havoc build_fullname_#t~mem8, build_fullname_#t~mem9, build_fullname_#t~short10, build_fullname_#t~pre11.base, build_fullname_#t~pre11.offset, build_fullname_#t~mem12, build_fullname_#t~mem13, build_fullname_#t~short14, build_fullname_#t~ret15.base, build_fullname_#t~ret15.offset, build_fullname_#t~ret16.base, build_fullname_#t~ret16.offset, build_fullname_#t~pre17.base, build_fullname_#t~pre17.offset, build_fullname_#t~ret18.base, build_fullname_#t~ret18.offset, build_fullname_~fullname.base, build_fullname_~fullname.offset, build_fullname_~directory.base, build_fullname_~directory.offset, build_fullname_~filename.base, build_fullname_~filename.offset, build_fullname_~dest~0.base, build_fullname_~dest~0.offset;build_fullname_~fullname.base, build_fullname_~fullname.offset := build_fullname_#in~fullname.base, build_fullname_#in~fullname.offset;build_fullname_~directory.base, build_fullname_~directory.offset := build_fullname_#in~directory.base, build_fullname_#in~directory.offset;build_fullname_~filename.base, build_fullname_~filename.offset := build_fullname_#in~filename.base, build_fullname_#in~filename.offset;build_fullname_~dest~0.base, build_fullname_~dest~0.offset := build_fullname_~fullname.base, build_fullname_~fullname.offset;call build_fullname_#t~mem8 := read~int(build_fullname_~directory.base, build_fullname_~directory.offset, 1);build_fullname_#t~short10 := 47 == build_fullname_#t~mem8; 10#L521true assume build_fullname_#t~short10;call build_fullname_#t~mem9 := read~int(build_fullname_~directory.base, 1 + build_fullname_~directory.offset, 1);build_fullname_#t~short10 := 0 == build_fullname_#t~mem9; 13#L521-2true assume build_fullname_#t~short10;havoc build_fullname_#t~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 [2018-11-28 23:17:38,762 INFO L796 eck$LassoCheckResult]: Loop: 24#L508-8true strcpy_#t~post2.base, strcpy_#t~post2.offset := strcpy_~s1.base, strcpy_~s1.offset;strcpy_~s1.base, strcpy_~s1.offset := strcpy_#t~post2.base, 1 + strcpy_#t~post2.offset;strcpy_#t~post3.base, strcpy_#t~post3.offset := strcpy_~s2.base, strcpy_~s2.offset;strcpy_~s2.base, strcpy_~s2.offset := strcpy_#t~post3.base, 1 + strcpy_#t~post3.offset;call strcpy_#t~mem4 := read~int(strcpy_#t~post3.base, strcpy_#t~post3.offset, 1);call write~int(strcpy_#t~mem4, strcpy_#t~post2.base, strcpy_#t~post2.offset, 1); 7#L508-6true assume !!(0 != strcpy_#t~mem4);havoc strcpy_#t~mem4;havoc strcpy_#t~post3.base, strcpy_#t~post3.offset;havoc strcpy_#t~post2.base, strcpy_#t~post2.offset; 24#L508-8true [2018-11-28 23:17:38,768 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:38,768 INFO L82 PathProgramCache]: Analyzing trace with hash 1806905919, now seen corresponding path program 1 times [2018-11-28 23:17:38,771 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:17:38,771 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:17:38,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:38,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:17:38,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:38,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:38,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:38,992 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:38,993 INFO L82 PathProgramCache]: Analyzing trace with hash 3590, now seen corresponding path program 1 times [2018-11-28 23:17:38,993 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:17:38,993 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:17:38,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:38,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:17:38,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:39,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:39,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:39,035 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:39,038 INFO L82 PathProgramCache]: Analyzing trace with hash 1269803204, now seen corresponding path program 1 times [2018-11-28 23:17:39,038 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:17:39,038 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:17:39,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:39,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:17:39,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:39,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:39,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:39,470 WARN L180 SmtUtils]: Spent 287.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2018-11-28 23:17:41,258 WARN L180 SmtUtils]: Spent 1.68 s on a formula simplification. DAG size of input: 185 DAG size of output: 150 [2018-11-28 23:17:41,818 WARN L180 SmtUtils]: Spent 536.00 ms on a formula simplification that was a NOOP. DAG size: 132 [2018-11-28 23:17:41,831 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:17:41,832 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:17:41,833 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:17:41,833 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:17:41,833 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:17:41,833 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:17:41,833 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:17:41,834 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:17:41,834 INFO L131 ssoRankerPreferences]: Filename of dumped script: build_fullname_true-termination.c.i_Iteration1_Lasso [2018-11-28 23:17:41,834 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:17:41,835 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:17:41,866 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:41,907 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:41,922 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:41,930 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:41,934 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:41,941 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:41,946 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:41,950 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:41,953 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:41,975 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:41,992 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:42,000 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:42,002 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:42,008 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:42,018 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:42,022 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:42,027 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:42,033 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:42,035 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:42,037 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:42,044 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:42,047 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:43,148 WARN L180 SmtUtils]: Spent 512.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 115 [2018-11-28 23:17:43,361 WARN L180 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 72 [2018-11-28 23:17:43,361 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:43,363 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:43,393 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:43,395 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:43,397 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:43,399 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:43,401 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:43,852 WARN L180 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2018-11-28 23:17:43,962 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-11-28 23:17:44,440 WARN L180 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2018-11-28 23:17:44,525 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:17:44,531 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:17:44,533 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:17:44,536 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:44,536 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:17:44,538 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:44,538 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:44,538 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:44,541 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:17:44,541 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:17:44,544 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:17:44,545 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:17:44,545 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:44,545 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:17:44,547 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:44,547 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:44,547 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:44,548 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:17:44,548 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:17:44,550 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:17:44,551 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:17:44,551 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:44,551 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:44,552 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:44,552 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:44,556 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:17:44,556 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:17:44,560 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:17:44,560 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:17:44,562 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:44,562 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:17:44,562 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:44,562 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:44,563 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:44,563 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:17:44,563 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:17:44,564 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:17:44,564 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:17:44,567 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:44,567 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:17:44,567 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:44,567 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:44,567 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:44,569 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:17:44,569 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:17:44,570 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:17:44,570 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:17:44,571 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:44,571 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:17:44,571 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:44,571 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:44,571 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:44,574 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:17:44,574 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:17:44,575 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:17:44,576 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:17:44,576 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:44,576 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:17:44,578 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:44,578 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:44,578 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:44,579 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:17:44,579 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:17:44,580 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:17:44,581 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:17:44,581 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:44,582 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:17:44,582 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:44,582 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:44,582 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:44,583 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:17:44,584 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:17:44,585 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:17:44,586 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:17:44,587 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:44,587 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:17:44,587 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:44,587 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:44,587 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:44,588 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:17:44,588 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:17:44,591 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:17:44,591 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:17:44,592 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:44,593 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:17:44,593 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:44,593 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:44,593 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:44,594 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:17:44,594 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:17:44,596 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:17:44,597 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:17:44,597 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:44,597 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:17:44,597 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:44,599 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:44,599 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:44,600 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:17:44,600 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:17:44,601 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:17:44,602 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:17:44,602 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:44,604 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:17:44,604 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:44,605 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:44,605 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:44,605 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:17:44,605 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:17:44,607 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:17:44,608 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:17:44,608 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:44,608 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:17:44,610 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:44,610 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:44,610 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:44,611 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:17:44,612 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:17:44,612 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:17:44,613 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:17:44,615 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:44,615 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:17:44,615 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:44,615 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:44,615 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:44,616 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:17:44,617 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:17:44,617 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:17:44,618 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:17:44,619 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:44,619 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:17:44,619 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:44,619 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:44,619 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:44,620 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:17:44,620 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:17:44,621 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:17:44,623 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:17:44,624 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:44,624 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:17:44,624 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:44,624 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:44,624 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:44,625 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:17:44,625 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:17:44,626 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:17:44,628 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:17:44,629 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:44,629 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:17:44,629 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:44,630 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:44,630 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:44,630 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:17:44,630 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:17:44,634 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:17:44,634 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:17:44,635 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:44,635 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:17:44,635 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:44,635 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:44,635 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:44,636 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:17:44,636 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:17:44,637 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:17:44,637 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:17:44,638 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:44,638 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:17:44,638 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:44,638 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:44,638 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:44,639 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:17:44,639 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:17:44,640 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:17:44,640 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:17:44,641 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:44,641 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:17:44,641 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:44,641 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:44,641 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:44,642 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:17:44,642 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:17:44,643 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:17:44,643 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:17:44,643 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:44,644 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:44,644 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:44,644 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:44,645 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:17:44,646 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:17:44,648 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:17:44,649 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:17:44,649 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:44,649 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:44,650 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:44,650 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:44,652 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:17:44,652 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:17:44,665 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:17:44,665 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:17:44,666 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:44,666 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:17:44,666 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:44,667 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:44,672 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:17:44,672 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:17:44,698 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:17:44,699 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:17:44,699 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:44,700 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:44,700 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:44,700 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:44,701 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:17:44,701 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:17:44,705 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:17:44,706 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:17:44,706 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:44,707 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:17:44,707 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:44,707 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 23:17:44,707 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:44,708 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 23:17:44,708 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:17:44,711 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:17:44,711 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:17:44,712 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:44,712 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:17:44,712 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:44,712 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:44,712 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:44,713 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:17:44,713 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:17:44,714 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:17:44,714 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:17:44,715 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:44,715 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:44,715 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:44,715 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:44,716 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:17:44,717 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:17:44,722 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:17:44,722 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:17:44,723 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:44,723 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:44,723 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:44,723 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:44,726 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:17:44,726 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:17:44,731 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:17:44,736 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:17:44,736 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:44,736 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:17:44,737 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:44,737 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:44,743 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:17:44,743 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:17:44,779 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:17:44,780 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:17:44,780 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:44,784 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:17:44,784 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:44,784 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:44,790 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:17:44,790 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:17:44,801 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:17:44,802 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:17:44,802 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:44,804 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:44,804 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:44,804 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:44,807 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:17:44,807 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:17:44,811 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:17:44,811 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:17:44,812 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:44,812 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:17:44,812 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:44,812 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:44,812 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:44,815 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:17:44,815 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:17:44,817 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:17:44,817 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:17:44,818 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:44,818 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:44,818 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:44,818 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:44,821 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:17:44,821 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:17:44,825 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:17:44,825 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:17:44,827 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:44,827 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:44,828 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:44,828 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:44,837 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:17:44,837 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:17:44,954 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:17:45,013 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-28 23:17:45,013 INFO L444 ModelExtractionUtils]: 72 out of 79 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-28 23:17:45,016 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:17:45,018 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:17:45,020 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:17:45,021 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc23.base)_1, ULTIMATE.start_strcpy_~s1.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc23.base)_1 - 1*ULTIMATE.start_strcpy_~s1.offset Supporting invariants [] [2018-11-28 23:17:45,549 INFO L297 tatePredicateManager]: 34 out of 35 supporting invariants were superfluous and have been removed [2018-11-28 23:17:45,558 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-28 23:17:45,584 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:45,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:17:45,622 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:17:45,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:17:45,678 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:17:45,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:17:45,737 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-11-28 23:17:45,738 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states. Second operand 4 states. [2018-11-28 23:17:45,924 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26 states.. Second operand 4 states. Result 59 states and 81 transitions. Complement of second has 8 states. [2018-11-28 23:17:45,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 1 non-accepting loop states 2 accepting loop states [2018-11-28 23:17:45,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 23:17:45,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 63 transitions. [2018-11-28 23:17:45,931 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 63 transitions. Stem has 7 letters. Loop has 2 letters. [2018-11-28 23:17:45,932 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:17:45,933 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 63 transitions. Stem has 9 letters. Loop has 2 letters. [2018-11-28 23:17:45,933 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:17:45,933 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 63 transitions. Stem has 7 letters. Loop has 4 letters. [2018-11-28 23:17:45,933 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:17:45,934 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 81 transitions. [2018-11-28 23:17:45,940 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2018-11-28 23:17:45,944 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 22 states and 27 transitions. [2018-11-28 23:17:45,945 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2018-11-28 23:17:45,946 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2018-11-28 23:17:45,946 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 27 transitions. [2018-11-28 23:17:45,947 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:17:45,947 INFO L705 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2018-11-28 23:17:45,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 27 transitions. [2018-11-28 23:17:45,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2018-11-28 23:17:45,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-28 23:17:45,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2018-11-28 23:17:45,973 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2018-11-28 23:17:45,973 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2018-11-28 23:17:45,973 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 23:17:45,973 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 25 transitions. [2018-11-28 23:17:45,974 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2018-11-28 23:17:45,974 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:17:45,974 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:17:45,975 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:17:45,975 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 23:17:45,975 INFO L794 eck$LassoCheckResult]: Stem: 308#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 305#L-1 havoc main_#res;havoc main_#t~nondet19, main_#t~nondet20, main_#t~malloc21.base, main_#t~malloc21.offset, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_~dir_len~0, main_~file_len~0, main_~dir~0.base, main_~dir~0.offset, main_~file~0.base, main_~file~0.offset, main_~output~0.base, main_~output~0.offset;main_~dir_len~0 := main_#t~nondet19;havoc main_#t~nondet19; 306#L532 assume !(main_~dir_len~0 < 1);main_~file_len~0 := main_#t~nondet20;havoc main_#t~nondet20; 301#L534 assume !(main_~file_len~0 < 1);call main_#t~malloc21.base, main_#t~malloc21.offset := #Ultimate.alloc(main_~dir_len~0);main_~dir~0.base, main_~dir~0.offset := main_#t~malloc21.base, main_#t~malloc21.offset;call write~int(0, main_~dir~0.base, main_~dir~0.offset + (main_~dir_len~0 - 1), 1);call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.alloc(main_~file_len~0);main_~file~0.base, main_~file~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call write~int(0, main_~file~0.base, main_~file~0.offset + (main_~file_len~0 - 1), 1);call main_#t~malloc23.base, main_#t~malloc23.offset := #Ultimate.alloc(2 + (main_~dir_len~0 + main_~file_len~0));main_~output~0.base, main_~output~0.offset := main_#t~malloc23.base, main_#t~malloc23.offset;build_fullname_#in~fullname.base, build_fullname_#in~fullname.offset, build_fullname_#in~directory.base, build_fullname_#in~directory.offset, build_fullname_#in~filename.base, build_fullname_#in~filename.offset := main_~output~0.base, main_~output~0.offset, main_~dir~0.base, main_~dir~0.offset, main_~file~0.base, main_~file~0.offset;havoc build_fullname_#t~mem8, build_fullname_#t~mem9, build_fullname_#t~short10, build_fullname_#t~pre11.base, build_fullname_#t~pre11.offset, build_fullname_#t~mem12, build_fullname_#t~mem13, build_fullname_#t~short14, build_fullname_#t~ret15.base, build_fullname_#t~ret15.offset, build_fullname_#t~ret16.base, build_fullname_#t~ret16.offset, build_fullname_#t~pre17.base, build_fullname_#t~pre17.offset, build_fullname_#t~ret18.base, build_fullname_#t~ret18.offset, build_fullname_~fullname.base, build_fullname_~fullname.offset, build_fullname_~directory.base, build_fullname_~directory.offset, build_fullname_~filename.base, build_fullname_~filename.offset, build_fullname_~dest~0.base, build_fullname_~dest~0.offset;build_fullname_~fullname.base, build_fullname_~fullname.offset := build_fullname_#in~fullname.base, build_fullname_#in~fullname.offset;build_fullname_~directory.base, build_fullname_~directory.offset := build_fullname_#in~directory.base, build_fullname_#in~directory.offset;build_fullname_~filename.base, build_fullname_~filename.offset := build_fullname_#in~filename.base, build_fullname_#in~filename.offset;build_fullname_~dest~0.base, build_fullname_~dest~0.offset := build_fullname_~fullname.base, build_fullname_~fullname.offset;call build_fullname_#t~mem8 := read~int(build_fullname_~directory.base, build_fullname_~directory.offset, 1);build_fullname_#t~short10 := 47 == build_fullname_#t~mem8; 302#L521 assume build_fullname_#t~short10;call build_fullname_#t~mem9 := read~int(build_fullname_~directory.base, 1 + build_fullname_~directory.offset, 1);build_fullname_#t~short10 := 0 == build_fullname_#t~mem9; 307#L521-2 assume !build_fullname_#t~short10;havoc build_fullname_#t~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; 303#L523 assume !build_fullname_#t~short14;call build_fullname_#t~mem13 := read~int(build_fullname_~directory.base, 1 + build_fullname_~directory.offset, 1);build_fullname_#t~short14 := 0 != build_fullname_#t~mem13; 304#L523-2 assume build_fullname_#t~short14;havoc build_fullname_#t~mem13;havoc build_fullname_#t~short14;havoc build_fullname_#t~mem12;strcpy_#in~s1.base, strcpy_#in~s1.offset, strcpy_#in~s2.base, strcpy_#in~s2.offset := build_fullname_~dest~0.base, build_fullname_~dest~0.offset, build_fullname_~directory.base, build_fullname_~directory.offset;havoc strcpy_#res.base, strcpy_#res.offset;havoc strcpy_#t~post2.base, strcpy_#t~post2.offset, strcpy_#t~post3.base, strcpy_#t~post3.offset, strcpy_#t~mem4, strcpy_~s1.base, strcpy_~s1.offset, strcpy_~s2.base, strcpy_~s2.offset, strcpy_~res~0.base, strcpy_~res~0.offset;strcpy_~s1.base, strcpy_~s1.offset := strcpy_#in~s1.base, strcpy_#in~s1.offset;strcpy_~s2.base, strcpy_~s2.offset := strcpy_#in~s2.base, strcpy_#in~s2.offset;strcpy_~res~0.base, strcpy_~res~0.offset := strcpy_~s1.base, strcpy_~s1.offset; 290#L508-3 [2018-11-28 23:17:45,976 INFO L796 eck$LassoCheckResult]: Loop: 290#L508-3 strcpy_#t~post2.base, strcpy_#t~post2.offset := strcpy_~s1.base, strcpy_~s1.offset;strcpy_~s1.base, strcpy_~s1.offset := strcpy_#t~post2.base, 1 + strcpy_#t~post2.offset;strcpy_#t~post3.base, strcpy_#t~post3.offset := strcpy_~s2.base, strcpy_~s2.offset;strcpy_~s2.base, strcpy_~s2.offset := strcpy_#t~post3.base, 1 + strcpy_#t~post3.offset;call strcpy_#t~mem4 := read~int(strcpy_#t~post3.base, strcpy_#t~post3.offset, 1);call write~int(strcpy_#t~mem4, strcpy_#t~post2.base, strcpy_#t~post2.offset, 1); 291#L508-1 assume !!(0 != strcpy_#t~mem4);havoc strcpy_#t~mem4;havoc strcpy_#t~post3.base, strcpy_#t~post3.offset;havoc strcpy_#t~post2.base, strcpy_#t~post2.offset; 290#L508-3 [2018-11-28 23:17:45,976 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:45,976 INFO L82 PathProgramCache]: Analyzing trace with hash 179509076, now seen corresponding path program 1 times [2018-11-28 23:17:45,976 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:17:45,976 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:17:45,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:45,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:17:45,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:45,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:17:46,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:17:46,289 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:17:46,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 23:17:46,292 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 23:17:46,292 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:46,292 INFO L82 PathProgramCache]: Analyzing trace with hash 2150, now seen corresponding path program 1 times [2018-11-28 23:17:46,292 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:17:46,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:17:46,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:46,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:17:46,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:46,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:46,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:46,780 WARN L180 SmtUtils]: Spent 477.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2018-11-28 23:17:47,096 WARN L180 SmtUtils]: Spent 313.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2018-11-28 23:17:47,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 23:17:47,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-28 23:17:47,101 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. cyclomatic complexity: 8 Second operand 5 states. [2018-11-28 23:17:47,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:17:47,447 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. [2018-11-28 23:17:47,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 23:17:47,450 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 30 transitions. [2018-11-28 23:17:47,451 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2018-11-28 23:17:47,452 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 25 states and 30 transitions. [2018-11-28 23:17:47,452 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2018-11-28 23:17:47,454 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2018-11-28 23:17:47,454 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 30 transitions. [2018-11-28 23:17:47,454 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:17:47,454 INFO L705 BuchiCegarLoop]: Abstraction has 25 states and 30 transitions. [2018-11-28 23:17:47,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 30 transitions. [2018-11-28 23:17:47,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2018-11-28 23:17:47,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-28 23:17:47,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2018-11-28 23:17:47,457 INFO L728 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2018-11-28 23:17:47,457 INFO L608 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2018-11-28 23:17:47,457 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 23:17:47,457 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 27 transitions. [2018-11-28 23:17:47,458 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2018-11-28 23:17:47,458 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:17:47,459 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:17:47,459 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:17:47,459 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 23:17:47,459 INFO L794 eck$LassoCheckResult]: Stem: 364#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 361#L-1 havoc main_#res;havoc main_#t~nondet19, main_#t~nondet20, main_#t~malloc21.base, main_#t~malloc21.offset, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_~dir_len~0, main_~file_len~0, main_~dir~0.base, main_~dir~0.offset, main_~file~0.base, main_~file~0.offset, main_~output~0.base, main_~output~0.offset;main_~dir_len~0 := main_#t~nondet19;havoc main_#t~nondet19; 360#L532 assume !(main_~dir_len~0 < 1);main_~file_len~0 := main_#t~nondet20;havoc main_#t~nondet20; 354#L534 assume !(main_~file_len~0 < 1);call main_#t~malloc21.base, main_#t~malloc21.offset := #Ultimate.alloc(main_~dir_len~0);main_~dir~0.base, main_~dir~0.offset := main_#t~malloc21.base, main_#t~malloc21.offset;call write~int(0, main_~dir~0.base, main_~dir~0.offset + (main_~dir_len~0 - 1), 1);call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.alloc(main_~file_len~0);main_~file~0.base, main_~file~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call write~int(0, main_~file~0.base, main_~file~0.offset + (main_~file_len~0 - 1), 1);call main_#t~malloc23.base, main_#t~malloc23.offset := #Ultimate.alloc(2 + (main_~dir_len~0 + main_~file_len~0));main_~output~0.base, main_~output~0.offset := main_#t~malloc23.base, main_#t~malloc23.offset;build_fullname_#in~fullname.base, build_fullname_#in~fullname.offset, build_fullname_#in~directory.base, build_fullname_#in~directory.offset, build_fullname_#in~filename.base, build_fullname_#in~filename.offset := main_~output~0.base, main_~output~0.offset, main_~dir~0.base, main_~dir~0.offset, main_~file~0.base, main_~file~0.offset;havoc build_fullname_#t~mem8, build_fullname_#t~mem9, build_fullname_#t~short10, build_fullname_#t~pre11.base, build_fullname_#t~pre11.offset, build_fullname_#t~mem12, build_fullname_#t~mem13, build_fullname_#t~short14, build_fullname_#t~ret15.base, build_fullname_#t~ret15.offset, build_fullname_#t~ret16.base, build_fullname_#t~ret16.offset, build_fullname_#t~pre17.base, build_fullname_#t~pre17.offset, build_fullname_#t~ret18.base, build_fullname_#t~ret18.offset, build_fullname_~fullname.base, build_fullname_~fullname.offset, build_fullname_~directory.base, build_fullname_~directory.offset, build_fullname_~filename.base, build_fullname_~filename.offset, build_fullname_~dest~0.base, build_fullname_~dest~0.offset;build_fullname_~fullname.base, build_fullname_~fullname.offset := build_fullname_#in~fullname.base, build_fullname_#in~fullname.offset;build_fullname_~directory.base, build_fullname_~directory.offset := build_fullname_#in~directory.base, build_fullname_#in~directory.offset;build_fullname_~filename.base, build_fullname_~filename.offset := build_fullname_#in~filename.base, build_fullname_#in~filename.offset;build_fullname_~dest~0.base, build_fullname_~dest~0.offset := build_fullname_~fullname.base, build_fullname_~fullname.offset;call build_fullname_#t~mem8 := read~int(build_fullname_~directory.base, build_fullname_~directory.offset, 1);build_fullname_#t~short10 := 47 == build_fullname_#t~mem8; 355#L521 assume !build_fullname_#t~short10; 362#L521-2 assume !build_fullname_#t~short10;havoc build_fullname_#t~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; 365#L523 assume !build_fullname_#t~short14;call build_fullname_#t~mem13 := read~int(build_fullname_~directory.base, 1 + build_fullname_~directory.offset, 1);build_fullname_#t~short14 := 0 != build_fullname_#t~mem13; 359#L523-2 assume build_fullname_#t~short14;havoc build_fullname_#t~mem13;havoc build_fullname_#t~short14;havoc build_fullname_#t~mem12;strcpy_#in~s1.base, strcpy_#in~s1.offset, strcpy_#in~s2.base, strcpy_#in~s2.offset := build_fullname_~dest~0.base, build_fullname_~dest~0.offset, build_fullname_~directory.base, build_fullname_~directory.offset;havoc strcpy_#res.base, strcpy_#res.offset;havoc strcpy_#t~post2.base, strcpy_#t~post2.offset, strcpy_#t~post3.base, strcpy_#t~post3.offset, strcpy_#t~mem4, strcpy_~s1.base, strcpy_~s1.offset, strcpy_~s2.base, strcpy_~s2.offset, strcpy_~res~0.base, strcpy_~res~0.offset;strcpy_~s1.base, strcpy_~s1.offset := strcpy_#in~s1.base, strcpy_#in~s1.offset;strcpy_~s2.base, strcpy_~s2.offset := strcpy_#in~s2.base, strcpy_#in~s2.offset;strcpy_~res~0.base, strcpy_~res~0.offset := strcpy_~s1.base, strcpy_~s1.offset; 345#L508-3 [2018-11-28 23:17:47,460 INFO L796 eck$LassoCheckResult]: Loop: 345#L508-3 strcpy_#t~post2.base, strcpy_#t~post2.offset := strcpy_~s1.base, strcpy_~s1.offset;strcpy_~s1.base, strcpy_~s1.offset := strcpy_#t~post2.base, 1 + strcpy_#t~post2.offset;strcpy_#t~post3.base, strcpy_#t~post3.offset := strcpy_~s2.base, strcpy_~s2.offset;strcpy_~s2.base, strcpy_~s2.offset := strcpy_#t~post3.base, 1 + strcpy_#t~post3.offset;call strcpy_#t~mem4 := read~int(strcpy_#t~post3.base, strcpy_#t~post3.offset, 1);call write~int(strcpy_#t~mem4, strcpy_#t~post2.base, strcpy_#t~post2.offset, 1); 346#L508-1 assume !!(0 != strcpy_#t~mem4);havoc strcpy_#t~mem4;havoc strcpy_#t~post3.base, strcpy_#t~post3.offset;havoc strcpy_#t~post2.base, strcpy_#t~post2.offset; 345#L508-3 [2018-11-28 23:17:47,460 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:47,460 INFO L82 PathProgramCache]: Analyzing trace with hash 179568658, now seen corresponding path program 1 times [2018-11-28 23:17:47,460 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:17:47,460 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:17:47,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:47,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:17:47,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:47,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:47,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:47,521 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:47,521 INFO L82 PathProgramCache]: Analyzing trace with hash 2150, now seen corresponding path program 2 times [2018-11-28 23:17:47,522 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:17:47,522 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:17:47,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:47,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:17:47,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:47,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:47,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:47,536 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:47,538 INFO L82 PathProgramCache]: Analyzing trace with hash 766789687, now seen corresponding path program 1 times [2018-11-28 23:17:47,538 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:17:47,538 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:17:47,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:47,542 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:17:47,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:47,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:47,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:47,805 WARN L180 SmtUtils]: Spent 210.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2018-11-28 23:17:48,749 WARN L180 SmtUtils]: Spent 862.00 ms on a formula simplification. DAG size of input: 180 DAG size of output: 149 [2018-11-28 23:17:49,096 WARN L180 SmtUtils]: Spent 322.00 ms on a formula simplification that was a NOOP. DAG size: 132 [2018-11-28 23:17:49,099 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:17:49,099 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:17:49,099 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:17:49,099 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:17:49,100 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:17:49,100 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:17:49,100 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:17:49,100 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:17:49,100 INFO L131 ssoRankerPreferences]: Filename of dumped script: build_fullname_true-termination.c.i_Iteration3_Lasso [2018-11-28 23:17:49,100 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:17:49,100 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:17:49,106 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:49,110 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:49,113 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:49,117 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:49,127 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:49,129 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:49,131 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:49,134 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:49,137 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:49,139 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:49,142 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:49,153 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:49,154 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:49,158 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:49,162 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:49,165 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:49,168 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:49,170 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:49,176 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:49,178 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:50,026 WARN L180 SmtUtils]: Spent 474.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 122 [2018-11-28 23:17:50,279 WARN L180 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 70 [2018-11-28 23:17:50,279 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:50,281 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:50,283 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:50,285 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:50,287 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:50,288 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:50,289 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:50,291 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:50,292 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:50,293 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:50,738 WARN L180 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2018-11-28 23:17:51,586 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:17:51,586 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:17:51,587 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:17:51,588 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:51,588 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:17:51,588 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:51,588 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:51,588 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:51,589 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:17:51,589 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:17:51,590 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:17:51,590 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:17:51,590 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:51,590 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:17:51,591 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:51,591 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:51,591 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:51,591 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:17:51,591 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:17:51,591 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:17:51,592 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:17:51,592 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:51,592 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:51,592 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:51,592 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:51,593 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:17:51,593 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:17:51,595 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:17:51,595 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:17:51,595 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:51,595 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:17:51,596 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:51,596 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:51,596 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:51,596 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:17:51,596 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:17:51,597 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:17:51,597 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:17:51,598 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:51,598 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:17:51,598 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:51,598 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:51,598 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:51,599 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:17:51,599 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:17:51,599 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:17:51,599 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:17:51,600 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:51,600 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:17:51,600 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:51,600 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:51,600 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:51,601 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:17:51,601 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:17:51,601 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:17:51,601 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:17:51,602 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:51,602 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:17:51,602 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:51,602 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:51,602 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:51,603 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:17:51,603 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:17:51,603 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:17:51,603 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:17:51,604 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:51,604 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:17:51,604 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:51,604 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:51,604 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:51,604 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:17:51,605 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:17:51,605 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:17:51,605 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:17:51,606 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:51,606 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:17:51,606 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:51,606 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:51,606 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:51,606 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:17:51,606 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:17:51,607 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:17:51,607 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:17:51,607 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:51,608 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:17:51,608 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:51,608 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:51,608 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:51,608 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:17:51,608 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:17:51,609 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:17:51,609 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:17:51,609 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:51,609 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:17:51,610 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:51,610 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:51,610 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:51,610 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:17:51,610 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:17:51,611 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:17:51,611 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:17:51,611 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:51,611 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:17:51,612 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:51,612 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:51,612 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:51,612 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:17:51,612 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:17:51,613 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:17:51,613 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:17:51,613 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:51,613 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:17:51,614 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:51,614 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:51,614 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:51,614 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:17:51,614 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:17:51,615 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:17:51,615 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:17:51,615 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:51,615 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:17:51,615 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:51,615 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:51,616 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:51,616 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:17:51,616 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:17:51,616 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:17:51,617 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:17:51,617 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:51,617 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:17:51,617 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:51,617 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:51,617 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:51,618 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:17:51,618 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:17:51,618 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:17:51,619 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:17:51,619 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:51,619 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:17:51,619 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:51,619 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:51,619 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:51,620 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:17:51,620 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:17:51,620 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:17:51,621 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:17:51,621 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:51,621 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:17:51,621 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:51,621 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:51,621 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:51,622 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:17:51,622 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:17:51,622 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:17:51,622 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:17:51,623 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:51,623 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:17:51,623 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:51,623 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:51,623 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:51,624 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:17:51,624 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:17:51,624 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:17:51,624 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:17:51,625 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:51,630 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:51,630 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:51,630 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:51,631 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:17:51,631 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:17:51,632 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:17:51,633 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:17:51,633 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:51,633 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:51,633 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:51,634 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:51,637 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:17:51,637 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:17:51,639 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:17:51,640 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:17:51,643 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:51,643 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:17:51,644 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:51,644 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:51,648 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:17:51,648 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:17:51,666 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:17:51,667 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:17:51,667 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:51,667 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:17:51,667 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:51,668 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:51,672 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:17:51,672 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:17:51,690 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:17:51,691 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:17:51,691 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:51,692 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:51,692 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:51,692 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:51,693 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:17:51,693 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:17:51,695 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:17:51,696 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:17:51,696 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:51,696 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:51,696 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 23:17:51,696 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:51,699 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2018-11-28 23:17:51,699 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-28 23:17:51,716 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:17:51,717 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:17:51,717 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:51,717 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:51,717 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:51,718 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:51,718 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:17:51,718 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:17:51,722 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:17:51,722 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:17:51,722 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:51,723 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:17:51,723 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:51,723 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:51,724 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:17:51,724 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:17:51,731 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:17:51,732 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:17:51,732 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:51,733 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:51,733 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:51,733 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:51,738 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:17:51,738 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:17:51,772 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:17:51,848 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-28 23:17:51,848 INFO L444 ModelExtractionUtils]: 55 out of 61 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-28 23:17:51,849 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:17:51,853 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:17:51,854 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:17:51,854 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_strcpy_~s1.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc21.base)_2) = -1*ULTIMATE.start_strcpy_~s1.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc21.base)_2 Supporting invariants [] [2018-11-28 23:17:52,417 INFO L297 tatePredicateManager]: 30 out of 34 supporting invariants were superfluous and have been removed [2018-11-28 23:17:52,425 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-28 23:17:52,448 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:52,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:17:52,477 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:17:52,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:17:52,504 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:17:52,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:17:52,629 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-11-28 23:17:52,629 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 27 transitions. cyclomatic complexity: 8 Second operand 4 states. [2018-11-28 23:17:52,720 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 27 transitions. cyclomatic complexity: 8. Second operand 4 states. Result 32 states and 39 transitions. Complement of second has 6 states. [2018-11-28 23:17:52,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 23:17:52,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 23:17:52,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2018-11-28 23:17:52,722 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 8 letters. Loop has 2 letters. [2018-11-28 23:17:52,723 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:17:52,723 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 10 letters. Loop has 2 letters. [2018-11-28 23:17:52,723 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:17:52,723 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 8 letters. Loop has 4 letters. [2018-11-28 23:17:52,724 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:17:52,724 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 39 transitions. [2018-11-28 23:17:52,725 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2018-11-28 23:17:52,726 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 23 states and 28 transitions. [2018-11-28 23:17:52,726 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-11-28 23:17:52,726 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2018-11-28 23:17:52,726 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 28 transitions. [2018-11-28 23:17:52,727 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:17:52,727 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 28 transitions. [2018-11-28 23:17:52,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 28 transitions. [2018-11-28 23:17:52,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-11-28 23:17:52,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-28 23:17:52,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2018-11-28 23:17:52,729 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 28 transitions. [2018-11-28 23:17:52,729 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 28 transitions. [2018-11-28 23:17:52,729 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-28 23:17:52,729 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 28 transitions. [2018-11-28 23:17:52,730 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2018-11-28 23:17:52,730 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:17:52,730 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:17:52,731 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:17:52,731 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 23:17:52,731 INFO L794 eck$LassoCheckResult]: Stem: 614#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 610#L-1 havoc main_#res;havoc main_#t~nondet19, main_#t~nondet20, main_#t~malloc21.base, main_#t~malloc21.offset, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_~dir_len~0, main_~file_len~0, main_~dir~0.base, main_~dir~0.offset, main_~file~0.base, main_~file~0.offset, main_~output~0.base, main_~output~0.offset;main_~dir_len~0 := main_#t~nondet19;havoc main_#t~nondet19; 611#L532 assume !(main_~dir_len~0 < 1);main_~file_len~0 := main_#t~nondet20;havoc main_#t~nondet20; 604#L534 assume !(main_~file_len~0 < 1);call main_#t~malloc21.base, main_#t~malloc21.offset := #Ultimate.alloc(main_~dir_len~0);main_~dir~0.base, main_~dir~0.offset := main_#t~malloc21.base, main_#t~malloc21.offset;call write~int(0, main_~dir~0.base, main_~dir~0.offset + (main_~dir_len~0 - 1), 1);call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.alloc(main_~file_len~0);main_~file~0.base, main_~file~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call write~int(0, main_~file~0.base, main_~file~0.offset + (main_~file_len~0 - 1), 1);call main_#t~malloc23.base, main_#t~malloc23.offset := #Ultimate.alloc(2 + (main_~dir_len~0 + main_~file_len~0));main_~output~0.base, main_~output~0.offset := main_#t~malloc23.base, main_#t~malloc23.offset;build_fullname_#in~fullname.base, build_fullname_#in~fullname.offset, build_fullname_#in~directory.base, build_fullname_#in~directory.offset, build_fullname_#in~filename.base, build_fullname_#in~filename.offset := main_~output~0.base, main_~output~0.offset, main_~dir~0.base, main_~dir~0.offset, main_~file~0.base, main_~file~0.offset;havoc build_fullname_#t~mem8, build_fullname_#t~mem9, build_fullname_#t~short10, build_fullname_#t~pre11.base, build_fullname_#t~pre11.offset, build_fullname_#t~mem12, build_fullname_#t~mem13, build_fullname_#t~short14, build_fullname_#t~ret15.base, build_fullname_#t~ret15.offset, build_fullname_#t~ret16.base, build_fullname_#t~ret16.offset, build_fullname_#t~pre17.base, build_fullname_#t~pre17.offset, build_fullname_#t~ret18.base, build_fullname_#t~ret18.offset, build_fullname_~fullname.base, build_fullname_~fullname.offset, build_fullname_~directory.base, build_fullname_~directory.offset, build_fullname_~filename.base, build_fullname_~filename.offset, build_fullname_~dest~0.base, build_fullname_~dest~0.offset;build_fullname_~fullname.base, build_fullname_~fullname.offset := build_fullname_#in~fullname.base, build_fullname_#in~fullname.offset;build_fullname_~directory.base, build_fullname_~directory.offset := build_fullname_#in~directory.base, build_fullname_#in~directory.offset;build_fullname_~filename.base, build_fullname_~filename.offset := build_fullname_#in~filename.base, build_fullname_#in~filename.offset;build_fullname_~dest~0.base, build_fullname_~dest~0.offset := build_fullname_~fullname.base, build_fullname_~fullname.offset;call build_fullname_#t~mem8 := read~int(build_fullname_~directory.base, build_fullname_~directory.offset, 1);build_fullname_#t~short10 := 47 == build_fullname_#t~mem8; 605#L521 assume !build_fullname_#t~short10; 612#L521-2 assume !build_fullname_#t~short10;havoc build_fullname_#t~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; 616#L523 assume !build_fullname_#t~short14;call build_fullname_#t~mem13 := read~int(build_fullname_~directory.base, 1 + build_fullname_~directory.offset, 1);build_fullname_#t~short14 := 0 != build_fullname_#t~mem13; 609#L523-2 assume build_fullname_#t~short14;havoc build_fullname_#t~mem13;havoc build_fullname_#t~short14;havoc build_fullname_#t~mem12;strcpy_#in~s1.base, strcpy_#in~s1.offset, strcpy_#in~s2.base, strcpy_#in~s2.offset := build_fullname_~dest~0.base, build_fullname_~dest~0.offset, build_fullname_~directory.base, build_fullname_~directory.offset;havoc strcpy_#res.base, strcpy_#res.offset;havoc strcpy_#t~post2.base, strcpy_#t~post2.offset, strcpy_#t~post3.base, strcpy_#t~post3.offset, strcpy_#t~mem4, strcpy_~s1.base, strcpy_~s1.offset, strcpy_~s2.base, strcpy_~s2.offset, strcpy_~res~0.base, strcpy_~res~0.offset;strcpy_~s1.base, strcpy_~s1.offset := strcpy_#in~s1.base, strcpy_#in~s1.offset;strcpy_~s2.base, strcpy_~s2.offset := strcpy_#in~s2.base, strcpy_#in~s2.offset;strcpy_~res~0.base, strcpy_~res~0.offset := strcpy_~s1.base, strcpy_~s1.offset; 594#L508-3 strcpy_#t~post2.base, strcpy_#t~post2.offset := strcpy_~s1.base, strcpy_~s1.offset;strcpy_~s1.base, strcpy_~s1.offset := strcpy_#t~post2.base, 1 + strcpy_#t~post2.offset;strcpy_#t~post3.base, strcpy_#t~post3.offset := strcpy_~s2.base, strcpy_~s2.offset;strcpy_~s2.base, strcpy_~s2.offset := strcpy_#t~post3.base, 1 + strcpy_#t~post3.offset;call strcpy_#t~mem4 := read~int(strcpy_#t~post3.base, strcpy_#t~post3.offset, 1);call write~int(strcpy_#t~mem4, strcpy_#t~post2.base, strcpy_#t~post2.offset, 1); 595#L508-1 assume !(0 != strcpy_#t~mem4);havoc strcpy_#t~mem4;havoc strcpy_#t~post3.base, strcpy_#t~post3.offset;havoc strcpy_#t~post2.base, strcpy_#t~post2.offset; 600#L508-4 strcpy_#res.base, strcpy_#res.offset := strcpy_~res~0.base, strcpy_~res~0.offset; 601#L509 build_fullname_#t~ret15.base, build_fullname_#t~ret15.offset := strcpy_#res.base, strcpy_#res.offset;havoc build_fullname_#t~ret15.base, build_fullname_#t~ret15.offset;strchr_#in~t.base, strchr_#in~t.offset, strchr_#in~c := build_fullname_~dest~0.base, build_fullname_~dest~0.offset, 0;havoc strchr_#res.base, strchr_#res.offset;havoc strchr_#t~mem5, strchr_#t~mem6, strchr_#t~pre7.base, strchr_#t~pre7.offset, strchr_~t.base, strchr_~t.offset, strchr_~c, strchr_~ch~0;strchr_~t.base, strchr_~t.offset := strchr_#in~t.base, strchr_#in~t.offset;strchr_~c := strchr_#in~c;havoc strchr_~ch~0;strchr_~ch~0 := (if strchr_~c % 256 <= 127 then strchr_~c % 256 else strchr_~c % 256 - 256); 603#L514-2 [2018-11-28 23:17:52,731 INFO L796 eck$LassoCheckResult]: Loop: 603#L514-2 assume !false;call strchr_#t~mem5 := read~int(strchr_~t.base, strchr_~t.offset, 1); 597#L515 assume !(strchr_#t~mem5 == strchr_~ch~0);havoc strchr_#t~mem5;call strchr_#t~mem6 := read~int(strchr_~t.base, strchr_~t.offset, 1); 599#L515-2 assume !(0 == strchr_#t~mem6);havoc strchr_#t~mem6;strchr_#t~pre7.base, strchr_#t~pre7.offset := strchr_~t.base, 1 + strchr_~t.offset;strchr_~t.base, strchr_~t.offset := strchr_~t.base, 1 + strchr_~t.offset;havoc strchr_#t~pre7.base, strchr_#t~pre7.offset; 603#L514-2 [2018-11-28 23:17:52,732 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:52,732 INFO L82 PathProgramCache]: Analyzing trace with hash -1849486153, now seen corresponding path program 1 times [2018-11-28 23:17:52,732 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:17:52,732 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:17:52,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:52,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:17:52,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:52,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:17:52,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:17:52,958 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:17:52,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 23:17:52,959 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 23:17:52,959 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:52,959 INFO L82 PathProgramCache]: Analyzing trace with hash 85564, now seen corresponding path program 1 times [2018-11-28 23:17:52,959 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:17:52,959 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:17:52,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:52,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:17:52,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:52,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:52,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:53,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 23:17:53,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-28 23:17:53,040 INFO L87 Difference]: Start difference. First operand 23 states and 28 transitions. cyclomatic complexity: 8 Second operand 6 states. [2018-11-28 23:17:53,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:17:53,200 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2018-11-28 23:17:53,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 23:17:53,201 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 32 transitions. [2018-11-28 23:17:53,202 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2018-11-28 23:17:53,202 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 27 states and 32 transitions. [2018-11-28 23:17:53,202 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2018-11-28 23:17:53,202 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2018-11-28 23:17:53,203 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 32 transitions. [2018-11-28 23:17:53,203 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:17:53,203 INFO L705 BuchiCegarLoop]: Abstraction has 27 states and 32 transitions. [2018-11-28 23:17:53,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 32 transitions. [2018-11-28 23:17:53,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2018-11-28 23:17:53,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-28 23:17:53,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2018-11-28 23:17:53,207 INFO L728 BuchiCegarLoop]: Abstraction has 26 states and 31 transitions. [2018-11-28 23:17:53,207 INFO L608 BuchiCegarLoop]: Abstraction has 26 states and 31 transitions. [2018-11-28 23:17:53,207 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-28 23:17:53,207 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 31 transitions. [2018-11-28 23:17:53,208 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2018-11-28 23:17:53,208 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:17:53,208 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:17:53,209 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:17:53,209 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 23:17:53,209 INFO L794 eck$LassoCheckResult]: Stem: 679#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 674#L-1 havoc main_#res;havoc main_#t~nondet19, main_#t~nondet20, main_#t~malloc21.base, main_#t~malloc21.offset, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_~dir_len~0, main_~file_len~0, main_~dir~0.base, main_~dir~0.offset, main_~file~0.base, main_~file~0.offset, main_~output~0.base, main_~output~0.offset;main_~dir_len~0 := main_#t~nondet19;havoc main_#t~nondet19; 675#L532 assume !(main_~dir_len~0 < 1);main_~file_len~0 := main_#t~nondet20;havoc main_#t~nondet20; 670#L534 assume !(main_~file_len~0 < 1);call main_#t~malloc21.base, main_#t~malloc21.offset := #Ultimate.alloc(main_~dir_len~0);main_~dir~0.base, main_~dir~0.offset := main_#t~malloc21.base, main_#t~malloc21.offset;call write~int(0, main_~dir~0.base, main_~dir~0.offset + (main_~dir_len~0 - 1), 1);call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.alloc(main_~file_len~0);main_~file~0.base, main_~file~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call write~int(0, main_~file~0.base, main_~file~0.offset + (main_~file_len~0 - 1), 1);call main_#t~malloc23.base, main_#t~malloc23.offset := #Ultimate.alloc(2 + (main_~dir_len~0 + main_~file_len~0));main_~output~0.base, main_~output~0.offset := main_#t~malloc23.base, main_#t~malloc23.offset;build_fullname_#in~fullname.base, build_fullname_#in~fullname.offset, build_fullname_#in~directory.base, build_fullname_#in~directory.offset, build_fullname_#in~filename.base, build_fullname_#in~filename.offset := main_~output~0.base, main_~output~0.offset, main_~dir~0.base, main_~dir~0.offset, main_~file~0.base, main_~file~0.offset;havoc build_fullname_#t~mem8, build_fullname_#t~mem9, build_fullname_#t~short10, build_fullname_#t~pre11.base, build_fullname_#t~pre11.offset, build_fullname_#t~mem12, build_fullname_#t~mem13, build_fullname_#t~short14, build_fullname_#t~ret15.base, build_fullname_#t~ret15.offset, build_fullname_#t~ret16.base, build_fullname_#t~ret16.offset, build_fullname_#t~pre17.base, build_fullname_#t~pre17.offset, build_fullname_#t~ret18.base, build_fullname_#t~ret18.offset, build_fullname_~fullname.base, build_fullname_~fullname.offset, build_fullname_~directory.base, build_fullname_~directory.offset, build_fullname_~filename.base, build_fullname_~filename.offset, build_fullname_~dest~0.base, build_fullname_~dest~0.offset;build_fullname_~fullname.base, build_fullname_~fullname.offset := build_fullname_#in~fullname.base, build_fullname_#in~fullname.offset;build_fullname_~directory.base, build_fullname_~directory.offset := build_fullname_#in~directory.base, build_fullname_#in~directory.offset;build_fullname_~filename.base, build_fullname_~filename.offset := build_fullname_#in~filename.base, build_fullname_#in~filename.offset;build_fullname_~dest~0.base, build_fullname_~dest~0.offset := build_fullname_~fullname.base, build_fullname_~fullname.offset;call build_fullname_#t~mem8 := read~int(build_fullname_~directory.base, build_fullname_~directory.offset, 1);build_fullname_#t~short10 := 47 == build_fullname_#t~mem8; 671#L521 assume !build_fullname_#t~short10; 676#L521-2 assume !build_fullname_#t~short10;havoc build_fullname_#t~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; 682#L523 assume build_fullname_#t~short14; 673#L523-2 assume build_fullname_#t~short14;havoc build_fullname_#t~mem13;havoc build_fullname_#t~short14;havoc build_fullname_#t~mem12;strcpy_#in~s1.base, strcpy_#in~s1.offset, strcpy_#in~s2.base, strcpy_#in~s2.offset := build_fullname_~dest~0.base, build_fullname_~dest~0.offset, build_fullname_~directory.base, build_fullname_~directory.offset;havoc strcpy_#res.base, strcpy_#res.offset;havoc strcpy_#t~post2.base, strcpy_#t~post2.offset, strcpy_#t~post3.base, strcpy_#t~post3.offset, strcpy_#t~mem4, strcpy_~s1.base, strcpy_~s1.offset, strcpy_~s2.base, strcpy_~s2.offset, strcpy_~res~0.base, strcpy_~res~0.offset;strcpy_~s1.base, strcpy_~s1.offset := strcpy_#in~s1.base, strcpy_#in~s1.offset;strcpy_~s2.base, strcpy_~s2.offset := strcpy_#in~s2.base, strcpy_#in~s2.offset;strcpy_~res~0.base, strcpy_~res~0.offset := strcpy_~s1.base, strcpy_~s1.offset; 681#L508-3 strcpy_#t~post2.base, strcpy_#t~post2.offset := strcpy_~s1.base, strcpy_~s1.offset;strcpy_~s1.base, strcpy_~s1.offset := strcpy_#t~post2.base, 1 + strcpy_#t~post2.offset;strcpy_#t~post3.base, strcpy_#t~post3.offset := strcpy_~s2.base, strcpy_~s2.offset;strcpy_~s2.base, strcpy_~s2.offset := strcpy_#t~post3.base, 1 + strcpy_#t~post3.offset;call strcpy_#t~mem4 := read~int(strcpy_#t~post3.base, strcpy_#t~post3.offset, 1);call write~int(strcpy_#t~mem4, strcpy_#t~post2.base, strcpy_#t~post2.offset, 1); 660#L508-1 assume !(0 != strcpy_#t~mem4);havoc strcpy_#t~mem4;havoc strcpy_#t~post3.base, strcpy_#t~post3.offset;havoc strcpy_#t~post2.base, strcpy_#t~post2.offset; 664#L508-4 strcpy_#res.base, strcpy_#res.offset := strcpy_~res~0.base, strcpy_~res~0.offset; 665#L509 build_fullname_#t~ret15.base, build_fullname_#t~ret15.offset := strcpy_#res.base, strcpy_#res.offset;havoc build_fullname_#t~ret15.base, build_fullname_#t~ret15.offset;strchr_#in~t.base, strchr_#in~t.offset, strchr_#in~c := build_fullname_~dest~0.base, build_fullname_~dest~0.offset, 0;havoc strchr_#res.base, strchr_#res.offset;havoc strchr_#t~mem5, strchr_#t~mem6, strchr_#t~pre7.base, strchr_#t~pre7.offset, strchr_~t.base, strchr_~t.offset, strchr_~c, strchr_~ch~0;strchr_~t.base, strchr_~t.offset := strchr_#in~t.base, strchr_#in~t.offset;strchr_~c := strchr_#in~c;havoc strchr_~ch~0;strchr_~ch~0 := (if strchr_~c % 256 <= 127 then strchr_~c % 256 else strchr_~c % 256 - 256); 667#L514-2 [2018-11-28 23:17:53,209 INFO L796 eck$LassoCheckResult]: Loop: 667#L514-2 assume !false;call strchr_#t~mem5 := read~int(strchr_~t.base, strchr_~t.offset, 1); 661#L515 assume !(strchr_#t~mem5 == strchr_~ch~0);havoc strchr_#t~mem5;call strchr_#t~mem6 := read~int(strchr_~t.base, strchr_~t.offset, 1); 663#L515-2 assume !(0 == strchr_#t~mem6);havoc strchr_#t~mem6;strchr_#t~pre7.base, strchr_#t~pre7.offset := strchr_~t.base, 1 + strchr_~t.offset;strchr_~t.base, strchr_~t.offset := strchr_~t.base, 1 + strchr_~t.offset;havoc strchr_#t~pre7.base, strchr_#t~pre7.offset; 667#L514-2 [2018-11-28 23:17:53,209 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:53,209 INFO L82 PathProgramCache]: Analyzing trace with hash -1906744455, now seen corresponding path program 1 times [2018-11-28 23:17:53,210 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:17:53,210 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:17:53,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:53,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:17:53,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:53,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:53,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:53,258 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:53,260 INFO L82 PathProgramCache]: Analyzing trace with hash 85564, now seen corresponding path program 2 times [2018-11-28 23:17:53,260 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:17:53,260 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:17:53,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:53,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:17:53,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:53,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:53,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:53,271 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:53,272 INFO L82 PathProgramCache]: Analyzing trace with hash 1413453764, now seen corresponding path program 1 times [2018-11-28 23:17:53,272 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:17:53,272 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:17:53,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:53,274 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:17:53,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:53,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:17:53,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:17:53,444 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:17:53,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 23:17:53,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 23:17:53,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-28 23:17:53,483 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. cyclomatic complexity: 8 Second operand 7 states. [2018-11-28 23:17:53,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:17:53,595 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2018-11-28 23:17:53,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 23:17:53,596 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 43 transitions. [2018-11-28 23:17:53,598 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2018-11-28 23:17:53,598 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 36 states and 43 transitions. [2018-11-28 23:17:53,599 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2018-11-28 23:17:53,599 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2018-11-28 23:17:53,599 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 43 transitions. [2018-11-28 23:17:53,599 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:17:53,599 INFO L705 BuchiCegarLoop]: Abstraction has 36 states and 43 transitions. [2018-11-28 23:17:53,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 43 transitions. [2018-11-28 23:17:53,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 32. [2018-11-28 23:17:53,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-28 23:17:53,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2018-11-28 23:17:53,604 INFO L728 BuchiCegarLoop]: Abstraction has 32 states and 39 transitions. [2018-11-28 23:17:53,604 INFO L608 BuchiCegarLoop]: Abstraction has 32 states and 39 transitions. [2018-11-28 23:17:53,604 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-28 23:17:53,604 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 39 transitions. [2018-11-28 23:17:53,609 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2018-11-28 23:17:53,609 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:17:53,609 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:17:53,610 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:17:53,610 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 23:17:53,610 INFO L794 eck$LassoCheckResult]: Stem: 756#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 752#L-1 havoc main_#res;havoc main_#t~nondet19, main_#t~nondet20, main_#t~malloc21.base, main_#t~malloc21.offset, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_~dir_len~0, main_~file_len~0, main_~dir~0.base, main_~dir~0.offset, main_~file~0.base, main_~file~0.offset, main_~output~0.base, main_~output~0.offset;main_~dir_len~0 := main_#t~nondet19;havoc main_#t~nondet19; 753#L532 assume !(main_~dir_len~0 < 1);main_~file_len~0 := main_#t~nondet20;havoc main_#t~nondet20; 747#L534 assume !(main_~file_len~0 < 1);call main_#t~malloc21.base, main_#t~malloc21.offset := #Ultimate.alloc(main_~dir_len~0);main_~dir~0.base, main_~dir~0.offset := main_#t~malloc21.base, main_#t~malloc21.offset;call write~int(0, main_~dir~0.base, main_~dir~0.offset + (main_~dir_len~0 - 1), 1);call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.alloc(main_~file_len~0);main_~file~0.base, main_~file~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call write~int(0, main_~file~0.base, main_~file~0.offset + (main_~file_len~0 - 1), 1);call main_#t~malloc23.base, main_#t~malloc23.offset := #Ultimate.alloc(2 + (main_~dir_len~0 + main_~file_len~0));main_~output~0.base, main_~output~0.offset := main_#t~malloc23.base, main_#t~malloc23.offset;build_fullname_#in~fullname.base, build_fullname_#in~fullname.offset, build_fullname_#in~directory.base, build_fullname_#in~directory.offset, build_fullname_#in~filename.base, build_fullname_#in~filename.offset := main_~output~0.base, main_~output~0.offset, main_~dir~0.base, main_~dir~0.offset, main_~file~0.base, main_~file~0.offset;havoc build_fullname_#t~mem8, build_fullname_#t~mem9, build_fullname_#t~short10, build_fullname_#t~pre11.base, build_fullname_#t~pre11.offset, build_fullname_#t~mem12, build_fullname_#t~mem13, build_fullname_#t~short14, build_fullname_#t~ret15.base, build_fullname_#t~ret15.offset, build_fullname_#t~ret16.base, build_fullname_#t~ret16.offset, build_fullname_#t~pre17.base, build_fullname_#t~pre17.offset, build_fullname_#t~ret18.base, build_fullname_#t~ret18.offset, build_fullname_~fullname.base, build_fullname_~fullname.offset, build_fullname_~directory.base, build_fullname_~directory.offset, build_fullname_~filename.base, build_fullname_~filename.offset, build_fullname_~dest~0.base, build_fullname_~dest~0.offset;build_fullname_~fullname.base, build_fullname_~fullname.offset := build_fullname_#in~fullname.base, build_fullname_#in~fullname.offset;build_fullname_~directory.base, build_fullname_~directory.offset := build_fullname_#in~directory.base, build_fullname_#in~directory.offset;build_fullname_~filename.base, build_fullname_~filename.offset := build_fullname_#in~filename.base, build_fullname_#in~filename.offset;build_fullname_~dest~0.base, build_fullname_~dest~0.offset := build_fullname_~fullname.base, build_fullname_~fullname.offset;call build_fullname_#t~mem8 := read~int(build_fullname_~directory.base, build_fullname_~directory.offset, 1);build_fullname_#t~short10 := 47 == build_fullname_#t~mem8; 748#L521 assume !build_fullname_#t~short10; 754#L521-2 assume !build_fullname_#t~short10;havoc build_fullname_#t~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; 760#L523 assume build_fullname_#t~short14; 750#L523-2 assume build_fullname_#t~short14;havoc build_fullname_#t~mem13;havoc build_fullname_#t~short14;havoc build_fullname_#t~mem12;strcpy_#in~s1.base, strcpy_#in~s1.offset, strcpy_#in~s2.base, strcpy_#in~s2.offset := build_fullname_~dest~0.base, build_fullname_~dest~0.offset, build_fullname_~directory.base, build_fullname_~directory.offset;havoc strcpy_#res.base, strcpy_#res.offset;havoc strcpy_#t~post2.base, strcpy_#t~post2.offset, strcpy_#t~post3.base, strcpy_#t~post3.offset, strcpy_#t~mem4, strcpy_~s1.base, strcpy_~s1.offset, strcpy_~s2.base, strcpy_~s2.offset, strcpy_~res~0.base, strcpy_~res~0.offset;strcpy_~s1.base, strcpy_~s1.offset := strcpy_#in~s1.base, strcpy_#in~s1.offset;strcpy_~s2.base, strcpy_~s2.offset := strcpy_#in~s2.base, strcpy_#in~s2.offset;strcpy_~res~0.base, strcpy_~res~0.offset := strcpy_~s1.base, strcpy_~s1.offset; 735#L508-3 strcpy_#t~post2.base, strcpy_#t~post2.offset := strcpy_~s1.base, strcpy_~s1.offset;strcpy_~s1.base, strcpy_~s1.offset := strcpy_#t~post2.base, 1 + strcpy_#t~post2.offset;strcpy_#t~post3.base, strcpy_#t~post3.offset := strcpy_~s2.base, strcpy_~s2.offset;strcpy_~s2.base, strcpy_~s2.offset := strcpy_#t~post3.base, 1 + strcpy_#t~post3.offset;call strcpy_#t~mem4 := read~int(strcpy_#t~post3.base, strcpy_#t~post3.offset, 1);call write~int(strcpy_#t~mem4, strcpy_#t~post2.base, strcpy_#t~post2.offset, 1); 736#L508-1 assume !!(0 != strcpy_#t~mem4);havoc strcpy_#t~mem4;havoc strcpy_#t~post3.base, strcpy_#t~post3.offset;havoc strcpy_#t~post2.base, strcpy_#t~post2.offset; 737#L508-3 strcpy_#t~post2.base, strcpy_#t~post2.offset := strcpy_~s1.base, strcpy_~s1.offset;strcpy_~s1.base, strcpy_~s1.offset := strcpy_#t~post2.base, 1 + strcpy_#t~post2.offset;strcpy_#t~post3.base, strcpy_#t~post3.offset := strcpy_~s2.base, strcpy_~s2.offset;strcpy_~s2.base, strcpy_~s2.offset := strcpy_#t~post3.base, 1 + strcpy_#t~post3.offset;call strcpy_#t~mem4 := read~int(strcpy_#t~post3.base, strcpy_#t~post3.offset, 1);call write~int(strcpy_#t~mem4, strcpy_#t~post2.base, strcpy_#t~post2.offset, 1); 738#L508-1 assume !(0 != strcpy_#t~mem4);havoc strcpy_#t~mem4;havoc strcpy_#t~post3.base, strcpy_#t~post3.offset;havoc strcpy_#t~post2.base, strcpy_#t~post2.offset; 742#L508-4 strcpy_#res.base, strcpy_#res.offset := strcpy_~res~0.base, strcpy_~res~0.offset; 743#L509 build_fullname_#t~ret15.base, build_fullname_#t~ret15.offset := strcpy_#res.base, strcpy_#res.offset;havoc build_fullname_#t~ret15.base, build_fullname_#t~ret15.offset;strchr_#in~t.base, strchr_#in~t.offset, strchr_#in~c := build_fullname_~dest~0.base, build_fullname_~dest~0.offset, 0;havoc strchr_#res.base, strchr_#res.offset;havoc strchr_#t~mem5, strchr_#t~mem6, strchr_#t~pre7.base, strchr_#t~pre7.offset, strchr_~t.base, strchr_~t.offset, strchr_~c, strchr_~ch~0;strchr_~t.base, strchr_~t.offset := strchr_#in~t.base, strchr_#in~t.offset;strchr_~c := strchr_#in~c;havoc strchr_~ch~0;strchr_~ch~0 := (if strchr_~c % 256 <= 127 then strchr_~c % 256 else strchr_~c % 256 - 256); 757#L514-2 [2018-11-28 23:17:53,610 INFO L796 eck$LassoCheckResult]: Loop: 757#L514-2 assume !false;call strchr_#t~mem5 := read~int(strchr_~t.base, strchr_~t.offset, 1); 764#L515 assume !(strchr_#t~mem5 == strchr_~ch~0);havoc strchr_#t~mem5;call strchr_#t~mem6 := read~int(strchr_~t.base, strchr_~t.offset, 1); 762#L515-2 assume !(0 == strchr_#t~mem6);havoc strchr_#t~mem6;strchr_#t~pre7.base, strchr_#t~pre7.offset := strchr_~t.base, 1 + strchr_~t.offset;strchr_~t.base, strchr_~t.offset := strchr_~t.base, 1 + strchr_~t.offset;havoc strchr_#t~pre7.base, strchr_#t~pre7.offset; 757#L514-2 [2018-11-28 23:17:53,610 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:53,618 INFO L82 PathProgramCache]: Analyzing trace with hash 1571186846, now seen corresponding path program 1 times [2018-11-28 23:17:53,618 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:17:53,618 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:17:53,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:53,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:17:53,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:53,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:53,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:53,680 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:53,681 INFO L82 PathProgramCache]: Analyzing trace with hash 85564, now seen corresponding path program 3 times [2018-11-28 23:17:53,681 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:17:53,682 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:17:53,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:53,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:17:53,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:53,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:53,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:53,690 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:53,694 INFO L82 PathProgramCache]: Analyzing trace with hash 673793151, now seen corresponding path program 1 times [2018-11-28 23:17:53,694 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:17:53,694 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:17:53,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:53,695 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:17:53,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:53,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:53,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:53,977 WARN L180 SmtUtils]: Spent 236.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-11-28 23:17:54,184 WARN L180 SmtUtils]: Spent 206.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-11-28 23:17:56,036 WARN L180 SmtUtils]: Spent 1.85 s on a formula simplification. DAG size of input: 269 DAG size of output: 227 [2018-11-28 23:17:57,443 WARN L180 SmtUtils]: Spent 1.39 s on a formula simplification. DAG size of input: 177 DAG size of output: 169 [2018-11-28 23:17:57,450 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:17:57,450 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:17:57,450 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:17:57,450 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:17:57,451 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:17:57,451 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:17:57,451 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:17:57,451 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:17:57,451 INFO L131 ssoRankerPreferences]: Filename of dumped script: build_fullname_true-termination.c.i_Iteration6_Lasso [2018-11-28 23:17:57,451 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:17:57,451 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:17:57,456 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:57,460 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:57,462 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:57,463 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:57,465 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:57,497 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:57,503 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:57,504 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:57,506 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:57,508 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:57,510 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:58,608 WARN L180 SmtUtils]: Spent 610.00 ms on a formula simplification. DAG size of input: 169 DAG size of output: 152 [2018-11-28 23:17:58,793 WARN L180 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2018-11-28 23:17:58,793 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:58,805 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:58,807 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:58,808 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:58,811 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:58,813 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:58,815 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:58,817 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:58,820 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:58,822 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:58,824 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:58,827 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:58,829 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:58,831 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:58,834 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:58,837 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:58,840 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:58,842 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:58,844 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:58,846 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:58,848 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:58,851 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:59,471 WARN L180 SmtUtils]: Spent 548.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 92 [2018-11-28 23:18:00,019 WARN L180 SmtUtils]: Spent 209.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2018-11-28 23:18:00,189 WARN L180 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2018-11-28 23:18:00,589 WARN L180 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 38 [2018-11-28 23:18:00,643 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:18:00,643 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:18:00,643 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:00,644 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:00,644 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:00,644 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:00,644 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:00,644 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:00,651 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:00,651 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:00,652 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:00,652 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:00,654 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:00,658 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:00,658 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:00,658 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:00,658 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:00,658 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:00,658 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:00,659 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:00,659 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:00,660 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:00,660 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:00,660 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:00,660 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:00,660 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:00,660 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:00,660 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:00,661 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:00,661 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:00,662 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:00,662 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:00,662 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:00,662 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:00,662 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:00,662 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:00,663 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:00,666 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:00,666 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:00,667 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:00,667 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:00,667 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:00,667 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:00,667 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:00,667 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:00,668 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:00,668 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:00,668 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:00,672 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:00,672 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:00,672 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:00,672 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:00,675 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:00,675 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:00,675 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:00,676 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:00,676 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:00,676 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:00,676 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:00,677 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:00,680 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:00,680 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:00,680 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:00,680 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:00,681 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:00,681 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:00,681 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:00,682 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:00,682 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:00,682 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:00,682 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:00,682 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:00,682 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:00,682 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:00,683 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:00,683 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:00,683 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:00,683 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:00,683 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:00,684 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:00,684 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:00,684 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:00,684 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:00,690 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:00,690 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:00,690 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:00,690 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:00,691 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:00,691 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:00,691 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:00,691 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:00,691 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:00,692 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:00,692 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:00,692 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:00,692 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:00,692 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:00,693 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:00,693 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:00,698 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:00,699 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:00,699 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:00,699 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:00,699 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:00,699 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:00,702 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:00,703 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:00,713 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:00,713 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:00,714 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:00,714 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:00,714 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:00,714 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:00,717 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:00,717 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:00,718 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:00,722 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:00,722 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:00,722 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:00,723 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:00,723 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:00,723 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:00,723 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:00,723 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:00,723 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:00,724 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:00,724 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:00,724 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:00,725 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:00,725 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:00,733 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:00,733 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:00,784 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:18:00,833 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-28 23:18:00,834 INFO L444 ModelExtractionUtils]: 86 out of 91 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-28 23:18:00,834 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:18:00,837 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:18:00,837 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:18:00,837 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_strchr_~t.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc23.base)_3) = -1*ULTIMATE.start_strchr_~t.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc23.base)_3 Supporting invariants [] [2018-11-28 23:18:01,334 INFO L297 tatePredicateManager]: 49 out of 50 supporting invariants were superfluous and have been removed [2018-11-28 23:18:01,337 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-28 23:18:01,361 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:01,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:18:01,397 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:18:01,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:18:01,458 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:18:01,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:18:01,482 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-11-28 23:18:01,483 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 32 states and 39 transitions. cyclomatic complexity: 10 Second operand 4 states. [2018-11-28 23:18:01,555 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 32 states and 39 transitions. cyclomatic complexity: 10. Second operand 4 states. Result 42 states and 54 transitions. Complement of second has 5 states. [2018-11-28 23:18:01,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 23:18:01,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 23:18:01,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 25 transitions. [2018-11-28 23:18:01,558 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 14 letters. Loop has 3 letters. [2018-11-28 23:18:01,559 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:18:01,559 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 17 letters. Loop has 3 letters. [2018-11-28 23:18:01,559 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:18:01,559 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 14 letters. Loop has 6 letters. [2018-11-28 23:18:01,559 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:18:01,560 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 54 transitions. [2018-11-28 23:18:01,561 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 23:18:01,561 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 35 states and 43 transitions. [2018-11-28 23:18:01,561 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2018-11-28 23:18:01,562 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2018-11-28 23:18:01,562 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 43 transitions. [2018-11-28 23:18:01,562 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:18:01,562 INFO L705 BuchiCegarLoop]: Abstraction has 35 states and 43 transitions. [2018-11-28 23:18:01,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 43 transitions. [2018-11-28 23:18:01,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2018-11-28 23:18:01,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-28 23:18:01,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2018-11-28 23:18:01,570 INFO L728 BuchiCegarLoop]: Abstraction has 33 states and 40 transitions. [2018-11-28 23:18:01,570 INFO L608 BuchiCegarLoop]: Abstraction has 33 states and 40 transitions. [2018-11-28 23:18:01,570 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-28 23:18:01,570 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 40 transitions. [2018-11-28 23:18:01,572 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 23:18:01,575 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:18:01,575 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:18:01,576 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:18:01,576 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 23:18:01,577 INFO L794 eck$LassoCheckResult]: Stem: 1113#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1108#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; 1109#L532 assume !(main_~dir_len~0 < 1);main_~file_len~0 := main_#t~nondet20;havoc main_#t~nondet20; 1101#L534 assume !(main_~file_len~0 < 1);call main_#t~malloc21.base, main_#t~malloc21.offset := #Ultimate.alloc(main_~dir_len~0);main_~dir~0.base, main_~dir~0.offset := main_#t~malloc21.base, main_#t~malloc21.offset;call write~int(0, main_~dir~0.base, main_~dir~0.offset + (main_~dir_len~0 - 1), 1);call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.alloc(main_~file_len~0);main_~file~0.base, main_~file~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call write~int(0, main_~file~0.base, main_~file~0.offset + (main_~file_len~0 - 1), 1);call main_#t~malloc23.base, main_#t~malloc23.offset := #Ultimate.alloc(2 + (main_~dir_len~0 + main_~file_len~0));main_~output~0.base, main_~output~0.offset := main_#t~malloc23.base, main_#t~malloc23.offset;build_fullname_#in~fullname.base, build_fullname_#in~fullname.offset, build_fullname_#in~directory.base, build_fullname_#in~directory.offset, build_fullname_#in~filename.base, build_fullname_#in~filename.offset := main_~output~0.base, main_~output~0.offset, main_~dir~0.base, main_~dir~0.offset, main_~file~0.base, main_~file~0.offset;havoc build_fullname_#t~mem8, build_fullname_#t~mem9, build_fullname_#t~short10, build_fullname_#t~pre11.base, build_fullname_#t~pre11.offset, build_fullname_#t~mem12, build_fullname_#t~mem13, build_fullname_#t~short14, build_fullname_#t~ret15.base, build_fullname_#t~ret15.offset, build_fullname_#t~ret16.base, build_fullname_#t~ret16.offset, build_fullname_#t~pre17.base, build_fullname_#t~pre17.offset, build_fullname_#t~ret18.base, build_fullname_#t~ret18.offset, build_fullname_~fullname.base, build_fullname_~fullname.offset, build_fullname_~directory.base, build_fullname_~directory.offset, build_fullname_~filename.base, build_fullname_~filename.offset, build_fullname_~dest~0.base, build_fullname_~dest~0.offset;build_fullname_~fullname.base, build_fullname_~fullname.offset := build_fullname_#in~fullname.base, build_fullname_#in~fullname.offset;build_fullname_~directory.base, build_fullname_~directory.offset := build_fullname_#in~directory.base, build_fullname_#in~directory.offset;build_fullname_~filename.base, build_fullname_~filename.offset := build_fullname_#in~filename.base, build_fullname_#in~filename.offset;build_fullname_~dest~0.base, build_fullname_~dest~0.offset := build_fullname_~fullname.base, build_fullname_~fullname.offset;call build_fullname_#t~mem8 := read~int(build_fullname_~directory.base, build_fullname_~directory.offset, 1);build_fullname_#t~short10 := 47 == build_fullname_#t~mem8; 1102#L521 assume !build_fullname_#t~short10; 1110#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; 1120#L523 assume build_fullname_#t~short14; 1106#L523-2 assume build_fullname_#t~short14;havoc build_fullname_#t~mem13;havoc build_fullname_#t~short14;havoc build_fullname_#t~mem12;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; 1119#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); 1118#L508-1 assume !(0 != strcpy_#t~mem4);havoc strcpy_#t~mem4;havoc strcpy_#t~post3.base, strcpy_#t~post3.offset;havoc strcpy_#t~post2.base, strcpy_#t~post2.offset; 1097#L508-4 strcpy_#res.base, strcpy_#res.offset := strcpy_~res~0.base, strcpy_~res~0.offset; 1098#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); 1107#L514-2 assume !false;call strchr_#t~mem5 := read~int(strchr_~t.base, strchr_~t.offset, 1); 1092#L515 assume strchr_#t~mem5 == strchr_~ch~0;havoc strchr_#t~mem5; 1093#L514-3 strchr_#res.base, strchr_#res.offset := strchr_~t.base, strchr_~t.offset; 1099#L517 build_fullname_#t~ret16.base, build_fullname_#t~ret16.offset := strchr_#res.base, strchr_#res.offset;build_fullname_~dest~0.base, build_fullname_~dest~0.offset := build_fullname_#t~ret16.base, build_fullname_#t~ret16.offset;havoc build_fullname_#t~ret16.base, build_fullname_#t~ret16.offset;call write~int(47, build_fullname_~dest~0.base, build_fullname_~dest~0.offset, 1);build_fullname_#t~pre17.base, build_fullname_#t~pre17.offset := build_fullname_~dest~0.base, 1 + build_fullname_~dest~0.offset;build_fullname_~dest~0.base, build_fullname_~dest~0.offset := build_fullname_~dest~0.base, 1 + build_fullname_~dest~0.offset;havoc build_fullname_#t~pre17.base, build_fullname_#t~pre17.offset; 1116#L523-4 strcpy_#in~s1.base, strcpy_#in~s1.offset, strcpy_#in~s2.base, strcpy_#in~s2.offset := build_fullname_~dest~0.base, build_fullname_~dest~0.offset, build_fullname_~filename.base, build_fullname_~filename.offset;havoc strcpy_#res.base, strcpy_#res.offset;havoc strcpy_#t~post2.base, strcpy_#t~post2.offset, strcpy_#t~post3.base, strcpy_#t~post3.offset, strcpy_#t~mem4, strcpy_~s1.base, strcpy_~s1.offset, strcpy_~s2.base, strcpy_~s2.offset, strcpy_~res~0.base, strcpy_~res~0.offset;strcpy_~s1.base, strcpy_~s1.offset := strcpy_#in~s1.base, strcpy_#in~s1.offset;strcpy_~s2.base, strcpy_~s2.offset := strcpy_#in~s2.base, strcpy_#in~s2.offset;strcpy_~res~0.base, strcpy_~res~0.offset := strcpy_~s1.base, strcpy_~s1.offset; 1104#L508-8 [2018-11-28 23:18:01,577 INFO L796 eck$LassoCheckResult]: Loop: 1104#L508-8 strcpy_#t~post2.base, strcpy_#t~post2.offset := strcpy_~s1.base, strcpy_~s1.offset;strcpy_~s1.base, strcpy_~s1.offset := strcpy_#t~post2.base, 1 + strcpy_#t~post2.offset;strcpy_#t~post3.base, strcpy_#t~post3.offset := strcpy_~s2.base, strcpy_~s2.offset;strcpy_~s2.base, strcpy_~s2.offset := strcpy_#t~post3.base, 1 + strcpy_#t~post3.offset;call strcpy_#t~mem4 := read~int(strcpy_#t~post3.base, strcpy_#t~post3.offset, 1);call write~int(strcpy_#t~mem4, strcpy_#t~post2.base, strcpy_#t~post2.offset, 1); 1103#L508-6 assume !!(0 != strcpy_#t~mem4);havoc strcpy_#t~mem4;havoc strcpy_#t~post3.base, strcpy_#t~post3.offset;havoc strcpy_#t~post2.base, strcpy_#t~post2.offset; 1104#L508-8 [2018-11-28 23:18:01,577 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:01,577 INFO L82 PathProgramCache]: Analyzing trace with hash 1119349231, now seen corresponding path program 1 times [2018-11-28 23:18:01,577 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:18:01,577 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:18:01,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:01,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:18:01,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:01,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:01,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:01,636 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:01,638 INFO L82 PathProgramCache]: Analyzing trace with hash 3590, now seen corresponding path program 2 times [2018-11-28 23:18:01,638 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:18:01,638 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:18:01,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:01,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:18:01,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:01,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:01,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:01,651 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:01,653 INFO L82 PathProgramCache]: Analyzing trace with hash 1952789620, now seen corresponding path program 1 times [2018-11-28 23:18:01,653 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:18:01,653 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:18:01,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:01,657 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:18:01,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:01,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:01,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:01,829 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2018-11-28 23:18:03,506 WARN L180 SmtUtils]: Spent 1.64 s on a formula simplification. DAG size of input: 280 DAG size of output: 224 [2018-11-28 23:18:03,875 WARN L180 SmtUtils]: Spent 342.00 ms on a formula simplification that was a NOOP. DAG size: 156 [2018-11-28 23:18:03,878 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:18:03,879 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:18:03,879 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:18:03,879 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:18:03,879 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:18:03,879 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:18:03,879 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:18:03,879 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:18:03,879 INFO L131 ssoRankerPreferences]: Filename of dumped script: build_fullname_true-termination.c.i_Iteration7_Lasso [2018-11-28 23:18:03,879 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:18:03,880 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:18:03,884 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:03,886 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:03,888 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:03,890 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:03,894 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:03,896 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:03,898 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:03,902 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:03,907 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:03,910 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:03,913 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:03,915 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:03,918 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:03,920 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:03,923 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:03,925 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:03,927 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:03,931 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:03,934 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:03,937 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:03,941 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:03,943 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:03,946 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:03,952 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:03,954 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:03,956 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:03,959 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:05,180 WARN L180 SmtUtils]: Spent 666.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 136 [2018-11-28 23:18:05,503 WARN L180 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 94 [2018-11-28 23:18:05,504 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:05,506 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:05,508 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:05,509 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:05,512 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:05,514 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:05,515 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:05,518 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:05,989 WARN L180 SmtUtils]: Spent 209.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2018-11-28 23:18:06,282 WARN L180 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2018-11-28 23:18:06,646 WARN L180 SmtUtils]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2018-11-28 23:18:06,870 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:18:06,871 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:18:06,871 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:06,871 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:06,871 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:06,872 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:06,872 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:06,872 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:06,872 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:06,872 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:06,874 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:06,874 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:06,874 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:06,875 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:06,875 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:06,875 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:06,875 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:06,875 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:06,875 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:06,883 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:06,883 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:06,884 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:06,884 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:06,884 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:06,884 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:06,884 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:06,884 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:06,885 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:06,885 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:06,885 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:06,885 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:06,889 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:06,889 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:06,889 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:06,889 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:06,890 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:06,890 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:06,890 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:06,896 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:06,896 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:06,896 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:06,897 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:06,897 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:06,897 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:06,897 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:06,897 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:06,901 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:06,901 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:06,902 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:06,902 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:06,902 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:06,902 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:06,902 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:06,902 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:06,903 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:06,903 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:06,903 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:06,904 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:06,904 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:06,904 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:06,904 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:06,909 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:06,909 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:06,910 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:06,911 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:06,911 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:06,911 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:06,911 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:06,911 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:06,914 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:06,914 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:06,915 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:06,915 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:06,916 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:06,916 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:06,916 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:06,916 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:06,916 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:06,917 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:06,920 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:06,920 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:06,921 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:06,921 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:06,921 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:06,921 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:06,921 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:06,921 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:06,925 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:06,925 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:06,925 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:06,926 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:06,926 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:06,926 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:06,926 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:06,926 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:06,926 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:06,930 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:06,930 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:06,930 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:06,931 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:06,931 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:06,931 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:06,931 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:06,932 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:06,932 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:06,932 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:06,932 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:06,932 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:06,933 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:06,934 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:06,934 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:06,934 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:06,934 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:06,934 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:06,934 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:06,934 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:06,935 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:06,935 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:06,936 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:06,936 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:06,936 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:06,936 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:06,936 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:06,936 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:06,936 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:06,937 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:06,937 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:06,937 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:06,938 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:06,941 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:06,941 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:06,941 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:06,941 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:06,941 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:06,942 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:06,942 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:06,943 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:06,943 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:06,943 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:06,943 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:06,943 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:06,943 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:06,943 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:06,946 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:06,946 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:06,947 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:06,947 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:06,947 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:06,947 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:06,948 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:06,948 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:06,952 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:06,954 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:06,954 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:06,954 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:06,955 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:06,955 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:06,955 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:06,955 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:06,955 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:06,956 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:06,956 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:06,956 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:06,956 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:06,963 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:06,963 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:06,964 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:06,964 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:06,965 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:06,965 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:06,965 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:06,966 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:06,971 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:06,971 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:06,971 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:06,971 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:06,971 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:06,972 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:06,972 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:06,973 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:06,973 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:06,974 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:06,974 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:06,974 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:06,974 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:06,974 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:06,974 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:06,975 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:06,975 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:06,975 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:06,975 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:06,975 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:06,981 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:06,981 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:06,981 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:06,982 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:06,982 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:06,982 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:06,983 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:06,983 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:06,983 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:06,983 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:06,987 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:06,987 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:06,987 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:06,988 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:06,988 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:06,988 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:06,988 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:06,989 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:06,989 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:06,989 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:06,989 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:06,989 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:06,993 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:06,993 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:06,993 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:06,994 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:06,994 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:06,994 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:06,994 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:06,994 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:06,995 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:06,996 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:06,996 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:06,996 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:06,996 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:06,996 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:06,997 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:06,997 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:06,997 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:06,997 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:06,998 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:06,999 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:06,999 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:06,999 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:06,999 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:06,999 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:07,000 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:07,001 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:07,002 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:07,002 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:07,002 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:18:07,002 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:07,002 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:07,007 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:18:07,008 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:07,036 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:07,037 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:07,037 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:07,043 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:07,043 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:07,043 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:07,044 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:07,044 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:07,050 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:07,054 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:07,054 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:07,055 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:07,055 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:07,055 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:07,055 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:07,055 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:07,055 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:07,056 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:07,056 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:07,063 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:07,064 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:07,064 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:07,064 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:07,065 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:07,065 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:07,066 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:07,067 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:07,067 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:07,067 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:07,071 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:07,071 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:07,072 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:07,072 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:07,077 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:07,081 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:07,081 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:07,081 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:07,082 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:07,082 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:07,082 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:07,082 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:07,082 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:07,083 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:07,085 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:07,085 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:07,085 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:07,086 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:07,086 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 23:18:07,086 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:07,086 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 23:18:07,086 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:07,091 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:07,093 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:07,093 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:07,094 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:07,094 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:07,094 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:07,094 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:07,094 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:07,101 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:07,102 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:07,102 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:07,102 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:07,102 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:07,102 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:07,106 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:07,106 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:07,116 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:07,120 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:07,121 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:07,121 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:07,121 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:07,121 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:07,122 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:07,122 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:07,123 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:07,124 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:07,124 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:07,124 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:18:07,124 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:07,125 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:07,126 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:18:07,126 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:07,133 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:07,134 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:07,134 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:07,134 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:07,134 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:07,134 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:07,138 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:07,139 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:07,148 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:07,151 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:07,151 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:07,151 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:07,152 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:07,152 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:07,152 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:07,152 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:07,161 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:07,162 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:07,162 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:07,163 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:07,163 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:07,163 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:07,174 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:07,175 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:07,243 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:18:07,285 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-28 23:18:07,285 INFO L444 ModelExtractionUtils]: 83 out of 88 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-28 23:18:07,285 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:18:07,286 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:18:07,286 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:18:07,287 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_strcpy_~s2.base)_4, ULTIMATE.start_strcpy_~s2.offset) = 1*v_rep(select #length ULTIMATE.start_strcpy_~s2.base)_4 - 1*ULTIMATE.start_strcpy_~s2.offset Supporting invariants [] [2018-11-28 23:18:08,092 INFO L297 tatePredicateManager]: 55 out of 55 supporting invariants were superfluous and have been removed [2018-11-28 23:18:08,094 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-28 23:18:08,106 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:08,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:18:08,157 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:18:08,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:18:08,183 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:18:08,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:18:08,240 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-28 23:18:08,240 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 40 transitions. cyclomatic complexity: 10 Second operand 3 states. [2018-11-28 23:18:08,248 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states and 40 transitions. cyclomatic complexity: 10. Second operand 3 states. Result 35 states and 42 transitions. Complement of second has 4 states. [2018-11-28 23:18:08,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 23:18:08,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:18:08,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2018-11-28 23:18:08,251 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 26 transitions. Stem has 17 letters. Loop has 2 letters. [2018-11-28 23:18:08,251 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:18:08,251 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 26 transitions. Stem has 19 letters. Loop has 2 letters. [2018-11-28 23:18:08,252 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:18:08,252 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 26 transitions. Stem has 17 letters. Loop has 4 letters. [2018-11-28 23:18:08,252 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:18:08,253 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 42 transitions. [2018-11-28 23:18:08,257 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:18:08,257 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 0 states and 0 transitions. [2018-11-28 23:18:08,257 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-28 23:18:08,257 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-28 23:18:08,257 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-28 23:18:08,257 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:18:08,257 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:18:08,258 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:18:08,261 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:18:08,261 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-28 23:18:08,261 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-28 23:18:08,261 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:18:08,261 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-28 23:18:08,272 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 11:18:08 BoogieIcfgContainer [2018-11-28 23:18:08,272 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 23:18:08,274 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 23:18:08,275 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 23:18:08,275 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 23:18:08,276 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:17:38" (3/4) ... [2018-11-28 23:18:08,283 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 23:18:08,288 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 23:18:08,289 INFO L168 Benchmark]: Toolchain (without parser) took 31149.44 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 485.5 MB). Free memory was 951.4 MB in the beginning and 791.7 MB in the end (delta: 159.6 MB). Peak memory consumption was 645.1 MB. Max. memory is 11.5 GB. [2018-11-28 23:18:08,293 INFO L168 Benchmark]: CDTParser took 0.39 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:18:08,294 INFO L168 Benchmark]: CACSL2BoogieTranslator took 706.54 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.3 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -165.0 MB). Peak memory consumption was 37.3 MB. Max. memory is 11.5 GB. [2018-11-28 23:18:08,296 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.46 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: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. [2018-11-28 23:18:08,297 INFO L168 Benchmark]: Boogie Preprocessor took 59.31 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:18:08,299 INFO L168 Benchmark]: RCFGBuilder took 655.16 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: 25.9 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. [2018-11-28 23:18:08,300 INFO L168 Benchmark]: BuchiAutomizer took 29644.34 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 361.2 MB). Free memory was 1.1 GB in the beginning and 791.7 MB in the end (delta: 285.2 MB). Peak memory consumption was 646.4 MB. Max. memory is 11.5 GB. [2018-11-28 23:18:08,301 INFO L168 Benchmark]: Witness Printer took 13.88 ms. Allocated memory is still 1.5 GB. Free memory is still 791.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:18:08,313 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.39 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 706.54 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.3 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -165.0 MB). Peak memory consumption was 37.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 62.46 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: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 59.31 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 655.16 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: 25.9 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 29644.34 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 361.2 MB). Free memory was 1.1 GB in the beginning and 791.7 MB in the end (delta: 285.2 MB). Peak memory consumption was 646.4 MB. Max. memory is 11.5 GB. * Witness Printer took 13.88 ms. Allocated memory is still 1.5 GB. Free memory is still 791.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (3 trivial, 4 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (dir_len+file_len+2)] + -1 * s1 and consists of 6 locations. One deterministic module has affine ranking function -1 * s1 + unknown-#length-unknown[__builtin_alloca (dir_len)] and consists of 4 locations. One deterministic module has affine ranking function -1 * t + unknown-#length-unknown[__builtin_alloca (dir_len+file_len+2)] and consists of 4 locations. One deterministic module has affine ranking function unknown-#length-unknown[s2] + -1 * s2 and consists of 3 locations. 3 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 29.5s and 8 iterations. TraceHistogramMax:2. Analysis of lassos took 27.7s. Construction of modules took 0.5s. Büchi inclusion checks took 1.1s. Highest rank in rank-based complementation 3. Minimization of det autom 6. Minimization of nondet autom 1. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 12 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 33 states and ocurred in iteration 6. Nontrivial modules had stage [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 142 SDtfs, 145 SDslu, 155 SDs, 0 SdLazy, 193 SolverSat, 29 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU2 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital548 mio100 ax100 hnf99 lsp98 ukn60 mio100 lsp44 div100 bol100 ite100 ukn100 eq203 hnf86 smp98 dnf127 smp86 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 20ms VariablesStem: 2 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 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...