./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/array-memsafety/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/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 61682d2c31dd7110d61be8ccb8e4bbb3882eca20 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:57:18,821 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 04:57:18,823 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 04:57:18,835 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 04:57:18,836 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 04:57:18,837 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 04:57:18,841 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 04:57:18,843 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 04:57:18,845 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 04:57:18,845 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 04:57:18,846 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 04:57:18,847 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 04:57:18,848 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 04:57:18,849 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 04:57:18,850 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 04:57:18,851 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 04:57:18,852 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 04:57:18,854 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 04:57:18,856 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 04:57:18,858 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 04:57:18,859 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 04:57:18,861 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 04:57:18,863 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 04:57:18,863 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 04:57:18,864 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 04:57:18,865 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 04:57:18,866 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 04:57:18,867 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 04:57:18,868 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 04:57:18,869 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 04:57:18,869 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 04:57:18,870 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 04:57:18,870 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 04:57:18,870 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 04:57:18,872 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 04:57:18,873 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 04:57:18,873 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:57:18,899 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 04:57:18,899 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 04:57:18,900 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 04:57:18,900 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 04:57:18,901 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 04:57:18,901 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 04:57:18,901 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 04:57:18,901 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 04:57:18,901 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 04:57:18,901 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 04:57:18,902 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 04:57:18,902 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 04:57:18,902 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 04:57:18,902 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 04:57:18,902 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 04:57:18,902 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 04:57:18,903 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 04:57:18,903 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 04:57:18,903 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 04:57:18,903 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 04:57:18,903 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 04:57:18,904 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 04:57:18,904 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 04:57:18,904 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 04:57:18,904 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 04:57:18,904 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 04:57:18,904 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 04:57:18,905 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 04:57:18,905 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 04:57:18,905 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 04:57:18,905 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 04:57:18,906 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 04:57:18,906 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 -> 61682d2c31dd7110d61be8ccb8e4bbb3882eca20 [2019-01-14 04:57:18,963 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 04:57:18,979 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 04:57:18,984 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 04:57:18,986 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 04:57:18,987 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 04:57:18,987 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/array-memsafety/cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2019-01-14 04:57:19,054 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30039569b/f73c91cbe99242079d128f181d496fb5/FLAGd6d8c613e [2019-01-14 04:57:19,550 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 04:57:19,550 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/array-memsafety/cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2019-01-14 04:57:19,569 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30039569b/f73c91cbe99242079d128f181d496fb5/FLAGd6d8c613e [2019-01-14 04:57:19,849 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30039569b/f73c91cbe99242079d128f181d496fb5 [2019-01-14 04:57:19,853 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 04:57:19,854 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 04:57:19,856 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 04:57:19,856 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 04:57:19,859 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 04:57:19,860 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:57:19" (1/1) ... [2019-01-14 04:57:19,864 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ff617d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:57:19, skipping insertion in model container [2019-01-14 04:57:19,864 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:57:19" (1/1) ... [2019-01-14 04:57:19,872 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 04:57:19,914 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 04:57:20,244 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:57:20,256 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 04:57:20,378 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:57:20,436 INFO L195 MainTranslator]: Completed translation [2019-01-14 04:57:20,436 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:57:20 WrapperNode [2019-01-14 04:57:20,437 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 04:57:20,438 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 04:57:20,438 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 04:57:20,438 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 04:57:20,448 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:57:20" (1/1) ... [2019-01-14 04:57:20,472 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:57:20" (1/1) ... [2019-01-14 04:57:20,503 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 04:57:20,504 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 04:57:20,504 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 04:57:20,504 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 04:57:20,514 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:57:20" (1/1) ... [2019-01-14 04:57:20,514 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:57:20" (1/1) ... [2019-01-14 04:57:20,518 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:57:20" (1/1) ... [2019-01-14 04:57:20,519 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:57:20" (1/1) ... [2019-01-14 04:57:20,527 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:57:20" (1/1) ... [2019-01-14 04:57:20,532 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:57:20" (1/1) ... [2019-01-14 04:57:20,534 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:57:20" (1/1) ... [2019-01-14 04:57:20,536 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 04:57:20,537 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 04:57:20,537 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 04:57:20,537 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 04:57:20,538 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:57:20" (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:57:20,599 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 04:57:20,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 04:57:20,600 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 04:57:20,600 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 04:57:20,600 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 04:57:20,600 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 04:57:21,015 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 04:57:21,015 INFO L286 CfgBuilder]: Removed 8 assue(true) statements. [2019-01-14 04:57:21,017 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:57:21 BoogieIcfgContainer [2019-01-14 04:57:21,017 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 04:57:21,018 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 04:57:21,018 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 04:57:21,024 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 04:57:21,025 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:57:21,025 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 04:57:19" (1/3) ... [2019-01-14 04:57:21,026 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2af8bdcd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:57:21, skipping insertion in model container [2019-01-14 04:57:21,026 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:57:21,026 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:57:20" (2/3) ... [2019-01-14 04:57:21,027 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2af8bdcd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:57:21, skipping insertion in model container [2019-01-14 04:57:21,027 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:57:21,027 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:57:21" (3/3) ... [2019-01-14 04:57:21,029 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2019-01-14 04:57:21,085 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 04:57:21,086 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 04:57:21,086 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 04:57:21,086 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 04:57:21,086 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 04:57:21,086 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 04:57:21,086 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 04:57:21,087 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 04:57:21,087 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 04:57:21,099 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-01-14 04:57:21,120 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-01-14 04:57:21,120 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:57:21,120 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:57:21,128 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-14 04:57:21,128 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-14 04:57:21,128 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 04:57:21,128 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-01-14 04:57:21,130 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-01-14 04:57:21,130 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:57:21,131 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:57:21,131 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-14 04:57:21,132 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-14 04:57:21,141 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~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14.base, main_#t~ret14.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~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 4#L558true assume !(main_~length1~0 < 1); 6#L558-2true assume !(main_~length2~0 < 1); 19#L561-1true call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.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~mem4, cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~mem6, cstrpbrk_#t~short7, cstrpbrk_#t~mem9, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~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_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 15#L545-4true [2019-01-14 04:57:21,141 INFO L796 eck$LassoCheckResult]: Loop: 15#L545-4true call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 8#L545-1true assume !!(0 != cstrpbrk_#t~mem3);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; 9#L548-5true assume !true; 12#L548-6true call cstrpbrk_#t~mem9 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); 18#L550true assume !(cstrpbrk_#t~mem9 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem9; 13#L545-3true cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset; 15#L545-4true [2019-01-14 04:57:21,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:57:21,149 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2019-01-14 04:57:21,152 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:57:21,152 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:57:21,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:21,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:57:21,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:21,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:21,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:21,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:57:21,310 INFO L82 PathProgramCache]: Analyzing trace with hash 1454917130, now seen corresponding path program 1 times [2019-01-14 04:57:21,310 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:57:21,310 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:57:21,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:21,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:57:21,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:21,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:57:21,344 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:57:21,346 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:57:21,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 04:57:21,350 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:57:21,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-14 04:57:21,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-14 04:57:21,367 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2019-01-14 04:57:21,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:57:21,375 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2019-01-14 04:57:21,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-14 04:57:21,377 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 23 transitions. [2019-01-14 04:57:21,379 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-01-14 04:57:21,383 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 13 states and 17 transitions. [2019-01-14 04:57:21,385 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-01-14 04:57:21,385 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-01-14 04:57:21,386 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 17 transitions. [2019-01-14 04:57:21,386 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:57:21,387 INFO L706 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2019-01-14 04:57:21,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 17 transitions. [2019-01-14 04:57:21,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-01-14 04:57:21,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-14 04:57:21,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2019-01-14 04:57:21,417 INFO L729 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2019-01-14 04:57:21,417 INFO L609 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2019-01-14 04:57:21,418 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 04:57:21,418 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2019-01-14 04:57:21,419 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-01-14 04:57:21,419 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:57:21,420 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:57:21,420 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-14 04:57:21,420 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:57:21,421 INFO L794 eck$LassoCheckResult]: Stem: 56#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 52#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14.base, main_#t~ret14.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~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 44#L558 assume !(main_~length1~0 < 1); 45#L558-2 assume !(main_~length2~0 < 1); 48#L561-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.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~mem4, cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~mem6, cstrpbrk_#t~short7, cstrpbrk_#t~mem9, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~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_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 55#L545-4 [2019-01-14 04:57:21,422 INFO L796 eck$LassoCheckResult]: Loop: 55#L545-4 call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 51#L545-1 assume !!(0 != cstrpbrk_#t~mem3);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; 50#L548-5 call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := 0 != cstrpbrk_#t~mem5; 46#L548-1 assume cstrpbrk_#t~short7;call cstrpbrk_#t~mem6 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := cstrpbrk_#t~mem6 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 47#L548-3 assume !cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem6;havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~short7; 49#L548-6 call cstrpbrk_#t~mem9 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); 53#L550 assume !(cstrpbrk_#t~mem9 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem9; 54#L545-3 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset; 55#L545-4 [2019-01-14 04:57:21,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:57:21,422 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 2 times [2019-01-14 04:57:21,422 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:57:21,422 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:57:21,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:21,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:57:21,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:21,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:21,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:21,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:57:21,493 INFO L82 PathProgramCache]: Analyzing trace with hash 1927396657, now seen corresponding path program 1 times [2019-01-14 04:57:21,493 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:57:21,494 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:57:21,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:21,495 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:57:21,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:21,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:21,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:21,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:57:21,556 INFO L82 PathProgramCache]: Analyzing trace with hash -102988426, now seen corresponding path program 1 times [2019-01-14 04:57:21,557 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:57:21,557 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:57:21,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:21,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:57:21,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:21,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:21,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:22,130 WARN L181 SmtUtils]: Spent 447.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2019-01-14 04:57:23,001 WARN L181 SmtUtils]: Spent 837.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2019-01-14 04:57:23,407 WARN L181 SmtUtils]: Spent 402.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 87 [2019-01-14 04:57:23,549 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-01-14 04:57:23,568 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:57:23,569 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:57:23,570 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:57:23,570 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:57:23,570 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:57:23,570 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:57:23,570 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:57:23,571 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:57:23,571 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrpbrk-alloca_true-valid-memsafety_true-termination.i_Iteration2_Lasso [2019-01-14 04:57:23,571 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:57:23,571 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:57:23,598 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:57:23,612 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:57:23,614 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:57:23,615 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:57:23,626 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:57:23,628 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:57:23,645 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:57:23,652 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:57:23,655 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:57:23,659 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:57:23,664 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:57:23,693 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:57:23,701 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:57:23,704 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:57:23,708 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:57:23,713 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:57:23,718 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:57:23,725 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:57:24,140 WARN L181 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 67 [2019-01-14 04:57:24,474 WARN L181 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-01-14 04:57:24,475 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:57:24,479 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:57:25,191 WARN L181 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 28 [2019-01-14 04:57:25,726 WARN L181 SmtUtils]: Spent 391.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 40 [2019-01-14 04:57:25,783 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:57:25,788 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:57:25,790 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:57:25,792 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:25,792 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:25,793 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:25,793 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:25,793 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:25,795 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:25,795 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:25,797 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:25,798 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:57:25,798 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:25,798 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:25,799 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:25,799 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:25,799 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:25,799 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:25,800 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:25,800 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:25,803 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:57:25,803 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:25,804 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:25,805 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:25,805 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:25,805 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:25,806 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:25,807 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:25,807 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:25,808 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:57:25,808 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:25,808 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:25,809 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:25,810 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:25,811 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:25,811 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:25,811 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:25,813 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:25,814 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:57:25,814 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:25,814 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:25,815 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:25,816 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:25,816 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:25,817 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:25,817 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:25,818 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:25,819 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:57:25,819 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:25,819 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:25,820 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:25,821 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:25,824 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:57:25,824 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:57:25,828 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:25,829 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:57:25,829 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:25,830 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:25,831 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:25,831 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:25,831 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:25,832 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:25,832 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:25,834 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:25,834 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:57:25,835 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:25,835 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:25,835 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:25,835 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:25,836 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:25,838 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:25,838 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:25,839 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:25,840 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:57:25,840 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:25,841 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:25,841 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:25,841 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:25,841 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:25,842 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:25,844 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:25,845 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:25,846 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:57:25,846 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:25,846 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:25,847 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:25,847 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:25,850 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:57:25,851 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:57:25,853 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:25,855 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:57:25,855 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:25,855 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:25,857 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:25,857 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:25,857 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:25,858 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:25,858 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:25,860 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:25,860 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:57:25,865 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:25,865 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:25,865 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:25,865 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:25,865 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:25,866 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:25,866 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:25,867 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:25,867 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:57:25,868 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:25,868 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:25,868 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:25,868 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:25,868 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:25,869 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:25,869 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:25,870 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:25,873 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:57:25,874 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:25,874 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:25,874 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:25,874 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:25,874 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:25,875 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:25,878 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:25,879 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:25,879 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:57:25,883 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:25,883 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:25,883 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:25,883 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:25,883 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:25,884 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:25,884 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:25,885 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:25,885 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:57:25,886 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:25,886 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:25,886 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:25,886 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:25,886 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:25,889 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:25,889 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:25,890 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:25,890 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:57:25,891 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:25,891 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:25,891 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:25,891 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:25,891 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:25,895 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:25,895 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:25,896 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:25,897 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:57:25,897 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:25,900 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:25,900 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:25,900 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:25,906 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:57:25,906 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:57:25,948 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:57:25,982 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 04:57:25,983 INFO L444 ModelExtractionUtils]: 23 out of 28 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-01-14 04:57:25,985 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:57:25,987 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 04:57:25,988 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:57:25,988 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc12.base)_1, ULTIMATE.start_cstrpbrk_~sc1~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc12.base)_1 - 1*ULTIMATE.start_cstrpbrk_~sc1~0.offset Supporting invariants [] [2019-01-14 04:57:26,148 INFO L297 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2019-01-14 04:57:26,157 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-14 04:57:26,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:57:26,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:57:26,228 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:57:26,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:57:26,267 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:57:26,318 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:57:26,321 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:57:26,322 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-01-14 04:57:26,399 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 21 states and 28 transitions. Complement of second has 4 states. [2019-01-14 04:57:26,400 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:57:26,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 04:57:26,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2019-01-14 04:57:26,404 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 8 letters. [2019-01-14 04:57:26,405 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:57:26,405 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 13 letters. Loop has 8 letters. [2019-01-14 04:57:26,406 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:57:26,406 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 16 letters. [2019-01-14 04:57:26,406 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:57:26,407 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 28 transitions. [2019-01-14 04:57:26,409 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 04:57:26,410 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 18 states and 25 transitions. [2019-01-14 04:57:26,410 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-01-14 04:57:26,411 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-01-14 04:57:26,411 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 25 transitions. [2019-01-14 04:57:26,411 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:57:26,411 INFO L706 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-01-14 04:57:26,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 25 transitions. [2019-01-14 04:57:26,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-01-14 04:57:26,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-14 04:57:26,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2019-01-14 04:57:26,415 INFO L729 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-01-14 04:57:26,415 INFO L609 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-01-14 04:57:26,415 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 04:57:26,415 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 25 transitions. [2019-01-14 04:57:26,416 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 04:57:26,416 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:57:26,416 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:57:26,416 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:57:26,416 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 04:57:26,417 INFO L794 eck$LassoCheckResult]: Stem: 194#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 190#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14.base, main_#t~ret14.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~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 178#L558 assume !(main_~length1~0 < 1); 179#L558-2 assume !(main_~length2~0 < 1); 184#L561-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.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~mem4, cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~mem6, cstrpbrk_#t~short7, cstrpbrk_#t~mem9, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~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_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 195#L545-4 call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 188#L545-1 assume !!(0 != cstrpbrk_#t~mem3);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; 185#L548-5 [2019-01-14 04:57:26,417 INFO L796 eck$LassoCheckResult]: Loop: 185#L548-5 call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := 0 != cstrpbrk_#t~mem5; 180#L548-1 assume cstrpbrk_#t~short7;call cstrpbrk_#t~mem6 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := cstrpbrk_#t~mem6 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 181#L548-3 assume !!cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem6;havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~short7;cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset := cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_#t~post8.base, 1 + cstrpbrk_#t~post8.offset;havoc cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset; 185#L548-5 [2019-01-14 04:57:26,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:57:26,417 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935595, now seen corresponding path program 1 times [2019-01-14 04:57:26,417 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:57:26,417 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:57:26,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:26,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:57:26,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:26,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:26,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:26,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:57:26,448 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 1 times [2019-01-14 04:57:26,448 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:57:26,448 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:57:26,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:26,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:57:26,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:26,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:26,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:26,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:57:26,461 INFO L82 PathProgramCache]: Analyzing trace with hash 1593218778, now seen corresponding path program 1 times [2019-01-14 04:57:26,461 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:57:26,461 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:57:26,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:26,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:57:26,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:26,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:26,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:26,733 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2019-01-14 04:57:27,074 WARN L181 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 100 [2019-01-14 04:57:27,293 WARN L181 SmtUtils]: Spent 216.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2019-01-14 04:57:27,296 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:57:27,296 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:57:27,296 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:57:27,296 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:57:27,296 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:57:27,297 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:57:27,297 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:57:27,297 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:57:27,297 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrpbrk-alloca_true-valid-memsafety_true-termination.i_Iteration3_Lasso [2019-01-14 04:57:27,297 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:57:27,297 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:57:27,302 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:57:27,309 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:57:27,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:57:27,313 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:57:27,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:57:27,319 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:57:27,321 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:57:27,324 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:57:27,326 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:57:27,328 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:57:27,330 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:57:27,333 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:57:27,335 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:57:27,339 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:57:27,341 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:57:27,342 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:57:27,348 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:57:27,349 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:57:27,351 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:57:27,692 WARN L181 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 78 [2019-01-14 04:57:27,950 WARN L181 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-01-14 04:57:27,951 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:57:28,922 WARN L181 SmtUtils]: Spent 505.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-01-14 04:57:29,407 WARN L181 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2019-01-14 04:57:29,417 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:57:29,417 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:57:29,417 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:57:29,418 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:29,418 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:29,418 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:29,419 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:29,421 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:29,422 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:29,422 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:29,423 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:29,424 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:57:29,425 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:29,425 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:29,425 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:29,426 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:29,428 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:29,428 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:29,428 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:29,430 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:29,430 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:57:29,431 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:29,432 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:29,433 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:29,433 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:29,433 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:29,433 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:29,433 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:29,436 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:29,436 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:57:29,437 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:29,438 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:29,439 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:29,439 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:29,439 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:29,440 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:29,440 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:29,441 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:29,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:57:29,441 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:29,442 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:29,444 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:29,445 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:29,445 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:29,445 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:29,445 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:29,446 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:29,448 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:57:29,450 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:29,450 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:29,451 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:29,451 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:29,451 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:29,452 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:29,452 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:29,453 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:29,453 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:57:29,457 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:29,457 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:29,457 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:29,457 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:29,458 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:57:29,459 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:57:29,462 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:29,463 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:57:29,463 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:29,463 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:29,464 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:29,464 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:29,467 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:29,467 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:29,468 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:29,469 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:29,470 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:57:29,471 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:29,471 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:29,471 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:29,471 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:29,471 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:29,472 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:29,472 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:29,473 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:29,476 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:57:29,477 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:29,477 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:29,477 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:29,477 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:29,477 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:29,480 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:29,480 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:29,481 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:29,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:57:29,482 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:29,482 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:29,482 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:29,482 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:29,486 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:57:29,487 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:57:29,489 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:29,490 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:57:29,490 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:29,490 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:29,491 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:29,491 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:29,493 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:29,493 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:29,494 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:29,495 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:29,496 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:57:29,497 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:29,497 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:29,497 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:29,497 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:29,497 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:29,498 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:29,498 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:29,498 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:29,502 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:57:29,502 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:29,502 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:29,504 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:29,505 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:29,505 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:29,505 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:29,505 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:29,507 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:29,507 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:57:29,508 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:29,508 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:29,508 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:29,508 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:29,509 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:29,511 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:29,512 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:29,513 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:29,513 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:57:29,513 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:29,514 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:29,514 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:29,514 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:29,514 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:29,514 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:29,514 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:29,516 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:29,517 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:57:29,517 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:29,517 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:29,517 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:29,518 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:29,520 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:29,520 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:29,520 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:29,521 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:29,521 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:57:29,522 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:29,522 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:29,522 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:29,522 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:29,522 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:29,522 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:29,523 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:29,526 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:29,526 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:57:29,527 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:29,527 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2019-01-14 04:57:29,527 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:29,527 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:29,543 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-14 04:57:29,544 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:57:29,590 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:29,593 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:57:29,595 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:29,595 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:29,595 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:29,595 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:29,597 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:57:29,598 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:57:29,600 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:29,601 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:57:29,601 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:29,604 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:29,604 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:29,604 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:29,607 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:57:29,608 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:57:29,640 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:57:29,657 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-14 04:57:29,657 INFO L444 ModelExtractionUtils]: 39 out of 43 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 04:57:29,657 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:57:29,659 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 04:57:29,660 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:57:29,660 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_2, ULTIMATE.start_cstrpbrk_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_2 - 1*ULTIMATE.start_cstrpbrk_~s~0.offset Supporting invariants [] [2019-01-14 04:57:29,796 INFO L297 tatePredicateManager]: 14 out of 15 supporting invariants were superfluous and have been removed [2019-01-14 04:57:29,798 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-14 04:57:29,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:57:29,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:57:29,843 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:57:29,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:57:29,865 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:57:29,981 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:57:29,982 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2019-01-14 04:57:29,982 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9 Second operand 4 states. [2019-01-14 04:57:30,038 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9. Second operand 4 states. Result 43 states and 57 transitions. Complement of second has 6 states. [2019-01-14 04:57:30,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 04:57:30,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 04:57:30,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2019-01-14 04:57:30,040 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 7 letters. Loop has 3 letters. [2019-01-14 04:57:30,041 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:57:30,041 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 10 letters. Loop has 3 letters. [2019-01-14 04:57:30,041 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:57:30,041 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 7 letters. Loop has 6 letters. [2019-01-14 04:57:30,041 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:57:30,041 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 57 transitions. [2019-01-14 04:57:30,043 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 04:57:30,044 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 30 states and 40 transitions. [2019-01-14 04:57:30,045 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-01-14 04:57:30,045 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-01-14 04:57:30,046 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 40 transitions. [2019-01-14 04:57:30,046 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:57:30,046 INFO L706 BuchiCegarLoop]: Abstraction has 30 states and 40 transitions. [2019-01-14 04:57:30,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 40 transitions. [2019-01-14 04:57:30,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2019-01-14 04:57:30,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-01-14 04:57:30,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2019-01-14 04:57:30,049 INFO L729 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2019-01-14 04:57:30,049 INFO L609 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2019-01-14 04:57:30,049 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 04:57:30,051 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 33 transitions. [2019-01-14 04:57:30,052 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 04:57:30,052 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:57:30,052 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:57:30,052 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:57:30,053 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 04:57:30,054 INFO L794 eck$LassoCheckResult]: Stem: 375#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 371#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14.base, main_#t~ret14.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~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 358#L558 assume !(main_~length1~0 < 1); 359#L558-2 assume !(main_~length2~0 < 1); 364#L561-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.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~mem4, cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~mem6, cstrpbrk_#t~short7, cstrpbrk_#t~mem9, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~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_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 376#L545-4 call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 377#L545-1 assume !!(0 != cstrpbrk_#t~mem3);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; 379#L548-5 call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := 0 != cstrpbrk_#t~mem5; 380#L548-1 assume !cstrpbrk_#t~short7; 366#L548-3 assume !cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem6;havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~short7; 367#L548-6 call cstrpbrk_#t~mem9 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); 372#L550 assume !(cstrpbrk_#t~mem9 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem9; 373#L545-3 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset; 374#L545-4 call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 368#L545-1 assume !!(0 != cstrpbrk_#t~mem3);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; 365#L548-5 [2019-01-14 04:57:30,054 INFO L796 eck$LassoCheckResult]: Loop: 365#L548-5 call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := 0 != cstrpbrk_#t~mem5; 360#L548-1 assume cstrpbrk_#t~short7;call cstrpbrk_#t~mem6 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := cstrpbrk_#t~mem6 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 361#L548-3 assume !!cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem6;havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~short7;cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset := cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_#t~post8.base, 1 + cstrpbrk_#t~post8.offset;havoc cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset; 365#L548-5 [2019-01-14 04:57:30,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:57:30,054 INFO L82 PathProgramCache]: Analyzing trace with hash 1587378397, now seen corresponding path program 1 times [2019-01-14 04:57:30,054 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:57:30,055 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:57:30,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:30,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:57:30,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:30,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:57:30,163 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:57:30,163 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:57:30,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-14 04:57:30,164 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:57:30,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:57:30,164 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 2 times [2019-01-14 04:57:30,164 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:57:30,164 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:57:30,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:30,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:57:30,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:30,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:30,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:30,784 WARN L181 SmtUtils]: Spent 608.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 38 [2019-01-14 04:57:30,892 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2019-01-14 04:57:30,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 04:57:30,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-14 04:57:30,894 INFO L87 Difference]: Start difference. First operand 24 states and 33 transitions. cyclomatic complexity: 12 Second operand 7 states. [2019-01-14 04:57:30,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:57:30,986 INFO L93 Difference]: Finished difference Result 30 states and 39 transitions. [2019-01-14 04:57:30,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 04:57:30,987 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 39 transitions. [2019-01-14 04:57:30,990 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-14 04:57:30,991 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 27 states and 35 transitions. [2019-01-14 04:57:30,991 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-01-14 04:57:30,992 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-01-14 04:57:30,993 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 35 transitions. [2019-01-14 04:57:30,993 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:57:30,993 INFO L706 BuchiCegarLoop]: Abstraction has 27 states and 35 transitions. [2019-01-14 04:57:30,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 35 transitions. [2019-01-14 04:57:30,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2019-01-14 04:57:30,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-01-14 04:57:30,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2019-01-14 04:57:30,998 INFO L729 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2019-01-14 04:57:30,998 INFO L609 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2019-01-14 04:57:30,998 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-14 04:57:30,998 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 33 transitions. [2019-01-14 04:57:31,001 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 04:57:31,001 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:57:31,001 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:57:31,003 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:57:31,003 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 04:57:31,003 INFO L794 eck$LassoCheckResult]: Stem: 449#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 444#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14.base, main_#t~ret14.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~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 430#L558 assume !(main_~length1~0 < 1); 431#L558-2 assume !(main_~length2~0 < 1); 436#L561-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.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~mem4, cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~mem6, cstrpbrk_#t~short7, cstrpbrk_#t~mem9, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~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_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 450#L545-4 call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 451#L545-1 assume !!(0 != cstrpbrk_#t~mem3);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; 442#L548-5 call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := 0 != cstrpbrk_#t~mem5; 443#L548-1 assume cstrpbrk_#t~short7;call cstrpbrk_#t~mem6 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := cstrpbrk_#t~mem6 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 452#L548-3 assume !cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem6;havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~short7; 445#L548-6 call cstrpbrk_#t~mem9 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); 446#L550 assume !(cstrpbrk_#t~mem9 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem9; 447#L545-3 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset; 448#L545-4 call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 440#L545-1 assume !!(0 != cstrpbrk_#t~mem3);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; 437#L548-5 [2019-01-14 04:57:31,003 INFO L796 eck$LassoCheckResult]: Loop: 437#L548-5 call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := 0 != cstrpbrk_#t~mem5; 432#L548-1 assume cstrpbrk_#t~short7;call cstrpbrk_#t~mem6 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := cstrpbrk_#t~mem6 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 433#L548-3 assume !!cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem6;havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~short7;cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset := cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_#t~post8.base, 1 + cstrpbrk_#t~post8.offset;havoc cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset; 437#L548-5 [2019-01-14 04:57:31,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:57:31,003 INFO L82 PathProgramCache]: Analyzing trace with hash -187628965, now seen corresponding path program 2 times [2019-01-14 04:57:31,003 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:57:31,004 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:57:31,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:31,004 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:57:31,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:31,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:31,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:31,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:57:31,036 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 3 times [2019-01-14 04:57:31,036 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:57:31,036 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:57:31,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:31,037 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:57:31,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:31,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:31,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:31,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:57:31,048 INFO L82 PathProgramCache]: Analyzing trace with hash -1902015318, now seen corresponding path program 1 times [2019-01-14 04:57:31,048 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:57:31,048 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:57:31,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:31,049 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:57:31,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:31,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:31,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:31,200 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 38 [2019-01-14 04:57:31,315 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2019-01-14 04:57:31,974 WARN L181 SmtUtils]: Spent 655.00 ms on a formula simplification. DAG size of input: 175 DAG size of output: 137 [2019-01-14 04:57:33,436 WARN L181 SmtUtils]: Spent 1.40 s on a formula simplification. DAG size of input: 109 DAG size of output: 109 [2019-01-14 04:57:33,439 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:57:33,439 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:57:33,439 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:57:33,439 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:57:33,439 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:57:33,439 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:57:33,439 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:57:33,439 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:57:33,439 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrpbrk-alloca_true-valid-memsafety_true-termination.i_Iteration5_Lasso [2019-01-14 04:57:33,440 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:57:33,440 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:57:33,448 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:57:33,473 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:57:33,475 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:57:33,478 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:57:33,479 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:57:33,481 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:57:33,483 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:57:33,486 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:57:33,719 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-01-14 04:57:34,689 WARN L181 SmtUtils]: Spent 966.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 96 [2019-01-14 04:57:34,890 WARN L181 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-01-14 04:57:34,891 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:57:34,900 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:57:34,902 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:57:34,904 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:57:34,907 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:57:34,909 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:57:34,910 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:57:34,911 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:57:34,915 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:57:34,916 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:57:34,917 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:57:34,918 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:57:35,463 WARN L181 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2019-01-14 04:57:36,015 WARN L181 SmtUtils]: Spent 466.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-01-14 04:57:36,534 WARN L181 SmtUtils]: Spent 390.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 38 [2019-01-14 04:57:36,736 WARN L181 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2019-01-14 04:57:36,756 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:57:36,756 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:57:36,757 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:57:36,757 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:36,757 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:36,758 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:36,758 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:36,758 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:36,758 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:36,758 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:36,763 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:36,763 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:57:36,766 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:36,766 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:36,766 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:36,766 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:36,766 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:36,767 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:36,767 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:36,769 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:36,769 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:57:36,770 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:36,770 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:36,770 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:36,770 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:36,770 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:36,771 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:36,771 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:36,771 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:36,772 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:57:36,776 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:36,776 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:36,776 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:36,776 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:36,777 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:36,777 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:36,777 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:36,778 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:36,778 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:57:36,778 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:36,778 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:36,779 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:36,779 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:36,779 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:36,779 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:36,779 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:36,779 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:36,780 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:57:36,780 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:36,780 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:36,781 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:36,781 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:36,781 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:57:36,782 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:57:36,783 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:36,783 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:57:36,784 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:36,784 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:36,784 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:36,784 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:36,784 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:36,784 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:36,785 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:36,785 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:36,785 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:57:36,786 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:36,786 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:36,786 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:36,786 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:36,787 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:57:36,787 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:57:36,791 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:36,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:57:36,792 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:36,792 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:36,793 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:36,793 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:36,793 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:57:36,793 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:57:36,794 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:36,795 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:57:36,795 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:36,795 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:36,795 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:36,796 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:36,796 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:57:36,796 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:57:36,797 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:36,798 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:57:36,798 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:36,798 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:36,798 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:36,798 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:36,799 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:57:36,799 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:57:36,800 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:36,801 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:57:36,801 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:36,801 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:36,802 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:36,802 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:36,802 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:57:36,802 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:57:36,804 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:36,805 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:57:36,805 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:36,805 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2019-01-14 04:57:36,805 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:36,805 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:36,809 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-14 04:57:36,809 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:57:36,826 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:36,834 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:57:36,835 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:36,835 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:36,835 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:36,835 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:36,838 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:57:36,838 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:57:36,867 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:57:36,879 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-14 04:57:36,879 INFO L444 ModelExtractionUtils]: 44 out of 49 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-01-14 04:57:36,879 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:57:36,880 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 04:57:36,880 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:57:36,881 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrpbrk_~s~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_3) = -1*ULTIMATE.start_cstrpbrk_~s~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_3 Supporting invariants [] [2019-01-14 04:57:37,467 INFO L297 tatePredicateManager]: 25 out of 26 supporting invariants were superfluous and have been removed [2019-01-14 04:57:37,469 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-14 04:57:37,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:57:37,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:57:37,512 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:57:37,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:57:37,533 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:57:37,548 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:57:37,549 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2019-01-14 04:57:37,549 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11 Second operand 4 states. [2019-01-14 04:57:37,606 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 41 states and 51 transitions. Complement of second has 6 states. [2019-01-14 04:57:37,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 04:57:37,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 04:57:37,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2019-01-14 04:57:37,609 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2019-01-14 04:57:37,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:57:37,610 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 04:57:37,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:57:37,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:57:37,667 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:57:37,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:57:37,703 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:57:37,724 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:57:37,724 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 2 loop predicates [2019-01-14 04:57:37,725 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11 Second operand 4 states. [2019-01-14 04:57:37,784 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 41 states and 51 transitions. Complement of second has 6 states. [2019-01-14 04:57:37,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 04:57:37,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 04:57:37,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2019-01-14 04:57:37,789 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2019-01-14 04:57:37,789 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:57:37,789 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 04:57:37,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:57:37,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:57:37,859 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:57:37,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:57:37,881 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:57:37,897 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:57:37,898 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2019-01-14 04:57:37,898 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11 Second operand 4 states. [2019-01-14 04:57:37,992 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 41 states and 53 transitions. Complement of second has 5 states. [2019-01-14 04:57:37,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 04:57:37,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 04:57:37,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2019-01-14 04:57:37,994 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 15 letters. Loop has 3 letters. [2019-01-14 04:57:37,995 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:57:37,995 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 18 letters. Loop has 3 letters. [2019-01-14 04:57:37,996 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:57:37,996 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 15 letters. Loop has 6 letters. [2019-01-14 04:57:37,996 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:57:37,997 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 53 transitions. [2019-01-14 04:57:37,999 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 04:57:37,999 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 0 states and 0 transitions. [2019-01-14 04:57:37,999 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 04:57:37,999 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 04:57:37,999 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 04:57:38,000 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:57:38,000 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:57:38,000 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:57:38,000 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:57:38,000 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-14 04:57:38,000 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 04:57:38,000 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 04:57:38,000 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 04:57:38,007 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 04:57:38 BoogieIcfgContainer [2019-01-14 04:57:38,007 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 04:57:38,008 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 04:57:38,008 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 04:57:38,008 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 04:57:38,009 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:57:21" (3/4) ... [2019-01-14 04:57:38,013 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 04:57:38,013 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 04:57:38,014 INFO L168 Benchmark]: Toolchain (without parser) took 18160.20 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 359.1 MB). Free memory was 946.0 MB in the beginning and 1.2 GB in the end (delta: -237.9 MB). Peak memory consumption was 121.2 MB. Max. memory is 11.5 GB. [2019-01-14 04:57:38,015 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:57:38,015 INFO L168 Benchmark]: CACSL2BoogieTranslator took 581.68 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -167.4 MB). Peak memory consumption was 30.5 MB. Max. memory is 11.5 GB. [2019-01-14 04:57:38,016 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.72 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. [2019-01-14 04:57:38,017 INFO L168 Benchmark]: Boogie Preprocessor took 32.92 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:57:38,018 INFO L168 Benchmark]: RCFGBuilder took 480.30 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.8 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. [2019-01-14 04:57:38,018 INFO L168 Benchmark]: BuchiAutomizer took 16989.86 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 227.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -97.1 MB). Peak memory consumption was 130.0 MB. Max. memory is 11.5 GB. [2019-01-14 04:57:38,019 INFO L168 Benchmark]: Witness Printer took 4.87 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:57:38,024 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.26 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 581.68 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -167.4 MB). Peak memory consumption was 30.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 65.72 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 32.92 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 480.30 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.8 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 16989.86 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 227.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -97.1 MB). Peak memory consumption was 130.0 MB. Max. memory is 11.5 GB. * Witness Printer took 4.87 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (2 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (length1 * sizeof(char))] + -1 * sc1 and consists of 3 locations. One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (length2 * sizeof(char))] + -1 * s and consists of 4 locations. One nondeterministic module has affine ranking function -1 * s + unknown-#length-unknown[__builtin_alloca (length2 * sizeof(char))] and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 16.9s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 15.6s. Construction of modules took 0.1s. Büchi inclusion checks took 0.9s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 8 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 25 states and ocurred in iteration 4. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 105 SDtfs, 91 SDslu, 72 SDs, 0 SdLazy, 105 SolverSat, 25 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital373 mio100 ax100 hnf99 lsp92 ukn72 mio100 lsp30 div132 bol100 ite100 ukn100 eq162 hnf81 smp91 dnf701 smp43 tf100 neg96 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 63ms VariablesStem: 11 VariablesLoop: 7 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...