./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/array-memsafety/cstrspn-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- 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/array-memsafety/cstrspn-alloca_true-valid-memsafety_true-termination.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1f6e8c8b965f85c3429105401e9fda59f9f060cb .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-02 00:19:27,039 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-02 00:19:27,040 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-02 00:19:27,057 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-02 00:19:27,057 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-02 00:19:27,058 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-02 00:19:27,060 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-02 00:19:27,063 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-02 00:19:27,065 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-02 00:19:27,074 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-02 00:19:27,075 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-02 00:19:27,075 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-02 00:19:27,077 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-02 00:19:27,079 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-02 00:19:27,080 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-02 00:19:27,080 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-02 00:19:27,084 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-02 00:19:27,088 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-02 00:19:27,092 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-02 00:19:27,094 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-02 00:19:27,095 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-02 00:19:27,097 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-02 00:19:27,101 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-02 00:19:27,101 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-02 00:19:27,101 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-02 00:19:27,102 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-02 00:19:27,103 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-02 00:19:27,105 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-02 00:19:27,106 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-02 00:19:27,109 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-02 00:19:27,109 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-02 00:19:27,111 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-02 00:19:27,111 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-02 00:19:27,111 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-02 00:19:27,114 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-02 00:19:27,115 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-02 00:19:27,117 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-02 00:19:27,143 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-02 00:19:27,143 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-02 00:19:27,145 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-02 00:19:27,145 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-02 00:19:27,145 INFO L133 SettingsManager]: * Use SBE=true [2019-01-02 00:19:27,146 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-02 00:19:27,146 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-02 00:19:27,146 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-02 00:19:27,146 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-02 00:19:27,146 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-02 00:19:27,146 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-02 00:19:27,147 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-02 00:19:27,147 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-02 00:19:27,147 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-02 00:19:27,147 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-02 00:19:27,147 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-02 00:19:27,147 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-02 00:19:27,149 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-02 00:19:27,149 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-02 00:19:27,149 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-02 00:19:27,149 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-02 00:19:27,150 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-02 00:19:27,150 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-02 00:19:27,150 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-02 00:19:27,150 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-02 00:19:27,150 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-02 00:19:27,150 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-02 00:19:27,152 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-02 00:19:27,152 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-02 00:19:27,152 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-02 00:19:27,152 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-02 00:19:27,154 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-02 00:19:27,154 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1f6e8c8b965f85c3429105401e9fda59f9f060cb [2019-01-02 00:19:27,209 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-02 00:19:27,231 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-02 00:19:27,237 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-02 00:19:27,239 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-02 00:19:27,240 INFO L276 PluginConnector]: CDTParser initialized [2019-01-02 00:19:27,241 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/array-memsafety/cstrspn-alloca_true-valid-memsafety_true-termination.i [2019-01-02 00:19:27,299 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30b59e85b/092bdc26ce4f401f932203bd511ee03f/FLAGfb48c1e07 [2019-01-02 00:19:27,766 INFO L307 CDTParser]: Found 1 translation units. [2019-01-02 00:19:27,767 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/array-memsafety/cstrspn-alloca_true-valid-memsafety_true-termination.i [2019-01-02 00:19:27,790 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30b59e85b/092bdc26ce4f401f932203bd511ee03f/FLAGfb48c1e07 [2019-01-02 00:19:28,076 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30b59e85b/092bdc26ce4f401f932203bd511ee03f [2019-01-02 00:19:28,080 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-02 00:19:28,082 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-02 00:19:28,083 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-02 00:19:28,083 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-02 00:19:28,088 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-02 00:19:28,089 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.01 12:19:28" (1/1) ... [2019-01-02 00:19:28,092 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e342e06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:19:28, skipping insertion in model container [2019-01-02 00:19:28,093 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.01 12:19:28" (1/1) ... [2019-01-02 00:19:28,102 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-02 00:19:28,169 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-02 00:19:28,557 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-02 00:19:28,573 INFO L191 MainTranslator]: Completed pre-run [2019-01-02 00:19:28,661 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-02 00:19:28,799 INFO L195 MainTranslator]: Completed translation [2019-01-02 00:19:28,800 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:19:28 WrapperNode [2019-01-02 00:19:28,800 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-02 00:19:28,801 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-02 00:19:28,801 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-02 00:19:28,802 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-02 00:19:28,812 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:19:28" (1/1) ... [2019-01-02 00:19:28,833 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:19:28" (1/1) ... [2019-01-02 00:19:28,858 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-02 00:19:28,858 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-02 00:19:28,858 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-02 00:19:28,858 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-02 00:19:28,867 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:19:28" (1/1) ... [2019-01-02 00:19:28,868 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:19:28" (1/1) ... [2019-01-02 00:19:28,871 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:19:28" (1/1) ... [2019-01-02 00:19:28,872 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:19:28" (1/1) ... [2019-01-02 00:19:28,883 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:19:28" (1/1) ... [2019-01-02 00:19:28,890 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:19:28" (1/1) ... [2019-01-02 00:19:28,892 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:19:28" (1/1) ... [2019-01-02 00:19:28,894 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-02 00:19:28,895 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-02 00:19:28,895 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-02 00:19:28,895 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-02 00:19:28,896 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:19:28" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:19:28,955 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-02 00:19:28,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-02 00:19:28,956 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-02 00:19:28,956 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-02 00:19:28,956 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-02 00:19:28,956 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-02 00:19:29,424 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-02 00:19:29,424 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2019-01-02 00:19:29,425 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.01 12:19:29 BoogieIcfgContainer [2019-01-02 00:19:29,425 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-02 00:19:29,426 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-02 00:19:29,426 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-02 00:19:29,430 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-02 00:19:29,431 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-02 00:19:29,431 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 02.01 12:19:28" (1/3) ... [2019-01-02 00:19:29,432 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@19e52f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.01 12:19:29, skipping insertion in model container [2019-01-02 00:19:29,432 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-02 00:19:29,432 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:19:28" (2/3) ... [2019-01-02 00:19:29,433 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@19e52f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.01 12:19:29, skipping insertion in model container [2019-01-02 00:19:29,433 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-02 00:19:29,433 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.01 12:19:29" (3/3) ... [2019-01-02 00:19:29,435 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrspn-alloca_true-valid-memsafety_true-termination.i [2019-01-02 00:19:29,495 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-02 00:19:29,496 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-02 00:19:29,496 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-02 00:19:29,496 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-02 00:19:29,497 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-02 00:19:29,497 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-02 00:19:29,497 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-02 00:19:29,497 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-02 00:19:29,497 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-02 00:19:29,517 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-01-02 00:19:29,539 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-01-02 00:19:29,540 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:19:29,540 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:19:29,547 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-02 00:19:29,548 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-02 00:19:29,548 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-02 00:19:29,548 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-01-02 00:19:29,550 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-01-02 00:19:29,550 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:19:29,550 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:19:29,551 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-02 00:19:29,551 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-02 00:19:29,560 INFO L794 eck$LassoCheckResult]: Stem: 14#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10#L-1true havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 3#L558true assume !(main_~length1~0 < 1); 6#L558-2true assume !(main_~length2~0 < 1); 19#L561-1true call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);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~mem4, cstrspn_#t~post8.base, cstrspn_#t~post8.offset, cstrspn_#t~mem5, cstrspn_#t~mem6, cstrspn_#t~short7, cstrspn_#t~mem9, cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, 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; 15#L545-4true [2019-01-02 00:19:29,561 INFO L796 eck$LassoCheckResult]: Loop: 15#L545-4true call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 8#L545-1true assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 9#L548-5true assume !true; 12#L548-6true call cstrspn_#t~mem9 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); 18#L550true assume !(cstrspn_#t~mem9 != cstrspn_~c~0);havoc cstrspn_#t~mem9; 13#L545-3true cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post2.base, 1 + cstrspn_#t~post2.offset;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset; 15#L545-4true [2019-01-02 00:19:29,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:19:29,570 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2019-01-02 00:19:29,572 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:19:29,574 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:19:29,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:19:29,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:19:29,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:19:29,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:19:29,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:19:29,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:19:29,749 INFO L82 PathProgramCache]: Analyzing trace with hash 1454917130, now seen corresponding path program 1 times [2019-01-02 00:19:29,749 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:19:29,749 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:19:29,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:19:29,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:19:29,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:19:29,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:19:29,784 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-02 00:19:29,786 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-02 00:19:29,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-02 00:19:29,791 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-02 00:19:29,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-02 00:19:29,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-02 00:19:29,812 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2019-01-02 00:19:29,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:19:29,822 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2019-01-02 00:19:29,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-02 00:19:29,824 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 23 transitions. [2019-01-02 00:19:29,826 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-01-02 00:19:29,830 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 13 states and 17 transitions. [2019-01-02 00:19:29,832 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-01-02 00:19:29,832 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-01-02 00:19:29,833 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 17 transitions. [2019-01-02 00:19:29,833 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:19:29,833 INFO L705 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2019-01-02 00:19:29,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 17 transitions. [2019-01-02 00:19:29,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-01-02 00:19:29,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-02 00:19:29,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2019-01-02 00:19:29,866 INFO L728 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2019-01-02 00:19:29,866 INFO L608 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2019-01-02 00:19:29,866 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-02 00:19:29,866 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2019-01-02 00:19:29,867 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-01-02 00:19:29,867 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:19:29,867 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:19:29,868 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-02 00:19:29,868 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:19:29,869 INFO L794 eck$LassoCheckResult]: Stem: 56#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 52#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 44#L558 assume !(main_~length1~0 < 1); 45#L558-2 assume !(main_~length2~0 < 1); 48#L561-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);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~mem4, cstrspn_#t~post8.base, cstrspn_#t~post8.offset, cstrspn_#t~mem5, cstrspn_#t~mem6, cstrspn_#t~short7, cstrspn_#t~mem9, cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, 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; 55#L545-4 [2019-01-02 00:19:29,869 INFO L796 eck$LassoCheckResult]: Loop: 55#L545-4 call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 51#L545-1 assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 50#L548-5 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 46#L548-1 assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 47#L548-3 assume !cstrspn_#t~short7;havoc cstrspn_#t~mem5;havoc cstrspn_#t~mem6;havoc cstrspn_#t~short7; 49#L548-6 call cstrspn_#t~mem9 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); 53#L550 assume !(cstrspn_#t~mem9 != cstrspn_~c~0);havoc cstrspn_#t~mem9; 54#L545-3 cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post2.base, 1 + cstrspn_#t~post2.offset;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset; 55#L545-4 [2019-01-02 00:19:29,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:19:29,870 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 2 times [2019-01-02 00:19:29,870 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:19:29,870 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:19:29,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:19:29,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:19:29,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:19:29,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:19:29,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:19:29,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:19:29,961 INFO L82 PathProgramCache]: Analyzing trace with hash 1927396657, now seen corresponding path program 1 times [2019-01-02 00:19:29,961 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:19:29,961 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:19:29,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:19:29,962 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:19:29,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:19:29,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:19:29,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:19:29,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:19:29,997 INFO L82 PathProgramCache]: Analyzing trace with hash -102988426, now seen corresponding path program 1 times [2019-01-02 00:19:29,997 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:19:29,997 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:19:29,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:19:29,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:19:29,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:19:30,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:19:30,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:19:30,780 WARN L181 SmtUtils]: Spent 644.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2019-01-02 00:19:31,724 WARN L181 SmtUtils]: Spent 912.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2019-01-02 00:19:32,142 WARN L181 SmtUtils]: Spent 414.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 87 [2019-01-02 00:19:32,306 WARN L181 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-01-02 00:19:32,319 INFO L216 LassoAnalysis]: Preferences: [2019-01-02 00:19:32,320 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-02 00:19:32,320 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-02 00:19:32,320 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-02 00:19:32,321 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-02 00:19:32,321 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:19:32,321 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-02 00:19:32,321 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-02 00:19:32,321 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrspn-alloca_true-valid-memsafety_true-termination.i_Iteration2_Lasso [2019-01-02 00:19:32,323 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-02 00:19:32,323 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-02 00:19:32,355 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-02 00:19:32,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-02 00:19:32,372 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-02 00:19:32,375 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-02 00:19:32,379 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-02 00:19:32,392 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-02 00:19:32,397 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-02 00:19:32,402 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:19:32,409 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-02 00:19:32,415 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-02 00:19:32,417 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-02 00:19:32,421 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:19:32,424 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-02 00:19:32,427 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:19:32,431 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-02 00:19:32,844 WARN L181 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 67 [2019-01-02 00:19:33,173 WARN L181 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-01-02 00:19:33,173 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-02 00:19:33,182 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-02 00:19:33,185 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-02 00:19:34,156 WARN L181 SmtUtils]: Spent 608.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 40 [2019-01-02 00:19:34,532 WARN L181 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 29 [2019-01-02 00:19:34,549 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-02 00:19:34,555 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-02 00:19:34,558 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-02 00:19:34,560 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:34,561 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:19:34,562 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:34,563 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:34,563 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:34,565 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:19:34,566 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:19:34,568 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:34,569 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-02 00:19:34,569 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:34,570 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:34,570 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:34,570 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:34,573 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:19:34,573 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:19:34,576 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:34,577 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-02 00:19:34,577 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:34,577 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:19:34,578 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:34,578 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:34,578 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:34,578 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:19:34,578 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:19:34,579 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:34,580 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-02 00:19:34,580 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:34,580 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:19:34,581 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:34,581 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:34,581 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:34,581 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:19:34,581 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:19:34,582 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:34,582 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-02 00:19:34,583 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:34,583 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:19:34,583 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:34,583 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:34,584 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:34,584 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:19:34,584 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:19:34,585 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:34,585 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-02 00:19:34,586 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:34,590 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:19:34,591 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:34,591 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:34,591 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:34,592 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:19:34,593 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:19:34,593 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:34,598 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-02 00:19:34,598 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:34,598 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:19:34,598 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:34,599 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:34,599 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:34,599 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:19:34,599 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:19:34,605 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:34,605 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:19:34,607 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:34,608 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:19:34,608 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:34,608 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:34,608 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:34,611 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:19:34,611 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:19:34,615 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:34,616 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-02 00:19:34,616 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:34,618 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:34,618 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:34,618 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:34,623 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:19:34,623 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:19:34,630 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:34,631 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-02 00:19:34,631 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:34,631 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:19:34,631 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:34,632 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:34,632 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:34,632 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:19:34,632 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:19:34,637 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:34,640 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:19:34,641 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:34,641 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:19:34,641 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:34,641 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:34,641 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:34,642 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:19:34,642 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:19:34,642 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:34,649 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:19:34,649 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:34,649 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:19:34,650 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:34,650 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:34,650 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:34,650 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:19:34,650 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:19:34,656 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:34,656 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-02 00:19:34,656 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:34,657 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:19:34,657 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:34,657 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:34,657 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:34,657 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:19:34,662 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:19:34,663 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:34,663 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-02 00:19:34,664 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:34,664 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:19:34,664 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:34,664 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:34,664 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:34,666 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:19:34,666 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:19:34,667 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:34,668 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:19:34,669 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:34,669 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:34,669 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:34,669 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:34,671 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:19:34,674 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:19:34,678 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:34,679 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-02 00:19:34,681 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:34,681 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2019-01-02 00:19:34,681 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:34,682 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:34,703 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-02 00:19:34,704 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:19:34,786 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:34,786 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-02 00:19:34,789 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:34,789 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:34,789 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:34,790 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:34,792 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:19:34,792 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:19:34,807 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:34,807 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-02 00:19:34,809 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:34,809 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:19:34,809 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:34,809 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:34,809 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:34,811 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:19:34,812 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:19:34,814 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:34,814 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:19:34,818 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:34,819 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:34,819 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:34,819 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:34,820 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:19:34,820 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:19:34,824 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:34,824 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-02 00:19:34,827 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:34,827 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:34,827 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:34,828 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:34,832 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:19:34,832 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:19:34,851 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:34,853 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-02 00:19:34,854 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:34,854 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:34,854 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:34,854 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:34,857 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:19:34,857 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:19:34,897 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-02 00:19:34,950 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-01-02 00:19:34,950 INFO L444 ModelExtractionUtils]: 23 out of 28 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-01-02 00:19:34,954 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-02 00:19:34,957 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-02 00:19:34,957 INFO L518 LassoAnalysis]: Proved termination. [2019-01-02 00:19:34,958 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrspn_~sc1~0.offset, v_rep(select #length ULTIMATE.start_cstrspn_~sc1~0.base)_1) = -1*ULTIMATE.start_cstrspn_~sc1~0.offset + 1*v_rep(select #length ULTIMATE.start_cstrspn_~sc1~0.base)_1 Supporting invariants [] [2019-01-02 00:19:35,104 INFO L297 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2019-01-02 00:19:35,111 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-02 00:19:35,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:19:35,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:19:35,175 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:19:35,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:19:35,210 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:19:35,356 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-02 00:19:35,359 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-02 00:19:35,360 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-01-02 00:19:35,423 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-02 00:19:35,425 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-02 00:19:35,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-02 00:19:35,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2019-01-02 00:19:35,428 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 8 letters. [2019-01-02 00:19:35,429 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:19:35,429 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 13 letters. Loop has 8 letters. [2019-01-02 00:19:35,430 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:19:35,430 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 16 letters. [2019-01-02 00:19:35,430 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:19:35,431 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 28 transitions. [2019-01-02 00:19:35,432 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-02 00:19:35,433 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 18 states and 25 transitions. [2019-01-02 00:19:35,433 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-01-02 00:19:35,433 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-01-02 00:19:35,433 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 25 transitions. [2019-01-02 00:19:35,434 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-02 00:19:35,434 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-01-02 00:19:35,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 25 transitions. [2019-01-02 00:19:35,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-01-02 00:19:35,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-02 00:19:35,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2019-01-02 00:19:35,436 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-01-02 00:19:35,436 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-01-02 00:19:35,437 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-02 00:19:35,437 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 25 transitions. [2019-01-02 00:19:35,438 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-02 00:19:35,438 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:19:35,438 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:19:35,438 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:19:35,438 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-02 00:19:35,438 INFO L794 eck$LassoCheckResult]: Stem: 189#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 185#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 173#L558 assume !(main_~length1~0 < 1); 174#L558-2 assume !(main_~length2~0 < 1); 179#L561-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);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~mem4, cstrspn_#t~post8.base, cstrspn_#t~post8.offset, cstrspn_#t~mem5, cstrspn_#t~mem6, cstrspn_#t~short7, cstrspn_#t~mem9, cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, 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; 190#L545-4 call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 183#L545-1 assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 180#L548-5 [2019-01-02 00:19:35,439 INFO L796 eck$LassoCheckResult]: Loop: 180#L548-5 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 175#L548-1 assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 176#L548-3 assume !!cstrspn_#t~short7;havoc cstrspn_#t~mem5;havoc cstrspn_#t~mem6;havoc cstrspn_#t~short7;cstrspn_#t~post8.base, cstrspn_#t~post8.offset := cstrspn_~s~0.base, cstrspn_~s~0.offset;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_#t~post8.base, 1 + cstrspn_#t~post8.offset;havoc cstrspn_#t~post8.base, cstrspn_#t~post8.offset; 180#L548-5 [2019-01-02 00:19:35,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:19:35,439 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935595, now seen corresponding path program 1 times [2019-01-02 00:19:35,439 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:19:35,439 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:19:35,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:19:35,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:19:35,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:19:35,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:19:35,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:19:35,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:19:35,478 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 1 times [2019-01-02 00:19:35,478 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:19:35,478 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:19:35,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:19:35,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:19:35,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:19:35,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:19:35,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:19:35,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:19:35,491 INFO L82 PathProgramCache]: Analyzing trace with hash 1593218778, now seen corresponding path program 1 times [2019-01-02 00:19:35,491 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:19:35,491 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:19:35,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:19:35,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:19:35,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:19:35,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:19:35,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:19:35,673 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 38 [2019-01-02 00:19:35,820 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2019-01-02 00:19:36,179 WARN L181 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 100 [2019-01-02 00:19:36,341 WARN L181 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2019-01-02 00:19:36,352 INFO L216 LassoAnalysis]: Preferences: [2019-01-02 00:19:36,352 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-02 00:19:36,353 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-02 00:19:36,353 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-02 00:19:36,353 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-02 00:19:36,353 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:19:36,353 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-02 00:19:36,353 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-02 00:19:36,353 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrspn-alloca_true-valid-memsafety_true-termination.i_Iteration3_Lasso [2019-01-02 00:19:36,353 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-02 00:19:36,353 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-02 00:19:36,359 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-02 00:19:36,368 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-02 00:19:36,370 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-02 00:19:36,372 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-02 00:19:36,374 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-02 00:19:36,376 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-02 00:19:36,378 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-02 00:19:36,383 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-02 00:19:36,387 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-02 00:19:36,389 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-02 00:19:36,390 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-02 00:19:36,392 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-02 00:19:36,394 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-02 00:19:36,395 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-02 00:19:36,397 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-02 00:19:36,781 WARN L181 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 78 [2019-01-02 00:19:37,068 WARN L181 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-01-02 00:19:37,068 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:19:37,070 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:19:37,072 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:19:38,091 WARN L181 SmtUtils]: Spent 504.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-01-02 00:19:38,336 WARN L181 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2019-01-02 00:19:38,533 WARN L181 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-01-02 00:19:38,566 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-02 00:19:38,567 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-02 00:19:38,567 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-02 00:19:38,568 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:38,568 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:19:38,568 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:38,568 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:38,568 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:38,571 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:19:38,572 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:19:38,572 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:38,573 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-02 00:19:38,575 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:38,575 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:19:38,576 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:38,576 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:38,576 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:38,576 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:19:38,576 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:19:38,578 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:38,579 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-02 00:19:38,579 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:38,579 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:19:38,579 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:38,579 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:38,579 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:38,582 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:19:38,582 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:19:38,583 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:38,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-02 00:19:38,583 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:38,586 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:38,586 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:38,586 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:38,587 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:19:38,587 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:19:38,590 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:38,591 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:19:38,592 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:38,592 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:19:38,592 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:38,592 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:38,592 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:38,592 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:19:38,593 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:19:38,593 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:38,593 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:19:38,598 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:38,598 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:19:38,598 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:38,598 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:38,598 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:38,600 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:19:38,600 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:19:38,600 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:38,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-02 00:19:38,602 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:38,602 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:19:38,602 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:38,604 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:38,605 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:38,605 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:19:38,605 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:19:38,607 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:38,607 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:19:38,608 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:38,608 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:38,608 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:38,608 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:38,611 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:19:38,611 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:19:38,613 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:38,614 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-02 00:19:38,614 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:38,614 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:19:38,615 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:38,616 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:38,617 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:38,617 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:19:38,617 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:19:38,617 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:38,619 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:19:38,619 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:38,619 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:19:38,622 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:38,622 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:38,622 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:38,623 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:19:38,624 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:19:38,624 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:38,624 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:19:38,627 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:38,627 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:19:38,627 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:38,627 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:38,627 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:38,627 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:19:38,628 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:19:38,628 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:38,628 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:19:38,629 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:38,629 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:19:38,629 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:38,629 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:38,629 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:38,630 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:19:38,634 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:19:38,634 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:38,635 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-02 00:19:38,636 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:38,636 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:19:38,636 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:38,636 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:38,636 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:38,637 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:19:38,637 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:19:38,637 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:38,641 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-02 00:19:38,642 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:38,642 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:19:38,642 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:38,642 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:38,642 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:38,642 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:19:38,642 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:19:38,643 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:38,643 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:19:38,644 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:38,648 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:38,649 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:38,649 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:38,649 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:19:38,650 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:19:38,651 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:38,651 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-02 00:19:38,652 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:38,655 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:38,655 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:38,655 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:38,656 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:19:38,656 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:19:38,662 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:38,663 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-02 00:19:38,663 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:38,664 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2019-01-02 00:19:38,666 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:38,666 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:38,670 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-02 00:19:38,671 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:19:38,695 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:38,699 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:19:38,699 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:38,700 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:38,700 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:38,700 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:38,704 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:19:38,704 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:19:38,706 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:38,707 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-02 00:19:38,709 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:38,709 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:38,710 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:38,710 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:38,711 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:19:38,711 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:19:38,714 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:38,719 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-02 00:19:38,721 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:38,722 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-02 00:19:38,722 INFO L206 nArgumentSynthesizer]: 6 loop disjuncts [2019-01-02 00:19:38,722 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:38,751 INFO L402 nArgumentSynthesizer]: We have 108 Motzkin's Theorem applications. [2019-01-02 00:19:38,751 INFO L403 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2019-01-02 00:19:38,858 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:38,859 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-02 00:19:38,866 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:38,866 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:38,866 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:38,866 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:38,867 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:19:38,867 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:19:38,873 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:38,874 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:19:38,874 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:38,875 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:38,875 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:38,875 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:38,883 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:19:38,883 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:19:38,909 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-02 00:19:38,954 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-01-02 00:19:38,954 INFO L444 ModelExtractionUtils]: 37 out of 46 variables were initially zero. Simplification set additionally 6 variables to zero. [2019-01-02 00:19:38,955 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-02 00:19:38,957 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-02 00:19:38,957 INFO L518 LassoAnalysis]: Proved termination. [2019-01-02 00:19:38,957 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrspn_~s~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_2) = -1*ULTIMATE.start_cstrspn_~s~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_2 Supporting invariants [] [2019-01-02 00:19:39,341 INFO L297 tatePredicateManager]: 14 out of 15 supporting invariants were superfluous and have been removed [2019-01-02 00:19:39,370 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-02 00:19:39,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:19:39,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:19:39,851 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:19:39,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:19:39,960 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:19:40,059 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-02 00:19:40,061 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-02 00:19:40,061 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9 Second operand 4 states. [2019-01-02 00:19:40,156 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9. Second operand 4 states. Result 43 states and 57 transitions. Complement of second has 6 states. [2019-01-02 00:19:40,157 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-02 00:19:40,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-02 00:19:40,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2019-01-02 00:19:40,158 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 7 letters. Loop has 3 letters. [2019-01-02 00:19:40,159 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:19:40,159 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 10 letters. Loop has 3 letters. [2019-01-02 00:19:40,159 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:19:40,159 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 7 letters. Loop has 6 letters. [2019-01-02 00:19:40,159 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:19:40,159 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 57 transitions. [2019-01-02 00:19:40,162 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-02 00:19:40,163 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 30 states and 40 transitions. [2019-01-02 00:19:40,163 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-01-02 00:19:40,163 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-01-02 00:19:40,163 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 40 transitions. [2019-01-02 00:19:40,164 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-02 00:19:40,164 INFO L705 BuchiCegarLoop]: Abstraction has 30 states and 40 transitions. [2019-01-02 00:19:40,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 40 transitions. [2019-01-02 00:19:40,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2019-01-02 00:19:40,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-01-02 00:19:40,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2019-01-02 00:19:40,167 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2019-01-02 00:19:40,167 INFO L608 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2019-01-02 00:19:40,167 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-02 00:19:40,167 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 33 transitions. [2019-01-02 00:19:40,170 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-02 00:19:40,170 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:19:40,170 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:19:40,170 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:19:40,172 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-02 00:19:40,172 INFO L794 eck$LassoCheckResult]: Stem: 370#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 366#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 353#L558 assume !(main_~length1~0 < 1); 354#L558-2 assume !(main_~length2~0 < 1); 359#L561-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);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~mem4, cstrspn_#t~post8.base, cstrspn_#t~post8.offset, cstrspn_#t~mem5, cstrspn_#t~mem6, cstrspn_#t~short7, cstrspn_#t~mem9, cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, 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; 371#L545-4 call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 372#L545-1 assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 374#L548-5 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 375#L548-1 assume !cstrspn_#t~short7; 361#L548-3 assume !cstrspn_#t~short7;havoc cstrspn_#t~mem5;havoc cstrspn_#t~mem6;havoc cstrspn_#t~short7; 362#L548-6 call cstrspn_#t~mem9 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); 367#L550 assume !(cstrspn_#t~mem9 != cstrspn_~c~0);havoc cstrspn_#t~mem9; 368#L545-3 cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post2.base, 1 + cstrspn_#t~post2.offset;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset; 369#L545-4 call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 363#L545-1 assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 360#L548-5 [2019-01-02 00:19:40,172 INFO L796 eck$LassoCheckResult]: Loop: 360#L548-5 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 355#L548-1 assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 356#L548-3 assume !!cstrspn_#t~short7;havoc cstrspn_#t~mem5;havoc cstrspn_#t~mem6;havoc cstrspn_#t~short7;cstrspn_#t~post8.base, cstrspn_#t~post8.offset := cstrspn_~s~0.base, cstrspn_~s~0.offset;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_#t~post8.base, 1 + cstrspn_#t~post8.offset;havoc cstrspn_#t~post8.base, cstrspn_#t~post8.offset; 360#L548-5 [2019-01-02 00:19:40,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:19:40,172 INFO L82 PathProgramCache]: Analyzing trace with hash 1587378397, now seen corresponding path program 1 times [2019-01-02 00:19:40,172 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:19:40,172 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:19:40,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:19:40,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:19:40,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:19:40,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:19:40,674 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-02 00:19:40,675 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-02 00:19:40,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-02 00:19:40,675 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-02 00:19:40,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:19:40,675 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 2 times [2019-01-02 00:19:40,675 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:19:40,676 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:19:40,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:19:40,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:19:40,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:19:40,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:19:40,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:19:41,041 WARN L181 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 38 [2019-01-02 00:19:41,358 WARN L181 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2019-01-02 00:19:41,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-02 00:19:41,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-02 00:19:41,360 INFO L87 Difference]: Start difference. First operand 24 states and 33 transitions. cyclomatic complexity: 12 Second operand 7 states. [2019-01-02 00:19:41,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:19:41,460 INFO L93 Difference]: Finished difference Result 30 states and 39 transitions. [2019-01-02 00:19:41,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-02 00:19:41,461 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 39 transitions. [2019-01-02 00:19:41,462 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-02 00:19:41,463 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 27 states and 35 transitions. [2019-01-02 00:19:41,463 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-01-02 00:19:41,463 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-01-02 00:19:41,463 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 35 transitions. [2019-01-02 00:19:41,464 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-02 00:19:41,464 INFO L705 BuchiCegarLoop]: Abstraction has 27 states and 35 transitions. [2019-01-02 00:19:41,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 35 transitions. [2019-01-02 00:19:41,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2019-01-02 00:19:41,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-01-02 00:19:41,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2019-01-02 00:19:41,469 INFO L728 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2019-01-02 00:19:41,469 INFO L608 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2019-01-02 00:19:41,469 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-02 00:19:41,469 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 33 transitions. [2019-01-02 00:19:41,472 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-02 00:19:41,472 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:19:41,472 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:19:41,473 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:19:41,474 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-02 00:19:41,474 INFO L794 eck$LassoCheckResult]: Stem: 444#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 439#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 425#L558 assume !(main_~length1~0 < 1); 426#L558-2 assume !(main_~length2~0 < 1); 431#L561-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);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~mem4, cstrspn_#t~post8.base, cstrspn_#t~post8.offset, cstrspn_#t~mem5, cstrspn_#t~mem6, cstrspn_#t~short7, cstrspn_#t~mem9, cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, 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; 445#L545-4 call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 446#L545-1 assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 437#L548-5 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 438#L548-1 assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 447#L548-3 assume !cstrspn_#t~short7;havoc cstrspn_#t~mem5;havoc cstrspn_#t~mem6;havoc cstrspn_#t~short7; 440#L548-6 call cstrspn_#t~mem9 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); 441#L550 assume !(cstrspn_#t~mem9 != cstrspn_~c~0);havoc cstrspn_#t~mem9; 442#L545-3 cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post2.base, 1 + cstrspn_#t~post2.offset;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset; 443#L545-4 call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 435#L545-1 assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 432#L548-5 [2019-01-02 00:19:41,474 INFO L796 eck$LassoCheckResult]: Loop: 432#L548-5 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 427#L548-1 assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 428#L548-3 assume !!cstrspn_#t~short7;havoc cstrspn_#t~mem5;havoc cstrspn_#t~mem6;havoc cstrspn_#t~short7;cstrspn_#t~post8.base, cstrspn_#t~post8.offset := cstrspn_~s~0.base, cstrspn_~s~0.offset;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_#t~post8.base, 1 + cstrspn_#t~post8.offset;havoc cstrspn_#t~post8.base, cstrspn_#t~post8.offset; 432#L548-5 [2019-01-02 00:19:41,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:19:41,474 INFO L82 PathProgramCache]: Analyzing trace with hash -187628965, now seen corresponding path program 2 times [2019-01-02 00:19:41,474 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:19:41,474 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:19:41,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:19:41,475 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:19:41,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:19:41,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:19:41,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:19:41,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:19:41,501 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 3 times [2019-01-02 00:19:41,501 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:19:41,502 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:19:41,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:19:41,502 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:19:41,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:19:41,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:19:41,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:19:41,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:19:41,512 INFO L82 PathProgramCache]: Analyzing trace with hash -1902015318, now seen corresponding path program 1 times [2019-01-02 00:19:41,512 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:19:41,512 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:19:41,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:19:41,513 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:19:41,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:19:41,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:19:41,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:19:41,687 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 38 [2019-01-02 00:19:41,801 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2019-01-02 00:19:42,543 WARN L181 SmtUtils]: Spent 735.00 ms on a formula simplification. DAG size of input: 175 DAG size of output: 138 [2019-01-02 00:19:43,770 WARN L181 SmtUtils]: Spent 1.20 s on a formula simplification. DAG size of input: 110 DAG size of output: 110 [2019-01-02 00:19:43,773 INFO L216 LassoAnalysis]: Preferences: [2019-01-02 00:19:43,773 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-02 00:19:43,774 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-02 00:19:43,774 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-02 00:19:43,774 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-02 00:19:43,774 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:19:43,774 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-02 00:19:43,774 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-02 00:19:43,775 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrspn-alloca_true-valid-memsafety_true-termination.i_Iteration5_Lasso [2019-01-02 00:19:43,775 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-02 00:19:43,775 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-02 00:19:43,783 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-02 00:19:43,796 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-02 00:19:43,798 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-02 00:19:43,801 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-02 00:19:43,804 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-02 00:19:43,806 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-02 00:19:43,808 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-02 00:19:43,818 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-02 00:19:43,821 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-02 00:19:43,823 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-02 00:19:43,826 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-02 00:19:44,055 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-01-02 00:19:45,049 WARN L181 SmtUtils]: Spent 990.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 99 [2019-01-02 00:19:45,302 WARN L181 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 58 [2019-01-02 00:19:45,302 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:19:45,305 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:19:45,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-02 00:19:45,308 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:19:45,310 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-02 00:19:45,313 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:19:45,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-02 00:19:45,557 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2019-01-02 00:19:45,759 WARN L181 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2019-01-02 00:19:46,384 WARN L181 SmtUtils]: Spent 458.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-01-02 00:19:46,764 WARN L181 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 39 [2019-01-02 00:19:46,991 WARN L181 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2019-01-02 00:19:47,156 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-02 00:19:47,156 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-02 00:19:47,157 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-02 00:19:47,157 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:47,157 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:19:47,158 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:47,161 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:47,161 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:47,161 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:19:47,161 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:19:47,162 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:47,162 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:19:47,166 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:47,166 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:47,166 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:47,166 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:47,167 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:19:47,167 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:19:47,170 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:47,171 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-02 00:19:47,171 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:47,171 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:19:47,172 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:47,172 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:47,172 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:47,172 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:19:47,172 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:19:47,177 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:47,177 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-02 00:19:47,178 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:47,178 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:19:47,178 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:47,178 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:47,178 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:47,179 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:19:47,179 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:19:47,179 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:47,180 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-02 00:19:47,183 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:47,184 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:19:47,184 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:47,184 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:47,184 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:47,184 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:19:47,184 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:19:47,185 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:47,185 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-02 00:19:47,185 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:47,185 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:19:47,185 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:47,191 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:47,191 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:47,192 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:19:47,192 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:19:47,192 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:47,193 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-02 00:19:47,193 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:47,193 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:19:47,193 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:47,193 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:47,193 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:47,194 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:19:47,194 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:19:47,194 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:47,194 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-02 00:19:47,195 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:47,199 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:47,199 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:47,199 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:47,200 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:19:47,200 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:19:47,201 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:47,201 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-02 00:19:47,202 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:47,202 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:19:47,202 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:47,202 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:47,202 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:47,202 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:19:47,202 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:19:47,203 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:47,203 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-02 00:19:47,203 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:47,203 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:19:47,203 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:47,204 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:47,208 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:47,208 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:19:47,208 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:19:47,209 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:47,209 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-02 00:19:47,210 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:47,210 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2019-01-02 00:19:47,210 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:47,210 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:47,220 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-02 00:19:47,220 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:19:47,242 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:47,243 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-02 00:19:47,243 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:47,243 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2019-01-02 00:19:47,243 INFO L206 nArgumentSynthesizer]: 6 loop disjuncts [2019-01-02 00:19:47,243 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:47,269 INFO L402 nArgumentSynthesizer]: We have 132 Motzkin's Theorem applications. [2019-01-02 00:19:47,269 INFO L403 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2019-01-02 00:19:47,384 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:19:47,385 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-02 00:19:47,386 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:19:47,386 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:19:47,386 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:19:47,386 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:19:47,392 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:19:47,393 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:19:47,414 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-02 00:19:47,453 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-01-02 00:19:47,453 INFO L444 ModelExtractionUtils]: 47 out of 52 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-01-02 00:19:47,453 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-02 00:19:47,456 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-02 00:19:47,456 INFO L518 LassoAnalysis]: Proved termination. [2019-01-02 00:19:47,457 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_3, ULTIMATE.start_cstrspn_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_3 - 1*ULTIMATE.start_cstrspn_~s~0.offset Supporting invariants [] [2019-01-02 00:19:47,776 INFO L297 tatePredicateManager]: 27 out of 28 supporting invariants were superfluous and have been removed [2019-01-02 00:19:47,781 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-02 00:19:47,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:19:47,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:19:47,837 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:19:47,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:19:47,855 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:19:47,877 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-02 00:19:47,878 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-02 00:19:47,878 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11 Second operand 4 states. [2019-01-02 00:19:47,932 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-02 00:19:47,935 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-02 00:19:47,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-02 00:19:47,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2019-01-02 00:19:47,936 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2019-01-02 00:19:47,936 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:19:47,936 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-02 00:19:47,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:19:48,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:19:48,007 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:19:48,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:19:48,048 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:19:48,060 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-02 00:19:48,061 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-02 00:19:48,061 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11 Second operand 4 states. [2019-01-02 00:19:48,116 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-02 00:19:48,120 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-02 00:19:48,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-02 00:19:48,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2019-01-02 00:19:48,121 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2019-01-02 00:19:48,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:19:48,122 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-02 00:19:48,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:19:48,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:19:48,171 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:19:48,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:19:48,190 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:19:48,203 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-02 00:19:48,204 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-02 00:19:48,204 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11 Second operand 4 states. [2019-01-02 00:19:48,269 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-02 00:19:48,270 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-02 00:19:48,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-02 00:19:48,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2019-01-02 00:19:48,271 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 15 letters. Loop has 3 letters. [2019-01-02 00:19:48,272 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:19:48,272 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 18 letters. Loop has 3 letters. [2019-01-02 00:19:48,272 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:19:48,272 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 15 letters. Loop has 6 letters. [2019-01-02 00:19:48,273 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:19:48,273 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 53 transitions. [2019-01-02 00:19:48,275 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-02 00:19:48,276 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 0 states and 0 transitions. [2019-01-02 00:19:48,276 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-02 00:19:48,276 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-02 00:19:48,276 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-02 00:19:48,276 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:19:48,276 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-02 00:19:48,276 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-02 00:19:48,276 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-02 00:19:48,276 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-02 00:19:48,276 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-02 00:19:48,277 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-02 00:19:48,277 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-02 00:19:48,284 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 02.01 12:19:48 BoogieIcfgContainer [2019-01-02 00:19:48,284 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-02 00:19:48,284 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-02 00:19:48,284 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-02 00:19:48,285 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-02 00:19:48,285 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.01 12:19:29" (3/4) ... [2019-01-02 00:19:48,289 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-02 00:19:48,289 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-02 00:19:48,290 INFO L168 Benchmark]: Toolchain (without parser) took 20209.25 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 362.3 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -131.5 MB). Peak memory consumption was 230.8 MB. Max. memory is 11.5 GB. [2019-01-02 00:19:48,292 INFO L168 Benchmark]: CDTParser took 0.15 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-02 00:19:48,292 INFO L168 Benchmark]: CACSL2BoogieTranslator took 717.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -175.9 MB). Peak memory consumption was 31.9 MB. Max. memory is 11.5 GB. [2019-01-02 00:19:48,293 INFO L168 Benchmark]: Boogie Procedure Inliner took 56.50 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-01-02 00:19:48,294 INFO L168 Benchmark]: Boogie Preprocessor took 36.60 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-02 00:19:48,295 INFO L168 Benchmark]: RCFGBuilder took 530.07 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 11.5 GB. [2019-01-02 00:19:48,296 INFO L168 Benchmark]: BuchiAutomizer took 18858.38 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 234.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.4 MB). Peak memory consumption was 247.8 MB. Max. memory is 11.5 GB. [2019-01-02 00:19:48,296 INFO L168 Benchmark]: Witness Printer took 4.70 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-02 00:19:48,302 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.15 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 717.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -175.9 MB). Peak memory consumption was 31.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 56.50 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 36.60 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 530.07 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 18858.38 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 234.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.4 MB). Peak memory consumption was 247.8 MB. Max. memory is 11.5 GB. * Witness Printer took 4.70 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[sc1] and consists of 3 locations. One deterministic module has affine ranking function -1 * s + unknown-#length-unknown[__builtin_alloca (length2 * sizeof(char))] and consists of 4 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (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.8s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 16.9s. Construction of modules took 0.2s. Büchi inclusion checks took 1.5s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 8 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 25 states and ocurred in iteration 4. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 105 SDtfs, 139 SDslu, 72 SDs, 0 SdLazy, 102 SolverSat, 23 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital375 mio100 ax100 hnf99 lsp91 ukn72 mio100 lsp31 div131 bol100 ite100 ukn100 eq165 hnf81 smp92 dnf666 smp43 tf100 neg96 sie110 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 141ms 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...