./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-15/cstrcspn_mixed_alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/termination-15/cstrcspn_mixed_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 bee04d628cc50c5f036e0a10e9bd347013a62a54 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 02:46:02,291 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 02:46:02,293 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 02:46:02,311 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 02:46:02,312 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 02:46:02,313 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 02:46:02,315 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 02:46:02,318 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 02:46:02,320 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 02:46:02,323 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 02:46:02,325 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 02:46:02,326 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 02:46:02,327 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 02:46:02,330 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 02:46:02,337 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 02:46:02,339 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 02:46:02,340 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 02:46:02,342 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 02:46:02,345 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 02:46:02,347 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 02:46:02,348 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 02:46:02,351 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 02:46:02,356 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 02:46:02,356 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 02:46:02,356 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 02:46:02,358 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 02:46:02,359 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 02:46:02,360 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 02:46:02,361 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 02:46:02,364 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 02:46:02,365 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 02:46:02,365 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 02:46:02,365 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 02:46:02,366 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 02:46:02,367 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 02:46:02,368 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 02:46:02,368 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-14 02:46:02,386 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 02:46:02,387 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 02:46:02,388 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 02:46:02,388 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 02:46:02,388 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 02:46:02,389 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 02:46:02,389 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 02:46:02,389 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 02:46:02,389 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 02:46:02,389 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 02:46:02,390 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 02:46:02,390 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 02:46:02,390 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 02:46:02,390 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 02:46:02,390 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 02:46:02,390 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 02:46:02,391 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 02:46:02,391 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 02:46:02,391 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 02:46:02,391 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 02:46:02,391 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 02:46:02,391 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 02:46:02,392 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 02:46:02,392 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 02:46:02,392 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 02:46:02,392 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 02:46:02,392 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 02:46:02,392 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 02:46:02,393 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 02:46:02,394 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 -> bee04d628cc50c5f036e0a10e9bd347013a62a54 [2019-01-14 02:46:02,428 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 02:46:02,440 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 02:46:02,444 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 02:46:02,445 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 02:46:02,446 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 02:46:02,446 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-15/cstrcspn_mixed_alloca_true-termination.c.i [2019-01-14 02:46:02,507 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/504ffaf3e/6a2fa23de35d4491be64a28d757a42ae/FLAG1a1cab90f [2019-01-14 02:46:03,006 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 02:46:03,007 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-15/cstrcspn_mixed_alloca_true-termination.c.i [2019-01-14 02:46:03,019 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/504ffaf3e/6a2fa23de35d4491be64a28d757a42ae/FLAG1a1cab90f [2019-01-14 02:46:03,314 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/504ffaf3e/6a2fa23de35d4491be64a28d757a42ae [2019-01-14 02:46:03,317 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 02:46:03,318 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 02:46:03,319 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 02:46:03,319 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 02:46:03,323 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 02:46:03,324 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:46:03" (1/1) ... [2019-01-14 02:46:03,327 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f93ae0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:46:03, skipping insertion in model container [2019-01-14 02:46:03,328 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:46:03" (1/1) ... [2019-01-14 02:46:03,337 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 02:46:03,386 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 02:46:03,748 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:46:03,764 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 02:46:03,920 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:46:04,001 INFO L195 MainTranslator]: Completed translation [2019-01-14 02:46:04,001 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:46:04 WrapperNode [2019-01-14 02:46:04,001 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 02:46:04,003 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 02:46:04,003 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 02:46:04,003 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 02:46:04,013 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:46:04" (1/1) ... [2019-01-14 02:46:04,029 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:46:04" (1/1) ... [2019-01-14 02:46:04,055 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 02:46:04,056 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 02:46:04,056 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 02:46:04,056 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 02:46:04,069 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:46:04" (1/1) ... [2019-01-14 02:46:04,069 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:46:04" (1/1) ... [2019-01-14 02:46:04,074 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:46:04" (1/1) ... [2019-01-14 02:46:04,076 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:46:04" (1/1) ... [2019-01-14 02:46:04,092 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:46:04" (1/1) ... [2019-01-14 02:46:04,097 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:46:04" (1/1) ... [2019-01-14 02:46:04,100 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:46:04" (1/1) ... [2019-01-14 02:46:04,102 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 02:46:04,103 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 02:46:04,103 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 02:46:04,103 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 02:46:04,104 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:46:04" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:46:04,160 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 02:46:04,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 02:46:04,160 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 02:46:04,160 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 02:46:04,160 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 02:46:04,160 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 02:46:04,583 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 02:46:04,584 INFO L286 CfgBuilder]: Removed 8 assue(true) statements. [2019-01-14 02:46:04,585 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:46:04 BoogieIcfgContainer [2019-01-14 02:46:04,585 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 02:46:04,586 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 02:46:04,586 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 02:46:04,589 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 02:46:04,590 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:46:04,590 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 02:46:03" (1/3) ... [2019-01-14 02:46:04,591 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@22eef788 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:46:04, skipping insertion in model container [2019-01-14 02:46:04,592 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:46:04,592 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:46:04" (2/3) ... [2019-01-14 02:46:04,592 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@22eef788 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:46:04, skipping insertion in model container [2019-01-14 02:46:04,592 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:46:04,592 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:46:04" (3/3) ... [2019-01-14 02:46:04,594 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrcspn_mixed_alloca_true-termination.c.i [2019-01-14 02:46:04,649 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 02:46:04,649 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 02:46:04,650 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 02:46:04,650 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 02:46:04,650 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 02:46:04,650 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 02:46:04,650 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 02:46:04,650 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 02:46:04,651 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 02:46:04,664 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-01-14 02:46:04,685 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-01-14 02:46:04,686 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:46:04,686 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:46:04,693 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-14 02:46:04,694 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-14 02:46:04,694 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 02:46:04,694 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-01-14 02:46:04,696 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-01-14 02:46:04,696 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:46:04,696 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:46:04,697 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-14 02:46:04,697 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-14 02:46:04,705 INFO L794 eck$LassoCheckResult]: Stem: 13#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10#L-1true havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 12#L382true assume !(main_~length1~0 < 1); 15#L382-2true assume !(main_~length2~0 < 1); 9#L385-1true call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset, 1);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1);cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem207, cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset, cstrcspn_#t~mem208, cstrcspn_#t~mem209, cstrcspn_#t~short210, cstrcspn_#t~mem212, cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset, cstrcspn_#t~mem206, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 6#L369-4true [2019-01-14 02:46:04,706 INFO L796 eck$LassoCheckResult]: Loop: 6#L369-4true call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 18#L369-1true assume !!(0 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 20#L372-5true assume !true; 4#L372-6true call cstrcspn_#t~mem212 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 8#L374true assume !(cstrcspn_#t~mem212 == cstrcspn_~c~0);havoc cstrcspn_#t~mem212; 5#L369-3true cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post205.base, 1 + cstrcspn_#t~post205.offset;havoc cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset; 6#L369-4true [2019-01-14 02:46:04,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:46:04,713 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2019-01-14 02:46:04,715 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:46:04,715 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:46:04,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:46:04,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:46:04,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:46:04,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:46:04,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:46:04,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:46:04,863 INFO L82 PathProgramCache]: Analyzing trace with hash 1454917130, now seen corresponding path program 1 times [2019-01-14 02:46:04,863 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:46:04,864 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:46:04,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:46:04,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:46:04,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:46:04,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:46:04,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:46:04,901 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:46:04,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 02:46:04,907 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 02:46:04,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-14 02:46:04,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-14 02:46:04,926 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2019-01-14 02:46:04,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:46:04,933 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2019-01-14 02:46:04,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-14 02:46:04,935 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 23 transitions. [2019-01-14 02:46:04,937 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-01-14 02:46:04,941 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 13 states and 17 transitions. [2019-01-14 02:46:04,942 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-01-14 02:46:04,943 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-01-14 02:46:04,943 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 17 transitions. [2019-01-14 02:46:04,944 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:46:04,944 INFO L706 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2019-01-14 02:46:04,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 17 transitions. [2019-01-14 02:46:04,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-01-14 02:46:04,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-14 02:46:04,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2019-01-14 02:46:04,967 INFO L729 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2019-01-14 02:46:04,967 INFO L609 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2019-01-14 02:46:04,968 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 02:46:04,968 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2019-01-14 02:46:04,969 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-01-14 02:46:04,969 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:46:04,969 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:46:04,969 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-14 02:46:04,970 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:46:04,970 INFO L794 eck$LassoCheckResult]: Stem: 55#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 50#L-1 havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 51#L382 assume !(main_~length1~0 < 1); 52#L382-2 assume !(main_~length2~0 < 1); 49#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset, 1);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1);cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem207, cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset, cstrcspn_#t~mem208, cstrcspn_#t~mem209, cstrcspn_#t~short210, cstrcspn_#t~mem212, cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset, cstrcspn_#t~mem206, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 47#L369-4 [2019-01-14 02:46:04,970 INFO L796 eck$LassoCheckResult]: Loop: 47#L369-4 call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 48#L369-1 assume !!(0 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 56#L372-5 call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 0 != cstrcspn_#t~mem208; 53#L372-1 assume cstrcspn_#t~short210;call cstrcspn_#t~mem209 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := cstrcspn_#t~mem209 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 54#L372-3 assume !cstrcspn_#t~short210;havoc cstrcspn_#t~short210;havoc cstrcspn_#t~mem209;havoc cstrcspn_#t~mem208; 44#L372-6 call cstrcspn_#t~mem212 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 45#L374 assume !(cstrcspn_#t~mem212 == cstrcspn_~c~0);havoc cstrcspn_#t~mem212; 46#L369-3 cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post205.base, 1 + cstrcspn_#t~post205.offset;havoc cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset; 47#L369-4 [2019-01-14 02:46:04,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:46:04,971 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 2 times [2019-01-14 02:46:04,971 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:46:04,971 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:46:04,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:46:04,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:46:04,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:46:04,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:46:05,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:46:05,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:46:05,015 INFO L82 PathProgramCache]: Analyzing trace with hash 1927396657, now seen corresponding path program 1 times [2019-01-14 02:46:05,015 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:46:05,015 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:46:05,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:46:05,016 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:46:05,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:46:05,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:46:05,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:46:05,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:46:05,047 INFO L82 PathProgramCache]: Analyzing trace with hash -102988426, now seen corresponding path program 1 times [2019-01-14 02:46:05,048 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:46:05,048 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:46:05,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:46:05,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:46:05,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:46:05,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:46:05,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:46:05,776 WARN L181 SmtUtils]: Spent 597.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2019-01-14 02:46:06,622 WARN L181 SmtUtils]: Spent 770.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 50 [2019-01-14 02:46:07,034 WARN L181 SmtUtils]: Spent 408.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 88 [2019-01-14 02:46:07,205 WARN L181 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2019-01-14 02:46:07,219 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:46:07,221 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:46:07,221 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:46:07,221 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:46:07,221 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:46:07,222 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:46:07,222 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:46:07,222 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:46:07,222 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcspn_mixed_alloca_true-termination.c.i_Iteration2_Lasso [2019-01-14 02:46:07,222 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:46:07,223 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:46:07,253 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:46:07,258 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:46:07,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-14 02:46:07,274 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:46:07,286 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:46:07,289 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:46:07,292 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:46:07,300 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:46:07,307 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:46:07,310 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:46:07,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-14 02:46:07,316 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:46:07,319 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:46:07,325 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:46:07,329 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:46:07,335 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:46:07,744 WARN L181 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 68 [2019-01-14 02:46:08,082 WARN L181 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 57 [2019-01-14 02:46:08,083 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:46:08,086 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:46:09,063 WARN L181 SmtUtils]: Spent 555.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 40 [2019-01-14 02:46:09,451 WARN L181 SmtUtils]: Spent 365.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 34 [2019-01-14 02:46:09,572 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:46:09,578 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:46:09,580 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:46:09,581 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:46:09,582 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:46:09,582 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:46:09,583 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:46:09,583 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:46:09,585 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:46:09,585 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:46:09,587 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:46:09,588 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:46:09,588 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:46:09,588 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:46:09,589 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:46:09,589 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:46:09,591 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:46:09,592 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:46:09,595 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:46:09,596 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:46:09,596 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:46:09,596 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:46:09,597 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:46:09,597 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:46:09,597 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:46:09,597 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:46:09,597 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:46:09,598 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:46:09,599 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:46:09,599 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:46:09,600 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:46:09,600 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:46:09,600 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:46:09,602 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:46:09,602 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:46:09,605 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:46:09,606 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:46:09,606 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:46:09,606 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:46:09,607 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:46:09,607 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:46:09,607 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:46:09,607 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:46:09,608 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:46:09,608 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:46:09,609 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:46:09,609 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:46:09,610 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:46:09,610 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:46:09,610 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:46:09,610 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:46:09,611 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:46:09,611 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:46:09,612 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:46:09,612 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:46:09,613 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:46:09,613 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:46:09,613 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:46:09,613 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:46:09,613 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:46:09,614 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:46:09,614 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:46:09,615 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:46:09,615 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:46:09,615 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:46:09,616 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:46:09,616 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:46:09,616 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:46:09,616 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:46:09,617 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:46:09,617 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:46:09,618 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:46:09,618 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:46:09,619 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:46:09,619 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:46:09,619 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:46:09,619 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:46:09,619 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:46:09,620 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:46:09,620 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:46:09,621 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:46:09,621 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:46:09,622 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:46:09,622 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:46:09,622 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:46:09,622 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:46:09,622 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:46:09,623 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:46:09,623 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:46:09,624 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:46:09,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-14 02:46:09,625 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:46:09,625 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:46:09,625 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:46:09,625 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:46:09,625 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:46:09,626 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:46:09,626 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:46:09,627 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:46:09,627 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:46:09,628 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:46:09,628 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:46:09,628 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:46:09,628 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:46:09,628 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:46:09,629 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:46:09,629 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:46:09,630 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:46:09,630 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:46:09,631 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:46:09,631 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:46:09,631 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:46:09,631 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:46:09,631 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:46:09,632 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:46:09,632 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:46:09,633 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:46:09,633 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:46:09,634 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:46:09,634 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:46:09,634 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:46:09,634 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:46:09,634 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:46:09,635 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:46:09,635 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:46:09,636 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:46:09,636 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:46:09,637 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:46:09,637 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:46:09,637 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:46:09,637 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:46:09,637 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:46:09,638 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:46:09,638 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:46:09,639 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:46:09,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-14 02:46:09,640 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:46:09,640 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:46:09,640 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:46:09,640 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:46:09,643 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:46:09,643 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:46:09,648 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:46:09,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-14 02:46:09,649 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:46:09,649 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2019-01-14 02:46:09,649 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:46:09,650 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:46:09,660 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-14 02:46:09,660 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:46:09,722 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:46:09,722 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:46:09,723 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:46:09,723 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:46:09,723 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:46:09,723 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:46:09,727 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:46:09,727 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:46:09,730 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:46:09,730 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:46:09,731 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:46:09,731 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:46:09,731 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:46:09,731 INFO L206 nArgumentSynthesizer]: 4 loop disjuncts [2019-01-14 02:46:09,732 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:46:09,736 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-14 02:46:09,736 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:46:09,761 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:46:09,764 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:46:09,765 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:46:09,765 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:46:09,765 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:46:09,765 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:46:09,765 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:46:09,766 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:46:09,766 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:46:09,774 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:46:09,775 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:46:09,776 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:46:09,776 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:46:09,776 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:46:09,776 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:46:09,781 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:46:09,782 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:46:09,804 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:46:09,805 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:46:09,806 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:46:09,807 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:46:09,807 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:46:09,807 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:46:09,817 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:46:09,823 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:46:09,893 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:46:09,929 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-01-14 02:46:09,930 INFO L444 ModelExtractionUtils]: 34 out of 43 variables were initially zero. Simplification set additionally 6 variables to zero. [2019-01-14 02:46:09,933 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:46:09,934 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 02:46:09,936 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:46:09,936 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_cstrcspn_~sc1~0.base)_1, ULTIMATE.start_cstrcspn_~sc1~0.offset) = 1*v_rep(select #length ULTIMATE.start_cstrcspn_~sc1~0.base)_1 - 1*ULTIMATE.start_cstrcspn_~sc1~0.offset Supporting invariants [] [2019-01-14 02:46:10,144 INFO L297 tatePredicateManager]: 8 out of 8 supporting invariants were superfluous and have been removed [2019-01-14 02:46:10,171 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-14 02:46:10,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:46:10,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:46:10,454 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:46:10,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:46:10,485 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:46:10,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:46:10,583 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-14 02:46:10,584 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-01-14 02:46:10,642 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 21 states and 28 transitions. Complement of second has 4 states. [2019-01-14 02:46:10,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 02:46:10,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:46:10,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2019-01-14 02:46:10,647 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 8 letters. [2019-01-14 02:46:10,648 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:46:10,648 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 13 letters. Loop has 8 letters. [2019-01-14 02:46:10,649 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:46:10,649 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 16 letters. [2019-01-14 02:46:10,649 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:46:10,649 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 28 transitions. [2019-01-14 02:46:10,652 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 02:46:10,652 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 18 states and 25 transitions. [2019-01-14 02:46:10,653 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-01-14 02:46:10,653 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-01-14 02:46:10,654 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 25 transitions. [2019-01-14 02:46:10,654 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:46:10,654 INFO L706 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-01-14 02:46:10,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 25 transitions. [2019-01-14 02:46:10,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-01-14 02:46:10,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-14 02:46:10,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2019-01-14 02:46:10,658 INFO L729 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-01-14 02:46:10,658 INFO L609 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-01-14 02:46:10,658 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 02:46:10,658 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 25 transitions. [2019-01-14 02:46:10,661 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 02:46:10,661 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:46:10,661 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:46:10,661 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:46:10,662 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 02:46:10,662 INFO L794 eck$LassoCheckResult]: Stem: 180#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 177#L-1 havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 178#L382 assume !(main_~length1~0 < 1); 179#L382-2 assume !(main_~length2~0 < 1); 176#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset, 1);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1);cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem207, cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset, cstrcspn_#t~mem208, cstrcspn_#t~mem209, cstrcspn_#t~short210, cstrcspn_#t~mem212, cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset, cstrcspn_#t~mem206, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 173#L369-4 call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 175#L369-1 assume !!(0 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 185#L372-5 [2019-01-14 02:46:10,662 INFO L796 eck$LassoCheckResult]: Loop: 185#L372-5 call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 0 != cstrcspn_#t~mem208; 181#L372-1 assume cstrcspn_#t~short210;call cstrcspn_#t~mem209 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := cstrcspn_#t~mem209 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 182#L372-3 assume !!cstrcspn_#t~short210;havoc cstrcspn_#t~short210;havoc cstrcspn_#t~mem209;havoc cstrcspn_#t~mem208;cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset := cstrcspn_~s~0.base, cstrcspn_~s~0.offset;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset - 1;havoc cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset; 185#L372-5 [2019-01-14 02:46:10,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:46:10,662 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935595, now seen corresponding path program 1 times [2019-01-14 02:46:10,662 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:46:10,663 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:46:10,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:46:10,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:46:10,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:46:10,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:46:10,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:46:10,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:46:10,698 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 1 times [2019-01-14 02:46:10,699 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:46:10,699 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:46:10,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:46:10,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:46:10,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:46:10,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:46:10,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:46:10,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:46:10,712 INFO L82 PathProgramCache]: Analyzing trace with hash 1593218778, now seen corresponding path program 1 times [2019-01-14 02:46:10,712 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:46:10,712 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:46:10,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:46:10,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:46:10,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:46:10,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:46:10,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:46:10,885 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 39 [2019-01-14 02:46:11,040 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 36 [2019-01-14 02:46:11,443 WARN L181 SmtUtils]: Spent 400.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 104 [2019-01-14 02:46:11,600 WARN L181 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2019-01-14 02:46:11,603 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:46:11,603 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:46:11,603 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:46:11,603 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:46:11,603 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:46:11,604 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:46:11,604 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:46:11,604 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:46:11,604 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcspn_mixed_alloca_true-termination.c.i_Iteration3_Lasso [2019-01-14 02:46:11,604 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:46:11,604 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:46:11,609 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:46:11,641 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:46:11,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-14 02:46:11,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-14 02:46:11,688 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:46:11,689 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:46:11,692 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:46:11,694 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:46:11,696 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:46:11,698 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:46:11,701 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:46:11,703 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:46:11,705 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:46:11,708 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:46:11,711 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:46:11,713 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:46:12,252 WARN L181 SmtUtils]: Spent 423.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 80 [2019-01-14 02:46:12,470 WARN L181 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-01-14 02:46:12,471 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:46:12,477 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:46:12,478 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:46:13,008 WARN L181 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2019-01-14 02:46:13,402 WARN L181 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2019-01-14 02:46:14,053 WARN L181 SmtUtils]: Spent 638.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-01-14 02:46:14,199 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:46:14,199 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:46:14,200 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:46:14,200 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:46:14,201 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:46:14,201 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:46:14,201 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:46:14,201 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:46:14,202 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:46:14,206 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:46:14,210 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:46:14,211 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:46:14,211 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:46:14,211 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:46:14,211 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:46:14,211 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:46:14,214 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:46:14,214 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:46:14,216 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:46:14,217 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:46:14,218 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:46:14,218 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:46:14,218 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:46:14,218 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:46:14,219 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:46:14,219 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:46:14,219 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:46:14,220 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:46:14,223 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:46:14,223 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:46:14,223 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:46:14,224 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:46:14,226 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:46:14,226 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:46:14,226 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:46:14,226 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:46:14,228 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:46:14,229 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:46:14,229 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:46:14,229 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:46:14,232 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:46:14,232 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:46:14,232 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:46:14,233 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:46:14,233 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:46:14,233 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:46:14,234 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:46:14,234 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:46:14,234 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:46:14,235 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:46:14,238 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:46:14,239 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:46:14,239 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:46:14,241 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:46:14,242 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:46:14,244 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:46:14,244 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:46:14,245 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:46:14,245 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:46:14,247 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:46:14,247 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:46:14,249 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:46:14,250 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:46:14,251 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:46:14,252 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:46:14,253 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:46:14,253 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:46:14,253 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:46:14,253 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:46:14,253 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:46:14,255 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:46:14,256 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:46:14,256 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:46:14,257 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:46:14,259 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:46:14,259 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:46:14,260 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:46:14,260 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:46:14,260 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:46:14,261 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:46:14,261 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:46:14,264 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:46:14,264 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:46:14,265 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:46:14,265 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:46:14,265 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:46:14,265 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:46:14,265 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:46:14,269 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:46:14,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-14 02:46:14,270 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:46:14,270 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:46:14,270 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:46:14,270 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:46:14,270 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:46:14,270 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:46:14,271 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:46:14,275 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:46:14,278 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:46:14,279 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:46:14,279 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:46:14,279 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:46:14,279 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:46:14,279 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:46:14,279 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:46:14,279 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:46:14,289 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:46:14,290 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:46:14,290 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:46:14,290 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:46:14,290 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:46:14,291 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:46:14,291 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:46:14,291 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:46:14,291 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:46:14,292 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:46:14,296 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:46:14,296 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:46:14,296 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:46:14,297 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:46:14,297 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:46:14,297 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:46:14,297 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:46:14,297 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:46:14,302 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:46:14,302 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:46:14,302 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:46:14,303 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:46:14,305 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:46:14,305 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:46:14,305 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:46:14,306 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:46:14,306 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:46:14,306 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:46:14,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-14 02:46:14,314 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:46:14,315 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:46:14,315 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:46:14,315 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:46:14,316 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:46:14,316 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:46:14,329 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:46:14,332 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:46:14,333 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:46:14,333 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:46:14,333 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:46:14,333 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:46:14,334 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:46:14,334 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:46:14,339 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:46:14,343 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:46:14,346 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:46:14,346 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:46:14,347 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:46:14,347 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:46:14,350 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:46:14,350 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:46:14,353 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:46:14,354 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:46:14,362 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:46:14,362 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-14 02:46:14,363 INFO L206 nArgumentSynthesizer]: 6 loop disjuncts [2019-01-14 02:46:14,363 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:46:14,418 INFO L402 nArgumentSynthesizer]: We have 108 Motzkin's Theorem applications. [2019-01-14 02:46:14,419 INFO L403 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2019-01-14 02:46:14,597 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:46:14,602 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:46:14,606 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:46:14,606 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:46:14,606 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:46:14,606 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:46:14,610 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:46:14,610 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:46:14,615 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:46:14,616 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:46:14,617 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:46:14,620 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2019-01-14 02:46:14,620 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:46:14,621 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:46:14,630 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-14 02:46:14,630 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:46:14,664 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:46:14,666 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:46:14,667 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:46:14,667 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:46:14,667 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:46:14,670 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:46:14,681 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:46:14,682 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:46:14,720 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:46:14,760 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-14 02:46:14,760 INFO L444 ModelExtractionUtils]: 47 out of 52 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-01-14 02:46:14,761 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:46:14,762 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 02:46:14,762 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:46:14,762 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrcspn_~s~0.offset) = 2*ULTIMATE.start_cstrcspn_~s~0.offset + 1 Supporting invariants [] [2019-01-14 02:46:15,205 INFO L297 tatePredicateManager]: 16 out of 16 supporting invariants were superfluous and have been removed [2019-01-14 02:46:15,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:46:15,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:46:15,510 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:46:15,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:46:15,533 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:46:15,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:46:15,651 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-14 02:46:15,651 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9 Second operand 3 states. [2019-01-14 02:46:15,681 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 43 states and 57 transitions. Complement of second has 5 states. [2019-01-14 02:46:15,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 02:46:15,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:46:15,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2019-01-14 02:46:15,683 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 7 letters. Loop has 3 letters. [2019-01-14 02:46:15,683 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:46:15,683 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 10 letters. Loop has 3 letters. [2019-01-14 02:46:15,683 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:46:15,683 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 7 letters. Loop has 6 letters. [2019-01-14 02:46:15,685 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:46:15,685 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 57 transitions. [2019-01-14 02:46:15,688 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 02:46:15,690 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 30 states and 40 transitions. [2019-01-14 02:46:15,691 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-01-14 02:46:15,691 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-01-14 02:46:15,691 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 40 transitions. [2019-01-14 02:46:15,691 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:46:15,691 INFO L706 BuchiCegarLoop]: Abstraction has 30 states and 40 transitions. [2019-01-14 02:46:15,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 40 transitions. [2019-01-14 02:46:15,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2019-01-14 02:46:15,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-01-14 02:46:15,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2019-01-14 02:46:15,695 INFO L729 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2019-01-14 02:46:15,695 INFO L609 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2019-01-14 02:46:15,696 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 02:46:15,696 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 33 transitions. [2019-01-14 02:46:15,697 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 02:46:15,697 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:46:15,697 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:46:15,697 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:46:15,698 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 02:46:15,699 INFO L794 eck$LassoCheckResult]: Stem: 361#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 354#L-1 havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 355#L382 assume !(main_~length1~0 < 1); 356#L382-2 assume !(main_~length2~0 < 1); 353#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset, 1);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1);cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem207, cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset, cstrcspn_#t~mem208, cstrcspn_#t~mem209, cstrcspn_#t~short210, cstrcspn_#t~mem212, cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset, cstrcspn_#t~mem206, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 349#L369-4 call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 350#L369-1 assume !!(0 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 363#L372-5 call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 0 != cstrcspn_#t~mem208; 359#L372-1 assume !cstrcspn_#t~short210; 360#L372-3 assume !cstrcspn_#t~short210;havoc cstrcspn_#t~short210;havoc cstrcspn_#t~mem209;havoc cstrcspn_#t~mem208; 345#L372-6 call cstrcspn_#t~mem212 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 346#L374 assume !(cstrcspn_#t~mem212 == cstrcspn_~c~0);havoc cstrcspn_#t~mem212; 347#L369-3 cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post205.base, 1 + cstrcspn_#t~post205.offset;havoc cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset; 348#L369-4 call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 352#L369-1 assume !!(0 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 362#L372-5 [2019-01-14 02:46:15,699 INFO L796 eck$LassoCheckResult]: Loop: 362#L372-5 call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 0 != cstrcspn_#t~mem208; 357#L372-1 assume cstrcspn_#t~short210;call cstrcspn_#t~mem209 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := cstrcspn_#t~mem209 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 358#L372-3 assume !!cstrcspn_#t~short210;havoc cstrcspn_#t~short210;havoc cstrcspn_#t~mem209;havoc cstrcspn_#t~mem208;cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset := cstrcspn_~s~0.base, cstrcspn_~s~0.offset;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset - 1;havoc cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset; 362#L372-5 [2019-01-14 02:46:15,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:46:15,699 INFO L82 PathProgramCache]: Analyzing trace with hash 1587378397, now seen corresponding path program 1 times [2019-01-14 02:46:15,699 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:46:15,699 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:46:15,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:46:15,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:46:15,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:46:15,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:46:15,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:46:15,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:46:15,729 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 2 times [2019-01-14 02:46:15,729 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:46:15,729 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:46:15,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:46:15,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:46:15,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:46:15,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:46:15,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:46:15,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:46:15,739 INFO L82 PathProgramCache]: Analyzing trace with hash 1999924968, now seen corresponding path program 1 times [2019-01-14 02:46:15,740 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:46:15,740 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:46:15,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:46:15,740 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:46:15,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:46:15,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:46:16,068 WARN L181 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-01-14 02:46:16,726 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:46:16,726 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 02:46:16,726 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 02:46:16,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:46:16,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:46:16,791 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:46:16,864 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 23 [2019-01-14 02:46:16,880 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2019-01-14 02:46:16,880 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:46:17,088 INFO L303 Elim1Store]: Index analysis took 127 ms [2019-01-14 02:46:17,130 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 34 [2019-01-14 02:46:17,143 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2019-01-14 02:46:17,144 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 02:46:17,187 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-01-14 02:46:17,188 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-14 02:46:17,203 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:46:17,209 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:46:17,214 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-14 02:46:17,214 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:33, output treesize:18 [2019-01-14 02:46:42,331 WARN L181 SmtUtils]: Spent 1.06 s on a formula simplification that was a NOOP. DAG size: 18 [2019-01-14 02:46:55,575 WARN L181 SmtUtils]: Spent 1.22 s on a formula simplification that was a NOOP. DAG size: 23 [2019-01-14 02:47:06,825 WARN L181 SmtUtils]: Spent 11.07 s on a formula simplification. DAG size of input: 26 DAG size of output: 26 [2019-01-14 02:47:31,009 WARN L181 SmtUtils]: Spent 1.80 s on a formula simplification that was a NOOP. DAG size: 17 [2019-01-14 02:47:46,275 WARN L181 SmtUtils]: Spent 1.50 s on a formula simplification that was a NOOP. DAG size: 17 [2019-01-14 02:47:46,282 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:47:46,302 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 02:47:46,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2019-01-14 02:47:46,416 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 39 [2019-01-14 02:47:46,534 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 36 [2019-01-14 02:47:46,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-14 02:47:46,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=116, Unknown=7, NotChecked=0, Total=156 [2019-01-14 02:47:46,537 INFO L87 Difference]: Start difference. First operand 24 states and 33 transitions. cyclomatic complexity: 12 Second operand 13 states. [2019-01-14 02:47:52,986 WARN L181 SmtUtils]: Spent 6.39 s on a formula simplification. DAG size of input: 36 DAG size of output: 31 [2019-01-14 02:48:05,069 WARN L181 SmtUtils]: Spent 12.02 s on a formula simplification. DAG size of input: 35 DAG size of output: 23 [2019-01-14 02:48:07,017 WARN L181 SmtUtils]: Spent 1.90 s on a formula simplification. DAG size of input: 29 DAG size of output: 21 [2019-01-14 02:48:09,771 WARN L181 SmtUtils]: Spent 2.71 s on a formula simplification that was a NOOP. DAG size: 20 [2019-01-14 02:48:09,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:48:09,827 INFO L93 Difference]: Finished difference Result 59 states and 72 transitions. [2019-01-14 02:48:09,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 02:48:09,827 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 72 transitions. [2019-01-14 02:48:09,830 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 02:48:09,833 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 43 states and 53 transitions. [2019-01-14 02:48:09,834 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-01-14 02:48:09,834 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-01-14 02:48:09,834 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 53 transitions. [2019-01-14 02:48:09,834 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:48:09,834 INFO L706 BuchiCegarLoop]: Abstraction has 43 states and 53 transitions. [2019-01-14 02:48:09,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 53 transitions. [2019-01-14 02:48:09,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 28. [2019-01-14 02:48:09,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-14 02:48:09,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2019-01-14 02:48:09,839 INFO L729 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2019-01-14 02:48:09,839 INFO L609 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2019-01-14 02:48:09,839 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-14 02:48:09,839 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 36 transitions. [2019-01-14 02:48:09,841 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 02:48:09,841 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:48:09,842 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:48:09,842 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:48:09,842 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 02:48:09,844 INFO L794 eck$LassoCheckResult]: Stem: 522#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 515#L-1 havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 516#L382 assume !(main_~length1~0 < 1); 517#L382-2 assume !(main_~length2~0 < 1); 514#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset, 1);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1);cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem207, cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset, cstrcspn_#t~mem208, cstrcspn_#t~mem209, cstrcspn_#t~short210, cstrcspn_#t~mem212, cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset, cstrcspn_#t~mem206, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 510#L369-4 call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 511#L369-1 assume !!(0 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 530#L372-5 call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 0 != cstrcspn_#t~mem208; 520#L372-1 assume cstrcspn_#t~short210;call cstrcspn_#t~mem209 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := cstrcspn_#t~mem209 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 521#L372-3 assume !cstrcspn_#t~short210;havoc cstrcspn_#t~short210;havoc cstrcspn_#t~mem209;havoc cstrcspn_#t~mem208; 506#L372-6 call cstrcspn_#t~mem212 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 507#L374 assume !(cstrcspn_#t~mem212 == cstrcspn_~c~0);havoc cstrcspn_#t~mem212; 508#L369-3 cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post205.base, 1 + cstrcspn_#t~post205.offset;havoc cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset; 509#L369-4 call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 512#L369-1 assume !!(0 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 523#L372-5 [2019-01-14 02:48:09,844 INFO L796 eck$LassoCheckResult]: Loop: 523#L372-5 call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 0 != cstrcspn_#t~mem208; 518#L372-1 assume cstrcspn_#t~short210;call cstrcspn_#t~mem209 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := cstrcspn_#t~mem209 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 519#L372-3 assume !!cstrcspn_#t~short210;havoc cstrcspn_#t~short210;havoc cstrcspn_#t~mem209;havoc cstrcspn_#t~mem208;cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset := cstrcspn_~s~0.base, cstrcspn_~s~0.offset;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset - 1;havoc cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset; 523#L372-5 [2019-01-14 02:48:09,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:48:09,844 INFO L82 PathProgramCache]: Analyzing trace with hash -187628965, now seen corresponding path program 2 times [2019-01-14 02:48:09,845 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:48:09,847 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:48:09,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:09,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:48:09,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:09,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:48:09,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:48:09,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:48:09,898 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 3 times [2019-01-14 02:48:09,899 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:48:09,899 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:48:09,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:09,902 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:48:09,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:09,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:48:09,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:48:09,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:48:09,914 INFO L82 PathProgramCache]: Analyzing trace with hash -1902015318, now seen corresponding path program 1 times [2019-01-14 02:48:09,914 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:48:09,914 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:48:09,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:09,917 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:48:09,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:48:09,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:48:09,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:48:10,304 WARN L181 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 39 [2019-01-14 02:48:10,429 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 36 [2019-01-14 02:48:11,273 WARN L181 SmtUtils]: Spent 839.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 141 [2019-01-14 02:48:12,565 WARN L181 SmtUtils]: Spent 1.23 s on a formula simplification. DAG size of input: 113 DAG size of output: 113 [2019-01-14 02:48:12,589 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:48:12,590 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:48:12,590 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:48:12,590 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:48:12,590 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:48:12,590 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:48:12,590 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:48:12,590 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:48:12,591 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcspn_mixed_alloca_true-termination.c.i_Iteration5_Lasso [2019-01-14 02:48:12,591 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:48:12,591 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:48:12,601 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:12,622 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:12,627 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:12,629 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:12,632 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:12,637 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:12,639 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:12,642 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:12,911 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-01-14 02:48:13,997 WARN L181 SmtUtils]: Spent 1.08 s on a formula simplification. DAG size of input: 112 DAG size of output: 101 [2019-01-14 02:48:14,333 WARN L181 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 57 [2019-01-14 02:48:14,333 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:14,337 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:14,339 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:14,342 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:14,344 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:14,346 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:14,347 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:14,351 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:14,353 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:14,355 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:48:14,561 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2019-01-14 02:48:14,817 WARN L181 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 45 [2019-01-14 02:48:15,015 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2019-01-14 02:48:15,674 WARN L181 SmtUtils]: Spent 612.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-01-14 02:48:16,448 WARN L181 SmtUtils]: Spent 748.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 46 [2019-01-14 02:48:16,671 WARN L181 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2019-01-14 02:48:16,687 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:48:16,687 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:48:16,688 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:16,689 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:16,689 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:16,689 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:16,689 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:16,689 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:16,690 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:16,690 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:16,691 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:16,691 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:16,692 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:16,692 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:16,692 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:16,692 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:16,692 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:16,693 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:16,693 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:16,693 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:16,694 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:16,694 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:16,694 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:16,694 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:16,695 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:16,695 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:16,695 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:16,695 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:16,695 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:16,696 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:16,696 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:16,696 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:16,697 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:16,697 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:16,697 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:48:16,697 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:48:16,699 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:16,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-14 02:48:16,700 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:16,700 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:16,700 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:16,700 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:16,700 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:16,701 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:16,701 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:16,701 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:16,702 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:16,702 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:16,702 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:16,702 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:16,702 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:16,702 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:16,703 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:16,703 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:16,703 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:16,704 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:16,704 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:16,704 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:48:16,704 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:16,704 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:16,704 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:16,705 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:48:16,705 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:48:16,705 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:16,706 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:16,706 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:16,706 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:16,706 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:16,706 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:16,707 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:48:16,707 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:48:16,712 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:16,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-14 02:48:16,713 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:16,713 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:16,713 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:16,713 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:16,714 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:48:16,714 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:48:16,715 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:16,716 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:16,716 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:16,716 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:16,716 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:16,716 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:16,717 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:48:16,717 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:48:16,718 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:16,719 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:16,719 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:16,719 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:16,719 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:16,719 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:16,720 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:48:16,720 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:48:16,721 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:48:16,722 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:48:16,722 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:48:16,723 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:48:16,723 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:48:16,723 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:48:16,726 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:48:16,726 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:48:16,781 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:48:16,805 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-01-14 02:48:16,806 INFO L444 ModelExtractionUtils]: 47 out of 55 variables were initially zero. Simplification set additionally 5 variables to zero. [2019-01-14 02:48:16,807 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:48:16,809 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 02:48:16,811 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:48:16,811 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrcspn_~s~0.offset) = 2*ULTIMATE.start_cstrcspn_~s~0.offset + 1 Supporting invariants [] [2019-01-14 02:48:17,113 INFO L297 tatePredicateManager]: 25 out of 25 supporting invariants were superfluous and have been removed [2019-01-14 02:48:17,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:48:17,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:48:17,148 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:48:17,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:48:17,159 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:48:17,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:48:17,168 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-14 02:48:17,168 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11 Second operand 3 states. [2019-01-14 02:48:17,192 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11. Second operand 3 states. Result 46 states and 58 transitions. Complement of second has 5 states. [2019-01-14 02:48:17,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 02:48:17,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:48:17,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2019-01-14 02:48:17,195 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2019-01-14 02:48:17,195 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:48:17,195 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:48:17,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:48:17,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:48:17,232 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:48:17,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:48:17,241 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:48:17,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:48:17,251 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-14 02:48:17,252 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11 Second operand 3 states. [2019-01-14 02:48:17,274 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11. Second operand 3 states. Result 46 states and 58 transitions. Complement of second has 5 states. [2019-01-14 02:48:17,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 02:48:17,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:48:17,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2019-01-14 02:48:17,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2019-01-14 02:48:17,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:48:17,280 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:48:17,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:48:17,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:48:17,342 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:48:17,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:48:17,365 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:48:17,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:48:17,412 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-14 02:48:17,412 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11 Second operand 3 states. [2019-01-14 02:48:17,460 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11. Second operand 3 states. Result 45 states and 60 transitions. Complement of second has 4 states. [2019-01-14 02:48:17,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 02:48:17,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:48:17,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 27 transitions. [2019-01-14 02:48:17,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 15 letters. Loop has 3 letters. [2019-01-14 02:48:17,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:48:17,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 18 letters. Loop has 3 letters. [2019-01-14 02:48:17,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:48:17,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 15 letters. Loop has 6 letters. [2019-01-14 02:48:17,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:48:17,465 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 60 transitions. [2019-01-14 02:48:17,468 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:48:17,469 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 0 states and 0 transitions. [2019-01-14 02:48:17,469 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 02:48:17,469 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 02:48:17,469 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 02:48:17,469 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:48:17,469 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:48:17,469 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:48:17,470 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:48:17,470 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-14 02:48:17,470 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 02:48:17,470 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:48:17,470 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 02:48:17,484 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 02:48:17 BoogieIcfgContainer [2019-01-14 02:48:17,484 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 02:48:17,485 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 02:48:17,485 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 02:48:17,485 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 02:48:17,489 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:46:04" (3/4) ... [2019-01-14 02:48:17,494 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 02:48:17,495 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 02:48:17,496 INFO L168 Benchmark]: Toolchain (without parser) took 134178.38 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 273.7 MB). Free memory was 952.7 MB in the beginning and 834.8 MB in the end (delta: 117.9 MB). Peak memory consumption was 391.6 MB. Max. memory is 11.5 GB. [2019-01-14 02:48:17,498 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-14 02:48:17,499 INFO L168 Benchmark]: CACSL2BoogieTranslator took 682.66 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -160.7 MB). Peak memory consumption was 31.2 MB. Max. memory is 11.5 GB. [2019-01-14 02:48:17,500 INFO L168 Benchmark]: Boogie Procedure Inliner took 52.74 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:48:17,501 INFO L168 Benchmark]: Boogie Preprocessor took 46.64 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:48:17,501 INFO L168 Benchmark]: RCFGBuilder took 482.32 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.7 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. [2019-01-14 02:48:17,505 INFO L168 Benchmark]: BuchiAutomizer took 132898.93 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 127.9 MB). Free memory was 1.1 GB in the beginning and 834.8 MB in the end (delta: 260.0 MB). Peak memory consumption was 387.9 MB. Max. memory is 11.5 GB. [2019-01-14 02:48:17,506 INFO L168 Benchmark]: Witness Printer took 9.67 ms. Allocated memory is still 1.3 GB. Free memory is still 834.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:48:17,515 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 682.66 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -160.7 MB). Peak memory consumption was 31.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 52.74 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 46.64 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 482.32 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.7 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 132898.93 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 127.9 MB). Free memory was 1.1 GB in the beginning and 834.8 MB in the end (delta: 260.0 MB). Peak memory consumption was 387.9 MB. Max. memory is 11.5 GB. * Witness Printer took 9.67 ms. Allocated memory is still 1.3 GB. Free memory is still 834.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * 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[sc1] + -1 * sc1 and consists of 3 locations. One deterministic module has affine ranking function 2 * s + 1 and consists of 3 locations. One nondeterministic module has affine ranking function 2 * s + 1 and consists of 3 locations. 2 modules have a trivial ranking function, the largest among these consists of 13 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 132.8s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 108.0s. Construction of modules took 0.2s. Büchi inclusion checks took 24.3s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 21 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 28 states and ocurred in iteration 4. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 114 SDtfs, 149 SDslu, 93 SDs, 0 SdLazy, 135 SolverSat, 26 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital382 mio100 ax100 hnf99 lsp91 ukn73 mio100 lsp36 div116 bol100 ite100 ukn100 eq180 hnf83 smp94 dnf855 smp33 tf100 neg96 sie112 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 242ms VariablesStem: 2 VariablesLoop: 4 DisjunctsStem: 2 DisjunctsLoop: 6 SupportingInvariants: 12 MotzkinApplications: 108 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...