./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/array-memsafety/openbsd_cstrpbrk-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0ed9222f 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/array-memsafety/openbsd_cstrpbrk-alloca_true-valid-memsafety_true-termination.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-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 32bit --witnessprinter.graph.data.programhash 37ce12f320cb92b62d01decbfb4f63ee1143a42a ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 04:58:27,038 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 04:58:27,040 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 04:58:27,053 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 04:58:27,053 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 04:58:27,055 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 04:58:27,056 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 04:58:27,059 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 04:58:27,060 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 04:58:27,062 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 04:58:27,063 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 04:58:27,063 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 04:58:27,064 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 04:58:27,065 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 04:58:27,069 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 04:58:27,070 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 04:58:27,071 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 04:58:27,073 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 04:58:27,075 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 04:58:27,076 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 04:58:27,078 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 04:58:27,079 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 04:58:27,082 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 04:58:27,082 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 04:58:27,082 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 04:58:27,084 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 04:58:27,085 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 04:58:27,089 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 04:58:27,090 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 04:58:27,093 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 04:58:27,093 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 04:58:27,094 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 04:58:27,094 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 04:58:27,094 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 04:58:27,095 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 04:58:27,099 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 04:58:27,099 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-14 04:58:27,130 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 04:58:27,130 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 04:58:27,132 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 04:58:27,132 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 04:58:27,132 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 04:58:27,132 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 04:58:27,132 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 04:58:27,133 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 04:58:27,134 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 04:58:27,134 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 04:58:27,134 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 04:58:27,135 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 04:58:27,135 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 04:58:27,135 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 04:58:27,135 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 04:58:27,135 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 04:58:27,135 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 04:58:27,136 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 04:58:27,137 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 04:58:27,137 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 04:58:27,137 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 04:58:27,137 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 04:58:27,137 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 04:58:27,138 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 04:58:27,138 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 04:58:27,138 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 04:58:27,138 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 04:58:27,138 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 04:58:27,139 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 04:58:27,140 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 04:58:27,140 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 04:58:27,141 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 04:58:27,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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 37ce12f320cb92b62d01decbfb4f63ee1143a42a [2019-01-14 04:58:27,202 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 04:58:27,218 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 04:58:27,223 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 04:58:27,225 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 04:58:27,225 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 04:58:27,226 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/array-memsafety/openbsd_cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2019-01-14 04:58:27,291 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/601448ff7/900aa7749cf749339b320ab86cdfd8ea/FLAG1497d4a85 [2019-01-14 04:58:27,822 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 04:58:27,823 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/array-memsafety/openbsd_cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2019-01-14 04:58:27,842 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/601448ff7/900aa7749cf749339b320ab86cdfd8ea/FLAG1497d4a85 [2019-01-14 04:58:28,129 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/601448ff7/900aa7749cf749339b320ab86cdfd8ea [2019-01-14 04:58:28,133 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 04:58:28,134 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 04:58:28,135 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 04:58:28,135 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 04:58:28,139 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 04:58:28,140 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:58:28" (1/1) ... [2019-01-14 04:58:28,143 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e34980e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:58:28, skipping insertion in model container [2019-01-14 04:58:28,143 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:58:28" (1/1) ... [2019-01-14 04:58:28,151 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 04:58:28,195 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 04:58:28,576 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:58:28,590 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 04:58:28,697 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:58:28,760 INFO L195 MainTranslator]: Completed translation [2019-01-14 04:58:28,761 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:58:28 WrapperNode [2019-01-14 04:58:28,761 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 04:58:28,762 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 04:58:28,762 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 04:58:28,762 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 04:58:28,771 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:58:28" (1/1) ... [2019-01-14 04:58:28,788 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:58:28" (1/1) ... [2019-01-14 04:58:28,814 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 04:58:28,815 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 04:58:28,815 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 04:58:28,815 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 04:58:28,825 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:58:28" (1/1) ... [2019-01-14 04:58:28,826 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:58:28" (1/1) ... [2019-01-14 04:58:28,829 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:58:28" (1/1) ... [2019-01-14 04:58:28,830 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:58:28" (1/1) ... [2019-01-14 04:58:28,837 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:58:28" (1/1) ... [2019-01-14 04:58:28,842 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:58:28" (1/1) ... [2019-01-14 04:58:28,844 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:58:28" (1/1) ... [2019-01-14 04:58:28,846 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 04:58:28,847 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 04:58:28,848 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 04:58:28,848 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 04:58:28,849 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:58:28" (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 [2019-01-14 04:58:28,918 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 04:58:28,918 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 04:58:28,918 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 04:58:28,919 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 04:58:28,919 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 04:58:28,919 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 04:58:29,321 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 04:58:29,322 INFO L286 CfgBuilder]: Removed 8 assue(true) statements. [2019-01-14 04:58:29,323 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:58:29 BoogieIcfgContainer [2019-01-14 04:58:29,323 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 04:58:29,324 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 04:58:29,324 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 04:58:29,328 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 04:58:29,328 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:58:29,329 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 04:58:28" (1/3) ... [2019-01-14 04:58:29,330 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3cb1d39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:58:29, skipping insertion in model container [2019-01-14 04:58:29,330 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:58:29,330 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:58:28" (2/3) ... [2019-01-14 04:58:29,330 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3cb1d39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:58:29, skipping insertion in model container [2019-01-14 04:58:29,331 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:58:29,331 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:58:29" (3/3) ... [2019-01-14 04:58:29,332 INFO L375 chiAutomizerObserver]: Analyzing ICFG openbsd_cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2019-01-14 04:58:29,386 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 04:58:29,386 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 04:58:29,386 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 04:58:29,387 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 04:58:29,387 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 04:58:29,387 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 04:58:29,387 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 04:58:29,387 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 04:58:29,388 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 04:58:29,401 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2019-01-14 04:58:29,426 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 04:58:29,426 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:58:29,426 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:58:29,434 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-14 04:58:29,434 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 04:58:29,434 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 04:58:29,434 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2019-01-14 04:58:29,436 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 04:58:29,436 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:58:29,436 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:58:29,437 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-14 04:58:29,437 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 04:58:29,445 INFO L794 eck$LassoCheckResult]: Stem: 14#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10#L-1true havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~ret10.base, main_#t~ret10.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet6;havoc main_#t~nondet6;main_~length2~0 := main_#t~nondet7;havoc main_#t~nondet7; 7#L555true assume !(main_~length1~0 < 1); 11#L555-2true assume !(main_~length2~0 < 1); 4#L558-1true call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset, cstrpbrk_~c~0, cstrpbrk_~sc~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;havoc cstrpbrk_~c~0;havoc cstrpbrk_~sc~0; 12#L546-4true [2019-01-14 04:58:29,446 INFO L796 eck$LassoCheckResult]: Loop: 12#L546-4true cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;call cstrpbrk_#t~mem3 := read~int(cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem3; 8#L545-1true assume !!(0 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem3;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 9#L546-3true assume !true; 12#L546-4true [2019-01-14 04:58:29,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:58:29,452 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2019-01-14 04:58:29,454 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:58:29,455 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:58:29,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:58:29,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:58:29,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:58:29,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:58:29,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:58:29,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:58:29,611 INFO L82 PathProgramCache]: Analyzing trace with hash 49828, now seen corresponding path program 1 times [2019-01-14 04:58:29,611 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:58:29,611 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:58:29,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:58:29,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:58:29,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:58:29,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:58:29,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:58:29,657 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:58:29,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-14 04:58:29,666 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:58:29,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-14 04:58:29,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-14 04:58:29,682 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 2 states. [2019-01-14 04:58:29,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:58:29,688 INFO L93 Difference]: Finished difference Result 15 states and 19 transitions. [2019-01-14 04:58:29,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-14 04:58:29,690 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 19 transitions. [2019-01-14 04:58:29,692 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 04:58:29,695 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 10 states and 13 transitions. [2019-01-14 04:58:29,696 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-01-14 04:58:29,696 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-01-14 04:58:29,697 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 13 transitions. [2019-01-14 04:58:29,697 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:58:29,697 INFO L706 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-01-14 04:58:29,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 13 transitions. [2019-01-14 04:58:29,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-01-14 04:58:29,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-14 04:58:29,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2019-01-14 04:58:29,720 INFO L729 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-01-14 04:58:29,720 INFO L609 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-01-14 04:58:29,720 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 04:58:29,720 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2019-01-14 04:58:29,721 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 04:58:29,721 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:58:29,721 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:58:29,722 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-14 04:58:29,722 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-14 04:58:29,722 INFO L794 eck$LassoCheckResult]: Stem: 46#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 38#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~ret10.base, main_#t~ret10.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet6;havoc main_#t~nondet6;main_~length2~0 := main_#t~nondet7;havoc main_#t~nondet7; 39#L555 assume !(main_~length1~0 < 1); 40#L555-2 assume !(main_~length2~0 < 1); 41#L558-1 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset, cstrpbrk_~c~0, cstrpbrk_~sc~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;havoc cstrpbrk_~c~0;havoc cstrpbrk_~sc~0; 42#L546-4 [2019-01-14 04:58:29,723 INFO L796 eck$LassoCheckResult]: Loop: 42#L546-4 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;call cstrpbrk_#t~mem3 := read~int(cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem3; 43#L545-1 assume !!(0 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem3;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 45#L546-3 cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset := cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_#t~post4.base, 1 + cstrpbrk_#t~post4.offset;call cstrpbrk_#t~mem5 := read~int(cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, 1);cstrpbrk_~sc~0 := cstrpbrk_#t~mem5; 47#L546-1 assume !(0 != cstrpbrk_~sc~0);havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset;havoc cstrpbrk_#t~mem5; 42#L546-4 [2019-01-14 04:58:29,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:58:29,723 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 2 times [2019-01-14 04:58:29,723 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:58:29,723 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:58:29,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:58:29,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:58:29,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:58:29,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:58:29,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:58:29,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:58:29,783 INFO L82 PathProgramCache]: Analyzing trace with hash 1544297, now seen corresponding path program 1 times [2019-01-14 04:58:29,783 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:58:29,783 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:58:29,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:58:29,785 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:58:29,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:58:29,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:58:29,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:58:29,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:58:29,803 INFO L82 PathProgramCache]: Analyzing trace with hash 1298350894, now seen corresponding path program 1 times [2019-01-14 04:58:29,803 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:58:29,804 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:58:29,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:58:29,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:58:29,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:58:29,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:58:29,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:58:30,136 WARN L181 SmtUtils]: Spent 257.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2019-01-14 04:58:30,252 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-01-14 04:58:31,183 WARN L181 SmtUtils]: Spent 926.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 83 [2019-01-14 04:58:31,305 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-01-14 04:58:31,318 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:58:31,319 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:58:31,319 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:58:31,320 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:58:31,320 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:58:31,320 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:58:31,320 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:58:31,320 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:58:31,321 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrpbrk-alloca_true-valid-memsafety_true-termination.i_Iteration2_Lasso [2019-01-14 04:58:31,321 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:58:31,321 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:58:31,350 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:58:31,382 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:58:31,393 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:58:31,396 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:58:31,399 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:58:31,402 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:58:31,412 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:58:32,131 WARN L181 SmtUtils]: Spent 371.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 63 [2019-01-14 04:58:32,286 WARN L181 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2019-01-14 04:58:32,287 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:58:32,291 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:58:32,294 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:58:32,299 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:58:32,303 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:58:32,305 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:58:32,308 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:58:32,311 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:58:32,315 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:58:33,267 WARN L181 SmtUtils]: Spent 497.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 37 [2019-01-14 04:58:33,433 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:58:33,439 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:58:33,441 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:58:33,444 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:58:33,444 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:58:33,445 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:58:33,445 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:58:33,445 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:58:33,448 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:58:33,448 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:58:33,451 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:58:33,452 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:58:33,452 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:58:33,452 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:58:33,454 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:58:33,454 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:58:33,454 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:58:33,455 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:58:33,455 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:58:33,456 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:58:33,457 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:58:33,457 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:58:33,457 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:58:33,458 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:58:33,458 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:58:33,458 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:58:33,458 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:58:33,459 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:58:33,461 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:58:33,462 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:58:33,463 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:58:33,463 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:58:33,463 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:58:33,463 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:58:33,464 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:58:33,464 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:58:33,464 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:58:33,467 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:58:33,467 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:58:33,469 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:58:33,469 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:58:33,469 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:58:33,469 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:58:33,470 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:58:33,470 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:58:33,470 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:58:33,472 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:58:33,473 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:58:33,473 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:58:33,474 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:58:33,474 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:58:33,474 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:58:33,478 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:58:33,478 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:58:33,482 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:58:33,482 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:58:33,483 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:58:33,484 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:58:33,484 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:58:33,484 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:58:33,485 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:58:33,485 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:58:33,485 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:58:33,489 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:58:33,489 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:58:33,490 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:58:33,490 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:58:33,490 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:58:33,490 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:58:33,494 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:58:33,494 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:58:33,499 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:58:33,500 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:58:33,501 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:58:33,501 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:58:33,501 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:58:33,501 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:58:33,505 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:58:33,506 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:58:33,521 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:58:33,522 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:58:33,523 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:58:33,523 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:58:33,523 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:58:33,523 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:58:33,527 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:58:33,527 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:58:33,530 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:58:33,530 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:58:33,531 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:58:33,531 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:58:33,531 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:58:33,531 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:58:33,534 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:58:33,535 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:58:33,540 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:58:33,540 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:58:33,541 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:58:33,541 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:58:33,541 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:58:33,541 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:58:33,542 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:58:33,544 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:58:33,544 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:58:33,546 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:58:33,546 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:58:33,548 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:58:33,549 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2019-01-14 04:58:33,549 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:58:33,549 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:58:33,557 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-14 04:58:33,558 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:58:33,608 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:58:33,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 [2019-01-14 04:58:33,609 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:58:33,610 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:58:33,610 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:58:33,610 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:58:33,613 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:58:33,613 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:58:33,616 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:58:33,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 [2019-01-14 04:58:33,617 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:58:33,617 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:58:33,617 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:58:33,618 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 04:58:33,618 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:58:33,619 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:58:33,621 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:58:33,625 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:58:33,626 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:58:33,626 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:58:33,626 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:58:33,627 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:58:33,629 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:58:33,630 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:58:33,631 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:58:33,633 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:58:33,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 [2019-01-14 04:58:33,634 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:58:33,635 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:58:33,635 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:58:33,635 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:58:33,642 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:58:33,643 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:58:33,699 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:58:33,734 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-14 04:58:33,734 INFO L444 ModelExtractionUtils]: 36 out of 40 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 04:58:33,737 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:58:33,739 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 04:58:33,740 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:58:33,741 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrpbrk_~s1.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc8.base)_1) = -1*ULTIMATE.start_cstrpbrk_~s1.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc8.base)_1 Supporting invariants [] [2019-01-14 04:58:33,879 INFO L297 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2019-01-14 04:58:33,900 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-14 04:58:33,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:58:34,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:58:34,027 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:58:34,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:58:34,057 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:58:34,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:58:34,149 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-14 04:58:34,150 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 4 Second operand 3 states. [2019-01-14 04:58:34,229 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 4. Second operand 3 states. Result 16 states and 20 transitions. Complement of second has 4 states. [2019-01-14 04:58:34,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 04:58:34,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 04:58:34,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2019-01-14 04:58:34,233 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 5 letters. Loop has 4 letters. [2019-01-14 04:58:34,234 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:58:34,235 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 9 letters. Loop has 4 letters. [2019-01-14 04:58:34,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:58:34,235 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 5 letters. Loop has 8 letters. [2019-01-14 04:58:34,236 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:58:34,236 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 20 transitions. [2019-01-14 04:58:34,238 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 04:58:34,238 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 15 states and 19 transitions. [2019-01-14 04:58:34,239 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-01-14 04:58:34,239 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-01-14 04:58:34,239 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 19 transitions. [2019-01-14 04:58:34,239 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:58:34,239 INFO L706 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2019-01-14 04:58:34,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 19 transitions. [2019-01-14 04:58:34,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2019-01-14 04:58:34,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-01-14 04:58:34,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 18 transitions. [2019-01-14 04:58:34,242 INFO L729 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2019-01-14 04:58:34,242 INFO L609 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2019-01-14 04:58:34,243 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 04:58:34,243 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 18 transitions. [2019-01-14 04:58:34,243 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 04:58:34,243 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:58:34,243 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:58:34,244 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:58:34,244 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 04:58:34,244 INFO L794 eck$LassoCheckResult]: Stem: 159#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 152#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~ret10.base, main_#t~ret10.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet6;havoc main_#t~nondet6;main_~length2~0 := main_#t~nondet7;havoc main_#t~nondet7; 153#L555 assume !(main_~length1~0 < 1); 154#L555-2 assume !(main_~length2~0 < 1); 155#L558-1 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset, cstrpbrk_~c~0, cstrpbrk_~sc~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;havoc cstrpbrk_~c~0;havoc cstrpbrk_~sc~0; 156#L546-4 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;call cstrpbrk_#t~mem3 := read~int(cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem3; 157#L545-1 assume !!(0 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem3;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 161#L546-3 [2019-01-14 04:58:34,244 INFO L796 eck$LassoCheckResult]: Loop: 161#L546-3 cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset := cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_#t~post4.base, 1 + cstrpbrk_#t~post4.offset;call cstrpbrk_#t~mem5 := read~int(cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, 1);cstrpbrk_~sc~0 := cstrpbrk_#t~mem5; 164#L546-1 assume !!(0 != cstrpbrk_~sc~0);havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset;havoc cstrpbrk_#t~mem5; 160#L547 assume !(cstrpbrk_~sc~0 == cstrpbrk_~c~0); 161#L546-3 [2019-01-14 04:58:34,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:58:34,246 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935627, now seen corresponding path program 1 times [2019-01-14 04:58:34,246 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:58:34,246 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:58:34,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:58:34,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:58:34,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:58:34,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:58:34,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:58:34,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:58:34,300 INFO L82 PathProgramCache]: Analyzing trace with hash 58753, now seen corresponding path program 1 times [2019-01-14 04:58:34,300 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:58:34,300 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:58:34,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:58:34,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:58:34,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:58:34,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:58:34,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:58:34,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:58:34,319 INFO L82 PathProgramCache]: Analyzing trace with hash 1594172151, now seen corresponding path program 1 times [2019-01-14 04:58:34,319 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:58:34,319 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:58:34,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:58:34,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:58:34,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:58:34,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:58:34,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:58:34,496 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2019-01-14 04:58:35,081 WARN L181 SmtUtils]: Spent 562.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 104 [2019-01-14 04:58:35,210 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2019-01-14 04:58:35,216 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:58:35,217 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:58:35,217 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:58:35,217 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:58:35,217 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:58:35,217 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:58:35,217 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:58:35,217 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:58:35,217 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrpbrk-alloca_true-valid-memsafety_true-termination.i_Iteration3_Lasso [2019-01-14 04:58:35,217 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:58:35,218 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:58:35,222 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:58:35,227 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:58:35,235 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:58:35,237 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:58:35,240 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:58:35,243 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:58:35,246 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:58:35,249 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:58:35,251 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:58:35,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:58:35,258 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:58:35,261 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:58:35,262 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:58:35,621 WARN L181 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 73 [2019-01-14 04:58:35,730 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:58:35,742 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:58:35,748 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:58:36,606 WARN L181 SmtUtils]: Spent 525.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 40 [2019-01-14 04:58:36,833 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:58:36,833 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:58:36,837 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:58:36,837 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:58:36,838 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:58:36,838 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:58:36,838 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:58:36,838 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:58:36,839 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:58:36,839 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:58:36,839 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:58:36,845 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:58:36,846 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:58:36,846 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:58:36,846 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:58:36,846 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:58:36,847 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:58:36,847 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:58:36,847 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:58:36,847 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:58:36,851 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:58:36,852 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:58:36,852 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:58:36,852 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:58:36,852 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:58:36,853 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:58:36,853 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:58:36,853 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:58:36,853 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:58:36,854 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:58:36,854 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:58:36,854 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:58:36,855 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:58:36,855 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:58:36,856 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:58:36,858 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:58:36,861 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:58:36,861 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:58:36,863 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:58:36,863 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:58:36,863 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:58:36,863 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:58:36,863 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:58:36,864 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:58:36,864 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:58:36,864 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:58:36,865 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:58:36,865 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:58:36,865 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:58:36,865 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:58:36,866 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:58:36,871 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:58:36,871 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:58:36,871 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:58:36,872 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:58:36,872 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:58:36,873 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:58:36,873 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:58:36,873 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:58:36,873 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:58:36,873 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:58:36,877 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:58:36,877 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:58:36,877 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:58:36,878 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:58:36,878 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:58:36,878 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:58:36,879 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:58:36,882 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:58:36,882 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:58:36,882 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:58:36,883 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:58:36,883 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:58:36,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 [2019-01-14 04:58:36,887 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:58:36,887 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:58:36,887 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:58:36,887 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:58:36,887 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:58:36,888 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:58:36,888 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:58:36,889 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:58:36,889 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:58:36,889 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:58:36,890 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:58:36,890 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:58:36,890 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:58:36,891 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:58:36,891 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:58:36,899 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:58:36,900 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:58:36,900 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:58:36,900 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:58:36,900 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:58:36,901 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:58:36,901 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:58:36,901 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:58:36,901 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:58:36,902 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:58:36,905 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:58:36,906 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:58:36,906 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:58:36,906 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:58:36,906 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:58:36,906 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:58:36,907 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:58:36,909 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:58:36,910 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:58:36,910 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:58:36,911 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:58:36,911 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:58:36,911 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:58:36,913 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:58:36,914 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:58:36,914 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:58:36,920 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:58:36,920 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:58:36,921 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:58:36,921 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:58:36,921 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:58:36,921 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:58:36,923 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:58:36,923 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:58:36,927 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:58:36,927 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:58:36,928 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:58:36,929 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:58:36,929 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:58:36,929 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:58:36,930 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:58:36,930 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:58:36,935 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:58:36,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 [2019-01-14 04:58:36,936 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:58:36,936 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:58:36,936 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:58:36,936 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:58:36,937 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:58:36,937 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:58:36,942 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:58:36,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 [2019-01-14 04:58:36,943 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:58:36,943 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2019-01-14 04:58:36,943 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:58:36,943 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:58:36,958 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-14 04:58:36,959 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:58:36,985 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:58:36,986 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:58:36,987 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:58:36,987 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:58:36,987 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:58:36,987 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:58:36,988 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:58:36,988 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:58:37,003 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:58:37,004 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:58:37,005 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:58:37,005 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:58:37,005 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:58:37,005 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:58:37,010 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:58:37,017 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:58:37,047 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:58:37,086 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-01-14 04:58:37,086 INFO L444 ModelExtractionUtils]: 37 out of 43 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-01-14 04:58:37,087 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:58:37,093 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 04:58:37,094 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:58:37,094 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_cstrpbrk_~scanp~0.base)_2, ULTIMATE.start_cstrpbrk_~scanp~0.offset) = 1*v_rep(select #length ULTIMATE.start_cstrpbrk_~scanp~0.base)_2 - 1*ULTIMATE.start_cstrpbrk_~scanp~0.offset Supporting invariants [] [2019-01-14 04:58:37,449 INFO L297 tatePredicateManager]: 13 out of 13 supporting invariants were superfluous and have been removed [2019-01-14 04:58:37,463 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-14 04:58:37,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:58:37,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:58:37,744 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:58:37,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:58:37,753 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:58:37,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:58:37,833 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-14 04:58:37,833 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 6 Second operand 3 states. [2019-01-14 04:58:37,917 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 31 states and 38 transitions. Complement of second has 5 states. [2019-01-14 04:58:37,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 04:58:37,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 04:58:37,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2019-01-14 04:58:37,919 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 7 letters. Loop has 3 letters. [2019-01-14 04:58:37,919 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:58:37,919 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 10 letters. Loop has 3 letters. [2019-01-14 04:58:37,919 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:58:37,920 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 7 letters. Loop has 6 letters. [2019-01-14 04:58:37,920 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:58:37,920 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 38 transitions. [2019-01-14 04:58:37,923 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 04:58:37,923 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 21 states and 27 transitions. [2019-01-14 04:58:37,924 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-01-14 04:58:37,924 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-01-14 04:58:37,924 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 27 transitions. [2019-01-14 04:58:37,924 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:58:37,924 INFO L706 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2019-01-14 04:58:37,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 27 transitions. [2019-01-14 04:58:37,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 15. [2019-01-14 04:58:37,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-01-14 04:58:37,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2019-01-14 04:58:37,926 INFO L729 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2019-01-14 04:58:37,926 INFO L609 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2019-01-14 04:58:37,926 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 04:58:37,926 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 19 transitions. [2019-01-14 04:58:37,927 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 04:58:37,927 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:58:37,927 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:58:37,928 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:58:37,928 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 04:58:37,928 INFO L794 eck$LassoCheckResult]: Stem: 308#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 300#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~ret10.base, main_#t~ret10.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet6;havoc main_#t~nondet6;main_~length2~0 := main_#t~nondet7;havoc main_#t~nondet7; 301#L555 assume !(main_~length1~0 < 1); 302#L555-2 assume !(main_~length2~0 < 1); 303#L558-1 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset, cstrpbrk_~c~0, cstrpbrk_~sc~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;havoc cstrpbrk_~c~0;havoc cstrpbrk_~sc~0; 304#L546-4 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;call cstrpbrk_#t~mem3 := read~int(cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem3; 305#L545-1 assume !!(0 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem3;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 312#L546-3 cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset := cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_#t~post4.base, 1 + cstrpbrk_#t~post4.offset;call cstrpbrk_#t~mem5 := read~int(cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, 1);cstrpbrk_~sc~0 := cstrpbrk_#t~mem5; 314#L546-1 assume !(0 != cstrpbrk_~sc~0);havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset;havoc cstrpbrk_#t~mem5; 306#L546-4 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;call cstrpbrk_#t~mem3 := read~int(cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem3; 307#L545-1 assume !!(0 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem3;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 310#L546-3 [2019-01-14 04:58:37,928 INFO L796 eck$LassoCheckResult]: Loop: 310#L546-3 cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset := cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_#t~post4.base, 1 + cstrpbrk_#t~post4.offset;call cstrpbrk_#t~mem5 := read~int(cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, 1);cstrpbrk_~sc~0 := cstrpbrk_#t~mem5; 313#L546-1 assume !!(0 != cstrpbrk_~sc~0);havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset;havoc cstrpbrk_#t~mem5; 309#L547 assume !(cstrpbrk_~sc~0 == cstrpbrk_~c~0); 310#L546-3 [2019-01-14 04:58:37,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:58:37,928 INFO L82 PathProgramCache]: Analyzing trace with hash -2120273357, now seen corresponding path program 2 times [2019-01-14 04:58:37,928 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:58:37,929 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:58:37,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:58:37,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:58:37,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:58:37,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:58:37,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:58:37,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:58:37,950 INFO L82 PathProgramCache]: Analyzing trace with hash 58753, now seen corresponding path program 2 times [2019-01-14 04:58:37,950 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:58:37,950 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:58:37,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:58:37,951 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:58:37,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:58:37,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:58:37,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:58:37,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:58:37,956 INFO L82 PathProgramCache]: Analyzing trace with hash 1020472847, now seen corresponding path program 1 times [2019-01-14 04:58:37,956 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:58:37,956 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:58:37,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:58:37,957 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:58:37,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:58:37,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:58:38,531 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:58:38,532 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 04:58:38,532 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 04:58:38,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:58:38,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:58:38,600 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:58:38,671 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 26 [2019-01-14 04:58:38,689 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2019-01-14 04:58:38,689 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 04:58:38,880 INFO L303 Elim1Store]: Index analysis took 118 ms [2019-01-14 04:58:38,951 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 37 [2019-01-14 04:58:38,977 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-01-14 04:58:38,977 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 04:58:39,165 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 04:58:39,169 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 04:58:39,180 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-14 04:58:39,181 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:36, output treesize:21 [2019-01-14 04:58:45,288 WARN L181 SmtUtils]: Spent 1.91 s on a formula simplification that was a NOOP. DAG size: 15 [2019-01-14 04:58:48,595 WARN L181 SmtUtils]: Spent 947.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-01-14 04:58:48,609 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2019-01-14 04:58:48,613 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 3 [2019-01-14 04:58:48,615 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 04:58:48,617 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 04:58:48,619 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 04:58:48,619 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:25, output treesize:3 [2019-01-14 04:58:48,620 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:58:48,640 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 04:58:48,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 12 [2019-01-14 04:58:48,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-14 04:58:48,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=101, Unknown=3, NotChecked=0, Total=132 [2019-01-14 04:58:48,699 INFO L87 Difference]: Start difference. First operand 15 states and 19 transitions. cyclomatic complexity: 6 Second operand 12 states. [2019-01-14 04:58:52,949 WARN L181 SmtUtils]: Spent 4.16 s on a formula simplification. DAG size of input: 18 DAG size of output: 17 [2019-01-14 04:58:55,566 WARN L181 SmtUtils]: Spent 2.59 s on a formula simplification. DAG size of input: 28 DAG size of output: 22 [2019-01-14 04:58:55,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:58:55,658 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2019-01-14 04:58:55,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-14 04:58:55,659 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 35 transitions. [2019-01-14 04:58:55,661 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 04:58:55,662 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 24 states and 28 transitions. [2019-01-14 04:58:55,663 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-01-14 04:58:55,664 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-01-14 04:58:55,664 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 28 transitions. [2019-01-14 04:58:55,664 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:58:55,664 INFO L706 BuchiCegarLoop]: Abstraction has 24 states and 28 transitions. [2019-01-14 04:58:55,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 28 transitions. [2019-01-14 04:58:55,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 17. [2019-01-14 04:58:55,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-14 04:58:55,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2019-01-14 04:58:55,666 INFO L729 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2019-01-14 04:58:55,666 INFO L609 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2019-01-14 04:58:55,667 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-14 04:58:55,667 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 21 transitions. [2019-01-14 04:58:55,667 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 04:58:55,667 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:58:55,667 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:58:55,668 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:58:55,668 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 04:58:55,668 INFO L794 eck$LassoCheckResult]: Stem: 423#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 411#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~ret10.base, main_#t~ret10.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet6;havoc main_#t~nondet6;main_~length2~0 := main_#t~nondet7;havoc main_#t~nondet7; 412#L555 assume !(main_~length1~0 < 1); 413#L555-2 assume !(main_~length2~0 < 1); 414#L558-1 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset, cstrpbrk_~c~0, cstrpbrk_~sc~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;havoc cstrpbrk_~c~0;havoc cstrpbrk_~sc~0; 415#L546-4 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;call cstrpbrk_#t~mem3 := read~int(cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem3; 416#L545-1 assume !!(0 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem3;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 426#L546-3 cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset := cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_#t~post4.base, 1 + cstrpbrk_#t~post4.offset;call cstrpbrk_#t~mem5 := read~int(cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, 1);cstrpbrk_~sc~0 := cstrpbrk_#t~mem5; 425#L546-1 assume !!(0 != cstrpbrk_~sc~0);havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset;havoc cstrpbrk_#t~mem5; 421#L547 assume !(cstrpbrk_~sc~0 == cstrpbrk_~c~0); 422#L546-3 cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset := cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_#t~post4.base, 1 + cstrpbrk_#t~post4.offset;call cstrpbrk_#t~mem5 := read~int(cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, 1);cstrpbrk_~sc~0 := cstrpbrk_#t~mem5; 427#L546-1 assume !(0 != cstrpbrk_~sc~0);havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset;havoc cstrpbrk_#t~mem5; 417#L546-4 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;call cstrpbrk_#t~mem3 := read~int(cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem3; 418#L545-1 assume !!(0 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem3;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 420#L546-3 [2019-01-14 04:58:55,668 INFO L796 eck$LassoCheckResult]: Loop: 420#L546-3 cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset := cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_#t~post4.base, 1 + cstrpbrk_#t~post4.offset;call cstrpbrk_#t~mem5 := read~int(cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, 1);cstrpbrk_~sc~0 := cstrpbrk_#t~mem5; 424#L546-1 assume !!(0 != cstrpbrk_~sc~0);havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset;havoc cstrpbrk_#t~mem5; 419#L547 assume !(cstrpbrk_~sc~0 == cstrpbrk_~c~0); 420#L546-3 [2019-01-14 04:58:55,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:58:55,669 INFO L82 PathProgramCache]: Analyzing trace with hash 1095399647, now seen corresponding path program 2 times [2019-01-14 04:58:55,669 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:58:55,669 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:58:55,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:58:55,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:58:55,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:58:55,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:58:55,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:58:55,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:58:55,691 INFO L82 PathProgramCache]: Analyzing trace with hash 58753, now seen corresponding path program 3 times [2019-01-14 04:58:55,691 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:58:55,691 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:58:55,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:58:55,692 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:58:55,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:58:55,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:58:55,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:58:55,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:58:55,696 INFO L82 PathProgramCache]: Analyzing trace with hash -110602269, now seen corresponding path program 3 times [2019-01-14 04:58:55,696 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:58:55,696 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:58:55,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:58:55,697 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:58:55,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:58:55,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:58:55,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:58:55,819 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2019-01-14 04:58:56,863 WARN L181 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 192 DAG size of output: 163 [2019-01-14 04:58:57,049 WARN L181 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2019-01-14 04:58:57,051 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:58:57,051 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:58:57,051 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:58:57,051 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:58:57,051 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:58:57,051 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:58:57,051 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:58:57,051 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:58:57,051 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrpbrk-alloca_true-valid-memsafety_true-termination.i_Iteration5_Lasso [2019-01-14 04:58:57,051 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:58:57,052 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:58:57,055 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:58:57,058 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:58:57,065 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:58:57,066 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:58:57,068 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:58:57,070 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:58:57,072 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:58:57,074 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:58:57,076 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:58:57,080 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:58:57,083 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:58:57,086 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:58:57,677 WARN L181 SmtUtils]: Spent 352.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 95 [2019-01-14 04:58:57,849 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 54 [2019-01-14 04:58:57,849 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:58:57,851 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:58:57,853 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:58:57,856 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:58:57,859 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:58:58,155 WARN L181 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2019-01-14 04:58:58,899 WARN L181 SmtUtils]: Spent 402.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 40 [2019-01-14 04:58:59,656 WARN L181 SmtUtils]: Spent 726.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 45 [2019-01-14 04:58:59,708 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:58:59,709 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:58:59,709 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:58:59,709 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:58:59,710 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:58:59,710 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:58:59,710 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:58:59,710 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:58:59,710 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:58:59,710 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:58:59,711 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:58:59,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 [2019-01-14 04:58:59,711 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:58:59,711 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:58:59,711 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:58:59,711 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:58:59,711 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:58:59,712 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:58:59,714 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:58:59,714 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:58:59,715 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:58:59,715 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:58:59,715 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:58:59,715 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:58:59,715 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:58:59,716 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:58:59,716 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:58:59,716 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:58:59,716 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:58:59,721 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:58:59,722 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:58:59,722 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:58:59,722 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:58:59,722 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:58:59,722 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:58:59,723 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:58:59,723 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:58:59,723 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:58:59,725 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:58:59,726 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:58:59,726 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:58:59,726 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:58:59,726 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:58:59,732 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:58:59,732 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:58:59,734 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:58:59,734 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:58:59,734 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:58:59,734 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:58:59,735 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:58:59,737 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:58:59,737 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:58:59,737 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:58:59,737 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:58:59,738 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:58:59,738 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:58:59,739 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:58:59,742 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:58:59,742 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:58:59,742 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:58:59,742 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:58:59,742 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:58:59,743 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:58:59,743 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:58:59,743 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:58:59,747 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:58:59,747 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:58:59,747 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:58:59,747 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:58:59,747 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:58:59,748 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:58:59,748 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:58:59,748 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:58:59,748 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:58:59,749 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:58:59,749 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:58:59,749 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:58:59,749 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:58:59,753 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:58:59,753 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:58:59,754 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:58:59,755 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:58:59,755 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:58:59,755 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:58:59,755 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:58:59,755 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:58:59,756 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:58:59,756 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:58:59,760 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:58:59,761 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:58:59,761 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:58:59,761 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:58:59,761 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:58:59,762 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:58:59,764 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:58:59,764 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:58:59,764 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:58:59,765 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:58:59,765 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:58:59,765 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:58:59,765 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:58:59,766 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:58:59,766 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:58:59,770 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:58:59,770 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:58:59,775 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:58:59,776 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:58:59,777 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:58:59,777 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:58:59,777 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:58:59,777 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:58:59,778 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:58:59,781 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:58:59,782 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:58:59,782 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:58:59,786 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:58:59,786 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:58:59,787 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:58:59,787 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:58:59,788 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:58:59,788 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:58:59,789 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:58:59,792 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:58:59,792 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:58:59,793 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:58:59,795 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:58:59,795 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:58:59,796 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:58:59,796 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:58:59,797 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:58:59,800 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:58:59,800 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:58:59,800 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:58:59,800 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:58:59,801 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:58:59,808 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:58:59,808 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:58:59,844 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:58:59,899 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2019-01-14 04:58:59,899 INFO L444 ModelExtractionUtils]: 42 out of 52 variables were initially zero. Simplification set additionally 7 variables to zero. [2019-01-14 04:58:59,900 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:58:59,900 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 04:58:59,901 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:58:59,904 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_cstrpbrk_~scanp~0.base)_3, ULTIMATE.start_cstrpbrk_~scanp~0.offset) = 1*v_rep(select #length ULTIMATE.start_cstrpbrk_~scanp~0.base)_3 - 1*ULTIMATE.start_cstrpbrk_~scanp~0.offset Supporting invariants [] [2019-01-14 04:59:00,137 INFO L297 tatePredicateManager]: 34 out of 34 supporting invariants were superfluous and have been removed [2019-01-14 04:59:00,139 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-14 04:59:00,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:59:00,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:59:00,176 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:59:00,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:59:00,186 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:59:00,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:59:00,228 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-14 04:59:00,228 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 21 transitions. cyclomatic complexity: 6 Second operand 3 states. [2019-01-14 04:59:00,248 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 21 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 28 states and 35 transitions. Complement of second has 5 states. [2019-01-14 04:59:00,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 04:59:00,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 04:59:00,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2019-01-14 04:59:00,251 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 14 letters. Loop has 3 letters. [2019-01-14 04:59:00,251 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:59:00,251 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 04:59:00,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:59:00,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:59:00,361 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:59:00,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:59:00,377 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:59:00,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:59:00,413 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-14 04:59:00,414 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 21 transitions. cyclomatic complexity: 6 Second operand 3 states. [2019-01-14 04:59:00,447 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 21 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 29 states and 36 transitions. Complement of second has 5 states. [2019-01-14 04:59:00,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 04:59:00,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 04:59:00,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2019-01-14 04:59:00,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 14 letters. Loop has 3 letters. [2019-01-14 04:59:00,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:59:00,449 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 04:59:00,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:59:00,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:59:00,484 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:59:00,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:59:00,493 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:59:00,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:59:00,504 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-14 04:59:00,505 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 21 transitions. cyclomatic complexity: 6 Second operand 3 states. [2019-01-14 04:59:00,521 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 21 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 24 states and 29 transitions. Complement of second has 4 states. [2019-01-14 04:59:00,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 04:59:00,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 04:59:00,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 20 transitions. [2019-01-14 04:59:00,524 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 14 letters. Loop has 3 letters. [2019-01-14 04:59:00,524 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:59:00,525 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 17 letters. Loop has 3 letters. [2019-01-14 04:59:00,525 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:59:00,525 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 14 letters. Loop has 6 letters. [2019-01-14 04:59:00,526 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:59:00,526 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 29 transitions. [2019-01-14 04:59:00,527 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 04:59:00,527 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 0 states and 0 transitions. [2019-01-14 04:59:00,527 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 04:59:00,527 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 04:59:00,527 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 04:59:00,527 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:59:00,527 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:59:00,528 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:59:00,528 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:59:00,528 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-14 04:59:00,528 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 04:59:00,528 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 04:59:00,528 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 04:59:00,538 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 04:59:00 BoogieIcfgContainer [2019-01-14 04:59:00,538 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 04:59:00,539 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 04:59:00,539 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 04:59:00,539 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 04:59:00,539 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:58:29" (3/4) ... [2019-01-14 04:59:00,543 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 04:59:00,543 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 04:59:00,544 INFO L168 Benchmark]: Toolchain (without parser) took 32411.13 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 306.2 MB). Free memory was 954.0 MB in the beginning and 929.9 MB in the end (delta: 24.2 MB). Peak memory consumption was 330.4 MB. Max. memory is 11.5 GB. [2019-01-14 04:59:00,545 INFO L168 Benchmark]: CDTParser took 0.14 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. [2019-01-14 04:59:00,546 INFO L168 Benchmark]: CACSL2BoogieTranslator took 626.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.0 MB). Free memory was 954.0 MB in the beginning and 1.1 GB in the end (delta: -158.1 MB). Peak memory consumption was 30.0 MB. Max. memory is 11.5 GB. [2019-01-14 04:59:00,547 INFO L168 Benchmark]: Boogie Procedure Inliner took 52.51 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: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-01-14 04:59:00,548 INFO L168 Benchmark]: Boogie Preprocessor took 32.43 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:59:00,548 INFO L168 Benchmark]: RCFGBuilder took 475.85 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.0 MB). Peak memory consumption was 25.0 MB. Max. memory is 11.5 GB. [2019-01-14 04:59:00,549 INFO L168 Benchmark]: BuchiAutomizer took 31214.43 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 176.2 MB). Free memory was 1.1 GB in the beginning and 929.9 MB in the end (delta: 150.7 MB). Peak memory consumption was 326.9 MB. Max. memory is 11.5 GB. [2019-01-14 04:59:00,550 INFO L168 Benchmark]: Witness Printer took 4.93 ms. Allocated memory is still 1.3 GB. Free memory is still 929.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:59:00,554 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 626.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.0 MB). Free memory was 954.0 MB in the beginning and 1.1 GB in the end (delta: -158.1 MB). Peak memory consumption was 30.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 52.51 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: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 32.43 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 475.85 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.0 MB). Peak memory consumption was 25.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 31214.43 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 176.2 MB). Free memory was 1.1 GB in the beginning and 929.9 MB in the end (delta: 150.7 MB). Peak memory consumption was 326.9 MB. Max. memory is 11.5 GB. * Witness Printer took 4.93 ms. Allocated memory is still 1.3 GB. Free memory is still 929.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (2 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -1 * s1 + unknown-#length-unknown[__builtin_alloca (length1 * sizeof(char))] and consists of 3 locations. One deterministic module has affine ranking function unknown-#length-unknown[scanp] + -1 * scanp and consists of 3 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[scanp] + -1 * scanp and consists of 3 locations. 2 modules have a trivial ranking function, the largest among these consists of 12 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 31.1s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 22.8s. Construction of modules took 0.2s. Büchi inclusion checks took 7.8s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 14 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 17 states and ocurred in iteration 4. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 93 SDtfs, 80 SDslu, 56 SDs, 0 SdLazy, 91 SolverSat, 13 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital227 mio100 ax100 hnf99 lsp96 ukn81 mio100 lsp41 div100 bol100 ite100 ukn100 eq188 hnf87 smp98 dnf308 smp88 tf100 neg94 sie114 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 61ms VariablesStem: 9 VariablesLoop: 6 DisjunctsStem: 4 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 12 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...