./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/loops/string_false-unreach-call_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 91b1670e 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/loops/string_false-unreach-call_true-termination.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 77cd31699320cd40da64f32a92959020d19291bd ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-28 23:41:43,331 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 23:41:43,332 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 23:41:43,345 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 23:41:43,345 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 23:41:43,346 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 23:41:43,347 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 23:41:43,349 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 23:41:43,351 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 23:41:43,352 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 23:41:43,353 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 23:41:43,354 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 23:41:43,355 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 23:41:43,356 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 23:41:43,357 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 23:41:43,358 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 23:41:43,359 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 23:41:43,361 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 23:41:43,363 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 23:41:43,365 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 23:41:43,366 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 23:41:43,367 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 23:41:43,370 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 23:41:43,370 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 23:41:43,371 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 23:41:43,372 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 23:41:43,373 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 23:41:43,374 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 23:41:43,374 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 23:41:43,376 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 23:41:43,376 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 23:41:43,377 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 23:41:43,377 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 23:41:43,377 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 23:41:43,378 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 23:41:43,379 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 23:41:43,379 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-28 23:41:43,397 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 23:41:43,397 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 23:41:43,399 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 23:41:43,399 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 23:41:43,399 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 23:41:43,400 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 23:41:43,400 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 23:41:43,400 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 23:41:43,400 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 23:41:43,401 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 23:41:43,401 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 23:41:43,401 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 23:41:43,402 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 23:41:43,402 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 23:41:43,402 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 23:41:43,402 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 23:41:43,403 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 23:41:43,403 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 23:41:43,403 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 23:41:43,403 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 23:41:43,404 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 23:41:43,404 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 23:41:43,404 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 23:41:43,404 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 23:41:43,405 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 23:41:43,405 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 23:41:43,406 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 23:41:43,406 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 23:41:43,406 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 23:41:43,406 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 23:41:43,407 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 23:41:43,408 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 23:41:43,408 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 77cd31699320cd40da64f32a92959020d19291bd [2018-11-28 23:41:43,454 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 23:41:43,474 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 23:41:43,479 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 23:41:43,480 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 23:41:43,481 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 23:41:43,483 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/loops/string_false-unreach-call_true-termination.i [2018-11-28 23:41:43,543 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8a42e02f/cee1a04038c5494e9735f99e79c8907a/FLAGa326a7468 [2018-11-28 23:41:44,036 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 23:41:44,037 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/loops/string_false-unreach-call_true-termination.i [2018-11-28 23:41:44,046 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8a42e02f/cee1a04038c5494e9735f99e79c8907a/FLAGa326a7468 [2018-11-28 23:41:44,346 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8a42e02f/cee1a04038c5494e9735f99e79c8907a [2018-11-28 23:41:44,351 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 23:41:44,353 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 23:41:44,355 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 23:41:44,355 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 23:41:44,359 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 23:41:44,361 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:41:44" (1/1) ... [2018-11-28 23:41:44,364 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33a111ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:41:44, skipping insertion in model container [2018-11-28 23:41:44,365 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:41:44" (1/1) ... [2018-11-28 23:41:44,374 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 23:41:44,396 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 23:41:44,640 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:41:44,646 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 23:41:44,689 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:41:44,723 INFO L195 MainTranslator]: Completed translation [2018-11-28 23:41:44,724 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:41:44 WrapperNode [2018-11-28 23:41:44,724 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 23:41:44,725 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 23:41:44,726 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 23:41:44,726 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 23:41:44,736 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:41:44" (1/1) ... [2018-11-28 23:41:44,748 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:41:44" (1/1) ... [2018-11-28 23:41:44,783 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 23:41:44,784 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 23:41:44,785 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 23:41:44,785 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 23:41:44,797 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:41:44" (1/1) ... [2018-11-28 23:41:44,797 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:41:44" (1/1) ... [2018-11-28 23:41:44,801 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:41:44" (1/1) ... [2018-11-28 23:41:44,803 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:41:44" (1/1) ... [2018-11-28 23:41:44,823 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:41:44" (1/1) ... [2018-11-28 23:41:44,840 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:41:44" (1/1) ... [2018-11-28 23:41:44,845 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:41:44" (1/1) ... [2018-11-28 23:41:44,848 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 23:41:44,849 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 23:41:44,849 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 23:41:44,849 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 23:41:44,851 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:41:44" (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 [2018-11-28 23:41:44,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 23:41:44,985 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 23:41:44,985 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 23:41:44,985 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 23:41:44,985 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 23:41:44,986 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 23:41:45,486 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 23:41:45,487 INFO L280 CfgBuilder]: Removed 11 assue(true) statements. [2018-11-28 23:41:45,488 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:41:45 BoogieIcfgContainer [2018-11-28 23:41:45,488 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 23:41:45,488 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 23:41:45,491 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 23:41:45,495 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 23:41:45,496 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:41:45,496 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 11:41:44" (1/3) ... [2018-11-28 23:41:45,499 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@24f3113b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:41:45, skipping insertion in model container [2018-11-28 23:41:45,500 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:41:45,500 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:41:44" (2/3) ... [2018-11-28 23:41:45,501 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@24f3113b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:41:45, skipping insertion in model container [2018-11-28 23:41:45,501 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:41:45,501 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:41:45" (3/3) ... [2018-11-28 23:41:45,504 INFO L375 chiAutomizerObserver]: Analyzing ICFG string_false-unreach-call_true-termination.i [2018-11-28 23:41:45,568 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 23:41:45,569 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 23:41:45,569 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 23:41:45,569 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 23:41:45,569 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 23:41:45,570 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 23:41:45,570 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 23:41:45,570 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 23:41:45,570 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 23:41:45,586 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2018-11-28 23:41:45,610 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2018-11-28 23:41:45,611 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:41:45,611 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:41:45,618 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 23:41:45,618 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 23:41:45,618 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 23:41:45,618 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2018-11-28 23:41:45,621 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2018-11-28 23:41:45,621 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:41:45,621 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:41:45,622 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 23:41:45,622 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 23:41:45,629 INFO L794 eck$LassoCheckResult]: Stem: 27#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 5#L-1true havoc main_#res;havoc main_#t~nondet2, main_#t~post1, main_#t~mem3, main_#t~nondet5, main_#t~post4, main_#t~mem6, main_#t~post8, main_#t~mem7, main_#t~post10, main_#t~mem9, main_#t~mem11, main_#t~mem12, main_#t~post13, main_#t~post14, main_~#string_A~0.base, main_~#string_A~0.offset, main_~#string_B~0.base, main_~#string_B~0.offset, main_~i~0, main_~j~0, main_~nc_A~0, main_~nc_B~0, main_~found~0;call main_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.alloc(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.alloc(5);havoc main_~i~0;havoc main_~j~0;havoc main_~nc_A~0;havoc main_~nc_B~0;main_~found~0 := 0;main_~i~0 := 0; 22#L21-3true [2018-11-28 23:41:45,630 INFO L796 eck$LassoCheckResult]: Loop: 22#L21-3true assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 24#L21-2true main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 22#L21-3true [2018-11-28 23:41:45,635 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:41:45,636 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-28 23:41:45,638 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:41:45,638 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:41:45,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:45,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:41:45,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:45,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:45,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:45,766 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:41:45,766 INFO L82 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2018-11-28 23:41:45,767 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:41:45,767 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:41:45,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:45,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:41:45,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:45,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:45,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:45,794 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:41:45,794 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2018-11-28 23:41:45,794 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:41:45,794 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:41:45,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:45,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:41:45,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:45,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:45,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:46,136 WARN L180 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2018-11-28 23:41:46,342 WARN L180 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2018-11-28 23:41:46,354 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:41:46,356 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:41:46,356 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:41:46,356 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:41:46,356 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:41:46,356 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:41:46,356 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:41:46,357 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:41:46,357 INFO L131 ssoRankerPreferences]: Filename of dumped script: string_false-unreach-call_true-termination.i_Iteration1_Lasso [2018-11-28 23:41:46,357 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:41:46,357 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:41:46,386 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:46,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:46,439 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:46,446 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:46,451 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:46,455 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:46,459 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:46,461 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:46,466 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:46,475 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:46,479 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:46,487 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:46,492 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:46,507 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:46,511 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:46,517 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:46,521 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:46,523 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:46,724 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-11-28 23:41:46,725 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:46,730 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:46,736 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:46,740 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:47,465 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:41:47,471 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:41:47,473 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:41:47,475 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:47,475 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:41:47,476 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:41:47,476 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:47,477 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:47,479 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:41:47,479 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:41:47,482 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:41:47,483 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:41:47,484 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:47,484 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:41:47,484 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:41:47,484 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:47,485 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:47,485 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:41:47,485 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:41:47,486 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:41:47,487 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:41:47,487 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:47,488 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:41:47,488 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:41:47,488 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:47,488 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:47,489 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:41:47,489 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:41:47,490 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:41:47,491 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:41:47,491 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:47,491 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:41:47,492 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:41:47,492 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:47,492 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:47,492 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:41:47,493 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:41:47,494 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:41:47,494 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:41:47,495 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:47,495 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:41:47,495 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:41:47,495 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:47,496 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:47,496 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:41:47,496 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:41:47,498 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:41:47,498 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:41:47,499 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:47,499 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:41:47,499 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:47,500 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:47,502 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:41:47,503 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:41:47,508 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:41:47,508 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:41:47,509 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:47,509 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:41:47,509 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:41:47,510 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:47,510 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:47,510 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:41:47,510 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:41:47,512 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:41:47,512 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:41:47,513 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:47,513 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:41:47,513 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:41:47,513 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:47,513 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:47,514 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:41:47,514 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:41:47,515 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:41:47,516 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:41:47,516 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:47,516 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:41:47,517 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:41:47,517 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:47,517 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:47,518 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:41:47,518 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:41:47,520 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:41:47,520 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:41:47,521 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:47,521 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:41:47,521 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:41:47,522 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:47,522 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:47,522 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:41:47,522 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:41:47,524 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:41:47,524 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:41:47,525 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:47,525 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:41:47,525 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:47,525 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:47,528 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:41:47,528 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:41:47,533 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:41:47,533 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:41:47,534 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:47,534 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:41:47,535 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:41:47,535 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:47,535 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:47,535 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:41:47,536 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:41:47,537 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:41:47,537 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:41:47,538 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:47,538 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:41:47,538 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:41:47,539 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:47,539 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:47,539 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:41:47,539 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:41:47,541 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:41:47,541 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:41:47,544 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:47,544 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:41:47,544 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:47,544 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:47,549 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:41:47,549 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:41:47,555 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:41:47,559 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:41:47,562 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:47,565 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:41:47,565 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:41:47,565 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:47,565 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:47,566 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:41:47,566 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:41:47,569 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:41:47,571 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:41:47,573 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:47,576 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:41:47,576 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:41:47,576 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:47,576 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:47,577 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:41:47,577 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:41:47,578 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:41:47,584 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:41:47,585 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:47,585 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:41:47,585 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:41:47,585 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:47,586 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:47,586 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:41:47,586 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:41:47,591 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:41:47,591 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:41:47,592 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:47,592 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:41:47,592 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:47,592 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:47,594 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:41:47,600 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:41:47,619 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:41:47,620 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:41:47,621 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:47,625 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:41:47,625 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:47,626 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:47,632 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:41:47,633 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:41:47,698 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:41:47,746 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-11-28 23:41:47,746 INFO L444 ModelExtractionUtils]: 7 out of 13 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-28 23:41:47,749 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:41:47,752 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:41:47,752 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:41:47,753 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#string_A~0.base)_1, ULTIMATE.start_main_~i~0) = 9*v_rep(select #length ULTIMATE.start_main_~#string_A~0.base)_1 - 2*ULTIMATE.start_main_~i~0 Supporting invariants [] [2018-11-28 23:41:47,781 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-28 23:41:47,790 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-28 23:41:47,830 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:41:47,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:41:47,853 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:41:47,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:41:47,873 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:41:47,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:41:47,920 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 [2018-11-28 23:41:47,922 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states. Second operand 3 states. [2018-11-28 23:41:48,047 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states.. Second operand 3 states. Result 50 states and 80 transitions. Complement of second has 8 states. [2018-11-28 23:41:48,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 23:41:48,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:41:48,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2018-11-28 23:41:48,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 2 letters. Loop has 2 letters. [2018-11-28 23:41:48,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:41:48,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 4 letters. Loop has 2 letters. [2018-11-28 23:41:48,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:41:48,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 2 letters. Loop has 4 letters. [2018-11-28 23:41:48,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:41:48,056 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 80 transitions. [2018-11-28 23:41:48,061 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-11-28 23:41:48,067 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 19 states and 28 transitions. [2018-11-28 23:41:48,068 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-11-28 23:41:48,069 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-11-28 23:41:48,070 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 28 transitions. [2018-11-28 23:41:48,071 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:41:48,071 INFO L705 BuchiCegarLoop]: Abstraction has 19 states and 28 transitions. [2018-11-28 23:41:48,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 28 transitions. [2018-11-28 23:41:48,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-11-28 23:41:48,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-28 23:41:48,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 28 transitions. [2018-11-28 23:41:48,099 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 28 transitions. [2018-11-28 23:41:48,099 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 28 transitions. [2018-11-28 23:41:48,099 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 23:41:48,100 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 28 transitions. [2018-11-28 23:41:48,101 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-11-28 23:41:48,101 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:41:48,101 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:41:48,101 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-28 23:41:48,102 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 23:41:48,102 INFO L794 eck$LassoCheckResult]: Stem: 143#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 140#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~post1, main_#t~mem3, main_#t~nondet5, main_#t~post4, main_#t~mem6, main_#t~post8, main_#t~mem7, main_#t~post10, main_#t~mem9, main_#t~mem11, main_#t~mem12, main_#t~post13, main_#t~post14, main_~#string_A~0.base, main_~#string_A~0.offset, main_~#string_B~0.base, main_~#string_B~0.offset, main_~i~0, main_~j~0, main_~nc_A~0, main_~nc_B~0, main_~found~0;call main_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.alloc(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.alloc(5);havoc main_~i~0;havoc main_~j~0;havoc main_~nc_A~0;havoc main_~nc_B~0;main_~found~0 := 0;main_~i~0 := 0; 134#L21-3 assume !(main_~i~0 < 5); 132#L21-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 133#L23 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 144#L25-3 [2018-11-28 23:41:48,102 INFO L796 eck$LassoCheckResult]: Loop: 144#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 145#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 144#L25-3 [2018-11-28 23:41:48,102 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:41:48,103 INFO L82 PathProgramCache]: Analyzing trace with hash 28696938, now seen corresponding path program 1 times [2018-11-28 23:41:48,103 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:41:48,103 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:41:48,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:48,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:41:48,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:48,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:41:48,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:41:48,168 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:41:48,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 23:41:48,170 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 23:41:48,170 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:41:48,170 INFO L82 PathProgramCache]: Analyzing trace with hash 1891, now seen corresponding path program 1 times [2018-11-28 23:41:48,170 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:41:48,170 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:41:48,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:48,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:41:48,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:48,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:48,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:48,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 23:41:48,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 23:41:48,313 INFO L87 Difference]: Start difference. First operand 19 states and 28 transitions. cyclomatic complexity: 14 Second operand 3 states. [2018-11-28 23:41:48,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:41:48,389 INFO L93 Difference]: Finished difference Result 24 states and 30 transitions. [2018-11-28 23:41:48,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 23:41:48,391 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 30 transitions. [2018-11-28 23:41:48,394 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-11-28 23:41:48,397 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 24 states and 30 transitions. [2018-11-28 23:41:48,397 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2018-11-28 23:41:48,398 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2018-11-28 23:41:48,398 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 30 transitions. [2018-11-28 23:41:48,398 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:41:48,398 INFO L705 BuchiCegarLoop]: Abstraction has 24 states and 30 transitions. [2018-11-28 23:41:48,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 30 transitions. [2018-11-28 23:41:48,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 20. [2018-11-28 23:41:48,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-28 23:41:48,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2018-11-28 23:41:48,403 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2018-11-28 23:41:48,403 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2018-11-28 23:41:48,403 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 23:41:48,404 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 25 transitions. [2018-11-28 23:41:48,404 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-11-28 23:41:48,404 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:41:48,405 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:41:48,405 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:41:48,405 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 23:41:48,405 INFO L794 eck$LassoCheckResult]: Stem: 192#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 190#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~post1, main_#t~mem3, main_#t~nondet5, main_#t~post4, main_#t~mem6, main_#t~post8, main_#t~mem7, main_#t~post10, main_#t~mem9, main_#t~mem11, main_#t~mem12, main_#t~post13, main_#t~post14, main_~#string_A~0.base, main_~#string_A~0.offset, main_~#string_B~0.base, main_~#string_B~0.offset, main_~i~0, main_~j~0, main_~nc_A~0, main_~nc_B~0, main_~found~0;call main_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.alloc(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.alloc(5);havoc main_~i~0;havoc main_~j~0;havoc main_~nc_A~0;havoc main_~nc_B~0;main_~found~0 := 0;main_~i~0 := 0; 183#L21-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 184#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 185#L21-3 assume !(main_~i~0 < 5); 181#L21-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 182#L23 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 193#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 194#L25-2 [2018-11-28 23:41:48,406 INFO L796 eck$LassoCheckResult]: Loop: 194#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 195#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 194#L25-2 [2018-11-28 23:41:48,406 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:41:48,406 INFO L82 PathProgramCache]: Analyzing trace with hash 265181045, now seen corresponding path program 1 times [2018-11-28 23:41:48,406 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:41:48,406 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:41:48,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:48,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:41:48,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:48,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:41:48,463 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:41:48,463 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:41:48,463 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 [2018-11-28 23:41:48,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:41:48,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:41:48,503 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:41:48,525 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:41:48,544 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:41:48,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-28 23:41:48,545 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 23:41:48,545 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:41:48,545 INFO L82 PathProgramCache]: Analyzing trace with hash 1951, now seen corresponding path program 2 times [2018-11-28 23:41:48,546 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:41:48,546 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:41:48,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:48,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:41:48,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:48,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:48,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:48,787 WARN L180 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2018-11-28 23:41:48,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 23:41:48,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-28 23:41:48,789 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. cyclomatic complexity: 10 Second operand 5 states. [2018-11-28 23:41:48,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:41:48,980 INFO L93 Difference]: Finished difference Result 30 states and 37 transitions. [2018-11-28 23:41:48,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 23:41:48,982 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 37 transitions. [2018-11-28 23:41:48,984 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-11-28 23:41:48,985 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 37 transitions. [2018-11-28 23:41:48,985 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2018-11-28 23:41:48,988 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2018-11-28 23:41:48,988 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 37 transitions. [2018-11-28 23:41:48,989 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:41:48,989 INFO L705 BuchiCegarLoop]: Abstraction has 30 states and 37 transitions. [2018-11-28 23:41:48,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 37 transitions. [2018-11-28 23:41:48,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2018-11-28 23:41:48,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-28 23:41:48,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2018-11-28 23:41:48,993 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 29 transitions. [2018-11-28 23:41:48,993 INFO L608 BuchiCegarLoop]: Abstraction has 24 states and 29 transitions. [2018-11-28 23:41:48,993 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-28 23:41:48,993 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 29 transitions. [2018-11-28 23:41:48,994 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-11-28 23:41:48,994 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:41:48,994 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:41:48,995 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-11-28 23:41:48,995 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 23:41:48,995 INFO L794 eck$LassoCheckResult]: Stem: 272#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 269#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~post1, main_#t~mem3, main_#t~nondet5, main_#t~post4, main_#t~mem6, main_#t~post8, main_#t~mem7, main_#t~post10, main_#t~mem9, main_#t~mem11, main_#t~mem12, main_#t~post13, main_#t~post14, main_~#string_A~0.base, main_~#string_A~0.offset, main_~#string_B~0.base, main_~#string_B~0.offset, main_~i~0, main_~j~0, main_~nc_A~0, main_~nc_B~0, main_~found~0;call main_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.alloc(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.alloc(5);havoc main_~i~0;havoc main_~j~0;havoc main_~nc_A~0;havoc main_~nc_B~0;main_~found~0 := 0;main_~i~0 := 0; 262#L21-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 263#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 264#L21-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 265#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 277#L21-3 assume !(main_~i~0 < 5); 260#L21-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 261#L23 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 275#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 276#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 273#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 274#L25-2 [2018-11-28 23:41:48,995 INFO L796 eck$LassoCheckResult]: Loop: 274#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 278#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 274#L25-2 [2018-11-28 23:41:48,996 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:41:48,996 INFO L82 PathProgramCache]: Analyzing trace with hash 780717205, now seen corresponding path program 1 times [2018-11-28 23:41:48,996 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:41:48,996 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:41:48,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:48,997 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:41:48,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:49,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:41:49,099 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 23:41:49,100 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:41:49,100 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:41:49,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:41:49,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:41:49,128 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:41:49,168 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 23:41:49,199 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:41:49,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-28 23:41:49,201 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 23:41:49,201 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:41:49,201 INFO L82 PathProgramCache]: Analyzing trace with hash 1951, now seen corresponding path program 3 times [2018-11-28 23:41:49,202 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:41:49,202 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:41:49,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:49,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:41:49,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:49,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:49,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:49,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 23:41:49,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-28 23:41:49,344 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. cyclomatic complexity: 10 Second operand 6 states. [2018-11-28 23:41:49,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:41:49,460 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2018-11-28 23:41:49,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 23:41:49,461 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 44 transitions. [2018-11-28 23:41:49,463 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-11-28 23:41:49,464 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 36 states and 44 transitions. [2018-11-28 23:41:49,464 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2018-11-28 23:41:49,465 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2018-11-28 23:41:49,465 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 44 transitions. [2018-11-28 23:41:49,466 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:41:49,466 INFO L705 BuchiCegarLoop]: Abstraction has 36 states and 44 transitions. [2018-11-28 23:41:49,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 44 transitions. [2018-11-28 23:41:49,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 28. [2018-11-28 23:41:49,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-28 23:41:49,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2018-11-28 23:41:49,470 INFO L728 BuchiCegarLoop]: Abstraction has 28 states and 33 transitions. [2018-11-28 23:41:49,470 INFO L608 BuchiCegarLoop]: Abstraction has 28 states and 33 transitions. [2018-11-28 23:41:49,470 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-28 23:41:49,470 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 33 transitions. [2018-11-28 23:41:49,472 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-11-28 23:41:49,472 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:41:49,472 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:41:49,474 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 1, 1, 1, 1, 1] [2018-11-28 23:41:49,474 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 23:41:49,474 INFO L794 eck$LassoCheckResult]: Stem: 375#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 372#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~post1, main_#t~mem3, main_#t~nondet5, main_#t~post4, main_#t~mem6, main_#t~post8, main_#t~mem7, main_#t~post10, main_#t~mem9, main_#t~mem11, main_#t~mem12, main_#t~post13, main_#t~post14, main_~#string_A~0.base, main_~#string_A~0.offset, main_~#string_B~0.base, main_~#string_B~0.offset, main_~i~0, main_~j~0, main_~nc_A~0, main_~nc_B~0, main_~found~0;call main_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.alloc(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.alloc(5);havoc main_~i~0;havoc main_~j~0;havoc main_~nc_A~0;havoc main_~nc_B~0;main_~found~0 := 0;main_~i~0 := 0; 364#L21-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 365#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 368#L21-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 383#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 366#L21-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 367#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 381#L21-3 assume !(main_~i~0 < 5); 362#L21-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 363#L23 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 378#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 379#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 380#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 384#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 376#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 377#L25-2 [2018-11-28 23:41:49,474 INFO L796 eck$LassoCheckResult]: Loop: 377#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 382#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 377#L25-2 [2018-11-28 23:41:49,474 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:41:49,475 INFO L82 PathProgramCache]: Analyzing trace with hash 2111137973, now seen corresponding path program 2 times [2018-11-28 23:41:49,475 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:41:49,475 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:41:49,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:49,477 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:41:49,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:49,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:41:49,566 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-28 23:41:49,566 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:41:49,566 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:41:49,579 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 23:41:49,597 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 23:41:49,597 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:41:49,600 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:41:49,623 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-28 23:41:49,642 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:41:49,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-28 23:41:49,643 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 23:41:49,643 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:41:49,643 INFO L82 PathProgramCache]: Analyzing trace with hash 1951, now seen corresponding path program 4 times [2018-11-28 23:41:49,643 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:41:49,644 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:41:49,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:49,645 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:41:49,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:49,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:49,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:49,811 WARN L180 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2018-11-28 23:41:49,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 23:41:49,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-28 23:41:49,858 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. cyclomatic complexity: 10 Second operand 7 states. [2018-11-28 23:41:49,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:41:49,956 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2018-11-28 23:41:49,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 23:41:49,961 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 51 transitions. [2018-11-28 23:41:49,962 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-11-28 23:41:49,963 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 42 states and 51 transitions. [2018-11-28 23:41:49,964 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2018-11-28 23:41:49,964 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2018-11-28 23:41:49,964 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 51 transitions. [2018-11-28 23:41:49,964 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:41:49,964 INFO L705 BuchiCegarLoop]: Abstraction has 42 states and 51 transitions. [2018-11-28 23:41:49,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 51 transitions. [2018-11-28 23:41:49,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 32. [2018-11-28 23:41:49,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-28 23:41:49,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2018-11-28 23:41:49,969 INFO L728 BuchiCegarLoop]: Abstraction has 32 states and 37 transitions. [2018-11-28 23:41:49,969 INFO L608 BuchiCegarLoop]: Abstraction has 32 states and 37 transitions. [2018-11-28 23:41:49,969 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-28 23:41:49,970 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 37 transitions. [2018-11-28 23:41:49,971 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-11-28 23:41:49,971 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:41:49,971 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:41:49,972 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 4, 3, 1, 1, 1, 1, 1] [2018-11-28 23:41:49,972 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 23:41:49,972 INFO L794 eck$LassoCheckResult]: Stem: 499#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 497#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~post1, main_#t~mem3, main_#t~nondet5, main_#t~post4, main_#t~mem6, main_#t~post8, main_#t~mem7, main_#t~post10, main_#t~mem9, main_#t~mem11, main_#t~mem12, main_#t~post13, main_#t~post14, main_~#string_A~0.base, main_~#string_A~0.offset, main_~#string_B~0.base, main_~#string_B~0.offset, main_~i~0, main_~j~0, main_~nc_A~0, main_~nc_B~0, main_~found~0;call main_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.alloc(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.alloc(5);havoc main_~i~0;havoc main_~j~0;havoc main_~nc_A~0;havoc main_~nc_B~0;main_~found~0 := 0;main_~i~0 := 0; 489#L21-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 490#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 491#L21-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 492#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 509#L21-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 508#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 507#L21-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 504#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 503#L21-3 assume !(main_~i~0 < 5); 487#L21-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 488#L23 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 500#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 501#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 502#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 513#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 512#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 511#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 510#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 506#L25-2 [2018-11-28 23:41:49,972 INFO L796 eck$LassoCheckResult]: Loop: 506#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 505#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 506#L25-2 [2018-11-28 23:41:49,972 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:41:49,973 INFO L82 PathProgramCache]: Analyzing trace with hash 213314517, now seen corresponding path program 3 times [2018-11-28 23:41:49,973 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:41:49,973 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:41:49,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:49,974 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:41:49,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:49,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:41:50,094 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-28 23:41:50,095 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:41:50,095 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:41:50,105 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-28 23:41:50,145 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-28 23:41:50,145 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:41:50,147 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:41:50,162 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-28 23:41:50,190 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:41:50,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-28 23:41:50,191 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 23:41:50,191 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:41:50,191 INFO L82 PathProgramCache]: Analyzing trace with hash 1951, now seen corresponding path program 5 times [2018-11-28 23:41:50,192 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:41:50,192 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:41:50,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:50,194 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:41:50,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:50,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:50,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:50,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 23:41:50,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-28 23:41:50,260 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. cyclomatic complexity: 10 Second operand 8 states. [2018-11-28 23:41:50,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:41:50,390 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2018-11-28 23:41:50,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 23:41:50,392 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 56 transitions. [2018-11-28 23:41:50,393 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-11-28 23:41:50,395 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 46 states and 56 transitions. [2018-11-28 23:41:50,395 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2018-11-28 23:41:50,395 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2018-11-28 23:41:50,395 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 56 transitions. [2018-11-28 23:41:50,397 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:41:50,397 INFO L705 BuchiCegarLoop]: Abstraction has 46 states and 56 transitions. [2018-11-28 23:41:50,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 56 transitions. [2018-11-28 23:41:50,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 36. [2018-11-28 23:41:50,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-28 23:41:50,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2018-11-28 23:41:50,402 INFO L728 BuchiCegarLoop]: Abstraction has 36 states and 41 transitions. [2018-11-28 23:41:50,402 INFO L608 BuchiCegarLoop]: Abstraction has 36 states and 41 transitions. [2018-11-28 23:41:50,402 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-28 23:41:50,402 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 41 transitions. [2018-11-28 23:41:50,404 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-11-28 23:41:50,404 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:41:50,404 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:41:50,405 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 4, 1, 1, 1, 1, 1] [2018-11-28 23:41:50,405 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 23:41:50,405 INFO L794 eck$LassoCheckResult]: Stem: 645#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 642#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~post1, main_#t~mem3, main_#t~nondet5, main_#t~post4, main_#t~mem6, main_#t~post8, main_#t~mem7, main_#t~post10, main_#t~mem9, main_#t~mem11, main_#t~mem12, main_#t~post13, main_#t~post14, main_~#string_A~0.base, main_~#string_A~0.offset, main_~#string_B~0.base, main_~#string_B~0.offset, main_~i~0, main_~j~0, main_~nc_A~0, main_~nc_B~0, main_~found~0;call main_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.alloc(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.alloc(5);havoc main_~i~0;havoc main_~j~0;havoc main_~nc_A~0;havoc main_~nc_B~0;main_~found~0 := 0;main_~i~0 := 0; 635#L21-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 636#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 637#L21-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 638#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 660#L21-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 658#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 656#L21-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 655#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 652#L21-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 651#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 650#L21-3 assume !(main_~i~0 < 5); 633#L21-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 634#L23 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 648#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 649#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 646#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 647#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 663#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 662#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 661#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 659#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 657#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 654#L25-2 [2018-11-28 23:41:50,405 INFO L796 eck$LassoCheckResult]: Loop: 654#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 653#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 654#L25-2 [2018-11-28 23:41:50,406 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:41:50,406 INFO L82 PathProgramCache]: Analyzing trace with hash 1212159477, now seen corresponding path program 4 times [2018-11-28 23:41:50,407 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:41:50,407 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:41:50,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:50,409 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:41:50,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:50,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:50,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:50,456 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:41:50,456 INFO L82 PathProgramCache]: Analyzing trace with hash 1951, now seen corresponding path program 6 times [2018-11-28 23:41:50,457 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:41:50,457 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:41:50,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:50,458 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:41:50,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:50,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:50,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:50,466 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:41:50,466 INFO L82 PathProgramCache]: Analyzing trace with hash 949121171, now seen corresponding path program 5 times [2018-11-28 23:41:50,466 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:41:50,466 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:41:50,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:50,467 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:41:50,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:50,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:41:50,802 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-28 23:41:50,802 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:41:50,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-28 23:41:50,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 23:41:50,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-28 23:41:50,878 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. cyclomatic complexity: 10 Second operand 9 states. [2018-11-28 23:41:51,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:41:51,086 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2018-11-28 23:41:51,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 23:41:51,088 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 41 transitions. [2018-11-28 23:41:51,089 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-11-28 23:41:51,090 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 37 states and 41 transitions. [2018-11-28 23:41:51,090 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2018-11-28 23:41:51,115 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2018-11-28 23:41:51,115 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 41 transitions. [2018-11-28 23:41:51,116 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:41:51,116 INFO L705 BuchiCegarLoop]: Abstraction has 37 states and 41 transitions. [2018-11-28 23:41:51,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 41 transitions. [2018-11-28 23:41:51,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2018-11-28 23:41:51,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-28 23:41:51,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2018-11-28 23:41:51,127 INFO L728 BuchiCegarLoop]: Abstraction has 36 states and 40 transitions. [2018-11-28 23:41:51,127 INFO L608 BuchiCegarLoop]: Abstraction has 36 states and 40 transitions. [2018-11-28 23:41:51,127 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-28 23:41:51,127 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 40 transitions. [2018-11-28 23:41:51,127 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-11-28 23:41:51,128 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:41:51,130 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:41:51,131 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:41:51,131 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 23:41:51,132 INFO L794 eck$LassoCheckResult]: Stem: 733#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 731#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~post1, main_#t~mem3, main_#t~nondet5, main_#t~post4, main_#t~mem6, main_#t~post8, main_#t~mem7, main_#t~post10, main_#t~mem9, main_#t~mem11, main_#t~mem12, main_#t~post13, main_#t~post14, main_~#string_A~0.base, main_~#string_A~0.offset, main_~#string_B~0.base, main_~#string_B~0.offset, main_~i~0, main_~j~0, main_~nc_A~0, main_~nc_B~0, main_~found~0;call main_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.alloc(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.alloc(5);havoc main_~i~0;havoc main_~j~0;havoc main_~nc_A~0;havoc main_~nc_B~0;main_~found~0 := 0;main_~i~0 := 0; 722#L21-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 723#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 724#L21-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 725#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 726#L21-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 750#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 749#L21-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 748#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 747#L21-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 738#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 737#L21-3 assume !(main_~i~0 < 5); 720#L21-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 721#L23 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 734#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 735#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 736#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 746#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 745#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 744#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 743#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 742#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 741#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 740#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 739#L25-3 assume !(main_~i~0 < 5); 732#L25-4 call main_#t~mem6 := read~int(main_~#string_B~0.base, 4 + main_~#string_B~0.offset, 1); 717#L27 assume !!(0 == main_#t~mem6);havoc main_#t~mem6;main_~nc_A~0 := 0; 718#L30-3 [2018-11-28 23:41:51,132 INFO L796 eck$LassoCheckResult]: Loop: 718#L30-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 719#L30-1 assume !!(0 != main_#t~mem7);havoc main_#t~mem7;main_#t~post8 := main_~nc_A~0;main_~nc_A~0 := 1 + main_#t~post8;havoc main_#t~post8; 718#L30-3 [2018-11-28 23:41:51,136 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:41:51,136 INFO L82 PathProgramCache]: Analyzing trace with hash 1572377782, now seen corresponding path program 1 times [2018-11-28 23:41:51,137 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:41:51,137 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:41:51,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:51,139 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:41:51,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:51,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:51,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:51,176 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:41:51,176 INFO L82 PathProgramCache]: Analyzing trace with hash 2406, now seen corresponding path program 1 times [2018-11-28 23:41:51,176 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:41:51,176 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:41:51,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:51,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:41:51,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:51,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:51,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:51,185 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:41:51,185 INFO L82 PathProgramCache]: Analyzing trace with hash -773438245, now seen corresponding path program 1 times [2018-11-28 23:41:51,185 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:41:51,185 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:41:51,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:51,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:41:51,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:51,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:51,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:55,002 WARN L180 SmtUtils]: Spent 3.65 s on a formula simplification. DAG size of input: 213 DAG size of output: 161 [2018-11-28 23:41:55,201 WARN L180 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2018-11-28 23:41:55,204 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:41:55,204 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:41:55,204 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:41:55,205 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:41:55,205 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:41:55,205 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:41:55,205 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:41:55,205 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:41:55,205 INFO L131 ssoRankerPreferences]: Filename of dumped script: string_false-unreach-call_true-termination.i_Iteration8_Lasso [2018-11-28 23:41:55,206 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:41:55,206 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:41:55,211 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:55,226 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:55,229 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:55,231 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:55,240 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:55,245 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:55,247 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:55,250 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:55,253 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:55,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:55,258 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:55,261 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:55,266 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:55,273 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:55,275 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:55,281 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:55,283 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:55,285 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:55,290 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:55,500 WARN L180 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 39 [2018-11-28 23:41:55,550 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:55,567 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:41:55,828 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:41:55,829 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:41:55,829 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:41:55,830 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:55,830 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:41:55,831 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:41:55,833 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:55,833 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:55,833 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:41:55,834 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:41:55,835 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:41:55,836 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:41:55,837 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:55,837 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:41:55,837 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:41:55,837 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:55,838 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:55,841 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:41:55,841 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:41:55,841 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:41:55,842 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:41:55,842 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:55,842 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:41:55,846 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:41:55,846 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:55,846 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:55,846 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:41:55,847 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:41:55,848 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:41:55,848 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:41:55,849 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:55,849 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:41:55,849 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:55,849 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:55,850 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:41:55,850 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:41:55,856 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:41:55,856 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:41:55,857 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:55,857 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:41:55,857 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:41:55,857 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:55,857 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:55,858 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:41:55,858 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:41:55,862 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:41:55,862 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:41:55,863 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:55,863 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:41:55,863 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:41:55,863 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:55,863 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:55,864 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:41:55,864 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:41:55,864 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:41:55,869 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:41:55,870 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:55,871 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:41:55,872 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:41:55,872 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:55,872 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:55,872 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:41:55,872 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:41:55,875 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:41:55,876 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:41:55,876 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:55,877 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:41:55,877 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:41:55,877 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:55,877 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:55,877 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:41:55,877 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:41:55,881 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:41:55,881 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:41:55,882 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:55,882 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:41:55,882 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:41:55,882 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:55,882 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:55,883 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:41:55,883 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:41:55,883 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:41:55,887 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:41:55,887 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:55,887 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:41:55,888 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:41:55,888 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:55,888 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:55,888 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:41:55,888 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:41:55,891 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:41:55,891 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:41:55,892 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:55,892 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:41:55,892 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:41:55,892 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:55,892 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:55,893 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:41:55,893 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:41:55,893 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:41:55,893 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:41:55,896 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:55,896 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:41:55,896 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:41:55,896 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:55,897 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:55,897 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:41:55,897 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:41:55,897 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:41:55,901 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:41:55,901 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:55,902 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:41:55,902 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:55,902 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:55,903 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:41:55,903 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:41:55,908 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:41:55,908 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:41:55,909 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:55,912 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:41:55,912 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:41:55,912 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:55,912 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:55,913 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:41:55,913 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:41:55,913 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:41:55,914 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:41:55,914 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:55,914 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:41:55,914 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:41:55,914 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:55,915 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:55,918 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:41:55,918 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:41:55,919 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:41:55,919 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:41:55,920 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:55,920 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:41:55,920 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:41:55,920 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:55,920 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:55,920 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:41:55,920 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:41:55,924 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:41:55,925 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:41:55,925 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:55,925 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:41:55,925 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:41:55,925 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:55,925 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:55,926 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:41:55,926 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:41:55,926 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:41:55,929 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:41:55,929 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:55,929 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:41:55,930 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:55,930 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:55,931 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:41:55,931 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:41:55,935 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:41:55,936 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:41:55,936 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:55,936 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:41:55,937 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:55,937 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:55,940 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:41:55,940 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:41:55,947 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:41:55,947 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:41:55,951 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:55,951 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:41:55,951 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:55,952 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:55,952 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:41:55,956 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:41:55,958 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:41:55,959 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:41:55,959 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:55,959 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:41:55,959 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:55,960 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:55,960 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:41:55,961 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:41:55,962 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:41:55,962 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:41:55,963 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:55,963 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:41:55,963 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:55,963 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:55,964 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:41:55,964 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:41:55,966 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:41:55,967 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:41:55,967 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:55,967 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:41:55,967 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:55,967 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:55,968 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:41:55,968 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:41:55,971 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:41:55,972 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:41:55,972 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:55,972 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:41:55,973 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:55,973 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:55,974 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:41:55,974 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:41:55,975 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:41:55,975 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:41:55,976 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:55,976 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:41:55,976 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:41:55,976 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:55,976 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:55,977 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:41:55,977 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:41:55,977 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:41:55,978 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:41:55,978 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:55,978 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:41:55,978 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:55,978 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:55,979 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:41:55,979 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:41:55,981 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:41:55,982 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:41:55,982 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:41:55,982 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:41:55,982 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:41:55,983 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:41:55,984 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:41:55,985 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:41:55,995 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:41:56,012 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2018-11-28 23:41:56,012 INFO L444 ModelExtractionUtils]: 3 out of 13 variables were initially zero. Simplification set additionally 6 variables to zero. [2018-11-28 23:41:56,013 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:41:56,013 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:41:56,014 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:41:56,014 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#string_A~0.base)_2, ULTIMATE.start_main_~#string_A~0.offset, ULTIMATE.start_main_~nc_A~0) = 1*v_rep(select #length ULTIMATE.start_main_~#string_A~0.base)_2 - 1*ULTIMATE.start_main_~#string_A~0.offset - 1*ULTIMATE.start_main_~nc_A~0 Supporting invariants [] [2018-11-28 23:41:56,126 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2018-11-28 23:41:56,136 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-28 23:41:56,345 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:41:56,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:41:56,376 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:41:56,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:41:56,389 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:41:56,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:41:56,402 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 [2018-11-28 23:41:56,402 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 36 states and 40 transitions. cyclomatic complexity: 8 Second operand 3 states. [2018-11-28 23:41:56,431 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 36 states and 40 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 44 states and 52 transitions. Complement of second has 4 states. [2018-11-28 23:41:56,433 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 [2018-11-28 23:41:56,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:41:56,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2018-11-28 23:41:56,434 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 28 letters. Loop has 2 letters. [2018-11-28 23:41:56,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:41:56,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 30 letters. Loop has 2 letters. [2018-11-28 23:41:56,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:41:56,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 28 letters. Loop has 4 letters. [2018-11-28 23:41:56,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:41:56,439 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 52 transitions. [2018-11-28 23:41:56,439 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-11-28 23:41:56,442 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 38 states and 43 transitions. [2018-11-28 23:41:56,442 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2018-11-28 23:41:56,442 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2018-11-28 23:41:56,442 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 43 transitions. [2018-11-28 23:41:56,443 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:41:56,444 INFO L705 BuchiCegarLoop]: Abstraction has 38 states and 43 transitions. [2018-11-28 23:41:56,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 43 transitions. [2018-11-28 23:41:56,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-11-28 23:41:56,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-28 23:41:56,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2018-11-28 23:41:56,449 INFO L728 BuchiCegarLoop]: Abstraction has 38 states and 43 transitions. [2018-11-28 23:41:56,449 INFO L608 BuchiCegarLoop]: Abstraction has 38 states and 43 transitions. [2018-11-28 23:41:56,449 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-28 23:41:56,449 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 43 transitions. [2018-11-28 23:41:56,449 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-11-28 23:41:56,449 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:41:56,450 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:41:56,453 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:41:56,453 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 23:41:56,454 INFO L794 eck$LassoCheckResult]: Stem: 940#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 938#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~post1, main_#t~mem3, main_#t~nondet5, main_#t~post4, main_#t~mem6, main_#t~post8, main_#t~mem7, main_#t~post10, main_#t~mem9, main_#t~mem11, main_#t~mem12, main_#t~post13, main_#t~post14, main_~#string_A~0.base, main_~#string_A~0.offset, main_~#string_B~0.base, main_~#string_B~0.offset, main_~i~0, main_~j~0, main_~nc_A~0, main_~nc_B~0, main_~found~0;call main_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.alloc(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.alloc(5);havoc main_~i~0;havoc main_~j~0;havoc main_~nc_A~0;havoc main_~nc_B~0;main_~found~0 := 0;main_~i~0 := 0; 930#L21-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 931#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 932#L21-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 933#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 958#L21-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 957#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 956#L21-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 955#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 954#L21-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 951#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 950#L21-3 assume !(main_~i~0 < 5); 928#L21-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 929#L23 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 943#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 944#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 941#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 942#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 953#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 952#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 949#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 948#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 947#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 946#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 945#L25-3 assume !(main_~i~0 < 5); 939#L25-4 call main_#t~mem6 := read~int(main_~#string_B~0.base, 4 + main_~#string_B~0.offset, 1); 923#L27 assume !!(0 == main_#t~mem6);havoc main_#t~mem6;main_~nc_A~0 := 0; 924#L30-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 926#L30-1 assume !(0 != main_#t~mem7);havoc main_#t~mem7; 921#L30-4 main_~nc_B~0 := 0; 922#L34-3 [2018-11-28 23:41:56,454 INFO L796 eck$LassoCheckResult]: Loop: 922#L34-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 937#L34-1 assume !!(0 != main_#t~mem9);havoc main_#t~mem9;main_#t~post10 := main_~nc_B~0;main_~nc_B~0 := 1 + main_#t~post10;havoc main_#t~post10; 922#L34-3 [2018-11-28 23:41:56,454 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:41:56,454 INFO L82 PathProgramCache]: Analyzing trace with hash 1793218173, now seen corresponding path program 1 times [2018-11-28 23:41:56,454 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:41:56,454 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:41:56,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:56,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:41:56,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:56,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:56,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:56,494 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:41:56,494 INFO L82 PathProgramCache]: Analyzing trace with hash 2854, now seen corresponding path program 1 times [2018-11-28 23:41:56,494 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:41:56,494 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:41:56,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:56,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:41:56,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:56,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:56,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:56,504 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:41:56,505 INFO L82 PathProgramCache]: Analyzing trace with hash 1000780450, now seen corresponding path program 1 times [2018-11-28 23:41:56,505 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:41:56,505 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:41:56,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:56,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:41:56,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:56,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:56,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:42:00,842 WARN L180 SmtUtils]: Spent 4.21 s on a formula simplification. DAG size of input: 224 DAG size of output: 171 [2018-11-28 23:42:01,047 WARN L180 SmtUtils]: Spent 193.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2018-11-28 23:42:01,049 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:42:01,049 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:42:01,049 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:42:01,049 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:42:01,049 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:42:01,050 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:42:01,050 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:42:01,050 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:42:01,050 INFO L131 ssoRankerPreferences]: Filename of dumped script: string_false-unreach-call_true-termination.i_Iteration9_Lasso [2018-11-28 23:42:01,050 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:42:01,050 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:42:01,054 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:01,069 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:01,071 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:01,072 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:01,075 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:01,076 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:01,117 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:01,142 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:01,173 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:01,176 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:01,177 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:01,179 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:01,180 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:01,181 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:01,183 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:01,185 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:01,186 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:01,452 WARN L180 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 40 [2018-11-28 23:42:01,474 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:01,478 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:01,480 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:01,708 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:42:01,709 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:42:01,709 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:01,710 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:01,710 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:42:01,710 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:01,710 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:01,710 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:01,710 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:42:01,710 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:42:01,716 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:01,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 [2018-11-28 23:42:01,717 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:01,717 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:01,717 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:01,717 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:01,718 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:42:01,718 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:42:01,719 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:01,720 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:01,720 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:01,720 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:42:01,720 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:01,720 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:01,720 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:01,721 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:42:01,721 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:42:01,721 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:01,721 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:01,722 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:01,722 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:42:01,722 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:01,722 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:01,722 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:01,723 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:42:01,723 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:42:01,723 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:01,723 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:01,724 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:01,724 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:42:01,724 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:01,724 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:01,724 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:01,724 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:42:01,724 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:42:01,725 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:01,725 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:01,725 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:01,726 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:01,726 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:01,726 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:01,727 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:42:01,727 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:42:01,728 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:01,728 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:01,728 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:01,728 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:42:01,729 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:01,729 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:01,729 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:01,729 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:42:01,729 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:42:01,730 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:01,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 [2018-11-28 23:42:01,730 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:01,730 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:42:01,730 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:01,731 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:01,731 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:01,731 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:42:01,731 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:42:01,731 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:01,732 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:01,732 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:01,732 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:42:01,732 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:01,732 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:01,733 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:01,733 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:42:01,733 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:42:01,733 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:01,734 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:01,734 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:01,734 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:42:01,734 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:01,734 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:01,735 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:01,735 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:42:01,735 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:42:01,735 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:01,736 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:01,736 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:01,736 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:42:01,736 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:01,736 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:01,737 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:01,737 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:42:01,737 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:42:01,737 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:01,738 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:01,738 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:01,738 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:42:01,738 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:01,738 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:01,739 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:01,739 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:42:01,739 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:42:01,739 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:01,740 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:01,740 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:01,740 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:42:01,741 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:01,741 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:01,741 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:01,741 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:42:01,741 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:42:01,742 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:01,742 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:01,742 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:01,742 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:42:01,743 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:01,743 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:01,743 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:01,743 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:42:01,743 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:42:01,743 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:01,744 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:01,744 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:01,744 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:42:01,744 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:01,744 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:01,744 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:01,745 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:42:01,745 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:42:01,745 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:01,746 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:01,746 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:01,746 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:42:01,746 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:01,746 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:01,746 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:01,747 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:42:01,747 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:42:01,747 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:01,748 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:01,748 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:01,748 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:01,749 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:01,749 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:01,749 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:42:01,750 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:42:01,751 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:01,751 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:01,752 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:01,752 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:01,752 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:01,752 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:01,754 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:42:01,754 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:42:01,772 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:42:01,801 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-28 23:42:01,801 INFO L444 ModelExtractionUtils]: 19 out of 25 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-28 23:42:01,801 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:42:01,802 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:42:01,802 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:42:01,802 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#string_B~0.base)_3, ULTIMATE.start_main_~#string_B~0.offset, ULTIMATE.start_main_~nc_B~0) = 1*v_rep(select #length ULTIMATE.start_main_~#string_B~0.base)_3 - 1*ULTIMATE.start_main_~#string_B~0.offset - 1*ULTIMATE.start_main_~nc_B~0 Supporting invariants [] [2018-11-28 23:42:01,928 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2018-11-28 23:42:01,943 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-28 23:42:02,221 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:42:02,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:42:02,259 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:42:02,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:42:02,276 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:42:02,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:42:02,436 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 [2018-11-28 23:42:02,436 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 38 states and 43 transitions. cyclomatic complexity: 9 Second operand 3 states. [2018-11-28 23:42:02,559 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 38 states and 43 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 43 states and 51 transitions. Complement of second has 4 states. [2018-11-28 23:42:02,560 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 [2018-11-28 23:42:02,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:42:02,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2018-11-28 23:42:02,561 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 31 letters. Loop has 2 letters. [2018-11-28 23:42:02,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:42:02,561 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 33 letters. Loop has 2 letters. [2018-11-28 23:42:02,564 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:42:02,564 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 31 letters. Loop has 4 letters. [2018-11-28 23:42:02,564 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:42:02,565 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 51 transitions. [2018-11-28 23:42:02,565 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 23:42:02,566 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 40 states and 46 transitions. [2018-11-28 23:42:02,566 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2018-11-28 23:42:02,566 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2018-11-28 23:42:02,566 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 46 transitions. [2018-11-28 23:42:02,571 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:42:02,571 INFO L705 BuchiCegarLoop]: Abstraction has 40 states and 46 transitions. [2018-11-28 23:42:02,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 46 transitions. [2018-11-28 23:42:02,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-11-28 23:42:02,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-28 23:42:02,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2018-11-28 23:42:02,576 INFO L728 BuchiCegarLoop]: Abstraction has 40 states and 46 transitions. [2018-11-28 23:42:02,576 INFO L608 BuchiCegarLoop]: Abstraction has 40 states and 46 transitions. [2018-11-28 23:42:02,576 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-28 23:42:02,576 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 46 transitions. [2018-11-28 23:42:02,577 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 23:42:02,577 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:42:02,577 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:42:02,578 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:42:02,578 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 23:42:02,578 INFO L794 eck$LassoCheckResult]: Stem: 1158#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1153#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~post1, main_#t~mem3, main_#t~nondet5, main_#t~post4, main_#t~mem6, main_#t~post8, main_#t~mem7, main_#t~post10, main_#t~mem9, main_#t~mem11, main_#t~mem12, main_#t~post13, main_#t~post14, main_~#string_A~0.base, main_~#string_A~0.offset, main_~#string_B~0.base, main_~#string_B~0.offset, main_~i~0, main_~j~0, main_~nc_A~0, main_~nc_B~0, main_~found~0;call main_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.alloc(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.alloc(5);havoc main_~i~0;havoc main_~j~0;havoc main_~nc_A~0;havoc main_~nc_B~0;main_~found~0 := 0;main_~i~0 := 0; 1146#L21-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 1147#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1148#L21-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 1149#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1176#L21-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 1175#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1174#L21-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 1173#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1172#L21-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 1169#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1168#L21-3 assume !(main_~i~0 < 5); 1144#L21-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 1145#L23 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 1161#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 1162#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1159#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 1160#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1171#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 1170#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1167#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 1166#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1165#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 1164#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1163#L25-3 assume !(main_~i~0 < 5); 1157#L25-4 call main_#t~mem6 := read~int(main_~#string_B~0.base, 4 + main_~#string_B~0.offset, 1); 1139#L27 assume !!(0 == main_#t~mem6);havoc main_#t~mem6;main_~nc_A~0 := 0; 1140#L30-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 1142#L30-1 assume !(0 != main_#t~mem7);havoc main_#t~mem7; 1137#L30-4 main_~nc_B~0 := 0; 1138#L34-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 1155#L34-1 assume !(0 != main_#t~mem9);havoc main_#t~mem9; 1150#L34-4 assume !!(main_~nc_B~0 >= main_~nc_A~0);main_~j~0 := 0;main_~i~0 := main_~j~0; 1151#L43-2 [2018-11-28 23:42:02,581 INFO L796 eck$LassoCheckResult]: Loop: 1151#L43-2 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0);call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0, 1); 1152#L43 assume main_#t~mem11 == main_#t~mem12;havoc main_#t~mem11;havoc main_#t~mem12;main_#t~post13 := main_~i~0;main_~i~0 := 1 + main_#t~post13;havoc main_#t~post13;main_#t~post14 := main_~j~0;main_~j~0 := 1 + main_#t~post14;havoc main_#t~post14; 1151#L43-2 [2018-11-28 23:42:02,581 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:42:02,581 INFO L82 PathProgramCache]: Analyzing trace with hash 959422888, now seen corresponding path program 1 times [2018-11-28 23:42:02,581 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:42:02,581 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:42:02,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:02,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:42:02,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:02,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:42:02,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:42:02,635 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:42:02,638 INFO L82 PathProgramCache]: Analyzing trace with hash 3556, now seen corresponding path program 1 times [2018-11-28 23:42:02,638 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:42:02,638 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:42:02,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:02,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:42:02,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:02,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:42:02,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:42:02,654 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:42:02,657 INFO L82 PathProgramCache]: Analyzing trace with hash -1412570677, now seen corresponding path program 1 times [2018-11-28 23:42:02,657 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:42:02,657 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:42:02,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:02,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:42:02,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:02,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:42:02,880 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-11-28 23:42:02,880 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:42:02,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 23:42:03,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 23:42:03,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-28 23:42:03,029 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. cyclomatic complexity: 10 Second operand 4 states. [2018-11-28 23:42:03,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:42:03,045 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2018-11-28 23:42:03,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 23:42:03,046 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 56 transitions. [2018-11-28 23:42:03,047 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 23:42:03,048 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 41 states and 46 transitions. [2018-11-28 23:42:03,048 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2018-11-28 23:42:03,048 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2018-11-28 23:42:03,048 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 46 transitions. [2018-11-28 23:42:03,048 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:42:03,048 INFO L705 BuchiCegarLoop]: Abstraction has 41 states and 46 transitions. [2018-11-28 23:42:03,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 46 transitions. [2018-11-28 23:42:03,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2018-11-28 23:42:03,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-28 23:42:03,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2018-11-28 23:42:03,053 INFO L728 BuchiCegarLoop]: Abstraction has 40 states and 45 transitions. [2018-11-28 23:42:03,055 INFO L608 BuchiCegarLoop]: Abstraction has 40 states and 45 transitions. [2018-11-28 23:42:03,055 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-28 23:42:03,055 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 45 transitions. [2018-11-28 23:42:03,056 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 23:42:03,056 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:42:03,056 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:42:03,057 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:42:03,057 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 23:42:03,057 INFO L794 eck$LassoCheckResult]: Stem: 1256#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1254#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~post1, main_#t~mem3, main_#t~nondet5, main_#t~post4, main_#t~mem6, main_#t~post8, main_#t~mem7, main_#t~post10, main_#t~mem9, main_#t~mem11, main_#t~mem12, main_#t~post13, main_#t~post14, main_~#string_A~0.base, main_~#string_A~0.offset, main_~#string_B~0.base, main_~#string_B~0.offset, main_~i~0, main_~j~0, main_~nc_A~0, main_~nc_B~0, main_~found~0;call main_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.alloc(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.alloc(5);havoc main_~i~0;havoc main_~j~0;havoc main_~nc_A~0;havoc main_~nc_B~0;main_~found~0 := 0;main_~i~0 := 0; 1244#L21-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 1245#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1246#L21-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 1247#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1274#L21-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 1273#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1271#L21-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 1269#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1267#L21-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 1264#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1263#L21-3 assume !(main_~i~0 < 5); 1242#L21-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 1243#L23 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 1257#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 1258#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1259#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 1272#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1270#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 1268#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1266#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 1265#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1262#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 1261#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1260#L25-3 assume !(main_~i~0 < 5); 1255#L25-4 call main_#t~mem6 := read~int(main_~#string_B~0.base, 4 + main_~#string_B~0.offset, 1); 1241#L27 assume !!(0 == main_#t~mem6);havoc main_#t~mem6;main_~nc_A~0 := 0; 1237#L30-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 1238#L30-1 assume !!(0 != main_#t~mem7);havoc main_#t~mem7;main_#t~post8 := main_~nc_A~0;main_~nc_A~0 := 1 + main_#t~post8;havoc main_#t~post8; 1239#L30-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 1240#L30-1 assume !(0 != main_#t~mem7);havoc main_#t~mem7; 1235#L30-4 main_~nc_B~0 := 0; 1236#L34-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 1252#L34-1 assume !(0 != main_#t~mem9);havoc main_#t~mem9; 1248#L34-4 assume !!(main_~nc_B~0 >= main_~nc_A~0);main_~j~0 := 0;main_~i~0 := main_~j~0; 1249#L43-2 [2018-11-28 23:42:03,057 INFO L796 eck$LassoCheckResult]: Loop: 1249#L43-2 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0);call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0, 1); 1250#L43 assume main_#t~mem11 == main_#t~mem12;havoc main_#t~mem11;havoc main_#t~mem12;main_#t~post13 := main_~i~0;main_~i~0 := 1 + main_#t~post13;havoc main_#t~post13;main_#t~post14 := main_~j~0;main_~j~0 := 1 + main_#t~post14;havoc main_#t~post14; 1249#L43-2 [2018-11-28 23:42:03,058 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:42:03,064 INFO L82 PathProgramCache]: Analyzing trace with hash 94364173, now seen corresponding path program 1 times [2018-11-28 23:42:03,064 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:42:03,064 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:42:03,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:03,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:42:03,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:03,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:42:03,262 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-11-28 23:42:03,263 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:42:03,263 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:42:03,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:42:03,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:42:03,316 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:42:03,390 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-11-28 23:42:03,422 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 23:42:03,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2018-11-28 23:42:03,423 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 23:42:03,423 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:42:03,423 INFO L82 PathProgramCache]: Analyzing trace with hash 3556, now seen corresponding path program 2 times [2018-11-28 23:42:03,423 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:42:03,423 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:42:03,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:03,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:42:03,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:03,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:42:03,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:42:03,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 23:42:03,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-28 23:42:03,513 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. cyclomatic complexity: 9 Second operand 9 states. [2018-11-28 23:42:03,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:42:03,593 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2018-11-28 23:42:03,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 23:42:03,595 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 48 transitions. [2018-11-28 23:42:03,595 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 23:42:03,596 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 42 states and 46 transitions. [2018-11-28 23:42:03,596 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2018-11-28 23:42:03,596 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2018-11-28 23:42:03,596 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 46 transitions. [2018-11-28 23:42:03,596 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:42:03,596 INFO L705 BuchiCegarLoop]: Abstraction has 42 states and 46 transitions. [2018-11-28 23:42:03,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 46 transitions. [2018-11-28 23:42:03,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2018-11-28 23:42:03,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-28 23:42:03,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2018-11-28 23:42:03,599 INFO L728 BuchiCegarLoop]: Abstraction has 40 states and 44 transitions. [2018-11-28 23:42:03,599 INFO L608 BuchiCegarLoop]: Abstraction has 40 states and 44 transitions. [2018-11-28 23:42:03,599 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-28 23:42:03,600 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 44 transitions. [2018-11-28 23:42:03,600 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 23:42:03,600 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:42:03,600 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:42:03,601 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:42:03,601 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 23:42:03,601 INFO L794 eck$LassoCheckResult]: Stem: 1459#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1457#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~post1, main_#t~mem3, main_#t~nondet5, main_#t~post4, main_#t~mem6, main_#t~post8, main_#t~mem7, main_#t~post10, main_#t~mem9, main_#t~mem11, main_#t~mem12, main_#t~post13, main_#t~post14, main_~#string_A~0.base, main_~#string_A~0.offset, main_~#string_B~0.base, main_~#string_B~0.offset, main_~i~0, main_~j~0, main_~nc_A~0, main_~nc_B~0, main_~found~0;call main_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.alloc(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.alloc(5);havoc main_~i~0;havoc main_~j~0;havoc main_~nc_A~0;havoc main_~nc_B~0;main_~found~0 := 0;main_~i~0 := 0; 1447#L21-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 1448#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1449#L21-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 1450#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1477#L21-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 1476#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1474#L21-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 1472#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1470#L21-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 1466#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1465#L21-3 assume !(main_~i~0 < 5); 1445#L21-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 1446#L23 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 1460#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 1461#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1462#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 1475#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1473#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 1471#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1469#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 1468#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1467#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 1464#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1463#L25-3 assume !(main_~i~0 < 5); 1458#L25-4 call main_#t~mem6 := read~int(main_~#string_B~0.base, 4 + main_~#string_B~0.offset, 1); 1440#L27 assume !!(0 == main_#t~mem6);havoc main_#t~mem6;main_~nc_A~0 := 0; 1441#L30-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 1442#L30-1 assume !!(0 != main_#t~mem7);havoc main_#t~mem7;main_#t~post8 := main_~nc_A~0;main_~nc_A~0 := 1 + main_#t~post8;havoc main_#t~post8; 1443#L30-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 1444#L30-1 assume !(0 != main_#t~mem7);havoc main_#t~mem7; 1438#L30-4 main_~nc_B~0 := 0; 1439#L34-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 1454#L34-1 assume !!(0 != main_#t~mem9);havoc main_#t~mem9;main_#t~post10 := main_~nc_B~0;main_~nc_B~0 := 1 + main_#t~post10;havoc main_#t~post10; 1455#L34-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 1456#L34-1 assume !(0 != main_#t~mem9);havoc main_#t~mem9; 1451#L34-4 assume !!(main_~nc_B~0 >= main_~nc_A~0);main_~j~0 := 0;main_~i~0 := main_~j~0; 1452#L43-2 [2018-11-28 23:42:03,601 INFO L796 eck$LassoCheckResult]: Loop: 1452#L43-2 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0);call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0, 1); 1453#L43 assume main_#t~mem11 == main_#t~mem12;havoc main_#t~mem11;havoc main_#t~mem12;main_#t~post13 := main_~i~0;main_~i~0 := 1 + main_#t~post13;havoc main_#t~post13;main_#t~post14 := main_~j~0;main_~j~0 := 1 + main_#t~post14;havoc main_#t~post14; 1452#L43-2 [2018-11-28 23:42:03,602 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:42:03,602 INFO L82 PathProgramCache]: Analyzing trace with hash 489706120, now seen corresponding path program 1 times [2018-11-28 23:42:03,602 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:42:03,602 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:42:03,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:03,603 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:42:03,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:03,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:42:03,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:42:03,633 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:42:03,633 INFO L82 PathProgramCache]: Analyzing trace with hash 3556, now seen corresponding path program 3 times [2018-11-28 23:42:03,633 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:42:03,633 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:42:03,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:03,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:42:03,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:03,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:42:03,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:42:03,639 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:42:03,639 INFO L82 PathProgramCache]: Analyzing trace with hash -1838818645, now seen corresponding path program 1 times [2018-11-28 23:42:03,639 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:42:03,639 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:42:03,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:03,640 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:42:03,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:03,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:42:03,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:42:03,810 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2018-11-28 23:42:07,822 WARN L180 SmtUtils]: Spent 3.98 s on a formula simplification. DAG size of input: 261 DAG size of output: 199 [2018-11-28 23:42:08,079 WARN L180 SmtUtils]: Spent 243.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2018-11-28 23:42:08,082 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:42:08,082 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:42:08,082 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:42:08,082 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:42:08,083 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:42:08,083 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:42:08,083 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:42:08,083 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:42:08,083 INFO L131 ssoRankerPreferences]: Filename of dumped script: string_false-unreach-call_true-termination.i_Iteration12_Lasso [2018-11-28 23:42:08,083 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:42:08,084 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:42:08,091 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:08,111 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:08,113 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:08,114 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:08,116 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:08,117 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:08,132 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:08,134 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:08,136 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:08,144 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:08,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:08,151 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:08,152 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:08,154 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:08,156 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:08,158 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:08,859 WARN L180 SmtUtils]: Spent 446.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 63 [2018-11-28 23:42:08,996 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 38 [2018-11-28 23:42:08,997 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:09,014 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:09,016 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:09,453 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:42:09,453 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:42:09,453 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:09,454 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:09,454 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:42:09,454 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:09,454 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:09,454 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:09,459 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:42:09,459 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:42:09,460 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:09,460 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:09,461 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:09,461 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:42:09,461 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:09,461 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:09,461 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:09,462 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:42:09,468 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:42:09,468 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:09,469 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:09,469 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:09,469 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:42:09,470 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:09,470 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:09,470 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:09,470 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:42:09,470 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:42:09,470 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:09,471 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:09,471 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:09,471 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:42:09,471 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:09,471 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:09,472 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:09,477 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:42:09,477 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:42:09,478 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:09,478 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:09,480 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:09,481 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:42:09,481 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:09,481 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:09,481 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:09,481 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:42:09,482 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:42:09,485 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:09,485 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:09,486 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:09,486 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:09,486 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:09,486 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:09,488 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:42:09,489 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:42:09,497 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:09,498 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:09,498 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:09,498 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:09,498 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:09,498 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:09,499 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:42:09,499 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:42:09,505 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:09,506 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:09,506 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:09,506 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:42:09,507 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:09,507 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:09,507 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:09,507 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:42:09,507 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:42:09,511 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:09,511 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:09,512 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:09,512 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:42:09,512 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:09,512 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:09,512 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:09,515 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:42:09,515 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:42:09,515 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:09,516 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:09,516 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:09,516 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:42:09,516 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:09,517 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:09,517 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:09,517 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:42:09,517 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:42:09,517 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:09,521 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:09,521 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:09,523 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:09,523 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:09,523 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:09,524 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:42:09,524 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:42:09,525 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:09,525 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:09,532 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:09,532 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:42:09,532 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:09,532 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:09,532 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:09,533 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:42:09,533 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:42:09,533 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:09,534 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:09,534 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:09,534 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:42:09,534 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:09,535 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:09,535 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:09,535 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:42:09,535 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:42:09,535 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:09,536 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:09,536 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:09,536 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:42:09,536 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:09,536 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:09,537 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:09,544 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:42:09,544 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:42:09,545 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:09,545 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:09,546 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:09,546 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:42:09,546 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:09,546 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:09,546 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:09,546 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:42:09,546 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:42:09,549 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:09,550 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:09,550 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:09,550 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:42:09,550 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:09,550 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:09,551 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:42:09,551 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:42:09,559 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:09,560 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:09,560 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:09,560 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:09,560 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:09,560 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:09,564 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:42:09,564 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:42:09,565 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:09,566 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:09,566 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:09,566 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:09,566 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:09,567 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:09,567 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:42:09,567 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:42:09,568 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:09,573 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:09,573 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:09,573 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2018-11-28 23:42:09,574 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:09,574 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:09,575 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-28 23:42:09,575 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:42:09,592 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:09,593 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:09,593 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:09,593 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:09,593 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:09,593 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:09,594 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:42:09,594 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:42:09,595 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:09,595 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:09,601 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:09,601 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:09,601 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:09,601 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:09,602 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:42:09,602 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:42:09,603 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:09,607 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:09,607 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:09,607 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:42:09,607 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:09,608 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:09,608 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:42:09,608 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:42:09,610 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:09,614 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:09,614 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:09,614 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:42:09,615 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:09,615 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:09,615 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:09,615 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:42:09,615 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:42:09,616 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:09,620 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:09,620 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:09,621 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:09,621 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:09,621 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:09,623 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:42:09,623 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:42:09,674 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:42:09,707 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2018-11-28 23:42:09,708 INFO L444 ModelExtractionUtils]: 15 out of 28 variables were initially zero. Simplification set additionally 9 variables to zero. [2018-11-28 23:42:09,709 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:42:09,709 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:42:09,710 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:42:09,710 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#string_A~0.base)_4, ULTIMATE.start_main_~#string_A~0.offset, ULTIMATE.start_main_~i~0) = 1*v_rep(select #length ULTIMATE.start_main_~#string_A~0.base)_4 - 1*ULTIMATE.start_main_~#string_A~0.offset - 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2018-11-28 23:42:09,847 INFO L297 tatePredicateManager]: 14 out of 14 supporting invariants were superfluous and have been removed [2018-11-28 23:42:09,852 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-28 23:42:09,864 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:42:09,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:42:09,900 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:42:09,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:42:09,910 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:42:09,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:42:09,920 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 [2018-11-28 23:42:09,920 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 40 states and 44 transitions. cyclomatic complexity: 8 Second operand 3 states. [2018-11-28 23:42:09,947 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 40 states and 44 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 44 states and 50 transitions. Complement of second has 5 states. [2018-11-28 23:42:09,949 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 [2018-11-28 23:42:09,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:42:09,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 22 transitions. [2018-11-28 23:42:09,950 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 38 letters. Loop has 2 letters. [2018-11-28 23:42:09,951 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:42:09,951 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 40 letters. Loop has 2 letters. [2018-11-28 23:42:09,951 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:42:09,952 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 38 letters. Loop has 4 letters. [2018-11-28 23:42:09,952 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:42:09,952 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 50 transitions. [2018-11-28 23:42:09,953 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 23:42:09,954 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 44 states and 50 transitions. [2018-11-28 23:42:09,954 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2018-11-28 23:42:09,954 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2018-11-28 23:42:09,954 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 50 transitions. [2018-11-28 23:42:09,954 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:42:09,954 INFO L705 BuchiCegarLoop]: Abstraction has 44 states and 50 transitions. [2018-11-28 23:42:09,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states and 50 transitions. [2018-11-28 23:42:09,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-11-28 23:42:09,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-28 23:42:09,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2018-11-28 23:42:09,957 INFO L728 BuchiCegarLoop]: Abstraction has 44 states and 50 transitions. [2018-11-28 23:42:09,957 INFO L608 BuchiCegarLoop]: Abstraction has 44 states and 50 transitions. [2018-11-28 23:42:09,957 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-11-28 23:42:09,957 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 50 transitions. [2018-11-28 23:42:09,958 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 23:42:09,958 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:42:09,958 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:42:09,961 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:42:09,961 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 23:42:09,961 INFO L794 eck$LassoCheckResult]: Stem: 1744#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1739#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~post1, main_#t~mem3, main_#t~nondet5, main_#t~post4, main_#t~mem6, main_#t~post8, main_#t~mem7, main_#t~post10, main_#t~mem9, main_#t~mem11, main_#t~mem12, main_#t~post13, main_#t~post14, main_~#string_A~0.base, main_~#string_A~0.offset, main_~#string_B~0.base, main_~#string_B~0.offset, main_~i~0, main_~j~0, main_~nc_A~0, main_~nc_B~0, main_~found~0;call main_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.alloc(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.alloc(5);havoc main_~i~0;havoc main_~j~0;havoc main_~nc_A~0;havoc main_~nc_B~0;main_~found~0 := 0;main_~i~0 := 0; 1728#L21-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 1729#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1730#L21-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 1731#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1762#L21-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 1761#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1760#L21-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 1758#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1756#L21-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 1751#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1750#L21-3 assume !(main_~i~0 < 5); 1726#L21-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 1727#L23 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 1745#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 1746#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1747#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 1759#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1757#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 1755#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1754#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 1753#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1752#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 1749#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1748#L25-3 assume !(main_~i~0 < 5); 1743#L25-4 call main_#t~mem6 := read~int(main_~#string_B~0.base, 4 + main_~#string_B~0.offset, 1); 1721#L27 assume !!(0 == main_#t~mem6);havoc main_#t~mem6;main_~nc_A~0 := 0; 1722#L30-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 1723#L30-1 assume !!(0 != main_#t~mem7);havoc main_#t~mem7;main_#t~post8 := main_~nc_A~0;main_~nc_A~0 := 1 + main_#t~post8;havoc main_#t~post8; 1724#L30-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 1725#L30-1 assume !(0 != main_#t~mem7);havoc main_#t~mem7; 1719#L30-4 main_~nc_B~0 := 0; 1720#L34-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 1740#L34-1 assume !!(0 != main_#t~mem9);havoc main_#t~mem9;main_#t~post10 := main_~nc_B~0;main_~nc_B~0 := 1 + main_#t~post10;havoc main_#t~post10; 1741#L34-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 1742#L34-1 assume !(0 != main_#t~mem9);havoc main_#t~mem9; 1732#L34-4 assume !!(main_~nc_B~0 >= main_~nc_A~0);main_~j~0 := 0;main_~i~0 := main_~j~0; 1733#L43-2 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0);call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0, 1); 1737#L43 assume !(main_#t~mem11 == main_#t~mem12);havoc main_#t~mem11;havoc main_#t~mem12;main_~i~0 := 1 + (main_~i~0 - main_~j~0);main_~j~0 := 0; 1734#L43-2 [2018-11-28 23:42:09,961 INFO L796 eck$LassoCheckResult]: Loop: 1734#L43-2 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0);call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0, 1); 1735#L43 assume main_#t~mem11 == main_#t~mem12;havoc main_#t~mem11;havoc main_#t~mem12;main_#t~post13 := main_~i~0;main_~i~0 := 1 + main_#t~post13;havoc main_#t~post13;main_#t~post14 := main_~j~0;main_~j~0 := 1 + main_#t~post14;havoc main_#t~post14; 1734#L43-2 [2018-11-28 23:42:09,962 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:42:09,962 INFO L82 PathProgramCache]: Analyzing trace with hash -1838818643, now seen corresponding path program 1 times [2018-11-28 23:42:09,962 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:42:09,962 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:42:09,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:09,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:42:09,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:10,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:42:10,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:42:10,030 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:42:10,030 INFO L82 PathProgramCache]: Analyzing trace with hash 3556, now seen corresponding path program 4 times [2018-11-28 23:42:10,030 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:42:10,030 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:42:10,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:10,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:42:10,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:10,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:42:10,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:42:10,043 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:42:10,045 INFO L82 PathProgramCache]: Analyzing trace with hash -1873154672, now seen corresponding path program 1 times [2018-11-28 23:42:10,045 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:42:10,045 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:42:10,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:10,048 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:42:10,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:10,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:42:10,636 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-11-28 23:42:10,637 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:42:10,637 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:42:10,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:42:10,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:42:10,699 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:42:10,787 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-11-28 23:42:10,807 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:42:10,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2018-11-28 23:42:10,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-28 23:42:10,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-11-28 23:42:10,875 INFO L87 Difference]: Start difference. First operand 44 states and 50 transitions. cyclomatic complexity: 11 Second operand 11 states. [2018-11-28 23:42:11,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:42:11,284 INFO L93 Difference]: Finished difference Result 74 states and 82 transitions. [2018-11-28 23:42:11,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 23:42:11,286 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 74 states and 82 transitions. [2018-11-28 23:42:11,288 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 23:42:11,288 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 74 states to 50 states and 56 transitions. [2018-11-28 23:42:11,288 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2018-11-28 23:42:11,288 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2018-11-28 23:42:11,288 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 56 transitions. [2018-11-28 23:42:11,289 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:42:11,289 INFO L705 BuchiCegarLoop]: Abstraction has 50 states and 56 transitions. [2018-11-28 23:42:11,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states and 56 transitions. [2018-11-28 23:42:11,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2018-11-28 23:42:11,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-28 23:42:11,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2018-11-28 23:42:11,292 INFO L728 BuchiCegarLoop]: Abstraction has 48 states and 54 transitions. [2018-11-28 23:42:11,292 INFO L608 BuchiCegarLoop]: Abstraction has 48 states and 54 transitions. [2018-11-28 23:42:11,292 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-11-28 23:42:11,292 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 48 states and 54 transitions. [2018-11-28 23:42:11,293 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 23:42:11,293 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:42:11,293 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:42:11,293 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:42:11,294 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 23:42:11,294 INFO L794 eck$LassoCheckResult]: Stem: 2014#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2012#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~post1, main_#t~mem3, main_#t~nondet5, main_#t~post4, main_#t~mem6, main_#t~post8, main_#t~mem7, main_#t~post10, main_#t~mem9, main_#t~mem11, main_#t~mem12, main_#t~post13, main_#t~post14, main_~#string_A~0.base, main_~#string_A~0.offset, main_~#string_B~0.base, main_~#string_B~0.offset, main_~i~0, main_~j~0, main_~nc_A~0, main_~nc_B~0, main_~found~0;call main_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.alloc(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.alloc(5);havoc main_~i~0;havoc main_~j~0;havoc main_~nc_A~0;havoc main_~nc_B~0;main_~found~0 := 0;main_~i~0 := 0; 1997#L21-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 1998#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1999#L21-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 2000#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 2033#L21-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 2031#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 2030#L21-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 2029#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 2027#L21-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 2025#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 2024#L21-3 assume !(main_~i~0 < 5); 1995#L21-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 1996#L23 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 2015#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 2016#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 2018#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 2035#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 2034#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 2032#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 2028#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 2026#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 2023#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 2022#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 2021#L25-3 assume !(main_~i~0 < 5); 2013#L25-4 call main_#t~mem6 := read~int(main_~#string_B~0.base, 4 + main_~#string_B~0.offset, 1); 1990#L27 assume !!(0 == main_#t~mem6);havoc main_#t~mem6;main_~nc_A~0 := 0; 1991#L30-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 1992#L30-1 assume !!(0 != main_#t~mem7);havoc main_#t~mem7;main_#t~post8 := main_~nc_A~0;main_~nc_A~0 := 1 + main_#t~post8;havoc main_#t~post8; 1993#L30-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 1994#L30-1 assume !!(0 != main_#t~mem7);havoc main_#t~mem7;main_#t~post8 := main_~nc_A~0;main_~nc_A~0 := 1 + main_#t~post8;havoc main_#t~post8; 2019#L30-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 2001#L30-1 assume !(0 != main_#t~mem7);havoc main_#t~mem7; 1988#L30-4 main_~nc_B~0 := 0; 1989#L34-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 2009#L34-1 assume !!(0 != main_#t~mem9);havoc main_#t~mem9;main_#t~post10 := main_~nc_B~0;main_~nc_B~0 := 1 + main_#t~post10;havoc main_#t~post10; 2010#L34-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 2011#L34-1 assume !!(0 != main_#t~mem9);havoc main_#t~mem9;main_#t~post10 := main_~nc_B~0;main_~nc_B~0 := 1 + main_#t~post10;havoc main_#t~post10; 2020#L34-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 2017#L34-1 assume !(0 != main_#t~mem9);havoc main_#t~mem9; 2002#L34-4 assume !!(main_~nc_B~0 >= main_~nc_A~0);main_~j~0 := 0;main_~i~0 := main_~j~0; 2003#L43-2 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0);call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0, 1); 2007#L43 assume !(main_#t~mem11 == main_#t~mem12);havoc main_#t~mem11;havoc main_#t~mem12;main_~i~0 := 1 + (main_~i~0 - main_~j~0);main_~j~0 := 0; 2004#L43-2 [2018-11-28 23:42:11,294 INFO L796 eck$LassoCheckResult]: Loop: 2004#L43-2 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0);call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0, 1); 2005#L43 assume main_#t~mem11 == main_#t~mem12;havoc main_#t~mem11;havoc main_#t~mem12;main_#t~post13 := main_~i~0;main_~i~0 := 1 + main_#t~post13;havoc main_#t~post13;main_#t~post14 := main_~j~0;main_~j~0 := 1 + main_#t~post14;havoc main_#t~post14; 2004#L43-2 [2018-11-28 23:42:11,294 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:42:11,294 INFO L82 PathProgramCache]: Analyzing trace with hash -1976327923, now seen corresponding path program 2 times [2018-11-28 23:42:11,294 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:42:11,295 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:42:11,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:11,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:42:11,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:11,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:42:11,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:42:11,330 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:42:11,330 INFO L82 PathProgramCache]: Analyzing trace with hash 3556, now seen corresponding path program 5 times [2018-11-28 23:42:11,330 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:42:11,330 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:42:11,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:11,331 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:42:11,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:11,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:42:11,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:42:11,336 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:42:11,336 INFO L82 PathProgramCache]: Analyzing trace with hash -875586576, now seen corresponding path program 2 times [2018-11-28 23:42:11,336 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:42:11,336 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:42:11,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:11,337 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:42:11,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:11,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:42:11,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:42:11,747 WARN L180 SmtUtils]: Spent 359.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2018-11-28 23:42:12,028 WARN L180 SmtUtils]: Spent 279.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2018-11-28 23:42:15,575 WARN L180 SmtUtils]: Spent 3.54 s on a formula simplification. DAG size of input: 310 DAG size of output: 231 [2018-11-28 23:42:15,861 WARN L180 SmtUtils]: Spent 275.00 ms on a formula simplification that was a NOOP. DAG size: 123 [2018-11-28 23:42:15,867 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:42:15,867 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:42:15,867 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:42:15,867 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:42:15,867 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:42:15,867 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:42:15,867 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:42:15,867 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:42:15,868 INFO L131 ssoRankerPreferences]: Filename of dumped script: string_false-unreach-call_true-termination.i_Iteration14_Lasso [2018-11-28 23:42:15,868 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:42:15,868 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:42:15,874 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:15,886 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:15,890 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:15,893 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:15,899 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:15,907 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:15,909 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:15,915 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:15,917 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:15,919 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:15,922 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:15,925 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:15,927 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:15,931 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:15,933 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:15,939 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:15,943 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:16,497 WARN L180 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 71 [2018-11-28 23:42:16,650 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:16,653 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:17,349 WARN L180 SmtUtils]: Spent 429.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2018-11-28 23:42:17,463 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:42:17,464 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:42:17,464 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:17,465 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:17,465 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:42:17,465 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:17,465 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:17,465 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:17,465 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:42:17,466 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:42:17,466 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:17,466 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:17,467 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:17,467 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:42:17,467 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:17,467 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:17,467 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:17,467 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:42:17,467 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:42:17,468 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:17,468 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:17,468 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:17,468 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:42:17,468 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:17,469 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:17,469 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:17,469 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:42:17,469 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:42:17,469 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:17,470 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:17,470 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:17,470 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:17,470 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:17,470 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:17,471 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:42:17,471 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:42:17,472 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:17,472 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:17,473 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:17,473 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:17,473 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:17,473 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:17,474 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:42:17,474 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:42:17,475 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:17,475 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:17,475 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:17,475 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:42:17,475 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:17,476 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:17,476 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:17,476 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:42:17,476 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:42:17,476 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:17,477 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:17,477 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:17,477 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:42:17,477 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:17,477 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:17,477 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:17,478 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:42:17,478 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:42:17,478 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:17,478 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:17,479 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:17,479 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:42:17,479 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:17,479 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:17,479 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:17,479 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:42:17,479 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:42:17,480 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:17,480 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:17,480 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:17,480 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:42:17,481 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:17,481 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:17,481 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:17,481 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:42:17,481 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:42:17,481 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:17,482 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:17,482 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:17,482 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:42:17,482 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:17,482 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:17,482 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:17,483 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:42:17,483 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:42:17,483 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:17,483 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:17,484 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:17,484 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:42:17,484 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:17,484 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:17,484 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:17,484 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:42:17,485 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:42:17,485 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:17,485 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:17,485 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:17,486 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:42:17,486 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:17,486 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:17,486 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:17,486 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:42:17,486 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:42:17,487 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:17,487 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:17,487 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:17,487 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:42:17,487 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:17,487 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:17,488 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:17,488 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:42:17,488 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:42:17,488 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:17,489 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:17,489 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:17,489 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:42:17,489 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:17,489 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:17,489 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:17,490 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:42:17,490 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:42:17,490 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:17,490 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:17,490 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:17,491 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:42:17,491 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:17,491 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:17,491 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:17,491 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:42:17,491 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:42:17,492 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:17,492 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:17,492 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:17,492 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:17,492 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:17,493 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:17,493 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:42:17,493 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:42:17,494 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:17,494 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:17,495 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:17,495 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:17,495 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:17,495 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:17,496 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:42:17,496 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:42:17,497 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:17,497 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:17,497 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:17,497 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:17,497 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:17,498 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:17,498 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:42:17,498 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:42:17,500 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:17,501 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:17,501 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:17,502 INFO L205 nArgumentSynthesizer]: 12 stem disjuncts [2018-11-28 23:42:17,502 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:17,502 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:17,504 INFO L402 nArgumentSynthesizer]: We have 28 Motzkin's Theorem applications. [2018-11-28 23:42:17,504 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:42:17,517 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:17,518 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:17,518 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:17,518 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:17,518 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:17,519 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:17,519 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:42:17,519 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:42:17,521 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:17,522 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:17,522 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:17,522 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:42:17,522 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:17,522 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:17,523 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:42:17,523 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:42:17,524 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:17,525 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:17,525 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:17,525 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:17,525 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:17,525 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:17,526 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:42:17,526 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:42:17,527 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:17,527 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:17,528 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:17,528 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:42:17,528 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:17,528 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:17,529 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:42:17,529 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:42:17,530 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:17,530 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:17,531 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:17,531 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:17,531 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:17,531 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:17,532 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:42:17,532 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:42:17,533 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:17,533 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:17,533 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:17,533 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:17,533 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:17,534 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:17,534 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:42:17,534 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:42:17,535 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:17,535 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:17,536 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:17,536 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:42:17,536 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:17,536 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:17,537 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:42:17,537 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:42:17,539 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:17,539 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:17,540 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:17,540 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:42:17,540 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:17,540 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:17,540 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:17,540 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:42:17,540 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:42:17,541 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:17,541 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:17,541 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:17,542 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:17,542 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:17,542 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:17,544 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:42:17,544 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:42:17,559 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:42:17,580 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-11-28 23:42:17,580 INFO L444 ModelExtractionUtils]: 18 out of 28 variables were initially zero. Simplification set additionally 7 variables to zero. [2018-11-28 23:42:17,581 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:42:17,581 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:42:17,581 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:42:17,581 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~nc_A~0) = -1*ULTIMATE.start_main_~i~0 + 1*ULTIMATE.start_main_~nc_A~0 Supporting invariants [] [2018-11-28 23:42:17,892 INFO L297 tatePredicateManager]: 26 out of 26 supporting invariants were superfluous and have been removed [2018-11-28 23:42:17,904 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:42:17,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:42:17,949 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:42:17,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:42:17,981 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:42:17,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:42:17,991 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 [2018-11-28 23:42:17,992 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 48 states and 54 transitions. cyclomatic complexity: 11 Second operand 3 states. [2018-11-28 23:42:18,011 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 48 states and 54 transitions. cyclomatic complexity: 11. Second operand 3 states. Result 52 states and 60 transitions. Complement of second has 5 states. [2018-11-28 23:42:18,012 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 [2018-11-28 23:42:18,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:42:18,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 25 transitions. [2018-11-28 23:42:18,013 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 25 transitions. Stem has 44 letters. Loop has 2 letters. [2018-11-28 23:42:18,014 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:42:18,014 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 25 transitions. Stem has 46 letters. Loop has 2 letters. [2018-11-28 23:42:18,014 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:42:18,015 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 25 transitions. Stem has 44 letters. Loop has 4 letters. [2018-11-28 23:42:18,015 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:42:18,015 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 52 states and 60 transitions. [2018-11-28 23:42:18,018 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 23:42:18,019 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 52 states to 52 states and 60 transitions. [2018-11-28 23:42:18,019 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2018-11-28 23:42:18,019 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2018-11-28 23:42:18,019 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 60 transitions. [2018-11-28 23:42:18,020 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:42:18,020 INFO L705 BuchiCegarLoop]: Abstraction has 52 states and 60 transitions. [2018-11-28 23:42:18,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states and 60 transitions. [2018-11-28 23:42:18,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-11-28 23:42:18,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-28 23:42:18,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 60 transitions. [2018-11-28 23:42:18,023 INFO L728 BuchiCegarLoop]: Abstraction has 52 states and 60 transitions. [2018-11-28 23:42:18,023 INFO L608 BuchiCegarLoop]: Abstraction has 52 states and 60 transitions. [2018-11-28 23:42:18,023 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2018-11-28 23:42:18,023 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states and 60 transitions. [2018-11-28 23:42:18,024 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 23:42:18,024 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:42:18,024 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:42:18,024 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:42:18,025 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 23:42:18,025 INFO L794 eck$LassoCheckResult]: Stem: 2377#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2375#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~post1, main_#t~mem3, main_#t~nondet5, main_#t~post4, main_#t~mem6, main_#t~post8, main_#t~mem7, main_#t~post10, main_#t~mem9, main_#t~mem11, main_#t~mem12, main_#t~post13, main_#t~post14, main_~#string_A~0.base, main_~#string_A~0.offset, main_~#string_B~0.base, main_~#string_B~0.offset, main_~i~0, main_~j~0, main_~nc_A~0, main_~nc_B~0, main_~found~0;call main_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.alloc(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.alloc(5);havoc main_~i~0;havoc main_~j~0;havoc main_~nc_A~0;havoc main_~nc_B~0;main_~found~0 := 0;main_~i~0 := 0; 2360#L21-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 2361#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 2362#L21-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 2363#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 2399#L21-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 2398#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 2397#L21-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 2396#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 2394#L21-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 2390#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 2389#L21-3 assume !(main_~i~0 < 5); 2358#L21-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 2359#L23 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 2379#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 2380#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 2382#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 2395#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 2393#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 2392#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 2391#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 2388#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 2387#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 2386#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 2385#L25-3 assume !(main_~i~0 < 5); 2376#L25-4 call main_#t~mem6 := read~int(main_~#string_B~0.base, 4 + main_~#string_B~0.offset, 1); 2353#L27 assume !!(0 == main_#t~mem6);havoc main_#t~mem6;main_~nc_A~0 := 0; 2354#L30-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 2355#L30-1 assume !!(0 != main_#t~mem7);havoc main_#t~mem7;main_#t~post8 := main_~nc_A~0;main_~nc_A~0 := 1 + main_#t~post8;havoc main_#t~post8; 2356#L30-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 2357#L30-1 assume !!(0 != main_#t~mem7);havoc main_#t~mem7;main_#t~post8 := main_~nc_A~0;main_~nc_A~0 := 1 + main_#t~post8;havoc main_#t~post8; 2383#L30-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 2364#L30-1 assume !(0 != main_#t~mem7);havoc main_#t~mem7; 2351#L30-4 main_~nc_B~0 := 0; 2352#L34-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 2372#L34-1 assume !!(0 != main_#t~mem9);havoc main_#t~mem9;main_#t~post10 := main_~nc_B~0;main_~nc_B~0 := 1 + main_#t~post10;havoc main_#t~post10; 2373#L34-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 2374#L34-1 assume !!(0 != main_#t~mem9);havoc main_#t~mem9;main_#t~post10 := main_~nc_B~0;main_~nc_B~0 := 1 + main_#t~post10;havoc main_#t~post10; 2384#L34-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 2381#L34-1 assume !(0 != main_#t~mem9);havoc main_#t~mem9; 2365#L34-4 assume !!(main_~nc_B~0 >= main_~nc_A~0);main_~j~0 := 0;main_~i~0 := main_~j~0; 2366#L43-2 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0);call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0, 1); 2370#L43 assume !(main_#t~mem11 == main_#t~mem12);havoc main_#t~mem11;havoc main_#t~mem12;main_~i~0 := 1 + (main_~i~0 - main_~j~0);main_~j~0 := 0; 2378#L43-2 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0);call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0, 1); 2400#L43 assume !(main_#t~mem11 == main_#t~mem12);havoc main_#t~mem11;havoc main_#t~mem12;main_~i~0 := 1 + (main_~i~0 - main_~j~0);main_~j~0 := 0; 2367#L43-2 [2018-11-28 23:42:18,025 INFO L796 eck$LassoCheckResult]: Loop: 2367#L43-2 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0);call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0, 1); 2368#L43 assume main_#t~mem11 == main_#t~mem12;havoc main_#t~mem11;havoc main_#t~mem12;main_#t~post13 := main_~i~0;main_~i~0 := 1 + main_#t~post13;havoc main_#t~post13;main_#t~post14 := main_~j~0;main_~j~0 := 1 + main_#t~post14;havoc main_#t~post14; 2367#L43-2 [2018-11-28 23:42:18,025 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:42:18,025 INFO L82 PathProgramCache]: Analyzing trace with hash -875586574, now seen corresponding path program 3 times [2018-11-28 23:42:18,026 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:42:18,026 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:42:18,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:18,026 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:42:18,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:18,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:42:18,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:42:18,078 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:42:18,078 INFO L82 PathProgramCache]: Analyzing trace with hash 3556, now seen corresponding path program 6 times [2018-11-28 23:42:18,078 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:42:18,078 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:42:18,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:18,081 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:42:18,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:18,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:42:18,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:42:18,085 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:42:18,086 INFO L82 PathProgramCache]: Analyzing trace with hash 374894997, now seen corresponding path program 3 times [2018-11-28 23:42:18,086 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:42:18,086 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:42:18,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:18,086 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:42:18,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:18,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:42:18,225 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-11-28 23:42:18,225 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:42:18,225 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:42:18,237 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-28 23:42:18,275 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-28 23:42:18,275 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:42:18,277 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:42:18,496 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-11-28 23:42:18,516 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:42:18,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2018-11-28 23:42:18,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-28 23:42:18,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-11-28 23:42:18,585 INFO L87 Difference]: Start difference. First operand 52 states and 60 transitions. cyclomatic complexity: 14 Second operand 12 states. [2018-11-28 23:42:18,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:42:18,857 INFO L93 Difference]: Finished difference Result 68 states and 78 transitions. [2018-11-28 23:42:18,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-28 23:42:18,866 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 78 transitions. [2018-11-28 23:42:18,867 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 23:42:18,867 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 55 states and 63 transitions. [2018-11-28 23:42:18,868 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2018-11-28 23:42:18,868 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2018-11-28 23:42:18,868 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 63 transitions. [2018-11-28 23:42:18,868 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:42:18,868 INFO L705 BuchiCegarLoop]: Abstraction has 55 states and 63 transitions. [2018-11-28 23:42:18,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 63 transitions. [2018-11-28 23:42:18,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2018-11-28 23:42:18,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-28 23:42:18,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 62 transitions. [2018-11-28 23:42:18,877 INFO L728 BuchiCegarLoop]: Abstraction has 54 states and 62 transitions. [2018-11-28 23:42:18,877 INFO L608 BuchiCegarLoop]: Abstraction has 54 states and 62 transitions. [2018-11-28 23:42:18,877 INFO L442 BuchiCegarLoop]: ======== Iteration 16============ [2018-11-28 23:42:18,877 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states and 62 transitions. [2018-11-28 23:42:18,877 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 23:42:18,877 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:42:18,878 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:42:18,884 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:42:18,884 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 23:42:18,884 INFO L794 eck$LassoCheckResult]: Stem: 2665#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2660#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~post1, main_#t~mem3, main_#t~nondet5, main_#t~post4, main_#t~mem6, main_#t~post8, main_#t~mem7, main_#t~post10, main_#t~mem9, main_#t~mem11, main_#t~mem12, main_#t~post13, main_#t~post14, main_~#string_A~0.base, main_~#string_A~0.offset, main_~#string_B~0.base, main_~#string_B~0.offset, main_~i~0, main_~j~0, main_~nc_A~0, main_~nc_B~0, main_~found~0;call main_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.alloc(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.alloc(5);havoc main_~i~0;havoc main_~j~0;havoc main_~nc_A~0;havoc main_~nc_B~0;main_~found~0 := 0;main_~i~0 := 0; 2648#L21-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 2649#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 2650#L21-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 2651#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 2688#L21-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 2687#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 2686#L21-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 2685#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 2684#L21-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 2681#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 2680#L21-3 assume !(main_~i~0 < 5); 2646#L21-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 2647#L23 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 2667#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 2668#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 2671#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 2683#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 2682#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 2679#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 2678#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 2677#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 2675#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 2674#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 2673#L25-3 assume !(main_~i~0 < 5); 2664#L25-4 call main_#t~mem6 := read~int(main_~#string_B~0.base, 4 + main_~#string_B~0.offset, 1); 2641#L27 assume !!(0 == main_#t~mem6);havoc main_#t~mem6;main_~nc_A~0 := 0; 2642#L30-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 2643#L30-1 assume !!(0 != main_#t~mem7);havoc main_#t~mem7;main_#t~post8 := main_~nc_A~0;main_~nc_A~0 := 1 + main_#t~post8;havoc main_#t~post8; 2644#L30-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 2645#L30-1 assume !!(0 != main_#t~mem7);havoc main_#t~mem7;main_#t~post8 := main_~nc_A~0;main_~nc_A~0 := 1 + main_#t~post8;havoc main_#t~post8; 2672#L30-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 2652#L30-1 assume !(0 != main_#t~mem7);havoc main_#t~mem7; 2639#L30-4 main_~nc_B~0 := 0; 2640#L34-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 2661#L34-1 assume !!(0 != main_#t~mem9);havoc main_#t~mem9;main_#t~post10 := main_~nc_B~0;main_~nc_B~0 := 1 + main_#t~post10;havoc main_#t~post10; 2670#L34-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 2689#L34-1 assume !!(0 != main_#t~mem9);havoc main_#t~mem9;main_#t~post10 := main_~nc_B~0;main_~nc_B~0 := 1 + main_#t~post10;havoc main_#t~post10; 2662#L34-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 2663#L34-1 assume !!(0 != main_#t~mem9);havoc main_#t~mem9;main_#t~post10 := main_~nc_B~0;main_~nc_B~0 := 1 + main_#t~post10;havoc main_#t~post10; 2676#L34-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 2669#L34-1 assume !(0 != main_#t~mem9);havoc main_#t~mem9; 2653#L34-4 assume !!(main_~nc_B~0 >= main_~nc_A~0);main_~j~0 := 0;main_~i~0 := main_~j~0; 2654#L43-2 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0);call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0, 1); 2658#L43 assume !(main_#t~mem11 == main_#t~mem12);havoc main_#t~mem11;havoc main_#t~mem12;main_~i~0 := 1 + (main_~i~0 - main_~j~0);main_~j~0 := 0; 2666#L43-2 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0);call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0, 1); 2690#L43 assume !(main_#t~mem11 == main_#t~mem12);havoc main_#t~mem11;havoc main_#t~mem12;main_~i~0 := 1 + (main_~i~0 - main_~j~0);main_~j~0 := 0; 2655#L43-2 [2018-11-28 23:42:18,884 INFO L796 eck$LassoCheckResult]: Loop: 2655#L43-2 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0);call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0, 1); 2656#L43 assume main_#t~mem11 == main_#t~mem12;havoc main_#t~mem11;havoc main_#t~mem12;main_#t~post13 := main_~i~0;main_~i~0 := 1 + main_#t~post13;havoc main_#t~post13;main_#t~post14 := main_~j~0;main_~j~0 := 1 + main_#t~post14;havoc main_#t~post14; 2655#L43-2 [2018-11-28 23:42:18,888 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:42:18,888 INFO L82 PathProgramCache]: Analyzing trace with hash 356019245, now seen corresponding path program 4 times [2018-11-28 23:42:18,888 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:42:18,888 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:42:18,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:18,889 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:42:18,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:18,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:42:18,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:42:18,948 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:42:18,949 INFO L82 PathProgramCache]: Analyzing trace with hash 3556, now seen corresponding path program 7 times [2018-11-28 23:42:18,949 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:42:18,949 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:42:18,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:18,950 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:42:18,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:18,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:42:18,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:42:18,958 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:42:18,961 INFO L82 PathProgramCache]: Analyzing trace with hash -1462886640, now seen corresponding path program 4 times [2018-11-28 23:42:18,961 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:42:18,961 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:42:18,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:18,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:42:18,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:18,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:42:19,122 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2018-11-28 23:42:19,122 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:42:19,122 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:42:19,135 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-28 23:42:19,176 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-28 23:42:19,177 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:42:19,179 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:42:19,254 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2018-11-28 23:42:19,273 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:42:19,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2018-11-28 23:42:19,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-28 23:42:19,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-11-28 23:42:19,380 INFO L87 Difference]: Start difference. First operand 54 states and 62 transitions. cyclomatic complexity: 14 Second operand 12 states. [2018-11-28 23:42:19,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:42:19,529 INFO L93 Difference]: Finished difference Result 79 states and 90 transitions. [2018-11-28 23:42:19,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-28 23:42:19,532 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 79 states and 90 transitions. [2018-11-28 23:42:19,533 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 23:42:19,534 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 79 states to 57 states and 65 transitions. [2018-11-28 23:42:19,534 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2018-11-28 23:42:19,535 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2018-11-28 23:42:19,535 INFO L73 IsDeterministic]: Start isDeterministic. Operand 57 states and 65 transitions. [2018-11-28 23:42:19,535 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:42:19,535 INFO L705 BuchiCegarLoop]: Abstraction has 57 states and 65 transitions. [2018-11-28 23:42:19,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states and 65 transitions. [2018-11-28 23:42:19,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2018-11-28 23:42:19,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-28 23:42:19,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 64 transitions. [2018-11-28 23:42:19,543 INFO L728 BuchiCegarLoop]: Abstraction has 56 states and 64 transitions. [2018-11-28 23:42:19,543 INFO L608 BuchiCegarLoop]: Abstraction has 56 states and 64 transitions. [2018-11-28 23:42:19,543 INFO L442 BuchiCegarLoop]: ======== Iteration 17============ [2018-11-28 23:42:19,545 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 64 transitions. [2018-11-28 23:42:19,545 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 23:42:19,545 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:42:19,546 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:42:19,547 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:42:19,549 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 23:42:19,550 INFO L794 eck$LassoCheckResult]: Stem: 2969#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2964#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~post1, main_#t~mem3, main_#t~nondet5, main_#t~post4, main_#t~mem6, main_#t~post8, main_#t~mem7, main_#t~post10, main_#t~mem9, main_#t~mem11, main_#t~mem12, main_#t~post13, main_#t~post14, main_~#string_A~0.base, main_~#string_A~0.offset, main_~#string_B~0.base, main_~#string_B~0.offset, main_~i~0, main_~j~0, main_~nc_A~0, main_~nc_B~0, main_~found~0;call main_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.alloc(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.alloc(5);havoc main_~i~0;havoc main_~j~0;havoc main_~nc_A~0;havoc main_~nc_B~0;main_~found~0 := 0;main_~i~0 := 0; 2951#L21-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 2952#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 2953#L21-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 2954#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 2956#L21-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 2991#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 2990#L21-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 2988#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 2985#L21-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 2980#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 2979#L21-3 assume !(main_~i~0 < 5); 2949#L21-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 2950#L23 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 2970#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 2971#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 2973#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 2992#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 2989#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 2987#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 2984#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 2983#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 2978#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 2977#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 2976#L25-3 assume !(main_~i~0 < 5); 2968#L25-4 call main_#t~mem6 := read~int(main_~#string_B~0.base, 4 + main_~#string_B~0.offset, 1); 2944#L27 assume !!(0 == main_#t~mem6);havoc main_#t~mem6;main_~nc_A~0 := 0; 2945#L30-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 2946#L30-1 assume !!(0 != main_#t~mem7);havoc main_#t~mem7;main_#t~post8 := main_~nc_A~0;main_~nc_A~0 := 1 + main_#t~post8;havoc main_#t~post8; 2947#L30-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 2948#L30-1 assume !!(0 != main_#t~mem7);havoc main_#t~mem7;main_#t~post8 := main_~nc_A~0;main_~nc_A~0 := 1 + main_#t~post8;havoc main_#t~post8; 2993#L30-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 2975#L30-1 assume !!(0 != main_#t~mem7);havoc main_#t~mem7;main_#t~post8 := main_~nc_A~0;main_~nc_A~0 := 1 + main_#t~post8;havoc main_#t~post8; 2974#L30-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 2955#L30-1 assume !(0 != main_#t~mem7);havoc main_#t~mem7; 2942#L30-4 main_~nc_B~0 := 0; 2943#L34-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 2965#L34-1 assume !!(0 != main_#t~mem9);havoc main_#t~mem9;main_#t~post10 := main_~nc_B~0;main_~nc_B~0 := 1 + main_#t~post10;havoc main_#t~post10; 2966#L34-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 2967#L34-1 assume !!(0 != main_#t~mem9);havoc main_#t~mem9;main_#t~post10 := main_~nc_B~0;main_~nc_B~0 := 1 + main_#t~post10;havoc main_#t~post10; 2986#L34-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 2982#L34-1 assume !!(0 != main_#t~mem9);havoc main_#t~mem9;main_#t~post10 := main_~nc_B~0;main_~nc_B~0 := 1 + main_#t~post10;havoc main_#t~post10; 2981#L34-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 2972#L34-1 assume !(0 != main_#t~mem9);havoc main_#t~mem9; 2957#L34-4 assume !!(main_~nc_B~0 >= main_~nc_A~0);main_~j~0 := 0;main_~i~0 := main_~j~0; 2958#L43-2 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0);call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0, 1); 2995#L43 assume !(main_#t~mem11 == main_#t~mem12);havoc main_#t~mem11;havoc main_#t~mem12;main_~i~0 := 1 + (main_~i~0 - main_~j~0);main_~j~0 := 0; 2994#L43-2 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0);call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0, 1); 2962#L43 assume !(main_#t~mem11 == main_#t~mem12);havoc main_#t~mem11;havoc main_#t~mem12;main_~i~0 := 1 + (main_~i~0 - main_~j~0);main_~j~0 := 0; 2959#L43-2 [2018-11-28 23:42:19,550 INFO L796 eck$LassoCheckResult]: Loop: 2959#L43-2 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0);call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0, 1); 2960#L43 assume main_#t~mem11 == main_#t~mem12;havoc main_#t~mem11;havoc main_#t~mem12;main_#t~post13 := main_~i~0;main_~i~0 := 1 + main_#t~post13;havoc main_#t~post13;main_#t~post14 := main_~j~0;main_~j~0 := 1 + main_#t~post14;havoc main_#t~post14; 2959#L43-2 [2018-11-28 23:42:19,550 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:42:19,550 INFO L82 PathProgramCache]: Analyzing trace with hash -1412851758, now seen corresponding path program 5 times [2018-11-28 23:42:19,551 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:42:19,551 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:42:19,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:19,563 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:42:19,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:19,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:42:19,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:42:19,643 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:42:19,643 INFO L82 PathProgramCache]: Analyzing trace with hash 3556, now seen corresponding path program 8 times [2018-11-28 23:42:19,643 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:42:19,643 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:42:19,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:19,644 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:42:19,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:19,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:42:19,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:42:19,657 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:42:19,657 INFO L82 PathProgramCache]: Analyzing trace with hash -540871307, now seen corresponding path program 5 times [2018-11-28 23:42:19,657 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:42:19,657 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:42:19,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:19,658 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:42:19,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:19,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:42:19,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:42:19,915 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2018-11-28 23:42:23,557 WARN L180 SmtUtils]: Spent 3.61 s on a formula simplification. DAG size of input: 358 DAG size of output: 267 [2018-11-28 23:42:23,829 WARN L180 SmtUtils]: Spent 261.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2018-11-28 23:42:23,833 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:42:23,833 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:42:23,833 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:42:23,833 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:42:23,834 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:42:23,834 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:42:23,834 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:42:23,834 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:42:23,834 INFO L131 ssoRankerPreferences]: Filename of dumped script: string_false-unreach-call_true-termination.i_Iteration17_Lasso [2018-11-28 23:42:23,834 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:42:23,834 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:42:23,839 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:23,846 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:23,848 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:23,851 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:23,856 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:23,860 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:23,863 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:23,865 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:23,868 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:23,871 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:23,873 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:23,876 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:23,879 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:24,573 WARN L180 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 80 [2018-11-28 23:42:24,710 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:24,719 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:24,721 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:24,723 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:24,726 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:24,728 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:25,027 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-28 23:42:27,306 WARN L180 SmtUtils]: Spent 2.15 s on a formula simplification. DAG size of input: 100 DAG size of output: 72 [2018-11-28 23:42:27,377 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:42:27,377 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:42:27,377 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:27,378 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:27,378 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:27,378 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:27,378 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:27,388 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:42:27,388 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:42:27,389 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:27,389 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:27,390 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:27,390 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:42:27,390 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:27,390 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:27,390 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:27,390 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:42:27,390 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:42:27,391 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:27,391 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:27,391 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:27,391 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:42:27,395 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:27,395 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:27,395 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:27,396 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:42:27,396 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:42:27,396 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:27,396 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:27,397 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:27,397 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:42:27,397 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:27,397 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:27,397 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:27,398 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:42:27,401 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:42:27,401 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:27,402 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:27,402 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:27,402 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:27,402 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:27,402 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:27,406 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:42:27,406 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:42:27,407 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:27,407 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:27,408 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:27,408 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:42:27,408 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:27,408 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:27,408 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:27,408 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:42:27,409 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:42:27,409 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:27,409 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:27,409 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:27,410 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:42:27,410 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:27,410 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:27,410 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:27,410 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:42:27,410 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:42:27,411 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:27,414 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:27,414 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:27,415 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:27,415 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:27,415 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:27,415 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:42:27,415 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:42:27,416 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:27,422 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:27,422 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:27,422 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:42:27,423 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:27,423 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:27,423 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:27,423 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:42:27,423 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:42:27,424 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:27,424 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:27,424 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:27,424 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:42:27,424 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:27,425 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:27,427 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:27,427 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:42:27,427 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:42:27,428 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:27,428 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:27,428 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:27,428 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:42:27,429 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:27,429 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:27,429 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:27,429 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:42:27,429 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:42:27,429 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:27,430 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:27,430 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:27,430 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:42:27,430 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:27,430 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:27,431 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:27,436 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:42:27,436 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:42:27,437 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:27,437 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:27,437 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:27,437 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:27,438 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:27,438 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:27,438 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:42:27,438 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:42:27,444 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:27,444 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:27,444 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:27,444 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:27,445 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:27,445 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:27,445 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:42:27,445 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:42:27,446 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:27,446 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:27,447 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:27,450 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:27,450 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:27,450 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:27,456 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:42:27,457 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:42:27,482 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:42:27,519 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-28 23:42:27,519 INFO L444 ModelExtractionUtils]: 19 out of 28 variables were initially zero. Simplification set additionally 6 variables to zero. [2018-11-28 23:42:27,519 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:42:27,520 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:42:27,520 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:42:27,520 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~nc_B~0, ULTIMATE.start_main_~j~0) = 1*ULTIMATE.start_main_~nc_B~0 - 1*ULTIMATE.start_main_~j~0 Supporting invariants [] [2018-11-28 23:42:27,877 INFO L297 tatePredicateManager]: 41 out of 41 supporting invariants were superfluous and have been removed [2018-11-28 23:42:27,888 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:42:27,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:42:27,947 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:42:27,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:42:27,958 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:42:27,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:42:27,977 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 [2018-11-28 23:42:27,977 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 56 states and 64 transitions. cyclomatic complexity: 14 Second operand 3 states. [2018-11-28 23:42:28,014 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 56 states and 64 transitions. cyclomatic complexity: 14. Second operand 3 states. Result 58 states and 68 transitions. Complement of second has 5 states. [2018-11-28 23:42:28,015 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 [2018-11-28 23:42:28,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:42:28,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 25 transitions. [2018-11-28 23:42:28,016 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 25 transitions. Stem has 50 letters. Loop has 2 letters. [2018-11-28 23:42:28,017 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:42:28,017 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:42:28,034 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:42:28,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:42:28,090 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:42:28,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:42:28,112 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:42:28,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:42:28,133 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 [2018-11-28 23:42:28,133 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 56 states and 64 transitions. cyclomatic complexity: 14 Second operand 3 states. [2018-11-28 23:42:28,144 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 56 states and 64 transitions. cyclomatic complexity: 14. Second operand 3 states. Result 58 states and 68 transitions. Complement of second has 5 states. [2018-11-28 23:42:28,147 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 [2018-11-28 23:42:28,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:42:28,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 25 transitions. [2018-11-28 23:42:28,147 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 25 transitions. Stem has 50 letters. Loop has 2 letters. [2018-11-28 23:42:28,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:42:28,148 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:42:28,184 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:42:28,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:42:28,245 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:42:28,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:42:28,272 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:42:28,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:42:28,350 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 [2018-11-28 23:42:28,350 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 56 states and 64 transitions. cyclomatic complexity: 14 Second operand 3 states. [2018-11-28 23:42:28,395 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 56 states and 64 transitions. cyclomatic complexity: 14. Second operand 3 states. Result 60 states and 71 transitions. Complement of second has 4 states. [2018-11-28 23:42:28,397 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 [2018-11-28 23:42:28,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:42:28,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2018-11-28 23:42:28,398 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 26 transitions. Stem has 50 letters. Loop has 2 letters. [2018-11-28 23:42:28,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:42:28,398 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 26 transitions. Stem has 52 letters. Loop has 2 letters. [2018-11-28 23:42:28,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:42:28,398 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 26 transitions. Stem has 50 letters. Loop has 4 letters. [2018-11-28 23:42:28,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:42:28,400 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 71 transitions. [2018-11-28 23:42:28,401 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 23:42:28,402 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 58 states and 67 transitions. [2018-11-28 23:42:28,402 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2018-11-28 23:42:28,402 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2018-11-28 23:42:28,402 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 67 transitions. [2018-11-28 23:42:28,402 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:42:28,402 INFO L705 BuchiCegarLoop]: Abstraction has 58 states and 67 transitions. [2018-11-28 23:42:28,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states and 67 transitions. [2018-11-28 23:42:28,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 50. [2018-11-28 23:42:28,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-28 23:42:28,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2018-11-28 23:42:28,405 INFO L728 BuchiCegarLoop]: Abstraction has 50 states and 55 transitions. [2018-11-28 23:42:28,405 INFO L608 BuchiCegarLoop]: Abstraction has 50 states and 55 transitions. [2018-11-28 23:42:28,405 INFO L442 BuchiCegarLoop]: ======== Iteration 18============ [2018-11-28 23:42:28,405 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 55 transitions. [2018-11-28 23:42:28,406 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 23:42:28,406 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:42:28,406 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:42:28,407 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:42:28,407 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 23:42:28,407 INFO L794 eck$LassoCheckResult]: Stem: 3862#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3857#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~post1, main_#t~mem3, main_#t~nondet5, main_#t~post4, main_#t~mem6, main_#t~post8, main_#t~mem7, main_#t~post10, main_#t~mem9, main_#t~mem11, main_#t~mem12, main_#t~post13, main_#t~post14, main_~#string_A~0.base, main_~#string_A~0.offset, main_~#string_B~0.base, main_~#string_B~0.offset, main_~i~0, main_~j~0, main_~nc_A~0, main_~nc_B~0, main_~found~0;call main_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.alloc(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.alloc(5);havoc main_~i~0;havoc main_~j~0;havoc main_~nc_A~0;havoc main_~nc_B~0;main_~found~0 := 0;main_~i~0 := 0; 3847#L21-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 3848#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 3849#L21-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 3850#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 3887#L21-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 3886#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 3885#L21-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 3884#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 3883#L21-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 3882#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 3881#L21-3 assume !(main_~i~0 < 5); 3845#L21-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 3846#L23 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 3863#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 3864#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 3866#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 3880#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 3878#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 3877#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 3874#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 3873#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 3872#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 3870#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 3869#L25-3 assume !(main_~i~0 < 5); 3861#L25-4 call main_#t~mem6 := read~int(main_~#string_B~0.base, 4 + main_~#string_B~0.offset, 1); 3840#L27 assume !!(0 == main_#t~mem6);havoc main_#t~mem6;main_~nc_A~0 := 0; 3841#L30-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 3842#L30-1 assume !!(0 != main_#t~mem7);havoc main_#t~mem7;main_#t~post8 := main_~nc_A~0;main_~nc_A~0 := 1 + main_#t~post8;havoc main_#t~post8; 3843#L30-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 3844#L30-1 assume !!(0 != main_#t~mem7);havoc main_#t~mem7;main_#t~post8 := main_~nc_A~0;main_~nc_A~0 := 1 + main_#t~post8;havoc main_#t~post8; 3871#L30-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 3868#L30-1 assume !!(0 != main_#t~mem7);havoc main_#t~mem7;main_#t~post8 := main_~nc_A~0;main_~nc_A~0 := 1 + main_#t~post8;havoc main_#t~post8; 3867#L30-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 3851#L30-1 assume !(0 != main_#t~mem7);havoc main_#t~mem7; 3838#L30-4 main_~nc_B~0 := 0; 3839#L34-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 3858#L34-1 assume !!(0 != main_#t~mem9);havoc main_#t~mem9;main_#t~post10 := main_~nc_B~0;main_~nc_B~0 := 1 + main_#t~post10;havoc main_#t~post10; 3859#L34-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 3860#L34-1 assume !!(0 != main_#t~mem9);havoc main_#t~mem9;main_#t~post10 := main_~nc_B~0;main_~nc_B~0 := 1 + main_#t~post10;havoc main_#t~post10; 3879#L34-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 3876#L34-1 assume !!(0 != main_#t~mem9);havoc main_#t~mem9;main_#t~post10 := main_~nc_B~0;main_~nc_B~0 := 1 + main_#t~post10;havoc main_#t~post10; 3875#L34-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 3865#L34-1 assume !(0 != main_#t~mem9);havoc main_#t~mem9; 3852#L34-4 assume !!(main_~nc_B~0 >= main_~nc_A~0);main_~j~0 := 0;main_~i~0 := main_~j~0; 3853#L43-2 [2018-11-28 23:42:28,407 INFO L796 eck$LassoCheckResult]: Loop: 3853#L43-2 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0);call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0, 1); 3854#L43 assume !(main_#t~mem11 == main_#t~mem12);havoc main_#t~mem11;havoc main_#t~mem12;main_~i~0 := 1 + (main_~i~0 - main_~j~0);main_~j~0 := 0; 3853#L43-2 [2018-11-28 23:42:28,407 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:42:28,408 INFO L82 PathProgramCache]: Analyzing trace with hash 1972313288, now seen corresponding path program 2 times [2018-11-28 23:42:28,408 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:42:28,408 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:42:28,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:28,409 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:42:28,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:28,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:42:28,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:42:28,451 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:42:28,451 INFO L82 PathProgramCache]: Analyzing trace with hash 3558, now seen corresponding path program 1 times [2018-11-28 23:42:28,451 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:42:28,451 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:42:28,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:28,452 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:42:28,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:28,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:42:28,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:42:28,461 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:42:28,461 INFO L82 PathProgramCache]: Analyzing trace with hash 1312494829, now seen corresponding path program 6 times [2018-11-28 23:42:28,461 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:42:28,461 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:42:28,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:28,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:42:28,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:28,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:42:28,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:42:28,702 WARN L180 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2018-11-28 23:42:34,954 WARN L180 SmtUtils]: Spent 6.22 s on a formula simplification. DAG size of input: 309 DAG size of output: 234 [2018-11-28 23:42:35,259 WARN L180 SmtUtils]: Spent 298.00 ms on a formula simplification that was a NOOP. DAG size: 126 [2018-11-28 23:42:35,262 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:42:35,262 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:42:35,262 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:42:35,262 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:42:35,262 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:42:35,262 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:42:35,263 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:42:35,263 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:42:35,263 INFO L131 ssoRankerPreferences]: Filename of dumped script: string_false-unreach-call_true-termination.i_Iteration18_Lasso [2018-11-28 23:42:35,263 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:42:35,263 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:42:35,268 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:35,275 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:35,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:35,279 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:35,283 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:35,286 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:35,287 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:35,290 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:35,310 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:35,312 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:35,316 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:35,972 WARN L180 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 77 [2018-11-28 23:42:36,105 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:36,108 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:36,118 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:36,120 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:36,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:36,125 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:36,127 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:36,139 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:36,462 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 36 [2018-11-28 23:42:36,834 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:42:36,834 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:42:36,835 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:36,835 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:36,835 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:42:36,835 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:36,835 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:36,835 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:36,843 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:42:36,843 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:42:36,843 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:36,844 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:36,844 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:36,844 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:42:36,844 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:36,844 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:36,845 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:36,845 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:42:36,845 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:42:36,845 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:36,846 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:36,846 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:36,846 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:42:36,846 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:36,846 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:36,846 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:36,850 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:42:36,850 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:42:36,850 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:36,851 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:36,851 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:36,851 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:36,851 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:36,851 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:36,855 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:42:36,855 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:42:36,856 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:36,856 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:36,857 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:36,857 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:42:36,857 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:36,857 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:36,857 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:36,859 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:42:36,859 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:42:36,859 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:36,860 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:36,860 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:36,860 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:42:36,860 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:36,860 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:36,860 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:36,863 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:42:36,863 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:42:36,863 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:36,864 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:36,864 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:36,864 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:42:36,864 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:36,864 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:36,864 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:36,865 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:42:36,865 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:42:36,865 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:36,865 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:36,869 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:36,869 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:36,869 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:36,869 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:36,870 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:42:36,870 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:42:36,874 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:36,875 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:36,875 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:36,875 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:36,875 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:36,875 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:36,876 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:42:36,876 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:42:36,877 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:36,877 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:36,878 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:36,878 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:42:36,878 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:36,878 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:36,878 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:36,878 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:42:36,879 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:42:36,882 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:36,882 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:36,883 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:36,883 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:42:36,883 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:36,883 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:36,883 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:36,883 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:42:36,884 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:42:36,887 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:36,887 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:36,888 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:36,888 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:36,888 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:36,888 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:36,892 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:42:36,892 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:42:36,893 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:36,893 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:36,894 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:36,894 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:42:36,894 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:36,894 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:36,895 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:42:36,895 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:42:36,896 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:36,896 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:36,900 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:36,900 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:36,900 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:36,900 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:36,901 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:42:36,901 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:42:36,906 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:36,907 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:36,907 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:36,907 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:42:36,907 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:36,907 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:36,911 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:42:36,911 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:42:36,912 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:36,916 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:36,916 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:36,917 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:36,917 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:36,917 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:36,917 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:42:36,917 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:42:36,918 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:36,921 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:36,921 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:36,921 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:42:36,921 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:36,922 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:36,922 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:42:36,922 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:42:36,927 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:36,927 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:36,927 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:36,928 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:36,928 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:36,928 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:36,928 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:42:36,928 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:42:36,932 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:36,933 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:36,933 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:36,933 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2018-11-28 23:42:36,933 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 23:42:36,934 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:36,940 INFO L402 nArgumentSynthesizer]: We have 28 Motzkin's Theorem applications. [2018-11-28 23:42:36,940 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-28 23:42:36,972 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:36,973 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:36,976 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:36,976 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:42:36,976 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:36,976 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:36,977 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:42:36,977 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:42:36,979 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:36,979 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:36,979 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:36,979 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:42:36,980 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:36,980 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:36,980 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:42:36,980 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:42:36,985 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:36,985 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:36,986 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:36,989 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:36,989 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:36,989 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:36,990 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:42:36,990 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:42:36,994 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:36,995 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:36,995 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:36,995 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:36,996 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:36,996 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:36,996 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:42:36,996 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:42:37,000 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:37,001 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:37,001 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:37,001 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:42:37,001 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:37,005 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:37,005 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:42:37,005 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:42:37,007 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:37,007 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:37,008 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:37,008 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:37,008 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:37,008 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:37,013 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:42:37,013 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:42:37,060 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:42:37,114 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-11-28 23:42:37,114 INFO L444 ModelExtractionUtils]: 16 out of 28 variables were initially zero. Simplification set additionally 9 variables to zero. [2018-11-28 23:42:37,114 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:42:37,115 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:42:37,115 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:42:37,115 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~nc_A~0) = -1*ULTIMATE.start_main_~i~0 + 1*ULTIMATE.start_main_~nc_A~0 Supporting invariants [] [2018-11-28 23:42:37,509 INFO L297 tatePredicateManager]: 45 out of 46 supporting invariants were superfluous and have been removed [2018-11-28 23:42:37,531 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:42:37,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:42:37,568 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:42:37,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:42:37,577 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:42:37,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:42:37,589 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 [2018-11-28 23:42:37,589 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 50 states and 55 transitions. cyclomatic complexity: 9 Second operand 3 states. [2018-11-28 23:42:37,632 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 50 states and 55 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 59 states and 69 transitions. Complement of second has 6 states. [2018-11-28 23:42:37,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 2 accepting loop states [2018-11-28 23:42:37,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:42:37,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2018-11-28 23:42:37,636 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 46 letters. Loop has 2 letters. [2018-11-28 23:42:37,636 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:42:37,636 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 48 letters. Loop has 2 letters. [2018-11-28 23:42:37,636 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:42:37,636 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 46 letters. Loop has 4 letters. [2018-11-28 23:42:37,636 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:42:37,637 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 69 transitions. [2018-11-28 23:42:37,637 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 23:42:37,638 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 57 states and 65 transitions. [2018-11-28 23:42:37,638 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2018-11-28 23:42:37,638 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2018-11-28 23:42:37,638 INFO L73 IsDeterministic]: Start isDeterministic. Operand 57 states and 65 transitions. [2018-11-28 23:42:37,639 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:42:37,639 INFO L705 BuchiCegarLoop]: Abstraction has 57 states and 65 transitions. [2018-11-28 23:42:37,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states and 65 transitions. [2018-11-28 23:42:37,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 53. [2018-11-28 23:42:37,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-28 23:42:37,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 60 transitions. [2018-11-28 23:42:37,641 INFO L728 BuchiCegarLoop]: Abstraction has 53 states and 60 transitions. [2018-11-28 23:42:37,641 INFO L608 BuchiCegarLoop]: Abstraction has 53 states and 60 transitions. [2018-11-28 23:42:37,641 INFO L442 BuchiCegarLoop]: ======== Iteration 19============ [2018-11-28 23:42:37,641 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 60 transitions. [2018-11-28 23:42:37,642 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 23:42:37,642 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:42:37,642 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:42:37,643 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:42:37,643 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 23:42:37,643 INFO L794 eck$LassoCheckResult]: Stem: 4330#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 4325#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~post1, main_#t~mem3, main_#t~nondet5, main_#t~post4, main_#t~mem6, main_#t~post8, main_#t~mem7, main_#t~post10, main_#t~mem9, main_#t~mem11, main_#t~mem12, main_#t~post13, main_#t~post14, main_~#string_A~0.base, main_~#string_A~0.offset, main_~#string_B~0.base, main_~#string_B~0.offset, main_~i~0, main_~j~0, main_~nc_A~0, main_~nc_B~0, main_~found~0;call main_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.alloc(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.alloc(5);havoc main_~i~0;havoc main_~j~0;havoc main_~nc_A~0;havoc main_~nc_B~0;main_~found~0 := 0;main_~i~0 := 0; 4315#L21-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 4316#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 4317#L21-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 4318#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 4358#L21-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 4357#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 4356#L21-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 4355#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 4354#L21-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 4353#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 4352#L21-3 assume !(main_~i~0 < 5); 4313#L21-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 4314#L23 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 4334#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 4335#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 4337#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 4351#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 4349#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 4348#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 4345#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 4344#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 4343#L25-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 4341#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 4340#L25-3 assume !(main_~i~0 < 5); 4329#L25-4 call main_#t~mem6 := read~int(main_~#string_B~0.base, 4 + main_~#string_B~0.offset, 1); 4308#L27 assume !!(0 == main_#t~mem6);havoc main_#t~mem6;main_~nc_A~0 := 0; 4309#L30-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 4310#L30-1 assume !!(0 != main_#t~mem7);havoc main_#t~mem7;main_#t~post8 := main_~nc_A~0;main_~nc_A~0 := 1 + main_#t~post8;havoc main_#t~post8; 4311#L30-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 4312#L30-1 assume !!(0 != main_#t~mem7);havoc main_#t~mem7;main_#t~post8 := main_~nc_A~0;main_~nc_A~0 := 1 + main_#t~post8;havoc main_#t~post8; 4342#L30-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 4339#L30-1 assume !!(0 != main_#t~mem7);havoc main_#t~mem7;main_#t~post8 := main_~nc_A~0;main_~nc_A~0 := 1 + main_#t~post8;havoc main_#t~post8; 4338#L30-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 4319#L30-1 assume !(0 != main_#t~mem7);havoc main_#t~mem7; 4306#L30-4 main_~nc_B~0 := 0; 4307#L34-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 4326#L34-1 assume !!(0 != main_#t~mem9);havoc main_#t~mem9;main_#t~post10 := main_~nc_B~0;main_~nc_B~0 := 1 + main_#t~post10;havoc main_#t~post10; 4327#L34-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 4328#L34-1 assume !!(0 != main_#t~mem9);havoc main_#t~mem9;main_#t~post10 := main_~nc_B~0;main_~nc_B~0 := 1 + main_#t~post10;havoc main_#t~post10; 4350#L34-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 4347#L34-1 assume !!(0 != main_#t~mem9);havoc main_#t~mem9;main_#t~post10 := main_~nc_B~0;main_~nc_B~0 := 1 + main_#t~post10;havoc main_#t~post10; 4346#L34-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 4336#L34-1 assume !(0 != main_#t~mem9);havoc main_#t~mem9; 4320#L34-4 assume !!(main_~nc_B~0 >= main_~nc_A~0);main_~j~0 := 0;main_~i~0 := main_~j~0; 4321#L43-2 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0);call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0, 1); 4323#L43 assume main_#t~mem11 == main_#t~mem12;havoc main_#t~mem11;havoc main_#t~mem12;main_#t~post13 := main_~i~0;main_~i~0 := 1 + main_#t~post13;havoc main_#t~post13;main_#t~post14 := main_~j~0;main_~j~0 := 1 + main_#t~post14;havoc main_#t~post14; 4333#L43-2 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0);call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0, 1); 4331#L43 [2018-11-28 23:42:37,643 INFO L796 eck$LassoCheckResult]: Loop: 4331#L43 assume !(main_#t~mem11 == main_#t~mem12);havoc main_#t~mem11;havoc main_#t~mem12;main_~i~0 := 1 + (main_~i~0 - main_~j~0);main_~j~0 := 0; 4332#L43-2 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0);call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0, 1); 4331#L43 [2018-11-28 23:42:37,643 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:42:37,643 INFO L82 PathProgramCache]: Analyzing trace with hash 2032634054, now seen corresponding path program 2 times [2018-11-28 23:42:37,643 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:42:37,644 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:42:37,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:37,644 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:42:37,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:37,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:42:37,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:42:37,682 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:42:37,682 INFO L82 PathProgramCache]: Analyzing trace with hash 3708, now seen corresponding path program 2 times [2018-11-28 23:42:37,682 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:42:37,683 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:42:37,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:37,683 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:42:37,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:37,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:42:37,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:42:37,687 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:42:37,687 INFO L82 PathProgramCache]: Analyzing trace with hash -848791039, now seen corresponding path program 6 times [2018-11-28 23:42:37,687 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:42:37,687 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:42:37,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:37,688 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:42:37,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:37,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:42:37,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:42:37,986 WARN L180 SmtUtils]: Spent 238.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2018-11-28 23:42:42,397 WARN L180 SmtUtils]: Spent 4.37 s on a formula simplification. DAG size of input: 348 DAG size of output: 255 [2018-11-28 23:42:42,644 WARN L180 SmtUtils]: Spent 240.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2018-11-28 23:42:42,647 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:42:42,647 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:42:42,647 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:42:42,648 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:42:42,648 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:42:42,648 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:42:42,648 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:42:42,648 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:42:42,648 INFO L131 ssoRankerPreferences]: Filename of dumped script: string_false-unreach-call_true-termination.i_Iteration19_Lasso [2018-11-28 23:42:42,648 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:42:42,648 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:42:42,652 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:42,661 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:42,662 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:42,664 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:43,247 WARN L180 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 80 [2018-11-28 23:42:43,378 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:43,381 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:43,382 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:43,384 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:43,386 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:43,388 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:43,389 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:43,391 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:43,393 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:43,395 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:43,396 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:43,401 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:43,403 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:44,072 WARN L180 SmtUtils]: Spent 294.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2018-11-28 23:42:44,266 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:42:44,266 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:42:44,266 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:44,267 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:44,267 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:42:44,267 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:44,267 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:44,267 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:44,267 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:42:44,268 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:42:44,268 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:44,268 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:44,269 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:44,269 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:42:44,269 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:44,269 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:44,269 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:44,269 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:42:44,269 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:42:44,270 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:44,270 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:44,270 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:44,270 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:42:44,270 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:44,271 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:44,271 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:44,271 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:42:44,271 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:42:44,271 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:44,272 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:44,272 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:44,272 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:42:44,272 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:44,272 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:44,272 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:44,273 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:42:44,273 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:42:44,273 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:44,273 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:44,274 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:44,274 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:44,274 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:44,274 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:44,274 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:42:44,274 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:42:44,275 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:44,275 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:44,276 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:44,276 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:44,276 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:44,276 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:44,277 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:42:44,277 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:42:44,278 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:44,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 [2018-11-28 23:42:44,278 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:44,278 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:44,278 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:44,279 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:44,279 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:42:44,279 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:42:44,280 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:44,280 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:44,281 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:44,281 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:44,281 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:44,281 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:44,282 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:42:44,282 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:42:44,284 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:44,284 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:44,284 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:44,285 INFO L205 nArgumentSynthesizer]: 8 stem disjuncts [2018-11-28 23:42:44,285 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 23:42:44,285 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:44,291 INFO L402 nArgumentSynthesizer]: We have 44 Motzkin's Theorem applications. [2018-11-28 23:42:44,292 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-28 23:42:44,329 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:44,330 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:44,330 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:44,330 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:42:44,330 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:44,331 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:44,331 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:42:44,332 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:42:44,333 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:44,333 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:44,334 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:44,334 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:42:44,334 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:44,334 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:44,334 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:42:44,335 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:42:44,336 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:44,336 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:44,337 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:44,337 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:44,337 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:44,337 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:44,337 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:42:44,338 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:42:44,338 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:44,339 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:44,339 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:44,339 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:44,339 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:44,339 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:44,340 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:42:44,340 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:42:44,342 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:44,342 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:44,343 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:44,343 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:44,343 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:44,343 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:44,343 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:42:44,344 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:42:44,344 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:44,345 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:44,345 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:44,345 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:42:44,345 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:44,345 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:44,346 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:42:44,346 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:42:44,347 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:44,348 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:44,348 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:44,348 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:44,348 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:44,348 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:44,350 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:42:44,350 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:42:44,362 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:42:44,371 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-28 23:42:44,371 INFO L444 ModelExtractionUtils]: 23 out of 28 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 23:42:44,372 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:42:44,372 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:42:44,372 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:42:44,372 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~nc_A~0) = 1*ULTIMATE.start_main_~j~0 - 1*ULTIMATE.start_main_~i~0 + 1*ULTIMATE.start_main_~nc_A~0 Supporting invariants [] [2018-11-28 23:42:45,078 INFO L297 tatePredicateManager]: 46 out of 46 supporting invariants were superfluous and have been removed [2018-11-28 23:42:45,091 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:42:45,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:42:45,141 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:42:45,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:42:45,164 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:42:45,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:42:45,275 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 [2018-11-28 23:42:45,276 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 53 states and 60 transitions. cyclomatic complexity: 12 Second operand 3 states. [2018-11-28 23:42:45,304 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 53 states and 60 transitions. cyclomatic complexity: 12. Second operand 3 states. Result 66 states and 77 transitions. Complement of second has 6 states. [2018-11-28 23:42:45,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 23:42:45,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:42:45,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2018-11-28 23:42:45,307 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 49 letters. Loop has 2 letters. [2018-11-28 23:42:45,307 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:42:45,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 51 letters. Loop has 2 letters. [2018-11-28 23:42:45,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:42:45,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 49 letters. Loop has 4 letters. [2018-11-28 23:42:45,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:42:45,311 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 66 states and 77 transitions. [2018-11-28 23:42:45,311 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:42:45,312 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 66 states to 0 states and 0 transitions. [2018-11-28 23:42:45,312 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-28 23:42:45,312 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-28 23:42:45,312 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-28 23:42:45,312 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:42:45,312 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:42:45,312 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:42:45,312 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:42:45,312 INFO L442 BuchiCegarLoop]: ======== Iteration 20============ [2018-11-28 23:42:45,313 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-28 23:42:45,313 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:42:45,313 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-28 23:42:45,333 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 11:42:45 BoogieIcfgContainer [2018-11-28 23:42:45,334 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 23:42:45,334 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 23:42:45,334 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 23:42:45,334 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 23:42:45,336 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:41:45" (3/4) ... [2018-11-28 23:42:45,346 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 23:42:45,346 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 23:42:45,347 INFO L168 Benchmark]: Toolchain (without parser) took 60995.43 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 471.9 MB). Free memory was 946.0 MB in the beginning and 966.2 MB in the end (delta: -20.2 MB). Peak memory consumption was 451.7 MB. Max. memory is 11.5 GB. [2018-11-28 23:42:45,348 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:42:45,349 INFO L168 Benchmark]: CACSL2BoogieTranslator took 369.73 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 935.2 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-28 23:42:45,350 INFO L168 Benchmark]: Boogie Procedure Inliner took 58.55 ms. Allocated memory is still 1.0 GB. Free memory was 935.2 MB in the beginning and 929.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-28 23:42:45,350 INFO L168 Benchmark]: Boogie Preprocessor took 63.96 ms. Allocated memory is still 1.0 GB. Free memory is still 929.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:42:45,352 INFO L168 Benchmark]: RCFGBuilder took 639.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 929.9 MB in the beginning and 1.1 GB in the end (delta: -173.6 MB). Peak memory consumption was 13.9 MB. Max. memory is 11.5 GB. [2018-11-28 23:42:45,353 INFO L168 Benchmark]: BuchiAutomizer took 59845.18 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 337.1 MB). Free memory was 1.1 GB in the beginning and 966.2 MB in the end (delta: 137.3 MB). Peak memory consumption was 474.4 MB. Max. memory is 11.5 GB. [2018-11-28 23:42:45,354 INFO L168 Benchmark]: Witness Printer took 12.38 ms. Allocated memory is still 1.5 GB. Free memory is still 966.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:42:45,362 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.27 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 369.73 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 935.2 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 58.55 ms. Allocated memory is still 1.0 GB. Free memory was 935.2 MB in the beginning and 929.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 63.96 ms. Allocated memory is still 1.0 GB. Free memory is still 929.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 639.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 929.9 MB in the beginning and 1.1 GB in the end (delta: -173.6 MB). Peak memory consumption was 13.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 59845.18 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 337.1 MB). Free memory was 1.1 GB in the beginning and 966.2 MB in the end (delta: 137.3 MB). Peak memory consumption was 474.4 MB. Max. memory is 11.5 GB. * Witness Printer took 12.38 ms. Allocated memory is still 1.5 GB. Free memory is still 966.2 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 - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 19 terminating modules (11 trivial, 7 deterministic, 1 nondeterministic). One deterministic module has affine ranking function 9 * unknown-#length-unknown[string_A] + -2 * i and consists of 5 locations. One deterministic module has affine ranking function unknown-#length-unknown[string_A] + -1 * string_A + -1 * nc_A and consists of 3 locations. One deterministic module has affine ranking function unknown-#length-unknown[string_B] + -1 * string_B + -1 * nc_B and consists of 3 locations. One deterministic module has affine ranking function unknown-#length-unknown[string_A] + -1 * string_A + -1 * i and consists of 3 locations. One deterministic module has affine ranking function -1 * i + nc_A and consists of 3 locations. One deterministic module has affine ranking function -1 * i + nc_A and consists of 4 locations. One deterministic module has affine ranking function j + -1 * i + nc_A and consists of 4 locations. One nondeterministic module has affine ranking function nc_B + -1 * j and consists of 3 locations. 11 modules have a trivial ranking function, the largest among these consists of 12 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 59.7s and 20 iterations. TraceHistogramMax:5. Analysis of lassos took 55.3s. Construction of modules took 1.5s. Büchi inclusion checks took 2.5s. Highest rank in rank-based complementation 3. Minimization of det autom 8. Minimization of nondet autom 11. Automata minimization 0.0s AutomataMinimizationTime, 18 MinimizatonAttempts, 58 StatesRemovedByMinimization, 13 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 56 states and ocurred in iteration 16. Nontrivial modules had stage [7, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 369 SDtfs, 364 SDslu, 465 SDs, 0 SdLazy, 719 SolverSat, 125 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc5 concLT0 SILN0 SILU6 SILI0 SILT0 lasso8 LassoPreprocessingBenchmarks: Lassos: inital313 mio100 ax100 hnf99 lsp96 ukn44 mio100 lsp57 div100 bol100 ite100 ukn100 eq171 hnf84 smp94 dnf366 smp88 tf100 neg95 sie110 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 45ms VariablesStem: 8 VariablesLoop: 7 DisjunctsStem: 8 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 44 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...