./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-memory-alloca/cstrspn-alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/termination-memory-alloca/cstrspn-alloca_true-termination.c.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 5bb7c0b0be083ae28de17688b83fb766e3f101f5 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 21:49:27,185 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 21:49:27,186 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 21:49:27,204 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 21:49:27,204 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 21:49:27,206 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 21:49:27,207 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 21:49:27,210 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 21:49:27,213 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 21:49:27,214 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 21:49:27,216 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 21:49:27,216 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 21:49:27,217 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 21:49:27,219 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 21:49:27,227 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 21:49:27,228 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 21:49:27,228 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 21:49:27,230 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 21:49:27,232 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 21:49:27,233 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 21:49:27,234 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 21:49:27,236 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 21:49:27,238 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 21:49:27,238 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 21:49:27,238 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 21:49:27,239 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 21:49:27,240 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 21:49:27,241 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 21:49:27,242 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 21:49:27,243 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 21:49:27,243 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 21:49:27,244 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 21:49:27,244 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 21:49:27,244 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 21:49:27,245 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 21:49:27,246 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 21:49:27,247 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-01 21:49:27,278 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 21:49:27,279 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 21:49:27,280 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 21:49:27,281 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 21:49:27,281 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 21:49:27,281 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 21:49:27,281 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 21:49:27,281 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 21:49:27,281 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 21:49:27,283 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 21:49:27,283 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 21:49:27,283 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 21:49:27,283 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 21:49:27,283 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 21:49:27,283 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 21:49:27,284 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 21:49:27,284 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 21:49:27,284 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 21:49:27,284 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 21:49:27,284 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 21:49:27,284 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 21:49:27,285 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 21:49:27,289 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 21:49:27,289 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 21:49:27,289 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 21:49:27,289 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 21:49:27,290 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 21:49:27,290 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 21:49:27,291 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 21:49:27,291 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5bb7c0b0be083ae28de17688b83fb766e3f101f5 [2019-01-01 21:49:27,325 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 21:49:27,340 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 21:49:27,348 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 21:49:27,351 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 21:49:27,352 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 21:49:27,353 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-memory-alloca/cstrspn-alloca_true-termination.c.i [2019-01-01 21:49:27,412 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/501ee7215/d6dacc9bcf2c49a2aebf1e4e81d24600/FLAGfdccecbf1 [2019-01-01 21:49:27,919 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 21:49:27,920 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-memory-alloca/cstrspn-alloca_true-termination.c.i [2019-01-01 21:49:27,939 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/501ee7215/d6dacc9bcf2c49a2aebf1e4e81d24600/FLAGfdccecbf1 [2019-01-01 21:49:28,211 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/501ee7215/d6dacc9bcf2c49a2aebf1e4e81d24600 [2019-01-01 21:49:28,214 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 21:49:28,216 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 21:49:28,216 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 21:49:28,217 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 21:49:28,220 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 21:49:28,221 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:49:28" (1/1) ... [2019-01-01 21:49:28,224 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53c28cb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:49:28, skipping insertion in model container [2019-01-01 21:49:28,225 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:49:28" (1/1) ... [2019-01-01 21:49:28,233 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 21:49:28,283 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 21:49:28,661 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:49:28,675 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 21:49:28,805 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:49:28,862 INFO L195 MainTranslator]: Completed translation [2019-01-01 21:49:28,862 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:49:28 WrapperNode [2019-01-01 21:49:28,862 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 21:49:28,864 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 21:49:28,864 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 21:49:28,864 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 21:49:28,874 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:49:28" (1/1) ... [2019-01-01 21:49:28,893 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:49:28" (1/1) ... [2019-01-01 21:49:28,919 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 21:49:28,919 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 21:49:28,919 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 21:49:28,919 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 21:49:28,930 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:49:28" (1/1) ... [2019-01-01 21:49:28,930 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:49:28" (1/1) ... [2019-01-01 21:49:28,935 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:49:28" (1/1) ... [2019-01-01 21:49:28,935 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:49:28" (1/1) ... [2019-01-01 21:49:28,945 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:49:28" (1/1) ... [2019-01-01 21:49:28,951 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:49:28" (1/1) ... [2019-01-01 21:49:28,953 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:49:28" (1/1) ... [2019-01-01 21:49:28,956 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 21:49:28,957 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 21:49:28,957 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 21:49:28,957 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 21:49:28,958 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:49: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-01 21:49:29,017 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-01 21:49:29,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-01 21:49:29,018 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 21:49:29,018 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-01 21:49:29,018 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 21:49:29,018 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 21:49:29,450 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 21:49:29,451 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2019-01-01 21:49:29,451 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:49:29 BoogieIcfgContainer [2019-01-01 21:49:29,451 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 21:49:29,453 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 21:49:29,453 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 21:49:29,458 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 21:49:29,460 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:49:29,462 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 09:49:28" (1/3) ... [2019-01-01 21:49:29,464 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@61a95b57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:49:29, skipping insertion in model container [2019-01-01 21:49:29,464 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:49:29,464 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:49:28" (2/3) ... [2019-01-01 21:49:29,465 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@61a95b57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:49:29, skipping insertion in model container [2019-01-01 21:49:29,466 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:49:29,466 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:49:29" (3/3) ... [2019-01-01 21:49:29,468 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrspn-alloca_true-termination.c.i [2019-01-01 21:49:29,529 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 21:49:29,530 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 21:49:29,530 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 21:49:29,530 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 21:49:29,530 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 21:49:29,531 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 21:49:29,531 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 21:49:29,531 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 21:49:29,531 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 21:49:29,545 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-01-01 21:49:29,566 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-01-01 21:49:29,566 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:49:29,567 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:49:29,574 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-01 21:49:29,574 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-01 21:49:29,574 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 21:49:29,575 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-01-01 21:49:29,576 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-01-01 21:49:29,577 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:49:29,577 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:49:29,578 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-01 21:49:29,578 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-01 21:49:29,588 INFO L794 eck$LassoCheckResult]: Stem: 11#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; 7#L565true assume !(main_~length1~0 < 1); 12#L565-2true assume !(main_~length2~0 < 1); 6#L568-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; 3#L552-4true [2019-01-01 21:49:29,588 INFO L796 eck$LassoCheckResult]: Loop: 3#L552-4true call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 14#L552-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; 16#L555-5true assume !true; 19#L555-6true call cstrspn_#t~mem9 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); 5#L557true assume !(cstrspn_#t~mem9 != cstrspn_~c~0);havoc cstrspn_#t~mem9; 20#L552-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; 3#L552-4true [2019-01-01 21:49:29,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:49:29,597 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2019-01-01 21:49:29,599 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:49:29,600 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:49:29,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:49:29,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:49:29,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:49:29,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:49:29,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:49:29,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:49:29,776 INFO L82 PathProgramCache]: Analyzing trace with hash 1454917130, now seen corresponding path program 1 times [2019-01-01 21:49:29,777 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:49:29,777 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:49:29,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:49:29,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:49:29,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:49:29,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:49:29,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:49:29,817 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:49:29,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 21:49:29,821 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 21:49:29,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-01 21:49:29,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-01 21:49:29,839 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2019-01-01 21:49:29,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:49:29,846 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2019-01-01 21:49:29,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-01 21:49:29,849 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 23 transitions. [2019-01-01 21:49:29,851 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-01-01 21:49:29,856 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 13 states and 17 transitions. [2019-01-01 21:49:29,857 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-01-01 21:49:29,858 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-01-01 21:49:29,858 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 17 transitions. [2019-01-01 21:49:29,859 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:49:29,859 INFO L705 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2019-01-01 21:49:29,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 17 transitions. [2019-01-01 21:49:29,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-01-01 21:49:29,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-01 21:49:29,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2019-01-01 21:49:29,888 INFO L728 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2019-01-01 21:49:29,888 INFO L608 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2019-01-01 21:49:29,889 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 21:49:29,889 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2019-01-01 21:49:29,890 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-01-01 21:49:29,890 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:49:29,890 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:49:29,891 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-01 21:49:29,891 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:49:29,892 INFO L794 eck$LassoCheckResult]: Stem: 54#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 53#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; 49#L565 assume !(main_~length1~0 < 1); 50#L565-2 assume !(main_~length2~0 < 1); 48#L568-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; 44#L552-4 [2019-01-01 21:49:29,892 INFO L796 eck$LassoCheckResult]: Loop: 44#L552-4 call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 45#L552-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; 56#L555-5 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 51#L555-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); 52#L555-3 assume !cstrspn_#t~short7;havoc cstrspn_#t~mem5;havoc cstrspn_#t~mem6;havoc cstrspn_#t~short7; 55#L555-6 call cstrspn_#t~mem9 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); 46#L557 assume !(cstrspn_#t~mem9 != cstrspn_~c~0);havoc cstrspn_#t~mem9; 47#L552-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; 44#L552-4 [2019-01-01 21:49:29,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:49:29,892 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 2 times [2019-01-01 21:49:29,892 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:49:29,895 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:49:29,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:49:29,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:49:29,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:49:29,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:49:29,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:49:29,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:49:29,941 INFO L82 PathProgramCache]: Analyzing trace with hash 1927396657, now seen corresponding path program 1 times [2019-01-01 21:49:29,941 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:49:29,941 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:49:29,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:49:29,943 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:49:29,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:49:29,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:49:29,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:49:29,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:49:29,996 INFO L82 PathProgramCache]: Analyzing trace with hash -102988426, now seen corresponding path program 1 times [2019-01-01 21:49:29,996 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:49:29,996 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:49:29,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:49:29,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:49:29,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:49:30,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:49:30,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:49:30,705 WARN L181 SmtUtils]: Spent 574.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2019-01-01 21:49:31,623 WARN L181 SmtUtils]: Spent 837.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2019-01-01 21:49:32,017 WARN L181 SmtUtils]: Spent 390.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 87 [2019-01-01 21:49:32,184 WARN L181 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-01-01 21:49:32,196 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:49:32,197 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:49:32,198 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:49:32,198 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:49:32,198 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:49:32,198 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:49:32,198 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:49:32,199 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:49:32,200 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrspn-alloca_true-termination.c.i_Iteration2_Lasso [2019-01-01 21:49:32,200 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:49:32,200 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:49:32,233 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:49:32,241 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:49:32,247 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:49:32,251 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:49:32,258 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:49:32,264 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:49:32,265 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:49:32,271 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:49:32,278 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:49:32,284 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:49:32,291 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:49:32,295 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:49:32,297 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:49:32,303 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:49:32,306 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:49:32,312 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:49:32,318 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:49:32,718 WARN L181 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 67 [2019-01-01 21:49:33,045 WARN L181 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-01-01 21:49:33,046 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:49:33,049 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:49:33,051 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:49:33,052 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:49:34,058 WARN L181 SmtUtils]: Spent 601.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 40 [2019-01-01 21:49:34,448 WARN L181 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 29 [2019-01-01 21:49:34,469 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:49:34,475 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:49:34,478 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:49:34,481 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:34,481 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:49:34,482 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:34,482 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:34,482 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:34,485 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:49:34,485 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:49:34,490 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:34,491 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:49:34,492 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:34,492 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:34,492 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:34,492 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:34,496 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:49:34,496 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:49:34,500 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:34,501 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:49:34,502 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:34,502 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:49:34,502 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:34,502 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:34,502 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:34,504 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:49:34,505 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:49:34,507 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:34,508 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:49:34,509 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:34,509 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:49:34,511 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:34,511 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:34,511 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:34,512 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:49:34,512 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:49:34,512 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:34,513 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:49:34,513 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:34,513 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:49:34,517 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:34,518 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:34,518 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:34,518 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:49:34,518 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:49:34,519 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:34,522 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:49:34,523 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:34,523 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:49:34,523 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:34,523 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:34,523 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:34,525 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:49:34,526 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:49:34,527 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:34,529 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:49:34,530 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:34,530 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:49:34,530 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:34,530 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:34,530 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:34,538 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:49:34,540 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:49:34,541 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:34,542 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:49:34,542 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:34,542 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:34,542 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:34,546 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:34,547 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:49:34,549 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:49:34,556 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:34,556 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:49:34,557 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:34,557 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:49:34,557 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:34,557 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:34,557 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:34,560 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:49:34,560 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:49:34,561 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:34,562 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:49:34,562 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:34,562 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:34,563 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:34,563 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:34,564 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:49:34,565 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:49:34,567 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:34,568 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:49:34,568 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:34,568 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:49:34,570 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:34,570 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:34,570 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:34,571 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:49:34,571 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:49:34,571 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:34,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-01 21:49:34,573 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:34,574 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:49:34,574 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:34,574 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:34,574 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:34,574 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:49:34,575 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:49:34,578 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:34,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-01 21:49:34,579 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:34,579 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:49:34,585 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:34,585 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:34,585 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:34,586 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:49:34,586 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:49:34,590 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:34,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-01 21:49:34,593 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:34,594 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:34,594 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:34,594 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:34,597 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:49:34,597 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:49:34,607 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:34,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-01 21:49:34,608 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:34,608 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:49:34,608 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:34,608 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:34,608 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:34,609 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:49:34,609 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:49:34,610 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:34,610 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:49:34,612 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:34,612 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:49:34,613 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:34,613 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:34,613 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:34,614 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:49:34,614 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:49:34,616 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:34,620 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:49:34,621 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:34,621 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:34,621 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:34,621 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:34,623 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:49:34,625 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:49:34,630 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49: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-01 21:49:34,631 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:34,632 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2019-01-01 21:49:34,632 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:34,632 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:34,647 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-01 21:49:34,648 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:49:34,698 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:34,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-01 21:49:34,700 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:34,700 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:34,700 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:34,700 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:34,704 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:49:34,704 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:49:34,712 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:34,712 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:49:34,713 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:34,713 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:49:34,713 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:34,713 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:34,713 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:34,716 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:49:34,716 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:49:34,718 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:34,718 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:49:34,720 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:34,720 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:34,720 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:34,721 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:34,722 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:49:34,723 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:49:34,726 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:34,726 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:49:34,727 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:34,727 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:34,727 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:34,727 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:34,732 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:49:34,732 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:49:34,743 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:34,746 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:49:34,746 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:34,747 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:34,747 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:34,747 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:34,752 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:49:34,752 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:49:34,798 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:49:34,825 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:49:34,827 INFO L444 ModelExtractionUtils]: 21 out of 28 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-01-01 21:49:34,830 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:49:34,831 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 21:49:34,833 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:49:34,836 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc12.base)_1, ULTIMATE.start_cstrspn_~sc1~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc12.base)_1 - 1*ULTIMATE.start_cstrspn_~sc1~0.offset Supporting invariants [] [2019-01-01 21:49:34,918 INFO L297 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2019-01-01 21:49:34,928 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-01 21:49:34,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:49:34,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:49:34,992 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:49:35,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:49:35,029 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:49:35,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:49:35,056 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-01 21:49:35,057 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-01-01 21:49:35,189 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 21 states and 28 transitions. Complement of second has 4 states. [2019-01-01 21:49:35,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:49:35,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:49:35,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2019-01-01 21:49:35,192 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 8 letters. [2019-01-01 21:49:35,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:49:35,194 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 13 letters. Loop has 8 letters. [2019-01-01 21:49:35,195 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:49:35,195 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 16 letters. [2019-01-01 21:49:35,196 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:49:35,196 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 28 transitions. [2019-01-01 21:49:35,197 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 21:49:35,199 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 18 states and 25 transitions. [2019-01-01 21:49:35,199 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-01-01 21:49:35,200 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-01-01 21:49:35,200 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 25 transitions. [2019-01-01 21:49:35,200 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:49:35,200 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-01-01 21:49:35,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 25 transitions. [2019-01-01 21:49:35,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-01-01 21:49:35,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-01 21:49:35,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2019-01-01 21:49:35,203 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-01-01 21:49:35,203 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-01-01 21:49:35,204 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 21:49:35,204 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 25 transitions. [2019-01-01 21:49:35,205 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 21:49:35,205 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:49:35,205 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:49:35,205 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:49:35,205 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 21:49:35,205 INFO L794 eck$LassoCheckResult]: Stem: 192#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 191#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; 185#L565 assume !(main_~length1~0 < 1); 186#L565-2 assume !(main_~length2~0 < 1); 184#L568-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; 178#L552-4 call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 180#L552-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; 193#L555-5 [2019-01-01 21:49:35,207 INFO L796 eck$LassoCheckResult]: Loop: 193#L555-5 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 187#L555-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); 188#L555-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; 193#L555-5 [2019-01-01 21:49:35,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:49:35,207 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935595, now seen corresponding path program 1 times [2019-01-01 21:49:35,207 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:49:35,207 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:49:35,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:49:35,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:49:35,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:49:35,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:49:35,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:49:35,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:49:35,254 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 1 times [2019-01-01 21:49:35,254 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:49:35,254 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:49:35,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:49:35,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:49:35,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:49:35,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:49:35,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:49:35,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:49:35,279 INFO L82 PathProgramCache]: Analyzing trace with hash 1593218778, now seen corresponding path program 1 times [2019-01-01 21:49:35,279 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:49:35,279 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:49:35,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:49:35,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:49:35,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:49:35,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:49:35,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:49:35,457 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 38 [2019-01-01 21:49:35,578 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2019-01-01 21:49:35,927 WARN L181 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 100 [2019-01-01 21:49:36,133 WARN L181 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2019-01-01 21:49:36,135 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:49:36,135 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:49:36,136 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:49:36,136 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:49:36,136 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:49:36,136 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:49:36,136 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:49:36,136 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:49:36,136 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrspn-alloca_true-termination.c.i_Iteration3_Lasso [2019-01-01 21:49:36,136 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:49:36,136 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:49:36,143 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:49:36,151 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:49:36,153 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:49:36,155 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:49:36,157 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:49:36,159 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:49:36,162 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:49:36,166 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:49:36,168 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:49:36,171 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:49:36,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-01 21:49:36,177 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:49:36,179 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:49:36,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-01 21:49:36,184 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:49:36,186 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:49:36,667 WARN L181 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 78 [2019-01-01 21:49:36,857 WARN L181 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-01-01 21:49:36,858 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:49:36,862 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:49:36,864 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:49:36,868 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:49:36,870 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:49:37,790 WARN L181 SmtUtils]: Spent 457.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-01-01 21:49:38,132 WARN L181 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2019-01-01 21:49:38,244 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:49:38,245 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:49:38,245 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:49:38,248 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:38,248 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:49:38,248 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:38,248 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:38,248 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:38,249 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:49:38,249 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:49:38,251 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:38,252 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:49:38,252 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:38,252 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:49:38,253 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:38,253 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:38,253 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:38,253 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:49:38,253 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:49:38,256 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:38,257 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:49:38,257 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:38,257 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:49:38,258 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:38,258 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:38,258 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:38,258 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:49:38,258 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:49:38,262 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:38,262 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:49:38,263 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:38,263 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:38,263 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:38,263 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:38,266 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:49:38,266 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:49:38,268 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:38,269 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:49:38,269 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:38,269 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:49:38,269 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:38,269 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:38,272 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:38,272 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:49:38,272 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:49:38,273 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:38,274 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:49:38,274 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:38,274 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:49:38,275 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:38,275 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:38,275 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:38,275 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:49:38,275 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:49:38,279 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:38,279 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:49:38,281 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:38,282 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:38,282 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:38,282 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:38,284 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:49:38,284 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:49:38,286 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:38,287 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:49:38,287 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:38,287 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:49:38,288 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:38,290 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:38,290 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:38,290 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:49:38,290 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:49:38,292 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:38,292 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:49:38,293 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:38,293 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:38,293 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:38,293 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:38,296 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:49:38,296 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:49:38,298 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:38,298 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:49:38,298 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:38,299 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:49:38,301 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:38,301 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:38,301 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:38,301 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:49:38,301 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:49:38,303 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:38,304 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:49:38,304 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:38,304 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:49:38,306 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:38,307 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:38,307 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:38,307 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:49:38,307 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:49:38,309 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:38,310 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:49:38,310 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:38,310 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:49:38,310 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:38,310 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:38,311 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:38,313 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:49:38,313 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:49:38,314 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:38,314 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:49:38,315 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:38,315 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:49:38,315 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:38,315 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:38,315 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:38,315 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:49:38,316 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:49:38,320 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:38,320 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:49:38,320 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:38,321 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:49:38,321 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:38,321 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:38,321 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:38,321 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:49:38,321 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:49:38,325 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:38,326 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:49:38,326 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:38,326 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:49:38,326 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:38,327 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:38,329 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:38,329 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:49:38,330 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:49:38,331 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:38,331 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:49:38,331 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:38,331 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:38,334 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:38,334 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:38,336 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:49:38,336 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:49:38,337 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:38,337 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:49:38,340 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:38,340 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:38,340 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:38,341 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:38,342 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:49:38,342 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:49:38,347 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:38,348 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:49:38,348 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:38,349 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2019-01-01 21:49:38,349 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:38,349 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:38,356 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-01 21:49:38,356 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:49:38,376 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:38,377 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:49:38,378 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:38,378 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:38,378 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:38,378 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:38,382 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:49:38,382 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:49:38,385 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:38,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-01 21:49:38,386 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:38,386 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:38,386 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:38,386 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:38,389 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:49:38,390 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:49:38,391 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:38,391 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:49:38,394 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:38,394 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-01 21:49:38,394 INFO L206 nArgumentSynthesizer]: 6 loop disjuncts [2019-01-01 21:49:38,395 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:38,417 INFO L402 nArgumentSynthesizer]: We have 108 Motzkin's Theorem applications. [2019-01-01 21:49:38,417 INFO L403 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2019-01-01 21:49:38,524 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:38,526 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:49:38,526 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:38,526 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:38,526 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:38,526 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:38,530 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:49:38,532 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:49:38,534 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:38,535 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:49:38,535 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:38,535 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:38,535 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:38,536 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:38,541 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:49:38,541 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:49:38,567 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:49:38,591 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:49:38,593 INFO L444 ModelExtractionUtils]: 39 out of 46 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-01-01 21:49:38,593 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:49:38,595 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 21:49:38,595 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:49:38,595 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_2, ULTIMATE.start_cstrspn_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_2 - 1*ULTIMATE.start_cstrspn_~s~0.offset Supporting invariants [] [2019-01-01 21:49:38,716 INFO L297 tatePredicateManager]: 14 out of 15 supporting invariants were superfluous and have been removed [2019-01-01 21:49:38,719 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-01 21:49:38,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:49:38,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:49:38,776 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:49:38,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:49:38,805 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:49:38,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:49:38,925 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2019-01-01 21:49:38,925 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9 Second operand 4 states. [2019-01-01 21:49:38,982 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-01 21:49:38,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:49:38,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 21:49:38,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2019-01-01 21:49:38,985 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 7 letters. Loop has 3 letters. [2019-01-01 21:49:38,985 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:49:38,986 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 10 letters. Loop has 3 letters. [2019-01-01 21:49:38,986 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:49:38,986 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 7 letters. Loop has 6 letters. [2019-01-01 21:49:38,986 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:49:38,986 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 57 transitions. [2019-01-01 21:49:38,989 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 21:49:38,990 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 30 states and 40 transitions. [2019-01-01 21:49:38,990 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-01-01 21:49:38,990 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-01-01 21:49:38,991 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 40 transitions. [2019-01-01 21:49:38,991 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:49:38,991 INFO L705 BuchiCegarLoop]: Abstraction has 30 states and 40 transitions. [2019-01-01 21:49:38,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 40 transitions. [2019-01-01 21:49:38,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2019-01-01 21:49:38,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-01-01 21:49:38,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2019-01-01 21:49:38,994 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2019-01-01 21:49:38,994 INFO L608 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2019-01-01 21:49:38,994 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-01 21:49:38,994 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 33 transitions. [2019-01-01 21:49:38,995 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 21:49:38,995 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:49:38,995 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:49:38,997 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:49:38,997 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 21:49:38,997 INFO L794 eck$LassoCheckResult]: Stem: 373#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 372#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; 366#L565 assume !(main_~length1~0 < 1); 367#L565-2 assume !(main_~length2~0 < 1); 365#L568-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; 358#L552-4 call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 359#L552-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; 375#L555-5 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 380#L555-1 assume !cstrspn_#t~short7; 379#L555-3 assume !cstrspn_#t~short7;havoc cstrspn_#t~mem5;havoc cstrspn_#t~mem6;havoc cstrspn_#t~short7; 378#L555-6 call cstrspn_#t~mem9 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); 363#L557 assume !(cstrspn_#t~mem9 != cstrspn_~c~0);havoc cstrspn_#t~mem9; 364#L552-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; 360#L552-4 call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 362#L552-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#L555-5 [2019-01-01 21:49:38,997 INFO L796 eck$LassoCheckResult]: Loop: 374#L555-5 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 368#L555-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); 369#L555-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; 374#L555-5 [2019-01-01 21:49:38,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:49:38,997 INFO L82 PathProgramCache]: Analyzing trace with hash 1587378397, now seen corresponding path program 1 times [2019-01-01 21:49:38,998 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:49:38,998 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:49:38,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:49:38,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:49:38,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:49:39,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:49:39,569 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:49:39,569 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:49:39,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-01 21:49:39,570 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 21:49:39,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:49:39,570 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 2 times [2019-01-01 21:49:39,570 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:49:39,570 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:49:39,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:49:39,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:49:39,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:49:39,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:49:39,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:49:39,748 WARN L181 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 38 [2019-01-01 21:49:39,881 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2019-01-01 21:49:39,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 21:49:39,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-01 21:49:39,883 INFO L87 Difference]: Start difference. First operand 24 states and 33 transitions. cyclomatic complexity: 12 Second operand 7 states. [2019-01-01 21:49:39,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:49:39,976 INFO L93 Difference]: Finished difference Result 30 states and 39 transitions. [2019-01-01 21:49:39,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-01 21:49:39,977 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 39 transitions. [2019-01-01 21:49:39,979 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-01 21:49:39,979 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 27 states and 35 transitions. [2019-01-01 21:49:39,979 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-01-01 21:49:39,980 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-01-01 21:49:39,980 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 35 transitions. [2019-01-01 21:49:39,980 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:49:39,980 INFO L705 BuchiCegarLoop]: Abstraction has 27 states and 35 transitions. [2019-01-01 21:49:39,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 35 transitions. [2019-01-01 21:49:39,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2019-01-01 21:49:39,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-01-01 21:49:39,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2019-01-01 21:49:39,985 INFO L728 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2019-01-01 21:49:39,985 INFO L608 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2019-01-01 21:49:39,985 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-01 21:49:39,985 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 33 transitions. [2019-01-01 21:49:39,986 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 21:49:39,986 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:49:39,986 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:49:39,990 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:49:39,990 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 21:49:39,990 INFO L794 eck$LassoCheckResult]: Stem: 445#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 444#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14, 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; 438#L565 assume !(main_~length1~0 < 1); 439#L565-2 assume !(main_~length2~0 < 1); 437#L568-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; 430#L552-4 call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 431#L552-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; 447#L555-5 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 448#L555-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); 450#L555-3 assume !cstrspn_#t~short7;havoc cstrspn_#t~mem5;havoc cstrspn_#t~mem6;havoc cstrspn_#t~short7; 449#L555-6 call cstrspn_#t~mem9 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); 435#L557 assume !(cstrspn_#t~mem9 != cstrspn_~c~0);havoc cstrspn_#t~mem9; 436#L552-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; 432#L552-4 call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 434#L552-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; 446#L555-5 [2019-01-01 21:49:39,990 INFO L796 eck$LassoCheckResult]: Loop: 446#L555-5 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 440#L555-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); 441#L555-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; 446#L555-5 [2019-01-01 21:49:39,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:49:39,991 INFO L82 PathProgramCache]: Analyzing trace with hash -187628965, now seen corresponding path program 2 times [2019-01-01 21:49:39,991 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:49:39,991 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:49:39,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:49:39,992 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:49:39,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:49:40,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:49:40,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:49:40,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:49:40,019 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 3 times [2019-01-01 21:49:40,019 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:49:40,019 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:49:40,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:49:40,020 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:49:40,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:49:40,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:49:40,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:49:40,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:49:40,029 INFO L82 PathProgramCache]: Analyzing trace with hash -1902015318, now seen corresponding path program 1 times [2019-01-01 21:49:40,029 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:49:40,030 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:49:40,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:49:40,032 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:49:40,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:49:40,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:49:40,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:49:40,872 WARN L181 SmtUtils]: Spent 806.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 38 [2019-01-01 21:49:41,063 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2019-01-01 21:49:41,801 WARN L181 SmtUtils]: Spent 734.00 ms on a formula simplification. DAG size of input: 175 DAG size of output: 138 [2019-01-01 21:49:43,196 WARN L181 SmtUtils]: Spent 1.32 s on a formula simplification. DAG size of input: 110 DAG size of output: 110 [2019-01-01 21:49:43,199 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:49:43,199 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:49:43,199 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:49:43,199 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:49:43,200 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:49:43,200 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:49:43,200 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:49:43,200 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:49:43,200 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrspn-alloca_true-termination.c.i_Iteration5_Lasso [2019-01-01 21:49:43,200 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:49:43,200 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:49:43,209 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:49:43,224 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:49:43,227 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:49:43,229 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:49:43,231 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:49:43,237 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:49:43,239 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:49:43,241 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:49:43,243 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:49:43,246 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:49:43,252 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:49:43,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:49:43,496 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-01-01 21:49:44,501 WARN L181 SmtUtils]: Spent 1.00 s on a formula simplification. DAG size of input: 111 DAG size of output: 99 [2019-01-01 21:49:44,662 WARN L181 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 58 [2019-01-01 21:49:44,662 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:49:44,666 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:49:44,668 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:49:44,670 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:49:44,672 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:49:44,676 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:49:44,680 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:49:44,682 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:49:44,684 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:49:44,859 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2019-01-01 21:49:44,992 WARN L181 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2019-01-01 21:49:45,657 WARN L181 SmtUtils]: Spent 399.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 39 [2019-01-01 21:49:45,884 WARN L181 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2019-01-01 21:49:46,338 WARN L181 SmtUtils]: Spent 452.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-01-01 21:49:46,616 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:49:46,617 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:49:46,617 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:49:46,620 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:46,620 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:49:46,621 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:46,621 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:46,622 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:46,622 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:49:46,622 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:49:46,623 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:46,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-01 21:49:46,624 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:46,624 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:46,624 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:46,624 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:46,626 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:49:46,626 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:49:46,627 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:46,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-01 21:49:46,628 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:46,628 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:49:46,628 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:46,629 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:46,629 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:46,629 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:49:46,629 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:49:46,629 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:46,630 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:49:46,630 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:46,630 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:49:46,630 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:46,630 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:46,630 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:46,631 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:49:46,631 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:49:46,631 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:46,632 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:49:46,632 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:46,632 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:49:46,632 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:46,632 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:46,633 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:46,633 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:49:46,633 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:49:46,633 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:46,634 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:49:46,634 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:46,634 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:49:46,634 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:46,634 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:46,634 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:46,635 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:49:46,635 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:49:46,635 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:46,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-01 21:49:46,636 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:46,636 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:46,636 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:46,636 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:46,637 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:49:46,637 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:49:46,638 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:46,639 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:49:46,639 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:46,639 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:49:46,639 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:46,640 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:46,640 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:46,640 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:49:46,640 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:49:46,640 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:46,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-01 21:49:46,641 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:46,641 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:46,641 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:46,641 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:46,642 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:49:46,642 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:49:46,643 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:46,644 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:49:46,644 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:46,644 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:49:46,644 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:46,644 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:46,645 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:46,645 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:49:46,645 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:49:46,646 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:46,646 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:49:46,646 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:46,646 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:49:46,647 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:46,647 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:46,647 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:46,647 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:49:46,647 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:49:46,647 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:46,648 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:49:46,648 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:46,648 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2019-01-01 21:49:46,648 INFO L206 nArgumentSynthesizer]: 6 loop disjuncts [2019-01-01 21:49:46,649 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:46,674 INFO L402 nArgumentSynthesizer]: We have 132 Motzkin's Theorem applications. [2019-01-01 21:49:46,674 INFO L403 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2019-01-01 21:49:46,806 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:46,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-01 21:49:46,807 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:46,808 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2019-01-01 21:49:46,808 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:46,808 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:46,814 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-01 21:49:46,814 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:49:46,831 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:46,831 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:49:46,832 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:46,832 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:46,832 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:46,832 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:46,839 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:49:46,839 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:49:46,870 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:49:46,884 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:49:46,884 INFO L444 ModelExtractionUtils]: 46 out of 52 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-01-01 21:49:46,884 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:49:46,885 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 21:49:46,885 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:49:46,885 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-01 21:49:47,609 INFO L297 tatePredicateManager]: 27 out of 28 supporting invariants were superfluous and have been removed [2019-01-01 21:49:47,635 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-01 21:49:47,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:49:47,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:49:47,806 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:49:47,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:49:47,825 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:49:47,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:49:47,840 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2019-01-01 21:49:47,840 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11 Second operand 4 states. [2019-01-01 21:49:47,889 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 41 states and 51 transitions. Complement of second has 6 states. [2019-01-01 21:49:47,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:49:47,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 21:49:47,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2019-01-01 21:49:47,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2019-01-01 21:49:47,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:49:47,893 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:49:47,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:49:47,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:49:47,956 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:49:47,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:49:47,975 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:49:47,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:49:47,992 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 2 loop predicates [2019-01-01 21:49:47,992 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11 Second operand 4 states. [2019-01-01 21:49:48,073 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 41 states and 51 transitions. Complement of second has 6 states. [2019-01-01 21:49:48,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:49:48,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 21:49:48,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2019-01-01 21:49:48,080 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2019-01-01 21:49:48,081 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:49:48,081 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:49:48,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:49:48,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:49:48,134 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:49:48,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:49:48,223 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:49:48,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:49:48,236 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2019-01-01 21:49:48,237 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11 Second operand 4 states. [2019-01-01 21:49:48,281 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 41 states and 53 transitions. Complement of second has 5 states. [2019-01-01 21:49:48,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:49:48,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 21:49:48,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2019-01-01 21:49:48,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 15 letters. Loop has 3 letters. [2019-01-01 21:49:48,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:49:48,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 18 letters. Loop has 3 letters. [2019-01-01 21:49:48,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:49:48,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 15 letters. Loop has 6 letters. [2019-01-01 21:49:48,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:49:48,287 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 53 transitions. [2019-01-01 21:49:48,289 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:49:48,289 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 0 states and 0 transitions. [2019-01-01 21:49:48,289 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 21:49:48,289 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 21:49:48,290 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 21:49:48,290 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:49:48,290 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:49:48,290 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:49:48,290 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:49:48,290 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-01 21:49:48,290 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-01 21:49:48,290 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:49:48,290 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-01 21:49:48,298 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 09:49:48 BoogieIcfgContainer [2019-01-01 21:49:48,298 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 21:49:48,299 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 21:49:48,299 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 21:49:48,299 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 21:49:48,299 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:49:29" (3/4) ... [2019-01-01 21:49:48,306 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-01 21:49:48,309 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 21:49:48,311 INFO L168 Benchmark]: Toolchain (without parser) took 20095.97 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 370.7 MB). Free memory was 952.7 MB in the beginning and 1.0 GB in the end (delta: -85.8 MB). Peak memory consumption was 284.9 MB. Max. memory is 11.5 GB. [2019-01-01 21:49:48,313 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-01 21:49:48,315 INFO L168 Benchmark]: CACSL2BoogieTranslator took 646.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -166.3 MB). Peak memory consumption was 30.7 MB. Max. memory is 11.5 GB. [2019-01-01 21:49:48,317 INFO L168 Benchmark]: Boogie Procedure Inliner took 55.06 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-01 21:49:48,318 INFO L168 Benchmark]: Boogie Preprocessor took 37.70 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-01 21:49:48,319 INFO L168 Benchmark]: RCFGBuilder took 494.40 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.6 MB). Peak memory consumption was 25.6 MB. Max. memory is 11.5 GB. [2019-01-01 21:49:48,321 INFO L168 Benchmark]: BuchiAutomizer took 18845.50 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 231.2 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 54.9 MB). Peak memory consumption was 286.2 MB. Max. memory is 11.5 GB. [2019-01-01 21:49:48,324 INFO L168 Benchmark]: Witness Printer took 11.37 ms. Allocated memory is still 1.4 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:49:48,331 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 646.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -166.3 MB). Peak memory consumption was 30.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 55.06 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. * Boogie Preprocessor took 37.70 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 494.40 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.6 MB). Peak memory consumption was 25.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 18845.50 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 231.2 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 54.9 MB). Peak memory consumption was 286.2 MB. Max. memory is 11.5 GB. * Witness Printer took 11.37 ms. Allocated memory is still 1.4 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (2 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (length1 * sizeof(char))] + -1 * sc1 and consists of 3 locations. One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (length2 * sizeof(char))] + -1 * s and consists of 4 locations. One nondeterministic module has affine ranking function 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.7s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 17.3s. Construction of modules took 0.1s. Büchi inclusion checks took 1.1s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 8 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 25 states and ocurred in iteration 4. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 105 SDtfs, 118 SDslu, 72 SDs, 0 SdLazy, 103 SolverSat, 25 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital375 mio100 ax105 hnf99 lsp87 ukn72 mio100 lsp31 div131 bol100 ite100 ukn100 eq165 hnf81 smp92 dnf666 smp43 tf100 neg96 sie110 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 158ms 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...