./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-15/cstrspn_malloc_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/termination-15/cstrspn_malloc_true-termination.c.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 9c357a0f089ccce134e4135f49c3923f49db9d7a .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 22:04:57,007 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 22:04:57,008 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 22:04:57,021 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 22:04:57,021 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 22:04:57,023 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 22:04:57,024 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 22:04:57,027 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 22:04:57,028 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 22:04:57,029 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 22:04:57,031 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 22:04:57,031 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 22:04:57,032 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 22:04:57,033 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 22:04:57,035 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 22:04:57,036 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 22:04:57,037 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 22:04:57,039 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 22:04:57,041 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 22:04:57,043 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 22:04:57,045 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 22:04:57,046 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 22:04:57,049 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 22:04:57,050 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 22:04:57,050 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 22:04:57,051 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 22:04:57,052 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 22:04:57,053 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 22:04:57,054 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 22:04:57,056 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 22:04:57,056 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 22:04:57,057 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 22:04:57,057 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 22:04:57,058 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 22:04:57,059 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 22:04:57,060 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 22:04:57,061 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-01 22:04:57,079 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 22:04:57,079 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 22:04:57,080 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 22:04:57,080 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 22:04:57,081 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 22:04:57,081 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 22:04:57,082 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 22:04:57,082 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 22:04:57,082 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 22:04:57,082 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 22:04:57,082 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 22:04:57,083 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 22:04:57,084 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 22:04:57,084 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 22:04:57,084 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 22:04:57,084 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 22:04:57,084 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 22:04:57,085 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 22:04:57,085 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 22:04:57,086 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 22:04:57,086 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 22:04:57,086 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 22:04:57,086 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 22:04:57,086 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 22:04:57,087 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 22:04:57,087 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 22:04:57,088 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 22:04:57,088 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 22:04:57,089 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 22:04:57,089 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9c357a0f089ccce134e4135f49c3923f49db9d7a [2019-01-01 22:04:57,126 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 22:04:57,139 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 22:04:57,143 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 22:04:57,145 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 22:04:57,145 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 22:04:57,146 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-15/cstrspn_malloc_true-termination.c.i [2019-01-01 22:04:57,215 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c423c126b/f72c836c62ae4f15a367f04ef5927c1f/FLAG3371f9678 [2019-01-01 22:04:57,754 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 22:04:57,760 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-15/cstrspn_malloc_true-termination.c.i [2019-01-01 22:04:57,773 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c423c126b/f72c836c62ae4f15a367f04ef5927c1f/FLAG3371f9678 [2019-01-01 22:04:58,005 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c423c126b/f72c836c62ae4f15a367f04ef5927c1f [2019-01-01 22:04:58,008 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 22:04:58,010 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 22:04:58,011 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 22:04:58,011 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 22:04:58,015 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 22:04:58,016 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 10:04:58" (1/1) ... [2019-01-01 22:04:58,019 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70cadbc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:04:58, skipping insertion in model container [2019-01-01 22:04:58,019 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 10:04:58" (1/1) ... [2019-01-01 22:04:58,028 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 22:04:58,077 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 22:04:58,509 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 22:04:58,521 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 22:04:58,642 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 22:04:58,717 INFO L195 MainTranslator]: Completed translation [2019-01-01 22:04:58,718 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:04:58 WrapperNode [2019-01-01 22:04:58,718 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 22:04:58,719 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 22:04:58,720 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 22:04:58,720 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 22:04:58,730 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:04:58" (1/1) ... [2019-01-01 22:04:58,751 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:04:58" (1/1) ... [2019-01-01 22:04:58,785 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 22:04:58,788 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 22:04:58,788 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 22:04:58,788 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 22:04:58,798 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:04:58" (1/1) ... [2019-01-01 22:04:58,798 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:04:58" (1/1) ... [2019-01-01 22:04:58,802 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:04:58" (1/1) ... [2019-01-01 22:04:58,802 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:04:58" (1/1) ... [2019-01-01 22:04:58,819 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:04:58" (1/1) ... [2019-01-01 22:04:58,830 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:04:58" (1/1) ... [2019-01-01 22:04:58,834 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:04:58" (1/1) ... [2019-01-01 22:04:58,839 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 22:04:58,839 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 22:04:58,840 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 22:04:58,841 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 22:04:58,842 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:04:58" (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-01 22:04:58,925 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-01 22:04:58,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-01 22:04:58,926 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-01 22:04:58,926 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-01 22:04:58,926 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 22:04:58,926 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 22:04:59,444 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 22:04:59,445 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2019-01-01 22:04:59,446 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 10:04:59 BoogieIcfgContainer [2019-01-01 22:04:59,446 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 22:04:59,447 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 22:04:59,447 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 22:04:59,451 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 22:04:59,452 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 22:04:59,452 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 10:04:58" (1/3) ... [2019-01-01 22:04:59,453 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@60183736 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 10:04:59, skipping insertion in model container [2019-01-01 22:04:59,453 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 22:04:59,454 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:04:58" (2/3) ... [2019-01-01 22:04:59,454 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@60183736 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 10:04:59, skipping insertion in model container [2019-01-01 22:04:59,454 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 22:04:59,454 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 10:04:59" (3/3) ... [2019-01-01 22:04:59,456 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrspn_malloc_true-termination.c.i [2019-01-01 22:04:59,514 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 22:04:59,515 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 22:04:59,515 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 22:04:59,515 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 22:04:59,515 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 22:04:59,515 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 22:04:59,516 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 22:04:59,516 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 22:04:59,516 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 22:04:59,531 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-01-01 22:04:59,556 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-01-01 22:04:59,556 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:04:59,556 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:04:59,565 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-01 22:04:59,566 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-01 22:04:59,566 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 22:04:59,566 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-01-01 22:04:59,568 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-01-01 22:04:59,568 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:04:59,568 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:04:59,569 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-01 22:04:59,569 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-01 22:04:59,578 INFO L794 eck$LassoCheckResult]: Stem: 13#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 11#L-1true havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~res~0;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 12#L382true assume !(main_~length1~0 < 1); 15#L382-2true assume !(main_~length2~0 < 1); 10#L385-1true call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.allocOnHeap(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.allocOnHeap(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.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);cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem207, cstrspn_#t~post211.base, cstrspn_#t~post211.offset, cstrspn_#t~mem208, cstrspn_#t~mem209, cstrspn_#t~short210, cstrspn_#t~mem212, cstrspn_#t~post205.base, cstrspn_#t~post205.offset, cstrspn_#t~mem206, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 6#L369-4true [2019-01-01 22:04:59,578 INFO L796 eck$LassoCheckResult]: Loop: 6#L369-4true call cstrspn_#t~mem206 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 18#L369-1true assume !!(0 != cstrspn_#t~mem206);havoc cstrspn_#t~mem206;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem207 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem207;havoc cstrspn_#t~mem207; 20#L372-5true assume !true; 4#L372-6true call cstrspn_#t~mem212 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); 8#L374true assume !(cstrspn_#t~mem212 != cstrspn_~c~0);havoc cstrspn_#t~mem212; 5#L369-3true cstrspn_#t~post205.base, cstrspn_#t~post205.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post205.base, 1 + cstrspn_#t~post205.offset;havoc cstrspn_#t~post205.base, cstrspn_#t~post205.offset; 6#L369-4true [2019-01-01 22:04:59,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:04:59,587 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2019-01-01 22:04:59,589 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:04:59,590 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:04:59,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:04:59,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:04:59,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:04:59,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:04:59,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:04:59,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:04:59,766 INFO L82 PathProgramCache]: Analyzing trace with hash 1454917130, now seen corresponding path program 1 times [2019-01-01 22:04:59,766 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:04:59,766 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:04:59,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:04:59,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:04:59,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:04:59,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:04:59,806 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-01 22:04:59,808 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:04:59,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 22:04:59,813 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 22:04:59,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-01 22:04:59,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-01 22:04:59,834 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2019-01-01 22:04:59,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:04:59,843 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2019-01-01 22:04:59,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-01 22:04:59,845 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 23 transitions. [2019-01-01 22:04:59,847 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-01-01 22:04:59,851 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 13 states and 17 transitions. [2019-01-01 22:04:59,853 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-01-01 22:04:59,853 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-01-01 22:04:59,854 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 17 transitions. [2019-01-01 22:04:59,854 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:04:59,854 INFO L705 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2019-01-01 22:04:59,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 17 transitions. [2019-01-01 22:04:59,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-01-01 22:04:59,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-01 22:04:59,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2019-01-01 22:04:59,888 INFO L728 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2019-01-01 22:04:59,889 INFO L608 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2019-01-01 22:04:59,889 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 22:04:59,889 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2019-01-01 22:04:59,890 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-01-01 22:04:59,890 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:04:59,890 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:04:59,891 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-01 22:04:59,891 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:04:59,891 INFO L794 eck$LassoCheckResult]: Stem: 55#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 50#L-1 havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~res~0;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 51#L382 assume !(main_~length1~0 < 1); 52#L382-2 assume !(main_~length2~0 < 1); 49#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.allocOnHeap(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.allocOnHeap(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.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);cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem207, cstrspn_#t~post211.base, cstrspn_#t~post211.offset, cstrspn_#t~mem208, cstrspn_#t~mem209, cstrspn_#t~short210, cstrspn_#t~mem212, cstrspn_#t~post205.base, cstrspn_#t~post205.offset, cstrspn_#t~mem206, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 47#L369-4 [2019-01-01 22:04:59,891 INFO L796 eck$LassoCheckResult]: Loop: 47#L369-4 call cstrspn_#t~mem206 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 48#L369-1 assume !!(0 != cstrspn_#t~mem206);havoc cstrspn_#t~mem206;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem207 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem207;havoc cstrspn_#t~mem207; 56#L372-5 call cstrspn_#t~mem208 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short210 := 0 != cstrspn_#t~mem208; 53#L372-1 assume cstrspn_#t~short210;call cstrspn_#t~mem209 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short210 := cstrspn_#t~mem209 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 54#L372-3 assume !cstrspn_#t~short210;havoc cstrspn_#t~mem209;havoc cstrspn_#t~mem208;havoc cstrspn_#t~short210; 44#L372-6 call cstrspn_#t~mem212 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); 45#L374 assume !(cstrspn_#t~mem212 != cstrspn_~c~0);havoc cstrspn_#t~mem212; 46#L369-3 cstrspn_#t~post205.base, cstrspn_#t~post205.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post205.base, 1 + cstrspn_#t~post205.offset;havoc cstrspn_#t~post205.base, cstrspn_#t~post205.offset; 47#L369-4 [2019-01-01 22:04:59,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:04:59,892 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 2 times [2019-01-01 22:04:59,892 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:04:59,892 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:04:59,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:04:59,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:04:59,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:04:59,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:04:59,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:04:59,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:04:59,938 INFO L82 PathProgramCache]: Analyzing trace with hash 1927396657, now seen corresponding path program 1 times [2019-01-01 22:04:59,938 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:04:59,938 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:04:59,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:04:59,940 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:04:59,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:04:59,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:04:59,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:04:59,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:04:59,976 INFO L82 PathProgramCache]: Analyzing trace with hash -102988426, now seen corresponding path program 1 times [2019-01-01 22:04:59,976 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:04:59,977 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:04:59,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:04:59,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:04:59,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:00,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:00,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:00,783 WARN L181 SmtUtils]: Spent 648.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2019-01-01 22:05:01,829 WARN L181 SmtUtils]: Spent 990.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2019-01-01 22:05:02,408 WARN L181 SmtUtils]: Spent 568.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 87 [2019-01-01 22:05:02,568 WARN L181 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-01-01 22:05:02,582 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:05:02,583 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:05:02,584 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:05:02,584 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:05:02,584 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 22:05:02,584 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:05:02,584 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:05:02,585 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:05:02,585 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrspn_malloc_true-termination.c.i_Iteration2_Lasso [2019-01-01 22:05:02,585 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:05:02,585 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:05:02,616 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-01 22:05:02,627 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-01 22:05:02,636 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-01 22:05:02,644 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-01 22:05:02,649 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-01 22:05:02,653 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-01 22:05:02,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-01 22:05:02,668 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-01 22:05:02,672 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:02,680 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-01 22:05:02,682 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-01 22:05:02,690 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-01 22:05:02,692 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:02,695 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-01 22:05:02,729 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-01 22:05:02,732 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-01 22:05:02,736 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-01 22:05:03,254 WARN L181 SmtUtils]: Spent 357.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 66 [2019-01-01 22:05:03,604 WARN L181 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-01-01 22:05:03,604 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-01 22:05:03,607 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-01 22:05:04,716 WARN L181 SmtUtils]: Spent 683.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 40 [2019-01-01 22:05:05,036 WARN L181 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 29 [2019-01-01 22:05:05,053 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:05:05,059 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 22:05:05,061 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:05:05,063 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:05,063 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:05:05,064 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:05,064 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:05,064 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:05,066 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:05:05,066 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:05:05,068 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:05,068 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:05:05,069 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:05,069 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:05:05,069 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:05,069 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:05,069 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:05,070 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:05:05,070 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:05:05,071 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:05,071 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:05:05,071 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:05,072 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:05,072 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:05,072 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:05,075 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:05:05,075 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:05:05,078 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:05,078 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:05:05,079 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:05,079 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:05:05,079 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:05,079 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:05,079 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:05,080 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:05:05,080 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:05:05,081 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:05,081 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:05:05,082 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:05,082 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:05:05,082 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:05,082 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:05,082 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:05,083 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:05:05,083 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:05:05,083 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:05,084 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:05:05,084 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:05,084 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:05,085 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:05,085 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:05,087 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:05:05,087 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:05:05,094 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:05,095 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:05:05,095 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:05,095 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:05:05,096 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:05,096 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:05,096 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:05,096 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:05:05,096 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:05:05,097 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:05,097 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:05:05,102 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:05,102 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:05:05,102 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:05,103 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:05,103 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:05,103 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:05:05,103 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:05:05,104 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:05,105 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:05:05,105 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:05,105 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:05:05,109 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:05,109 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:05,109 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:05,110 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:05:05,110 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:05:05,113 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:05,113 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:05:05,114 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:05,114 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:05:05,114 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:05,114 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:05,114 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:05,115 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:05:05,115 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:05:05,119 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:05,119 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:05:05,120 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:05,120 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:05:05,120 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:05,120 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:05,120 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:05,121 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:05:05,121 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:05:05,125 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:05,125 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:05:05,126 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:05,126 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:05:05,126 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:05,127 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:05,127 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:05,127 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:05:05,127 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:05:05,128 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:05,128 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:05:05,134 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:05,134 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:05:05,134 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:05,134 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:05,134 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:05,135 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:05:05,135 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:05:05,136 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:05,137 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:05:05,138 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:05,138 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:05:05,138 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:05,138 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:05,139 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:05,142 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:05:05,143 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:05:05,145 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:05,145 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:05:05,146 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:05,146 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:05:05,146 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:05,146 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:05,146 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:05,148 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:05:05,148 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:05:05,149 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:05,152 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:05:05,153 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:05,153 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:05:05,153 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:05,153 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:05,153 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:05,154 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:05:05,154 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:05:05,157 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:05,158 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:05:05,159 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:05,159 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2019-01-01 22:05:05,159 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:05,159 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:05,178 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-01 22:05:05,178 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:05:05,232 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:05,232 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:05:05,233 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:05,233 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:05,233 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:05,234 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:05,235 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:05:05,235 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:05:05,237 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:05,238 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:05:05,238 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:05,238 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:05,238 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:05,238 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:05,240 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:05:05,240 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:05:05,249 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:05,249 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:05:05,250 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:05,250 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:05:05,250 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:05,250 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:05,250 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:05,251 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:05:05,251 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:05:05,253 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:05,253 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:05:05,254 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:05,254 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:05,254 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:05,254 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:05,255 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:05:05,255 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:05:05,257 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:05,258 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:05:05,258 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:05,258 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:05,258 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:05,259 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:05,260 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:05:05,260 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:05:05,263 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:05,263 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:05:05,264 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:05,264 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:05,264 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:05,264 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:05,265 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:05:05,265 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:05:05,269 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:05,269 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:05:05,270 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:05,270 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:05,270 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:05,271 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:05,274 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:05:05,274 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:05:05,321 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 22:05:05,352 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 22:05:05,352 INFO L444 ModelExtractionUtils]: 22 out of 28 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-01-01 22:05:05,355 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 22:05:05,356 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 22:05:05,357 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 22:05:05,357 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrspn_~sc1~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc215.base)_1) = -1*ULTIMATE.start_cstrspn_~sc1~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc215.base)_1 Supporting invariants [] [2019-01-01 22:05:05,520 INFO L297 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2019-01-01 22:05:05,530 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-01 22:05:05,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:05:05,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:05:05,613 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:05:05,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:05:05,646 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:05:05,793 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-01 22:05:05,797 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-01 22:05:05,798 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-01-01 22:05:05,880 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-01 22:05:05,883 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-01 22:05:05,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 22:05:05,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2019-01-01 22:05:05,886 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 8 letters. [2019-01-01 22:05:05,888 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:05:05,888 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 13 letters. Loop has 8 letters. [2019-01-01 22:05:05,888 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:05:05,888 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 16 letters. [2019-01-01 22:05:05,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:05:05,889 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 28 transitions. [2019-01-01 22:05:05,890 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 22:05:05,891 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 18 states and 25 transitions. [2019-01-01 22:05:05,891 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-01-01 22:05:05,892 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-01-01 22:05:05,892 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 25 transitions. [2019-01-01 22:05:05,892 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 22:05:05,892 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-01-01 22:05:05,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 25 transitions. [2019-01-01 22:05:05,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-01-01 22:05:05,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-01 22:05:05,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2019-01-01 22:05:05,895 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-01-01 22:05:05,895 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-01-01 22:05:05,895 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 22:05:05,895 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 25 transitions. [2019-01-01 22:05:05,896 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 22:05:05,896 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:05:05,896 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:05:05,896 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:05:05,896 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 22:05:05,897 INFO L794 eck$LassoCheckResult]: Stem: 193#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 186#L-1 havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~res~0;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 187#L382 assume !(main_~length1~0 < 1); 188#L382-2 assume !(main_~length2~0 < 1); 185#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.allocOnHeap(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.allocOnHeap(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.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);cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem207, cstrspn_#t~post211.base, cstrspn_#t~post211.offset, cstrspn_#t~mem208, cstrspn_#t~mem209, cstrspn_#t~short210, cstrspn_#t~mem212, cstrspn_#t~post205.base, cstrspn_#t~post205.offset, cstrspn_#t~mem206, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 182#L369-4 call cstrspn_#t~mem206 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 184#L369-1 assume !!(0 != cstrspn_#t~mem206);havoc cstrspn_#t~mem206;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem207 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem207;havoc cstrspn_#t~mem207; 194#L372-5 [2019-01-01 22:05:05,897 INFO L796 eck$LassoCheckResult]: Loop: 194#L372-5 call cstrspn_#t~mem208 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short210 := 0 != cstrspn_#t~mem208; 189#L372-1 assume cstrspn_#t~short210;call cstrspn_#t~mem209 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short210 := cstrspn_#t~mem209 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 190#L372-3 assume !!cstrspn_#t~short210;havoc cstrspn_#t~mem209;havoc cstrspn_#t~mem208;havoc cstrspn_#t~short210;cstrspn_#t~post211.base, cstrspn_#t~post211.offset := cstrspn_~s~0.base, cstrspn_~s~0.offset;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_#t~post211.base, 1 + cstrspn_#t~post211.offset;havoc cstrspn_#t~post211.base, cstrspn_#t~post211.offset; 194#L372-5 [2019-01-01 22:05:05,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:05:05,897 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935595, now seen corresponding path program 1 times [2019-01-01 22:05:05,897 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:05:05,897 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:05:05,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:05,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:05:05,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:05,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:05,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:05,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:05:05,922 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 1 times [2019-01-01 22:05:05,922 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:05:05,923 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:05:05,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:05,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:05:05,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:05,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:05,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:05,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:05:05,932 INFO L82 PathProgramCache]: Analyzing trace with hash 1593218778, now seen corresponding path program 1 times [2019-01-01 22:05:05,933 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:05:05,933 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:05:05,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:05,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:05:05,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:05,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:05,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:06,157 WARN L181 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 38 [2019-01-01 22:05:06,344 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2019-01-01 22:05:06,762 WARN L181 SmtUtils]: Spent 414.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 103 [2019-01-01 22:05:06,943 WARN L181 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-01-01 22:05:06,947 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:05:06,947 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:05:06,947 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:05:06,948 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:05:06,948 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 22:05:06,948 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:05:06,948 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:05:06,948 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:05:06,948 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrspn_malloc_true-termination.c.i_Iteration3_Lasso [2019-01-01 22:05:06,948 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:05:06,948 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:05:06,955 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-01 22:05:06,962 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-01 22:05:06,965 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-01 22:05:06,968 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-01 22:05:06,971 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-01 22:05:06,974 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-01 22:05:06,977 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-01 22:05:06,980 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-01 22:05:06,983 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-01 22:05:06,986 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-01 22:05:06,989 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-01 22:05:06,992 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-01 22:05:06,995 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-01 22:05:06,999 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-01 22:05:07,003 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-01 22:05:07,004 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-01 22:05:07,490 WARN L181 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 80 [2019-01-01 22:05:07,734 WARN L181 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 53 [2019-01-01 22:05:07,735 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:07,737 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-01 22:05:07,741 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:07,915 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2019-01-01 22:05:08,018 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2019-01-01 22:05:08,144 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2019-01-01 22:05:08,503 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2019-01-01 22:05:09,220 WARN L181 SmtUtils]: Spent 679.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-01-01 22:05:09,504 WARN L181 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2019-01-01 22:05:09,544 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:05:09,544 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 22:05:09,544 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:05:09,545 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:09,545 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:05:09,545 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:09,545 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:09,545 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:09,548 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:05:09,549 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:05:09,550 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:09,550 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:05:09,550 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:09,550 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:05:09,553 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:09,553 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:09,553 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:09,553 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:05:09,553 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:05:09,555 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:09,555 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:05:09,556 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:09,556 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:05:09,556 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:09,556 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:09,556 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:09,559 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:05:09,559 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:05:09,560 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:09,560 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:05:09,561 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:09,561 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:05:09,561 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:09,561 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:09,561 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:09,565 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:05:09,565 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:05:09,565 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:09,566 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:05:09,566 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:09,566 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:09,566 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:09,567 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:09,570 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:05:09,571 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:05:09,573 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:09,574 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:05:09,576 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:09,576 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:05:09,576 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:09,577 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:09,577 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:09,577 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:05:09,577 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:05:09,578 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:09,578 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:05:09,581 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:09,581 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:05:09,582 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:09,582 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:09,582 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:09,582 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:05:09,582 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:05:09,583 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:09,583 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:05:09,587 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:09,587 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:09,587 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:09,587 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:09,588 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:05:09,588 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:05:09,591 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:09,592 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:05:09,592 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:09,592 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:05:09,592 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:09,592 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:09,593 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:09,593 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:05:09,593 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:05:09,594 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:09,597 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:05:09,598 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:09,598 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:05:09,598 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:09,598 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:09,598 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:09,598 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:05:09,598 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:05:09,602 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:09,602 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:05:09,603 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:09,603 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:05:09,603 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:09,603 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:09,603 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:09,606 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:05:09,607 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:05:09,607 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:09,608 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:05:09,608 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:09,608 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:05:09,608 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:09,608 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:09,608 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:09,612 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:05:09,612 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:05:09,612 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:09,613 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:05:09,613 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:09,613 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:05:09,616 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:09,616 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:09,616 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:09,617 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:05:09,617 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:05:09,618 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:09,618 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:05:09,618 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:09,618 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:05:09,621 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:09,622 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:09,622 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:09,622 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:05:09,622 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:05:09,623 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:09,623 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:05:09,623 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:09,627 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:05:09,627 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:09,627 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:09,627 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:09,627 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:05:09,627 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:05:09,629 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:09,630 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:05:09,630 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:09,631 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:09,631 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:09,631 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:09,638 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:05:09,639 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:05:09,659 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 22:05:09,680 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-01-01 22:05:09,680 INFO L444 ModelExtractionUtils]: 49 out of 55 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-01-01 22:05:09,681 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 22:05:09,682 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 22:05:09,683 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 22:05:09,683 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_cstrspn_~s~0.base)_2, ULTIMATE.start_cstrspn_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_cstrspn_~s~0.base)_2 - 1*ULTIMATE.start_cstrspn_~s~0.offset Supporting invariants [] [2019-01-01 22:05:09,809 INFO L297 tatePredicateManager]: 17 out of 17 supporting invariants were superfluous and have been removed [2019-01-01 22:05:09,811 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-01 22:05:09,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:05:09,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:05:09,839 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:05:09,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:05:09,846 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:05:09,924 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-01 22:05:09,924 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-01 22:05:09,924 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9 Second operand 3 states. [2019-01-01 22:05:09,988 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 43 states and 57 transitions. Complement of second has 5 states. [2019-01-01 22:05:09,989 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-01 22:05:09,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 22:05:09,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2019-01-01 22:05:09,989 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 7 letters. Loop has 3 letters. [2019-01-01 22:05:09,990 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:05:09,990 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 10 letters. Loop has 3 letters. [2019-01-01 22:05:09,990 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:05:09,990 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 7 letters. Loop has 6 letters. [2019-01-01 22:05:09,991 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:05:09,991 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 57 transitions. [2019-01-01 22:05:09,993 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 22:05:09,994 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 30 states and 40 transitions. [2019-01-01 22:05:09,994 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-01-01 22:05:09,994 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-01-01 22:05:09,995 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 40 transitions. [2019-01-01 22:05:09,995 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 22:05:09,995 INFO L705 BuchiCegarLoop]: Abstraction has 30 states and 40 transitions. [2019-01-01 22:05:09,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 40 transitions. [2019-01-01 22:05:09,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2019-01-01 22:05:09,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-01-01 22:05:09,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2019-01-01 22:05:09,998 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2019-01-01 22:05:09,998 INFO L608 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2019-01-01 22:05:09,998 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-01 22:05:09,998 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 33 transitions. [2019-01-01 22:05:09,999 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 22:05:10,000 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:05:10,000 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:05:10,000 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:05:10,000 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 22:05:10,001 INFO L794 eck$LassoCheckResult]: Stem: 374#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 367#L-1 havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~res~0;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 368#L382 assume !(main_~length1~0 < 1); 369#L382-2 assume !(main_~length2~0 < 1); 366#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.allocOnHeap(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.allocOnHeap(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.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);cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem207, cstrspn_#t~post211.base, cstrspn_#t~post211.offset, cstrspn_#t~mem208, cstrspn_#t~mem209, cstrspn_#t~short210, cstrspn_#t~mem212, cstrspn_#t~post205.base, cstrspn_#t~post205.offset, cstrspn_#t~mem206, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 362#L369-4 call cstrspn_#t~mem206 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 363#L369-1 assume !!(0 != cstrspn_#t~mem206);havoc cstrspn_#t~mem206;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem207 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem207;havoc cstrspn_#t~mem207; 376#L372-5 call cstrspn_#t~mem208 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short210 := 0 != cstrspn_#t~mem208; 372#L372-1 assume !cstrspn_#t~short210; 373#L372-3 assume !cstrspn_#t~short210;havoc cstrspn_#t~mem209;havoc cstrspn_#t~mem208;havoc cstrspn_#t~short210; 358#L372-6 call cstrspn_#t~mem212 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); 359#L374 assume !(cstrspn_#t~mem212 != cstrspn_~c~0);havoc cstrspn_#t~mem212; 360#L369-3 cstrspn_#t~post205.base, cstrspn_#t~post205.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post205.base, 1 + cstrspn_#t~post205.offset;havoc cstrspn_#t~post205.base, cstrspn_#t~post205.offset; 361#L369-4 call cstrspn_#t~mem206 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 365#L369-1 assume !!(0 != cstrspn_#t~mem206);havoc cstrspn_#t~mem206;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem207 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem207;havoc cstrspn_#t~mem207; 375#L372-5 [2019-01-01 22:05:10,001 INFO L796 eck$LassoCheckResult]: Loop: 375#L372-5 call cstrspn_#t~mem208 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short210 := 0 != cstrspn_#t~mem208; 370#L372-1 assume cstrspn_#t~short210;call cstrspn_#t~mem209 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short210 := cstrspn_#t~mem209 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 371#L372-3 assume !!cstrspn_#t~short210;havoc cstrspn_#t~mem209;havoc cstrspn_#t~mem208;havoc cstrspn_#t~short210;cstrspn_#t~post211.base, cstrspn_#t~post211.offset := cstrspn_~s~0.base, cstrspn_~s~0.offset;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_#t~post211.base, 1 + cstrspn_#t~post211.offset;havoc cstrspn_#t~post211.base, cstrspn_#t~post211.offset; 375#L372-5 [2019-01-01 22:05:10,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:05:10,001 INFO L82 PathProgramCache]: Analyzing trace with hash 1587378397, now seen corresponding path program 1 times [2019-01-01 22:05:10,001 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:05:10,001 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:05:10,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:10,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:05:10,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:10,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:05:10,105 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-01 22:05:10,105 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:05:10,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-01 22:05:10,105 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 22:05:10,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:05:10,106 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 2 times [2019-01-01 22:05:10,106 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:05:10,106 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:05:10,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:10,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:05:10,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:10,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:10,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:10,313 WARN L181 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 38 [2019-01-01 22:05:10,434 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2019-01-01 22:05:10,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 22:05:10,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-01 22:05:10,436 INFO L87 Difference]: Start difference. First operand 24 states and 33 transitions. cyclomatic complexity: 12 Second operand 7 states. [2019-01-01 22:05:10,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:05:10,764 INFO L93 Difference]: Finished difference Result 30 states and 39 transitions. [2019-01-01 22:05:10,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-01 22:05:10,765 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 39 transitions. [2019-01-01 22:05:10,766 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-01 22:05:10,767 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 27 states and 35 transitions. [2019-01-01 22:05:10,767 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-01-01 22:05:10,769 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-01-01 22:05:10,769 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 35 transitions. [2019-01-01 22:05:10,769 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 22:05:10,769 INFO L705 BuchiCegarLoop]: Abstraction has 27 states and 35 transitions. [2019-01-01 22:05:10,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 35 transitions. [2019-01-01 22:05:10,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2019-01-01 22:05:10,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-01-01 22:05:10,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2019-01-01 22:05:10,773 INFO L728 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2019-01-01 22:05:10,774 INFO L608 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2019-01-01 22:05:10,774 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-01 22:05:10,774 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 33 transitions. [2019-01-01 22:05:10,776 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 22:05:10,776 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:05:10,776 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:05:10,777 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:05:10,777 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 22:05:10,777 INFO L794 eck$LassoCheckResult]: Stem: 442#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 439#L-1 havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~res~0;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 440#L382 assume !(main_~length1~0 < 1); 441#L382-2 assume !(main_~length2~0 < 1); 438#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.allocOnHeap(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.allocOnHeap(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.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);cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem207, cstrspn_#t~post211.base, cstrspn_#t~post211.offset, cstrspn_#t~mem208, cstrspn_#t~mem209, cstrspn_#t~short210, cstrspn_#t~mem212, cstrspn_#t~post205.base, cstrspn_#t~post205.offset, cstrspn_#t~mem206, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 434#L369-4 call cstrspn_#t~mem206 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 435#L369-1 assume !!(0 != cstrspn_#t~mem206);havoc cstrspn_#t~mem206;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem207 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem207;havoc cstrspn_#t~mem207; 448#L372-5 call cstrspn_#t~mem208 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short210 := 0 != cstrspn_#t~mem208; 452#L372-1 assume cstrspn_#t~short210;call cstrspn_#t~mem209 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short210 := cstrspn_#t~mem209 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 451#L372-3 assume !cstrspn_#t~short210;havoc cstrspn_#t~mem209;havoc cstrspn_#t~mem208;havoc cstrspn_#t~short210; 430#L372-6 call cstrspn_#t~mem212 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); 431#L374 assume !(cstrspn_#t~mem212 != cstrspn_~c~0);havoc cstrspn_#t~mem212; 432#L369-3 cstrspn_#t~post205.base, cstrspn_#t~post205.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post205.base, 1 + cstrspn_#t~post205.offset;havoc cstrspn_#t~post205.base, cstrspn_#t~post205.offset; 433#L369-4 call cstrspn_#t~mem206 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 437#L369-1 assume !!(0 != cstrspn_#t~mem206);havoc cstrspn_#t~mem206;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem207 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem207;havoc cstrspn_#t~mem207; 447#L372-5 [2019-01-01 22:05:10,777 INFO L796 eck$LassoCheckResult]: Loop: 447#L372-5 call cstrspn_#t~mem208 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short210 := 0 != cstrspn_#t~mem208; 443#L372-1 assume cstrspn_#t~short210;call cstrspn_#t~mem209 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short210 := cstrspn_#t~mem209 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 444#L372-3 assume !!cstrspn_#t~short210;havoc cstrspn_#t~mem209;havoc cstrspn_#t~mem208;havoc cstrspn_#t~short210;cstrspn_#t~post211.base, cstrspn_#t~post211.offset := cstrspn_~s~0.base, cstrspn_~s~0.offset;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_#t~post211.base, 1 + cstrspn_#t~post211.offset;havoc cstrspn_#t~post211.base, cstrspn_#t~post211.offset; 447#L372-5 [2019-01-01 22:05:10,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:05:10,777 INFO L82 PathProgramCache]: Analyzing trace with hash -187628965, now seen corresponding path program 2 times [2019-01-01 22:05:10,777 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:05:10,778 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:05:10,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:10,778 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:05:10,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:10,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:10,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:10,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:05:10,837 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 3 times [2019-01-01 22:05:10,837 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:05:10,837 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:05:10,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:10,841 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:05:10,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:10,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:10,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:10,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:05:10,857 INFO L82 PathProgramCache]: Analyzing trace with hash -1902015318, now seen corresponding path program 1 times [2019-01-01 22:05:10,857 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:05:10,857 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:05:10,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:10,858 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:05:10,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:10,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:10,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:11,042 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 38 [2019-01-01 22:05:11,879 WARN L181 SmtUtils]: Spent 703.00 ms on a formula simplification. DAG size of input: 175 DAG size of output: 140 [2019-01-01 22:05:13,249 WARN L181 SmtUtils]: Spent 1.34 s on a formula simplification. DAG size of input: 112 DAG size of output: 112 [2019-01-01 22:05:13,252 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:05:13,252 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:05:13,252 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:05:13,252 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:05:13,252 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 22:05:13,252 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:05:13,253 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:05:13,253 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:05:13,253 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrspn_malloc_true-termination.c.i_Iteration5_Lasso [2019-01-01 22:05:13,253 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:05:13,253 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:05:13,262 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:13,284 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-01 22:05:13,290 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-01 22:05:13,294 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:13,303 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:13,306 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-01 22:05:13,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-01 22:05:13,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-01 22:05:13,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-01 22:05:13,329 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-01 22:05:13,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-01 22:05:13,336 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-01 22:05:13,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-01 22:05:13,354 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-01 22:05:13,358 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-01 22:05:13,363 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-01 22:05:13,366 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-01 22:05:13,637 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-01-01 22:05:14,679 WARN L181 SmtUtils]: Spent 1.04 s on a formula simplification. DAG size of input: 115 DAG size of output: 100 [2019-01-01 22:05:14,847 WARN L181 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2019-01-01 22:05:14,847 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-01 22:05:14,857 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:15,030 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2019-01-01 22:05:15,145 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2019-01-01 22:05:15,350 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2019-01-01 22:05:15,865 WARN L181 SmtUtils]: Spent 372.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 39 [2019-01-01 22:05:16,094 WARN L181 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2019-01-01 22:05:16,690 WARN L181 SmtUtils]: Spent 436.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-01-01 22:05:16,726 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:05:16,727 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 22:05:16,727 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:05:16,728 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:16,728 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:05:16,728 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:16,728 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:16,728 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:16,729 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:05:16,730 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:05:16,730 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:16,731 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:05:16,731 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:16,731 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:05:16,731 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:16,731 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:16,732 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:16,733 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:05:16,733 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:05:16,733 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:16,733 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:05:16,739 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:16,739 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:16,739 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:16,739 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:16,740 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:05:16,740 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:05:16,741 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:16,742 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:05:16,742 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:16,742 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:05:16,742 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:16,743 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:16,743 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:16,743 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:05:16,743 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:05:16,743 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:16,743 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:05:16,745 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:16,745 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:05:16,745 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:16,745 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:16,745 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:16,745 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:05:16,745 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:05:16,746 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:16,746 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:05:16,746 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:16,746 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:05:16,747 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:16,747 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:16,747 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:16,748 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:05:16,748 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:05:16,748 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:16,748 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:05:16,749 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:16,749 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:05:16,749 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:16,749 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:16,749 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:16,749 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:05:16,750 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:05:16,750 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:16,751 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:05:16,751 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:16,751 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:05:16,751 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:16,751 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:16,752 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:16,752 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:05:16,752 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:05:16,752 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:16,754 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:05:16,754 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:16,754 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:05:16,754 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:16,755 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:16,756 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:16,757 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:05:16,757 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:05:16,757 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:16,758 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:05:16,758 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:16,758 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:16,758 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:16,758 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:16,759 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:05:16,759 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:05:16,760 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:16,760 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:05:16,761 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:16,761 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:05:16,761 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:16,761 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:16,762 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:16,762 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:05:16,762 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:05:16,762 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:16,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-01 22:05:16,764 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:16,764 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:05:16,764 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:16,764 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:16,764 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:16,765 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:05:16,765 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:05:16,765 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:16,767 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:05:16,767 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:16,767 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:05:16,767 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:16,767 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:16,767 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:16,768 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:05:16,768 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:05:16,768 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:16,768 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:05:16,769 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:16,769 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:05:16,769 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:16,769 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:16,769 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:16,769 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:05:16,770 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:05:16,770 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:16,770 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:05:16,770 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:16,770 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:05:16,772 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:16,772 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:16,772 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:16,773 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:05:16,773 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:05:16,773 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:16,773 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:05:16,774 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:16,774 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:05:16,774 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:16,774 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:16,774 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:16,774 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:05:16,775 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:05:16,775 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:16,775 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:05:16,775 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:16,777 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2019-01-01 22:05:16,778 INFO L206 nArgumentSynthesizer]: 6 loop disjuncts [2019-01-01 22:05:16,778 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:16,839 INFO L402 nArgumentSynthesizer]: We have 132 Motzkin's Theorem applications. [2019-01-01 22:05:16,839 INFO L403 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2019-01-01 22:05:16,974 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:16,975 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:05:16,975 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:16,975 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:16,975 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:16,975 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:16,978 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:05:16,979 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:05:16,982 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:16,982 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:05:16,985 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:16,985 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:16,985 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:16,985 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:16,987 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:05:16,987 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:05:16,992 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:16,993 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:05:16,993 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:16,993 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:16,993 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:16,994 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:17,000 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:05:17,000 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:05:17,020 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 22:05:17,066 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-01 22:05:17,066 INFO L444 ModelExtractionUtils]: 53 out of 58 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-01-01 22:05:17,067 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 22:05:17,067 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 22:05:17,068 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 22:05:17,068 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc216.base)_3, ULTIMATE.start_cstrspn_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc216.base)_3 - 1*ULTIMATE.start_cstrspn_~s~0.offset Supporting invariants [] [2019-01-01 22:05:17,713 INFO L297 tatePredicateManager]: 29 out of 30 supporting invariants were superfluous and have been removed [2019-01-01 22:05:17,715 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-01 22:05:17,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:05:17,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:05:17,783 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:05:17,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:05:17,846 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:05:17,862 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-01 22:05:17,862 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-01 22:05:17,863 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11 Second operand 4 states. [2019-01-01 22:05:17,949 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-01 22:05:17,952 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-01 22:05:17,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 22:05:17,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2019-01-01 22:05:17,953 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2019-01-01 22:05:17,953 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:05:17,953 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 22:05:17,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:05:18,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:05:18,006 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:05:18,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:05:18,026 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:05:18,038 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-01 22:05:18,038 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-01 22:05:18,038 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11 Second operand 4 states. [2019-01-01 22:05:18,093 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-01 22:05:18,098 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-01 22:05:18,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 22:05:18,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2019-01-01 22:05:18,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2019-01-01 22:05:18,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:05:18,099 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 22:05:18,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:05:18,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:05:18,142 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:05:18,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:05:18,160 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:05:18,172 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-01 22:05:18,172 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-01 22:05:18,174 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11 Second operand 4 states. [2019-01-01 22:05:18,244 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-01 22:05:18,245 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-01 22:05:18,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 22:05:18,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2019-01-01 22:05:18,246 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 15 letters. Loop has 3 letters. [2019-01-01 22:05:18,246 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:05:18,246 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 18 letters. Loop has 3 letters. [2019-01-01 22:05:18,247 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:05:18,247 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 15 letters. Loop has 6 letters. [2019-01-01 22:05:18,247 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:05:18,247 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 53 transitions. [2019-01-01 22:05:18,250 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 22:05:18,250 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 0 states and 0 transitions. [2019-01-01 22:05:18,250 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 22:05:18,250 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 22:05:18,250 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 22:05:18,250 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:05:18,251 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 22:05:18,251 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 22:05:18,251 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 22:05:18,251 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-01 22:05:18,251 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-01 22:05:18,251 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 22:05:18,251 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-01 22:05:18,264 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 10:05:18 BoogieIcfgContainer [2019-01-01 22:05:18,264 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 22:05:18,265 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 22:05:18,265 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 22:05:18,265 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 22:05:18,265 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 10:04:59" (3/4) ... [2019-01-01 22:05:18,272 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-01 22:05:18,273 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 22:05:18,273 INFO L168 Benchmark]: Toolchain (without parser) took 20264.96 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 347.6 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -114.6 MB). Peak memory consumption was 233.0 MB. Max. memory is 11.5 GB. [2019-01-01 22:05:18,276 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 22:05:18,278 INFO L168 Benchmark]: CACSL2BoogieTranslator took 707.71 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 117.4 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -137.0 MB). Peak memory consumption was 30.6 MB. Max. memory is 11.5 GB. [2019-01-01 22:05:18,280 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.22 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 22:05:18,281 INFO L168 Benchmark]: Boogie Preprocessor took 51.15 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 22:05:18,281 INFO L168 Benchmark]: RCFGBuilder took 606.74 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.1 MB). Peak memory consumption was 19.1 MB. Max. memory is 11.5 GB. [2019-01-01 22:05:18,282 INFO L168 Benchmark]: BuchiAutomizer took 18817.80 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 230.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.2 MB). Peak memory consumption was 233.4 MB. Max. memory is 11.5 GB. [2019-01-01 22:05:18,286 INFO L168 Benchmark]: Witness Printer took 7.80 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 22:05:18,292 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 707.71 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 117.4 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -137.0 MB). Peak memory consumption was 30.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 68.22 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 51.15 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 606.74 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.1 MB). Peak memory consumption was 19.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 18817.80 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 230.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.2 MB). Peak memory consumption was 233.4 MB. Max. memory is 11.5 GB. * Witness Printer took 7.80 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (2 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -1 * sc1 + unknown-#length-unknown[malloc(length1 * sizeof(char))] and consists of 3 locations. One deterministic module has affine ranking function unknown-#length-unknown[s] + -1 * s and consists of 3 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[malloc(length2 * sizeof(char))] + -1 * s 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 18.7s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 17.1s. Construction of modules took 0.3s. Büchi inclusion checks took 1.1s. 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: 106 SDtfs, 92 SDslu, 67 SDs, 0 SdLazy, 103 SolverSat, 22 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital382 mio100 ax100 hnf99 lsp91 ukn73 mio100 lsp32 div129 bol100 ite100 ukn100 eq171 hnf80 smp96 dnf599 smp43 tf100 neg96 sie110 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 198ms VariablesStem: 7 VariablesLoop: 4 DisjunctsStem: 4 DisjunctsLoop: 6 SupportingInvariants: 12 MotzkinApplications: 132 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...