./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 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/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-0ed9222-m [2019-01-14 03:40:27,071 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 03:40:27,072 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 03:40:27,093 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 03:40:27,093 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 03:40:27,094 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 03:40:27,095 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 03:40:27,097 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 03:40:27,099 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 03:40:27,100 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 03:40:27,101 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 03:40:27,101 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 03:40:27,102 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 03:40:27,103 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 03:40:27,104 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 03:40:27,105 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 03:40:27,106 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 03:40:27,110 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 03:40:27,112 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 03:40:27,114 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 03:40:27,115 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 03:40:27,116 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 03:40:27,119 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 03:40:27,119 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 03:40:27,119 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 03:40:27,120 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 03:40:27,121 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 03:40:27,122 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 03:40:27,123 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 03:40:27,124 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 03:40:27,124 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 03:40:27,125 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 03:40:27,125 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 03:40:27,126 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 03:40:27,127 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 03:40:27,128 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 03:40:27,128 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-14 03:40:27,145 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 03:40:27,146 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 03:40:27,147 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 03:40:27,147 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 03:40:27,147 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 03:40:27,147 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 03:40:27,148 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 03:40:27,148 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 03:40:27,148 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 03:40:27,148 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 03:40:27,148 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 03:40:27,149 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 03:40:27,149 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 03:40:27,149 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 03:40:27,149 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 03:40:27,149 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 03:40:27,149 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 03:40:27,150 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 03:40:27,150 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 03:40:27,150 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 03:40:27,150 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 03:40:27,150 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 03:40:27,150 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 03:40:27,151 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 03:40:27,151 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 03:40:27,151 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 03:40:27,151 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 03:40:27,151 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 03:40:27,151 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 03:40:27,152 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 03:40:27,152 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 03:40:27,155 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 03:40:27,155 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 [2019-01-14 03:40:27,200 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 03:40:27,214 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 03:40:27,218 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 03:40:27,220 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 03:40:27,221 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 03:40:27,222 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/loops/string_false-unreach-call_true-termination.i [2019-01-14 03:40:27,288 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62d6cad62/0514aa2a55004b60bd13cdd3ad580feb/FLAGa1f806aaf [2019-01-14 03:40:27,778 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 03:40:27,780 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/loops/string_false-unreach-call_true-termination.i [2019-01-14 03:40:27,788 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62d6cad62/0514aa2a55004b60bd13cdd3ad580feb/FLAGa1f806aaf [2019-01-14 03:40:28,084 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62d6cad62/0514aa2a55004b60bd13cdd3ad580feb [2019-01-14 03:40:28,088 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 03:40:28,090 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 03:40:28,091 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 03:40:28,091 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 03:40:28,095 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 03:40:28,096 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 03:40:28" (1/1) ... [2019-01-14 03:40:28,102 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c850f9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:40:28, skipping insertion in model container [2019-01-14 03:40:28,102 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 03:40:28" (1/1) ... [2019-01-14 03:40:28,112 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 03:40:28,140 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 03:40:28,368 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 03:40:28,375 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 03:40:28,413 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 03:40:28,458 INFO L195 MainTranslator]: Completed translation [2019-01-14 03:40:28,458 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:40:28 WrapperNode [2019-01-14 03:40:28,458 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 03:40:28,459 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 03:40:28,460 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 03:40:28,460 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 03:40:28,469 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:40:28" (1/1) ... [2019-01-14 03:40:28,481 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:40:28" (1/1) ... [2019-01-14 03:40:28,503 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 03:40:28,503 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 03:40:28,503 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 03:40:28,503 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 03:40:28,513 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:40:28" (1/1) ... [2019-01-14 03:40:28,513 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:40:28" (1/1) ... [2019-01-14 03:40:28,516 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:40:28" (1/1) ... [2019-01-14 03:40:28,516 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:40:28" (1/1) ... [2019-01-14 03:40:28,524 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:40:28" (1/1) ... [2019-01-14 03:40:28,598 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:40:28" (1/1) ... [2019-01-14 03:40:28,600 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:40:28" (1/1) ... [2019-01-14 03:40:28,603 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 03:40:28,604 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 03:40:28,604 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 03:40:28,604 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 03:40:28,605 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:40:28" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:40:28,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 03:40:28,670 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 03:40:28,670 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 03:40:28,671 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 03:40:28,671 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 03:40:28,671 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 03:40:29,154 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 03:40:29,155 INFO L286 CfgBuilder]: Removed 11 assue(true) statements. [2019-01-14 03:40:29,157 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 03:40:29 BoogieIcfgContainer [2019-01-14 03:40:29,157 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 03:40:29,158 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 03:40:29,158 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 03:40:29,162 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 03:40:29,163 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 03:40:29,163 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 03:40:28" (1/3) ... [2019-01-14 03:40:29,165 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2a601ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 03:40:29, skipping insertion in model container [2019-01-14 03:40:29,165 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 03:40:29,165 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:40:28" (2/3) ... [2019-01-14 03:40:29,165 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2a601ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 03:40:29, skipping insertion in model container [2019-01-14 03:40:29,165 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 03:40:29,166 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 03:40:29" (3/3) ... [2019-01-14 03:40:29,167 INFO L375 chiAutomizerObserver]: Analyzing ICFG string_false-unreach-call_true-termination.i [2019-01-14 03:40:29,230 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 03:40:29,231 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 03:40:29,231 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 03:40:29,231 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 03:40:29,231 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 03:40:29,231 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 03:40:29,232 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 03:40:29,232 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 03:40:29,232 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 03:40:29,249 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2019-01-14 03:40:29,272 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2019-01-14 03:40:29,272 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:40:29,272 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:40:29,278 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-14 03:40:29,278 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 03:40:29,278 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 03:40:29,279 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2019-01-14 03:40:29,281 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2019-01-14 03:40:29,281 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:40:29,282 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:40:29,282 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-14 03:40:29,282 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 03:40:29,289 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.allocOnStack(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.allocOnStack(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 [2019-01-14 03:40:29,289 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 [2019-01-14 03:40:29,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:40:29,295 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-01-14 03:40:29,297 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:40:29,297 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:40:29,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:29,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:40:29,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:29,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:40:29,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:40:29,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:40:29,418 INFO L82 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2019-01-14 03:40:29,418 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:40:29,418 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:40:29,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:29,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:40:29,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:29,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:40:29,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:40:29,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:40:29,437 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2019-01-14 03:40:29,437 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:40:29,437 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:40:29,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:29,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:40:29,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:29,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:40:29,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:40:29,839 WARN L181 SmtUtils]: Spent 249.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2019-01-14 03:40:29,967 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-01-14 03:40:29,989 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 03:40:29,990 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 03:40:29,990 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 03:40:29,991 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 03:40:29,991 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 03:40:29,991 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:40:29,991 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 03:40:29,991 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 03:40:29,991 INFO L131 ssoRankerPreferences]: Filename of dumped script: string_false-unreach-call_true-termination.i_Iteration1_Lasso [2019-01-14 03:40:29,991 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 03:40:29,992 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 03:40:30,020 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:30,044 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:30,047 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:30,054 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:30,057 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:30,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:30,074 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:30,077 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:30,080 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:30,088 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:30,101 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:30,109 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:30,116 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:30,119 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:30,123 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:30,279 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2019-01-14 03:40:30,325 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:30,336 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:30,342 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:30,350 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:30,352 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:30,355 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:30,361 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:30,783 WARN L181 SmtUtils]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-01-14 03:40:31,156 WARN L181 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 19 [2019-01-14 03:40:31,223 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 03:40:31,227 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 03:40:31,229 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:40:31,231 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:31,231 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:40:31,232 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:31,232 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:31,232 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:31,234 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:40:31,234 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:40:31,237 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:31,237 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:40:31,238 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:31,238 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:40:31,238 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:31,238 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:31,239 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:31,239 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:40:31,239 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:40:31,241 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:31,241 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:40:31,242 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:31,242 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:40:31,242 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:31,242 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:31,243 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:31,243 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:40:31,243 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:40:31,244 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:31,245 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:40:31,246 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:31,246 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:40:31,246 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:31,246 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:31,246 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:31,247 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:40:31,247 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:40:31,248 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:31,249 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:40:31,249 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:31,250 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:40:31,250 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:31,250 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:31,250 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:31,251 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:40:31,251 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:40:31,252 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:31,253 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:40:31,253 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:31,254 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:31,254 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:31,254 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:31,257 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:40:31,257 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:40:31,262 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:31,262 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:40:31,263 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:31,263 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:40:31,263 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:31,264 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:31,264 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:31,264 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:40:31,265 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:40:31,265 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:31,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 [2019-01-14 03:40:31,267 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:31,267 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:40:31,267 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:31,267 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:31,267 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:31,268 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:40:31,268 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:40:31,270 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:31,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 [2019-01-14 03:40:31,271 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:31,271 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:40:31,271 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:31,271 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:31,271 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:31,272 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:40:31,272 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:40:31,273 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:31,274 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:40:31,275 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:31,275 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:40:31,275 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:31,275 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:31,275 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:31,276 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:40:31,276 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:40:31,277 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:31,278 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:40:31,278 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:31,278 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:31,279 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:31,279 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:31,281 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:40:31,281 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:40:31,285 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:31,286 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:40:31,287 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:31,287 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:40:31,287 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:31,287 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:31,287 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:31,288 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:40:31,288 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:40:31,289 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:31,290 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:40:31,290 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:31,291 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:40:31,291 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:31,291 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:31,291 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:31,292 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:40:31,292 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:40:31,293 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:31,293 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:40:31,294 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:31,294 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:31,294 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:31,295 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:31,297 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:40:31,297 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:40:31,301 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:31,302 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:40:31,302 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:31,302 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:31,303 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:31,303 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:31,305 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:40:31,305 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:40:31,312 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:31,312 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:40:31,313 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:31,313 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:31,313 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:31,314 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:31,318 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:40:31,318 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:40:31,362 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 03:40:31,390 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 03:40:31,391 INFO L444 ModelExtractionUtils]: 10 out of 13 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-14 03:40:31,393 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 03:40:31,396 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 03:40:31,397 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 03:40:31,397 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 9 Supporting invariants [] [2019-01-14 03:40:31,413 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-01-14 03:40:31,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:40:31,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:40:31,494 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:40:31,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:40:31,528 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:40:31,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 03:40:31,724 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-14 03:40:31,726 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states. Second operand 3 states. [2019-01-14 03:40:31,822 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states.. Second operand 3 states. Result 56 states and 85 transitions. Complement of second has 8 states. [2019-01-14 03:40:31,823 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 [2019-01-14 03:40:31,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 03:40:31,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2019-01-14 03:40:31,830 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 43 transitions. Stem has 2 letters. Loop has 2 letters. [2019-01-14 03:40:31,831 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:40:31,831 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 43 transitions. Stem has 4 letters. Loop has 2 letters. [2019-01-14 03:40:31,831 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:40:31,831 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 43 transitions. Stem has 2 letters. Loop has 4 letters. [2019-01-14 03:40:31,832 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:40:31,833 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 56 states and 85 transitions. [2019-01-14 03:40:31,841 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2019-01-14 03:40:31,845 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 56 states to 19 states and 28 transitions. [2019-01-14 03:40:31,847 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-01-14 03:40:31,847 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-01-14 03:40:31,848 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 28 transitions. [2019-01-14 03:40:31,848 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 03:40:31,849 INFO L706 BuchiCegarLoop]: Abstraction has 19 states and 28 transitions. [2019-01-14 03:40:31,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 28 transitions. [2019-01-14 03:40:31,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-01-14 03:40:31,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-01-14 03:40:31,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 28 transitions. [2019-01-14 03:40:31,876 INFO L729 BuchiCegarLoop]: Abstraction has 19 states and 28 transitions. [2019-01-14 03:40:31,876 INFO L609 BuchiCegarLoop]: Abstraction has 19 states and 28 transitions. [2019-01-14 03:40:31,876 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 03:40:31,876 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 28 transitions. [2019-01-14 03:40:31,877 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2019-01-14 03:40:31,877 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:40:31,877 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:40:31,878 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-14 03:40:31,878 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 03:40:31,878 INFO L794 eck$LassoCheckResult]: Stem: 149#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 146#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.allocOnStack(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.allocOnStack(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; 140#L21-3 assume !(main_~i~0 < 5); 138#L21-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 139#L23 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 150#L25-3 [2019-01-14 03:40:31,878 INFO L796 eck$LassoCheckResult]: Loop: 150#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; 151#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 150#L25-3 [2019-01-14 03:40:31,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:40:31,879 INFO L82 PathProgramCache]: Analyzing trace with hash 28696938, now seen corresponding path program 1 times [2019-01-14 03:40:31,879 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:40:31,879 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:40:31,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:31,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:40:31,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:31,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:40:31,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 03:40:31,939 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 03:40:31,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 03:40:31,941 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 03:40:31,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:40:31,941 INFO L82 PathProgramCache]: Analyzing trace with hash 1891, now seen corresponding path program 1 times [2019-01-14 03:40:31,942 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:40:31,942 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:40:31,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:31,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:40:31,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:31,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:40:31,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:40:32,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 03:40:32,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 03:40:32,072 INFO L87 Difference]: Start difference. First operand 19 states and 28 transitions. cyclomatic complexity: 14 Second operand 3 states. [2019-01-14 03:40:32,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 03:40:32,220 INFO L93 Difference]: Finished difference Result 24 states and 30 transitions. [2019-01-14 03:40:32,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 03:40:32,222 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 30 transitions. [2019-01-14 03:40:32,223 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2019-01-14 03:40:32,226 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 24 states and 30 transitions. [2019-01-14 03:40:32,226 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2019-01-14 03:40:32,226 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2019-01-14 03:40:32,226 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 30 transitions. [2019-01-14 03:40:32,227 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 03:40:32,227 INFO L706 BuchiCegarLoop]: Abstraction has 24 states and 30 transitions. [2019-01-14 03:40:32,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 30 transitions. [2019-01-14 03:40:32,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 20. [2019-01-14 03:40:32,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-01-14 03:40:32,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2019-01-14 03:40:32,231 INFO L729 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2019-01-14 03:40:32,231 INFO L609 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2019-01-14 03:40:32,231 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 03:40:32,231 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 25 transitions. [2019-01-14 03:40:32,232 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2019-01-14 03:40:32,232 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:40:32,232 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:40:32,233 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 03:40:32,233 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 03:40:32,233 INFO L794 eck$LassoCheckResult]: Stem: 198#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 196#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.allocOnStack(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.allocOnStack(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; 189#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; 190#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 191#L21-3 assume !(main_~i~0 < 5); 187#L21-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 188#L23 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 199#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; 200#L25-2 [2019-01-14 03:40:32,233 INFO L796 eck$LassoCheckResult]: Loop: 200#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 201#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; 200#L25-2 [2019-01-14 03:40:32,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:40:32,234 INFO L82 PathProgramCache]: Analyzing trace with hash 265181045, now seen corresponding path program 1 times [2019-01-14 03:40:32,234 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:40:32,234 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:40:32,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:32,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:40:32,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:32,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:40:32,287 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 03:40:32,287 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 03:40:32,287 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 03:40:32,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:40:32,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:40:32,329 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:40:32,361 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 03:40:32,381 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 03:40:32,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-01-14 03:40:32,382 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 03:40:32,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:40:32,382 INFO L82 PathProgramCache]: Analyzing trace with hash 1951, now seen corresponding path program 2 times [2019-01-14 03:40:32,382 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:40:32,382 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:40:32,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:32,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:40:32,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:32,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:40:32,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:40:32,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 03:40:32,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-14 03:40:32,548 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. cyclomatic complexity: 10 Second operand 5 states. [2019-01-14 03:40:32,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 03:40:32,624 INFO L93 Difference]: Finished difference Result 30 states and 37 transitions. [2019-01-14 03:40:32,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 03:40:32,625 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 37 transitions. [2019-01-14 03:40:32,627 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2019-01-14 03:40:32,628 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 37 transitions. [2019-01-14 03:40:32,629 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2019-01-14 03:40:32,629 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2019-01-14 03:40:32,629 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 37 transitions. [2019-01-14 03:40:32,629 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 03:40:32,629 INFO L706 BuchiCegarLoop]: Abstraction has 30 states and 37 transitions. [2019-01-14 03:40:32,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 37 transitions. [2019-01-14 03:40:32,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2019-01-14 03:40:32,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-01-14 03:40:32,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2019-01-14 03:40:32,633 INFO L729 BuchiCegarLoop]: Abstraction has 24 states and 29 transitions. [2019-01-14 03:40:32,633 INFO L609 BuchiCegarLoop]: Abstraction has 24 states and 29 transitions. [2019-01-14 03:40:32,633 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 03:40:32,633 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 29 transitions. [2019-01-14 03:40:32,634 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2019-01-14 03:40:32,634 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:40:32,634 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:40:32,635 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-01-14 03:40:32,635 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 03:40:32,635 INFO L794 eck$LassoCheckResult]: Stem: 278#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 275#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.allocOnStack(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.allocOnStack(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; 268#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; 269#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 270#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; 271#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 283#L21-3 assume !(main_~i~0 < 5); 266#L21-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 267#L23 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 281#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; 282#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 279#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; 280#L25-2 [2019-01-14 03:40:32,635 INFO L796 eck$LassoCheckResult]: Loop: 280#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 284#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; 280#L25-2 [2019-01-14 03:40:32,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:40:32,636 INFO L82 PathProgramCache]: Analyzing trace with hash 780717205, now seen corresponding path program 1 times [2019-01-14 03:40:32,636 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:40:32,636 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:40:32,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:32,637 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 03:40:32,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:32,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:40:32,719 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 03:40:32,719 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 03:40:32,720 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 [2019-01-14 03:40:32,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:40:32,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:40:32,747 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:40:32,848 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 03:40:32,872 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 03:40:32,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-01-14 03:40:32,872 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 03:40:32,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:40:32,873 INFO L82 PathProgramCache]: Analyzing trace with hash 1951, now seen corresponding path program 3 times [2019-01-14 03:40:32,873 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:40:32,873 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:40:32,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:32,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:40:32,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:32,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:40:32,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:40:32,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 03:40:32,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-14 03:40:32,989 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. cyclomatic complexity: 10 Second operand 6 states. [2019-01-14 03:40:33,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 03:40:33,089 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2019-01-14 03:40:33,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 03:40:33,090 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 44 transitions. [2019-01-14 03:40:33,092 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2019-01-14 03:40:33,094 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 36 states and 44 transitions. [2019-01-14 03:40:33,094 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2019-01-14 03:40:33,095 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2019-01-14 03:40:33,095 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 44 transitions. [2019-01-14 03:40:33,095 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 03:40:33,095 INFO L706 BuchiCegarLoop]: Abstraction has 36 states and 44 transitions. [2019-01-14 03:40:33,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 44 transitions. [2019-01-14 03:40:33,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 28. [2019-01-14 03:40:33,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-14 03:40:33,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2019-01-14 03:40:33,099 INFO L729 BuchiCegarLoop]: Abstraction has 28 states and 33 transitions. [2019-01-14 03:40:33,099 INFO L609 BuchiCegarLoop]: Abstraction has 28 states and 33 transitions. [2019-01-14 03:40:33,099 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-14 03:40:33,099 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 33 transitions. [2019-01-14 03:40:33,101 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2019-01-14 03:40:33,101 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:40:33,101 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:40:33,102 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 1, 1, 1, 1, 1] [2019-01-14 03:40:33,102 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 03:40:33,102 INFO L794 eck$LassoCheckResult]: Stem: 381#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 378#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.allocOnStack(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.allocOnStack(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; 370#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; 371#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 374#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; 389#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 372#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; 373#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 387#L21-3 assume !(main_~i~0 < 5); 368#L21-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 369#L23 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 384#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; 385#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 386#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; 390#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; 383#L25-2 [2019-01-14 03:40:33,102 INFO L796 eck$LassoCheckResult]: Loop: 383#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 388#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; 383#L25-2 [2019-01-14 03:40:33,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:40:33,103 INFO L82 PathProgramCache]: Analyzing trace with hash 2111137973, now seen corresponding path program 2 times [2019-01-14 03:40:33,103 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:40:33,103 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:40:33,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:33,104 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 03:40:33,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:33,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:40:33,204 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-14 03:40:33,205 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 03:40:33,205 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 [2019-01-14 03:40:33,218 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 03:40:33,239 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 03:40:33,239 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 03:40:33,242 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:40:33,261 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-14 03:40:33,283 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 03:40:33,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-01-14 03:40:33,284 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 03:40:33,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:40:33,284 INFO L82 PathProgramCache]: Analyzing trace with hash 1951, now seen corresponding path program 4 times [2019-01-14 03:40:33,284 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:40:33,284 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:40:33,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:33,286 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 03:40:33,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:33,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:40:33,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:40:33,441 WARN L181 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2019-01-14 03:40:33,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 03:40:33,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-01-14 03:40:33,458 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. cyclomatic complexity: 10 Second operand 7 states. [2019-01-14 03:40:33,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 03:40:33,565 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2019-01-14 03:40:33,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 03:40:33,567 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 51 transitions. [2019-01-14 03:40:33,570 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2019-01-14 03:40:33,572 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 42 states and 51 transitions. [2019-01-14 03:40:33,573 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2019-01-14 03:40:33,573 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2019-01-14 03:40:33,573 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 51 transitions. [2019-01-14 03:40:33,573 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 03:40:33,574 INFO L706 BuchiCegarLoop]: Abstraction has 42 states and 51 transitions. [2019-01-14 03:40:33,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 51 transitions. [2019-01-14 03:40:33,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 32. [2019-01-14 03:40:33,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-14 03:40:33,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2019-01-14 03:40:33,579 INFO L729 BuchiCegarLoop]: Abstraction has 32 states and 37 transitions. [2019-01-14 03:40:33,579 INFO L609 BuchiCegarLoop]: Abstraction has 32 states and 37 transitions. [2019-01-14 03:40:33,579 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-14 03:40:33,579 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 37 transitions. [2019-01-14 03:40:33,580 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2019-01-14 03:40:33,580 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:40:33,580 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:40:33,583 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 4, 3, 1, 1, 1, 1, 1] [2019-01-14 03:40:33,583 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 03:40:33,583 INFO L794 eck$LassoCheckResult]: Stem: 505#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 503#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.allocOnStack(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.allocOnStack(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; 495#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; 496#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 497#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; 498#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 515#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; 514#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 513#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; 510#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); 493#L21-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 494#L23 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 506#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; 507#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 508#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; 519#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 518#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; 517#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 516#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; 512#L25-2 [2019-01-14 03:40:33,583 INFO L796 eck$LassoCheckResult]: Loop: 512#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 511#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; 512#L25-2 [2019-01-14 03:40:33,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:40:33,584 INFO L82 PathProgramCache]: Analyzing trace with hash 213314517, now seen corresponding path program 3 times [2019-01-14 03:40:33,584 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:40:33,584 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:40:33,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:33,585 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 03:40:33,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:33,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:40:33,723 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-01-14 03:40:33,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 03:40:33,724 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 [2019-01-14 03:40:33,742 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 03:40:33,791 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-01-14 03:40:33,792 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 03:40:33,794 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:40:33,804 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-01-14 03:40:33,828 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 03:40:33,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-01-14 03:40:33,829 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 03:40:33,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:40:33,829 INFO L82 PathProgramCache]: Analyzing trace with hash 1951, now seen corresponding path program 5 times [2019-01-14 03:40:33,829 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:40:33,829 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:40:33,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:33,833 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 03:40:33,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:33,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:40:33,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:40:33,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 03:40:33,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-14 03:40:33,904 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. cyclomatic complexity: 10 Second operand 8 states. [2019-01-14 03:40:34,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 03:40:34,018 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2019-01-14 03:40:34,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 03:40:34,020 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 56 transitions. [2019-01-14 03:40:34,022 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2019-01-14 03:40:34,023 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 46 states and 56 transitions. [2019-01-14 03:40:34,024 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2019-01-14 03:40:34,024 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2019-01-14 03:40:34,024 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 56 transitions. [2019-01-14 03:40:34,025 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 03:40:34,025 INFO L706 BuchiCegarLoop]: Abstraction has 46 states and 56 transitions. [2019-01-14 03:40:34,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 56 transitions. [2019-01-14 03:40:34,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 36. [2019-01-14 03:40:34,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-14 03:40:34,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2019-01-14 03:40:34,029 INFO L729 BuchiCegarLoop]: Abstraction has 36 states and 41 transitions. [2019-01-14 03:40:34,029 INFO L609 BuchiCegarLoop]: Abstraction has 36 states and 41 transitions. [2019-01-14 03:40:34,029 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-14 03:40:34,029 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 41 transitions. [2019-01-14 03:40:34,030 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2019-01-14 03:40:34,030 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:40:34,030 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:40:34,031 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 4, 1, 1, 1, 1, 1] [2019-01-14 03:40:34,031 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 03:40:34,031 INFO L794 eck$LassoCheckResult]: Stem: 651#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 648#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.allocOnStack(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.allocOnStack(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; 641#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; 642#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 643#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; 644#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 666#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; 664#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 662#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; 661#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 658#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; 657#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); 639#L21-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 640#L23 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 654#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; 655#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 652#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; 653#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 669#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; 668#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 667#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; 665#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; 660#L25-2 [2019-01-14 03:40:34,031 INFO L796 eck$LassoCheckResult]: Loop: 660#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 659#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; 660#L25-2 [2019-01-14 03:40:34,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:40:34,032 INFO L82 PathProgramCache]: Analyzing trace with hash 1212159477, now seen corresponding path program 4 times [2019-01-14 03:40:34,032 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:40:34,032 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:40:34,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:34,033 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 03:40:34,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:34,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:40:34,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:40:34,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:40:34,095 INFO L82 PathProgramCache]: Analyzing trace with hash 1951, now seen corresponding path program 6 times [2019-01-14 03:40:34,096 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:40:34,096 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:40:34,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:34,097 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 03:40:34,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:34,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:40:34,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:40:34,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:40:34,104 INFO L82 PathProgramCache]: Analyzing trace with hash 949121171, now seen corresponding path program 5 times [2019-01-14 03:40:34,104 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:40:34,104 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:40:34,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:34,105 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 03:40:34,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:34,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:40:34,384 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-01-14 03:40:34,385 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 03:40:34,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-14 03:40:34,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-14 03:40:34,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-01-14 03:40:34,448 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. cyclomatic complexity: 10 Second operand 9 states. [2019-01-14 03:40:34,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 03:40:34,652 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2019-01-14 03:40:34,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-14 03:40:34,652 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 41 transitions. [2019-01-14 03:40:34,653 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2019-01-14 03:40:34,654 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 37 states and 41 transitions. [2019-01-14 03:40:34,654 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2019-01-14 03:40:34,654 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2019-01-14 03:40:34,654 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 41 transitions. [2019-01-14 03:40:34,657 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 03:40:34,657 INFO L706 BuchiCegarLoop]: Abstraction has 37 states and 41 transitions. [2019-01-14 03:40:34,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 41 transitions. [2019-01-14 03:40:34,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2019-01-14 03:40:34,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-14 03:40:34,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2019-01-14 03:40:34,663 INFO L729 BuchiCegarLoop]: Abstraction has 36 states and 40 transitions. [2019-01-14 03:40:34,663 INFO L609 BuchiCegarLoop]: Abstraction has 36 states and 40 transitions. [2019-01-14 03:40:34,663 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2019-01-14 03:40:34,663 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 40 transitions. [2019-01-14 03:40:34,664 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2019-01-14 03:40:34,664 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:40:34,664 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:40:34,665 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 03:40:34,665 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 03:40:34,666 INFO L794 eck$LassoCheckResult]: Stem: 739#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 737#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.allocOnStack(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.allocOnStack(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; 728#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; 729#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 730#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; 731#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 732#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; 756#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 755#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; 754#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 753#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; 744#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 743#L21-3 assume !(main_~i~0 < 5); 726#L21-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 727#L23 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 740#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; 741#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 742#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; 752#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 751#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; 750#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 749#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; 748#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 747#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); 738#L25-4 call main_#t~mem6 := read~int(main_~#string_B~0.base, 4 + main_~#string_B~0.offset, 1); 723#L27 assume !!(0 == main_#t~mem6);havoc main_#t~mem6;main_~nc_A~0 := 0; 724#L30-3 [2019-01-14 03:40:34,666 INFO L796 eck$LassoCheckResult]: Loop: 724#L30-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 725#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; 724#L30-3 [2019-01-14 03:40:34,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:40:34,666 INFO L82 PathProgramCache]: Analyzing trace with hash 1572377782, now seen corresponding path program 1 times [2019-01-14 03:40:34,666 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:40:34,667 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:40:34,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:34,668 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 03:40:34,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:34,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:40:34,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:40:34,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:40:34,754 INFO L82 PathProgramCache]: Analyzing trace with hash 2406, now seen corresponding path program 1 times [2019-01-14 03:40:34,754 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:40:34,754 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:40:34,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:34,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:40:34,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:34,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:40:34,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:40:34,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:40:34,767 INFO L82 PathProgramCache]: Analyzing trace with hash -773438245, now seen corresponding path program 1 times [2019-01-14 03:40:34,767 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:40:34,767 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:40:34,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:34,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:40:34,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:34,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:40:34,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:40:38,550 WARN L181 SmtUtils]: Spent 3.63 s on a formula simplification. DAG size of input: 216 DAG size of output: 164 [2019-01-14 03:40:38,762 WARN L181 SmtUtils]: Spent 193.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2019-01-14 03:40:38,765 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 03:40:38,765 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 03:40:38,765 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 03:40:38,765 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 03:40:38,765 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 03:40:38,765 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:40:38,765 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 03:40:38,765 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 03:40:38,766 INFO L131 ssoRankerPreferences]: Filename of dumped script: string_false-unreach-call_true-termination.i_Iteration8_Lasso [2019-01-14 03:40:38,766 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 03:40:38,766 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 03:40:38,776 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:38,809 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:38,816 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:38,818 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:38,820 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:38,824 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:38,826 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:38,828 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:38,829 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:38,831 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:38,832 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:38,834 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:38,837 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:38,839 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:39,094 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:39,096 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:39,098 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:39,100 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:39,101 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:39,103 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:39,106 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:39,453 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 03:40:39,453 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 03:40:39,454 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:40:39,455 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:39,455 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:40:39,455 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:39,455 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:39,455 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:39,456 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:40:39,456 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:40:39,457 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:39,457 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:40:39,458 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:39,458 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:40:39,458 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:39,458 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:39,458 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:39,458 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:40:39,459 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:40:39,459 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:39,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 [2019-01-14 03:40:39,460 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:39,460 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:40:39,460 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:39,460 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:39,460 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:39,461 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:40:39,461 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:40:39,461 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:39,462 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:40:39,462 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:39,462 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:39,462 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:39,462 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:39,464 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:40:39,464 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:40:39,465 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:39,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 [2019-01-14 03:40:39,466 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:39,466 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:40:39,467 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:39,467 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:39,467 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:39,467 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:40:39,467 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:40:39,468 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:39,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 [2019-01-14 03:40:39,468 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:39,469 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:40:39,469 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:39,469 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:39,469 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:39,469 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:40:39,469 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:40:39,470 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:39,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 [2019-01-14 03:40:39,471 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:39,471 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:40:39,471 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:39,471 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:39,471 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:39,471 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:40:39,472 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:40:39,472 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:39,478 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:40:39,479 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:39,479 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:40:39,479 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:39,479 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:39,479 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:39,480 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:40:39,480 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:40:39,480 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:39,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 [2019-01-14 03:40:39,483 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:39,484 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:40:39,484 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:39,484 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:39,484 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:39,484 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:40:39,484 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:40:39,485 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:39,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 [2019-01-14 03:40:39,495 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:39,495 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:40:39,495 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:39,496 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:39,496 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:39,496 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:40:39,496 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:40:39,497 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:39,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 [2019-01-14 03:40:39,498 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:39,498 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:40:39,500 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:39,500 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:39,500 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:39,500 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:40:39,501 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:40:39,501 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:39,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 [2019-01-14 03:40:39,506 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:39,507 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:40:39,507 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:39,507 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:39,507 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:39,508 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:40:39,508 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:40:39,508 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:39,509 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:40:39,509 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:39,510 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:39,513 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:39,513 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:39,514 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:40:39,514 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:40:39,519 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:39,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 [2019-01-14 03:40:39,521 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:39,521 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:39,521 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:39,521 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:39,527 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:40:39,527 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:40:39,534 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:39,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 [2019-01-14 03:40:39,535 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:39,535 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:39,535 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:39,535 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:39,539 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:40:39,539 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:40:39,544 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:39,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 [2019-01-14 03:40:39,545 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:39,545 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2019-01-14 03:40:39,545 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:39,546 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:39,549 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-14 03:40:39,553 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:40:39,563 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:39,563 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:40:39,567 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:39,567 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:39,567 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:39,568 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:39,569 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:40:39,569 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:40:39,575 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:39,576 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:40:39,579 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:39,579 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:39,580 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:39,580 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:39,581 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:40:39,581 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:40:39,582 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:39,583 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:40:39,585 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:39,585 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:40:39,586 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:39,586 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:39,586 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:39,588 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:40:39,589 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:40:39,589 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:39,593 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:40:39,593 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:39,593 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:39,594 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:39,594 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:39,594 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:40:39,595 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:40:39,596 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:39,599 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:40:39,600 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:39,600 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:39,600 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:39,600 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:39,601 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:40:39,601 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:40:39,623 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 03:40:39,632 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-01-14 03:40:39,632 INFO L444 ModelExtractionUtils]: 7 out of 13 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-01-14 03:40:39,633 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 03:40:39,635 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 03:40:39,635 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 03:40:39,635 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 [] [2019-01-14 03:40:39,729 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2019-01-14 03:40:39,741 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-14 03:40:39,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:40:39,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:40:39,782 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:40:39,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:40:39,792 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:40:39,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 03:40:39,803 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-14 03:40:39,803 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 36 states and 40 transitions. cyclomatic complexity: 8 Second operand 3 states. [2019-01-14 03:40:39,832 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. [2019-01-14 03:40:39,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 03:40:39,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 03:40:39,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2019-01-14 03:40:39,834 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 28 letters. Loop has 2 letters. [2019-01-14 03:40:39,835 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:40:39,835 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 30 letters. Loop has 2 letters. [2019-01-14 03:40:39,837 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:40:39,837 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 28 letters. Loop has 4 letters. [2019-01-14 03:40:39,838 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:40:39,839 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 52 transitions. [2019-01-14 03:40:39,839 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-01-14 03:40:39,840 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 38 states and 43 transitions. [2019-01-14 03:40:39,840 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2019-01-14 03:40:39,840 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2019-01-14 03:40:39,840 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 43 transitions. [2019-01-14 03:40:39,841 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 03:40:39,841 INFO L706 BuchiCegarLoop]: Abstraction has 38 states and 43 transitions. [2019-01-14 03:40:39,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 43 transitions. [2019-01-14 03:40:39,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-01-14 03:40:39,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-14 03:40:39,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2019-01-14 03:40:39,846 INFO L729 BuchiCegarLoop]: Abstraction has 38 states and 43 transitions. [2019-01-14 03:40:39,846 INFO L609 BuchiCegarLoop]: Abstraction has 38 states and 43 transitions. [2019-01-14 03:40:39,846 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2019-01-14 03:40:39,846 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 43 transitions. [2019-01-14 03:40:39,847 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-01-14 03:40:39,847 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:40:39,847 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:40:39,848 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 03:40:39,848 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 03:40:39,849 INFO L794 eck$LassoCheckResult]: Stem: 946#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 944#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.allocOnStack(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.allocOnStack(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; 936#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; 937#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 938#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; 939#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 964#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; 963#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 962#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; 961#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 960#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); 934#L21-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 935#L23 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 950#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; 949#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; 948#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 959#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; 958#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 955#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; 954#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; 951#L25-3 assume !(main_~i~0 < 5); 945#L25-4 call main_#t~mem6 := read~int(main_~#string_B~0.base, 4 + main_~#string_B~0.offset, 1); 929#L27 assume !!(0 == main_#t~mem6);havoc main_#t~mem6;main_~nc_A~0 := 0; 930#L30-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 932#L30-1 assume !(0 != main_#t~mem7);havoc main_#t~mem7; 927#L30-4 main_~nc_B~0 := 0; 928#L34-3 [2019-01-14 03:40:39,849 INFO L796 eck$LassoCheckResult]: Loop: 928#L34-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 943#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; 928#L34-3 [2019-01-14 03:40:39,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:40:39,849 INFO L82 PathProgramCache]: Analyzing trace with hash 1793218173, now seen corresponding path program 1 times [2019-01-14 03:40:39,849 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:40:39,849 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:40:39,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:39,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:40:39,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:39,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:40:39,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:40:39,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:40:39,895 INFO L82 PathProgramCache]: Analyzing trace with hash 2854, now seen corresponding path program 1 times [2019-01-14 03:40:39,895 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:40:39,895 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:40:39,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:39,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:40:39,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:39,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:40:39,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:40:39,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:40:39,904 INFO L82 PathProgramCache]: Analyzing trace with hash 1000780450, now seen corresponding path program 1 times [2019-01-14 03:40:39,904 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:40:39,904 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:40:39,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:39,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:40:39,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:39,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:40:39,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:40:44,044 WARN L181 SmtUtils]: Spent 3.98 s on a formula simplification. DAG size of input: 227 DAG size of output: 174 [2019-01-14 03:40:44,219 WARN L181 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2019-01-14 03:40:44,221 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 03:40:44,222 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 03:40:44,222 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 03:40:44,222 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 03:40:44,222 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 03:40:44,222 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:40:44,222 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 03:40:44,222 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 03:40:44,222 INFO L131 ssoRankerPreferences]: Filename of dumped script: string_false-unreach-call_true-termination.i_Iteration9_Lasso [2019-01-14 03:40:44,222 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 03:40:44,222 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 03:40:44,226 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:44,235 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:44,242 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:44,455 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:44,457 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:44,459 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:44,460 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:44,463 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:44,464 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:44,466 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:44,468 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:44,469 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:44,471 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:44,472 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:44,474 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:44,475 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:44,476 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:44,477 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:44,481 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:44,482 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:44,803 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 03:40:44,804 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 03:40:44,805 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:40:44,805 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:44,805 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:40:44,806 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:44,809 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:44,809 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:44,810 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:40:44,811 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:40:44,811 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:44,813 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:40:44,813 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:44,814 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:44,814 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:44,814 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:44,818 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:40:44,818 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:40:44,819 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:44,821 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:40:44,822 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:44,822 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:44,822 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:44,822 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:44,826 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:40:44,826 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:40:44,828 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:44,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 [2019-01-14 03:40:44,830 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:44,830 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:44,830 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:44,830 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:44,836 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:40:44,836 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:40:44,848 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 03:40:44,862 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2019-01-14 03:40:44,862 INFO L444 ModelExtractionUtils]: 16 out of 25 variables were initially zero. Simplification set additionally 5 variables to zero. [2019-01-14 03:40:44,863 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 03:40:44,864 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 03:40:44,865 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 03:40:44,866 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~#string_B~0.offset, ULTIMATE.start_main_~nc_B~0, 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 + 1*v_rep(select #length ULTIMATE.start_main_~#string_B~0.base)_3 Supporting invariants [] [2019-01-14 03:40:44,969 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2019-01-14 03:40:44,983 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-14 03:40:45,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:40:45,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:40:45,262 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:40:45,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:40:45,282 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:40:45,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 03:40:45,417 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-14 03:40:45,417 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 38 states and 43 transitions. cyclomatic complexity: 9 Second operand 3 states. [2019-01-14 03:40:45,536 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. [2019-01-14 03:40:45,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 03:40:45,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 03:40:45,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2019-01-14 03:40:45,538 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 31 letters. Loop has 2 letters. [2019-01-14 03:40:45,538 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:40:45,538 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 33 letters. Loop has 2 letters. [2019-01-14 03:40:45,541 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:40:45,542 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 31 letters. Loop has 4 letters. [2019-01-14 03:40:45,542 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:40:45,542 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 51 transitions. [2019-01-14 03:40:45,543 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 03:40:45,544 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 40 states and 46 transitions. [2019-01-14 03:40:45,546 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2019-01-14 03:40:45,546 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2019-01-14 03:40:45,546 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 46 transitions. [2019-01-14 03:40:45,546 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 03:40:45,547 INFO L706 BuchiCegarLoop]: Abstraction has 40 states and 46 transitions. [2019-01-14 03:40:45,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 46 transitions. [2019-01-14 03:40:45,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-01-14 03:40:45,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-14 03:40:45,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2019-01-14 03:40:45,552 INFO L729 BuchiCegarLoop]: Abstraction has 40 states and 46 transitions. [2019-01-14 03:40:45,552 INFO L609 BuchiCegarLoop]: Abstraction has 40 states and 46 transitions. [2019-01-14 03:40:45,554 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2019-01-14 03:40:45,554 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 46 transitions. [2019-01-14 03:40:45,555 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 03:40:45,555 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:40:45,555 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:40:45,556 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 03:40:45,556 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 03:40:45,556 INFO L794 eck$LassoCheckResult]: Stem: 1164#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1159#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.allocOnStack(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.allocOnStack(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; 1152#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; 1153#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1154#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; 1155#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1182#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; 1181#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1180#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; 1179#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1178#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); 1150#L21-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 1151#L23 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 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; 1168#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; 1166#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1177#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; 1176#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1173#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; 1172#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; 1169#L25-3 assume !(main_~i~0 < 5); 1163#L25-4 call main_#t~mem6 := read~int(main_~#string_B~0.base, 4 + main_~#string_B~0.offset, 1); 1145#L27 assume !!(0 == main_#t~mem6);havoc main_#t~mem6;main_~nc_A~0 := 0; 1146#L30-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 1148#L30-1 assume !(0 != main_#t~mem7);havoc main_#t~mem7; 1143#L30-4 main_~nc_B~0 := 0; 1144#L34-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 1161#L34-1 assume !(0 != main_#t~mem9);havoc main_#t~mem9; 1156#L34-4 assume !!(main_~nc_B~0 >= main_~nc_A~0);main_~j~0 := 0;main_~i~0 := main_~j~0; 1157#L43-2 [2019-01-14 03:40:45,557 INFO L796 eck$LassoCheckResult]: Loop: 1157#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); 1158#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; 1157#L43-2 [2019-01-14 03:40:45,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:40:45,562 INFO L82 PathProgramCache]: Analyzing trace with hash 959422888, now seen corresponding path program 1 times [2019-01-14 03:40:45,562 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:40:45,562 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:40:45,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:45,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:40:45,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:45,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:40:45,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:40:45,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:40:45,604 INFO L82 PathProgramCache]: Analyzing trace with hash 3556, now seen corresponding path program 1 times [2019-01-14 03:40:45,604 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:40:45,604 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:40:45,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:45,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:40:45,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:45,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:40:45,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:40:45,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:40:45,615 INFO L82 PathProgramCache]: Analyzing trace with hash -1412570677, now seen corresponding path program 1 times [2019-01-14 03:40:45,615 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:40:45,615 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:40:45,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:45,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:40:45,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:45,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:40:45,835 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-01-14 03:40:45,835 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 03:40:45,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 03:40:46,183 WARN L181 SmtUtils]: Spent 346.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2019-01-14 03:40:46,475 WARN L181 SmtUtils]: Spent 290.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-01-14 03:40:46,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 03:40:46,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-14 03:40:46,477 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. cyclomatic complexity: 10 Second operand 4 states. [2019-01-14 03:40:46,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 03:40:46,535 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2019-01-14 03:40:46,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 03:40:46,536 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 56 transitions. [2019-01-14 03:40:46,537 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 03:40:46,537 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 41 states and 46 transitions. [2019-01-14 03:40:46,538 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2019-01-14 03:40:46,538 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2019-01-14 03:40:46,538 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 46 transitions. [2019-01-14 03:40:46,538 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 03:40:46,538 INFO L706 BuchiCegarLoop]: Abstraction has 41 states and 46 transitions. [2019-01-14 03:40:46,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 46 transitions. [2019-01-14 03:40:46,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2019-01-14 03:40:46,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-14 03:40:46,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2019-01-14 03:40:46,543 INFO L729 BuchiCegarLoop]: Abstraction has 40 states and 45 transitions. [2019-01-14 03:40:46,543 INFO L609 BuchiCegarLoop]: Abstraction has 40 states and 45 transitions. [2019-01-14 03:40:46,543 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2019-01-14 03:40:46,543 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 45 transitions. [2019-01-14 03:40:46,544 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 03:40:46,545 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:40:46,545 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:40:46,546 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 03:40:46,547 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 03:40:46,547 INFO L794 eck$LassoCheckResult]: Stem: 1262#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1260#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.allocOnStack(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.allocOnStack(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; 1250#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; 1251#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1252#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; 1253#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1280#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; 1279#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1277#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; 1275#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1273#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; 1270#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1269#L21-3 assume !(main_~i~0 < 5); 1248#L21-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 1249#L23 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 1263#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; 1264#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1265#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; 1278#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1276#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; 1274#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1272#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; 1271#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1268#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; 1267#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); 1261#L25-4 call main_#t~mem6 := read~int(main_~#string_B~0.base, 4 + main_~#string_B~0.offset, 1); 1243#L27 assume !!(0 == main_#t~mem6);havoc main_#t~mem6;main_~nc_A~0 := 0; 1244#L30-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 1245#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; 1246#L30-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 1247#L30-1 assume !(0 != main_#t~mem7);havoc main_#t~mem7; 1241#L30-4 main_~nc_B~0 := 0; 1242#L34-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 1258#L34-1 assume !(0 != main_#t~mem9);havoc main_#t~mem9; 1254#L34-4 assume !!(main_~nc_B~0 >= main_~nc_A~0);main_~j~0 := 0;main_~i~0 := main_~j~0; 1255#L43-2 [2019-01-14 03:40:46,547 INFO L796 eck$LassoCheckResult]: Loop: 1255#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); 1256#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; 1255#L43-2 [2019-01-14 03:40:46,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:40:46,547 INFO L82 PathProgramCache]: Analyzing trace with hash 94364173, now seen corresponding path program 1 times [2019-01-14 03:40:46,547 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:40:46,548 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:40:46,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:46,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:40:46,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:46,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:40:46,977 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-01-14 03:40:46,977 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 03:40:46,977 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 [2019-01-14 03:40:46,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:40:47,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:40:47,027 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:40:47,086 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-01-14 03:40:47,116 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 03:40:47,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2019-01-14 03:40:47,116 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 03:40:47,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:40:47,117 INFO L82 PathProgramCache]: Analyzing trace with hash 3556, now seen corresponding path program 2 times [2019-01-14 03:40:47,118 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:40:47,118 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:40:47,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:47,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:40:47,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:47,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:40:47,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:40:47,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-14 03:40:47,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-01-14 03:40:47,208 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. cyclomatic complexity: 9 Second operand 9 states. [2019-01-14 03:40:47,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 03:40:47,286 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2019-01-14 03:40:47,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 03:40:47,288 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 48 transitions. [2019-01-14 03:40:47,288 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 03:40:47,289 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 42 states and 46 transitions. [2019-01-14 03:40:47,290 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2019-01-14 03:40:47,290 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2019-01-14 03:40:47,290 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 46 transitions. [2019-01-14 03:40:47,290 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 03:40:47,290 INFO L706 BuchiCegarLoop]: Abstraction has 42 states and 46 transitions. [2019-01-14 03:40:47,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 46 transitions. [2019-01-14 03:40:47,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2019-01-14 03:40:47,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-14 03:40:47,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2019-01-14 03:40:47,297 INFO L729 BuchiCegarLoop]: Abstraction has 40 states and 44 transitions. [2019-01-14 03:40:47,297 INFO L609 BuchiCegarLoop]: Abstraction has 40 states and 44 transitions. [2019-01-14 03:40:47,297 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2019-01-14 03:40:47,297 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 44 transitions. [2019-01-14 03:40:47,298 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 03:40:47,298 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:40:47,298 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:40:47,299 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 03:40:47,299 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 03:40:47,299 INFO L794 eck$LassoCheckResult]: Stem: 1465#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1463#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.allocOnStack(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.allocOnStack(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; 1453#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; 1454#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1455#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; 1456#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1483#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; 1482#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1480#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; 1478#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1476#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; 1471#L21-3 assume !(main_~i~0 < 5); 1451#L21-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 1452#L23 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 1466#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; 1467#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1468#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; 1481#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1479#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; 1477#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1475#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; 1474#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; 1470#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); 1464#L25-4 call main_#t~mem6 := read~int(main_~#string_B~0.base, 4 + main_~#string_B~0.offset, 1); 1446#L27 assume !!(0 == main_#t~mem6);havoc main_#t~mem6;main_~nc_A~0 := 0; 1447#L30-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 1448#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; 1449#L30-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 1450#L30-1 assume !(0 != main_#t~mem7);havoc main_#t~mem7; 1444#L30-4 main_~nc_B~0 := 0; 1445#L34-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 1460#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; 1461#L34-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 1462#L34-1 assume !(0 != main_#t~mem9);havoc main_#t~mem9; 1457#L34-4 assume !!(main_~nc_B~0 >= main_~nc_A~0);main_~j~0 := 0;main_~i~0 := main_~j~0; 1458#L43-2 [2019-01-14 03:40:47,299 INFO L796 eck$LassoCheckResult]: Loop: 1458#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); 1459#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; 1458#L43-2 [2019-01-14 03:40:47,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:40:47,300 INFO L82 PathProgramCache]: Analyzing trace with hash 489706120, now seen corresponding path program 1 times [2019-01-14 03:40:47,300 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:40:47,300 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:40:47,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:47,301 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 03:40:47,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:47,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:40:47,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:40:47,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:40:47,350 INFO L82 PathProgramCache]: Analyzing trace with hash 3556, now seen corresponding path program 3 times [2019-01-14 03:40:47,350 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:40:47,350 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:40:47,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:47,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:40:47,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:47,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:40:47,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:40:47,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:40:47,362 INFO L82 PathProgramCache]: Analyzing trace with hash -1838818645, now seen corresponding path program 1 times [2019-01-14 03:40:47,362 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:40:47,362 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:40:47,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:47,363 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 03:40:47,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:47,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:40:47,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:40:47,525 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2019-01-14 03:40:47,714 WARN L181 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-01-14 03:40:51,937 WARN L181 SmtUtils]: Spent 4.22 s on a formula simplification. DAG size of input: 264 DAG size of output: 202 [2019-01-14 03:40:52,196 WARN L181 SmtUtils]: Spent 249.00 ms on a formula simplification that was a NOOP. DAG size: 117 [2019-01-14 03:40:52,199 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 03:40:52,199 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 03:40:52,199 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 03:40:52,199 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 03:40:52,200 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 03:40:52,200 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:40:52,200 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 03:40:52,200 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 03:40:52,200 INFO L131 ssoRankerPreferences]: Filename of dumped script: string_false-unreach-call_true-termination.i_Iteration12_Lasso [2019-01-14 03:40:52,200 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 03:40:52,200 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 03:40:52,206 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:52,219 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:52,220 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:52,222 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:52,223 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:52,225 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:52,227 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:52,238 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:52,240 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:52,242 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:52,243 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:52,246 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:52,720 WARN L181 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 66 [2019-01-14 03:40:52,819 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:52,821 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:52,823 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:52,825 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:52,826 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:52,827 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:52,829 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:53,352 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 03:40:53,353 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 03:40:53,353 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:40:53,354 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:53,354 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:40:53,354 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:53,355 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:53,357 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:53,357 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:40:53,357 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:40:53,358 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:53,358 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:40:53,359 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:53,359 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:40:53,359 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:53,359 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:53,359 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:53,360 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:40:53,363 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:40:53,363 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:53,364 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:40:53,364 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:53,364 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:40:53,364 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:53,365 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:53,366 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:53,367 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:40:53,367 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:40:53,367 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:53,367 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:40:53,368 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:53,368 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:40:53,368 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:53,368 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:53,368 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:53,368 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:40:53,369 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:40:53,369 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:53,369 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:40:53,370 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:53,380 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:40:53,380 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:53,380 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:53,380 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:53,381 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:40:53,381 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:40:53,381 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:53,382 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:40:53,382 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:53,382 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:53,382 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:53,382 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:53,386 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:40:53,386 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:40:53,389 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:53,390 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:40:53,390 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:53,390 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:53,391 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:53,391 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:53,391 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:40:53,391 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:40:53,396 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:53,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 [2019-01-14 03:40:53,397 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:53,399 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:40:53,399 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:53,399 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:53,399 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:53,402 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:40:53,402 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:40:53,403 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:53,403 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:40:53,403 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:53,403 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:40:53,404 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:53,408 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:53,408 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:53,408 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:40:53,408 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:40:53,409 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:53,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 [2019-01-14 03:40:53,411 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:53,412 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:40:53,412 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:53,412 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:53,412 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:53,412 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:40:53,412 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:40:53,415 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:53,415 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:40:53,416 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:53,416 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:53,416 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:53,416 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:53,417 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:40:53,417 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:40:53,422 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:53,423 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:40:53,423 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:53,423 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:53,423 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:53,424 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:53,424 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:40:53,424 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:40:53,428 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:53,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 [2019-01-14 03:40:53,428 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:53,429 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:53,429 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:53,429 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:53,429 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:40:53,430 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:40:53,436 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:53,436 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:40:53,437 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:53,437 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2019-01-14 03:40:53,437 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:53,437 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:53,439 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-14 03:40:53,439 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:40:53,450 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:53,451 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:40:53,452 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:53,452 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:53,452 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:53,452 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:53,453 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:40:53,453 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:40:53,453 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:53,454 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:40:53,454 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:53,454 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:53,455 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:53,455 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:53,455 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:40:53,455 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:40:53,456 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:53,465 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:40:53,465 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:53,466 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:40:53,466 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:53,466 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:53,466 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:53,466 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:40:53,466 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:40:53,470 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:53,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 [2019-01-14 03:40:53,471 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:53,471 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2019-01-14 03:40:53,471 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:53,471 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:53,472 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-14 03:40:53,473 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:40:53,482 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:53,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 [2019-01-14 03:40:53,483 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:53,483 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:53,483 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:53,483 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:53,486 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:40:53,486 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:40:53,510 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 03:40:53,560 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2019-01-14 03:40:53,560 INFO L444 ModelExtractionUtils]: 19 out of 28 variables were initially zero. Simplification set additionally 5 variables to zero. [2019-01-14 03:40:53,560 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 03:40:53,561 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 03:40:53,561 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 03:40:53,561 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#string_B~0.base)_4, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~#string_B~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_~#string_B~0.base)_4 - 1*ULTIMATE.start_main_~j~0 - 1*ULTIMATE.start_main_~#string_B~0.offset Supporting invariants [] [2019-01-14 03:40:53,950 INFO L297 tatePredicateManager]: 14 out of 14 supporting invariants were superfluous and have been removed [2019-01-14 03:40:53,964 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-14 03:40:54,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:40:54,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:40:54,077 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:40:54,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:40:54,103 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:40:54,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 03:40:54,115 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-14 03:40:54,115 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 40 states and 44 transitions. cyclomatic complexity: 8 Second operand 3 states. [2019-01-14 03:40:54,131 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. [2019-01-14 03:40:54,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 03:40:54,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 03:40:54,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 22 transitions. [2019-01-14 03:40:54,133 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 38 letters. Loop has 2 letters. [2019-01-14 03:40:54,134 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:40:54,134 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 40 letters. Loop has 2 letters. [2019-01-14 03:40:54,135 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:40:54,135 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 38 letters. Loop has 4 letters. [2019-01-14 03:40:54,135 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:40:54,136 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 50 transitions. [2019-01-14 03:40:54,137 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 03:40:54,137 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 44 states and 50 transitions. [2019-01-14 03:40:54,137 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2019-01-14 03:40:54,137 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2019-01-14 03:40:54,137 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 50 transitions. [2019-01-14 03:40:54,138 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 03:40:54,138 INFO L706 BuchiCegarLoop]: Abstraction has 44 states and 50 transitions. [2019-01-14 03:40:54,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states and 50 transitions. [2019-01-14 03:40:54,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-01-14 03:40:54,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-01-14 03:40:54,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2019-01-14 03:40:54,141 INFO L729 BuchiCegarLoop]: Abstraction has 44 states and 50 transitions. [2019-01-14 03:40:54,141 INFO L609 BuchiCegarLoop]: Abstraction has 44 states and 50 transitions. [2019-01-14 03:40:54,141 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2019-01-14 03:40:54,141 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 50 transitions. [2019-01-14 03:40:54,142 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 03:40:54,142 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:40:54,142 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:40:54,142 INFO L867 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] [2019-01-14 03:40:54,143 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 03:40:54,143 INFO L794 eck$LassoCheckResult]: Stem: 1750#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1745#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.allocOnStack(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.allocOnStack(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; 1734#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; 1735#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1736#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; 1737#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1768#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; 1767#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1766#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; 1764#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; 1757#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); 1732#L21-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 1733#L23 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 1751#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; 1752#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1753#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; 1765#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1763#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; 1761#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1760#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; 1758#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); 1749#L25-4 call main_#t~mem6 := read~int(main_~#string_B~0.base, 4 + main_~#string_B~0.offset, 1); 1727#L27 assume !!(0 == main_#t~mem6);havoc main_#t~mem6;main_~nc_A~0 := 0; 1728#L30-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 1729#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; 1730#L30-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 1731#L30-1 assume !(0 != main_#t~mem7);havoc main_#t~mem7; 1725#L30-4 main_~nc_B~0 := 0; 1726#L34-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 1746#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; 1747#L34-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 1748#L34-1 assume !(0 != main_#t~mem9);havoc main_#t~mem9; 1738#L34-4 assume !!(main_~nc_B~0 >= main_~nc_A~0);main_~j~0 := 0;main_~i~0 := main_~j~0; 1739#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); 1744#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; 1740#L43-2 [2019-01-14 03:40:54,143 INFO L796 eck$LassoCheckResult]: Loop: 1740#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); 1741#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; 1740#L43-2 [2019-01-14 03:40:54,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:40:54,143 INFO L82 PathProgramCache]: Analyzing trace with hash -1838818643, now seen corresponding path program 1 times [2019-01-14 03:40:54,143 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:40:54,144 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:40:54,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:54,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:40:54,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:54,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:40:54,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:40:54,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:40:54,183 INFO L82 PathProgramCache]: Analyzing trace with hash 3556, now seen corresponding path program 4 times [2019-01-14 03:40:54,183 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:40:54,184 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:40:54,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:54,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:40:54,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:54,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:40:54,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:40:54,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:40:54,189 INFO L82 PathProgramCache]: Analyzing trace with hash -1873154672, now seen corresponding path program 1 times [2019-01-14 03:40:54,190 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:40:54,190 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:40:54,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:54,190 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 03:40:54,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:54,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:40:54,339 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2019-01-14 03:40:54,339 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 03:40:54,340 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 [2019-01-14 03:40:54,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:40:54,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:40:54,384 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:40:54,472 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2019-01-14 03:40:54,491 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 03:40:54,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2019-01-14 03:40:54,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-14 03:40:54,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-01-14 03:40:54,553 INFO L87 Difference]: Start difference. First operand 44 states and 50 transitions. cyclomatic complexity: 11 Second operand 11 states. [2019-01-14 03:40:54,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 03:40:54,785 INFO L93 Difference]: Finished difference Result 74 states and 82 transitions. [2019-01-14 03:40:54,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-14 03:40:54,787 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 74 states and 82 transitions. [2019-01-14 03:40:54,788 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 03:40:54,789 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 74 states to 50 states and 56 transitions. [2019-01-14 03:40:54,789 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2019-01-14 03:40:54,790 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2019-01-14 03:40:54,790 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 56 transitions. [2019-01-14 03:40:54,790 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 03:40:54,790 INFO L706 BuchiCegarLoop]: Abstraction has 50 states and 56 transitions. [2019-01-14 03:40:54,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states and 56 transitions. [2019-01-14 03:40:54,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2019-01-14 03:40:54,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-01-14 03:40:54,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2019-01-14 03:40:54,797 INFO L729 BuchiCegarLoop]: Abstraction has 48 states and 54 transitions. [2019-01-14 03:40:54,797 INFO L609 BuchiCegarLoop]: Abstraction has 48 states and 54 transitions. [2019-01-14 03:40:54,797 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2019-01-14 03:40:54,797 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 48 states and 54 transitions. [2019-01-14 03:40:54,801 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 03:40:54,801 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:40:54,801 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:40:54,802 INFO L867 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] [2019-01-14 03:40:54,802 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 03:40:54,805 INFO L794 eck$LassoCheckResult]: Stem: 2020#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2018#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.allocOnStack(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.allocOnStack(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; 2003#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; 2004#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 2005#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; 2006#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 2040#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; 2039#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 2038#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; 2036#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 2034#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); 2001#L21-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 2002#L23 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 2021#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; 2024#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; 2041#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 2037#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; 2033#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; 2029#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; 2028#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 2027#L25-3 assume !(main_~i~0 < 5); 2019#L25-4 call main_#t~mem6 := read~int(main_~#string_B~0.base, 4 + main_~#string_B~0.offset, 1); 1996#L27 assume !!(0 == main_#t~mem6);havoc main_#t~mem6;main_~nc_A~0 := 0; 1997#L30-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 1998#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; 1999#L30-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 2000#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; 2025#L30-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 2007#L30-1 assume !(0 != main_#t~mem7);havoc main_#t~mem7; 1994#L30-4 main_~nc_B~0 := 0; 1995#L34-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 2015#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; 2016#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;main_#t~post10 := main_~nc_B~0;main_~nc_B~0 := 1 + main_#t~post10;havoc main_#t~post10; 2026#L34-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 2023#L34-1 assume !(0 != main_#t~mem9);havoc main_#t~mem9; 2008#L34-4 assume !!(main_~nc_B~0 >= main_~nc_A~0);main_~j~0 := 0;main_~i~0 := main_~j~0; 2009#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); 2013#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; 2010#L43-2 [2019-01-14 03:40:54,805 INFO L796 eck$LassoCheckResult]: Loop: 2010#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); 2011#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; 2010#L43-2 [2019-01-14 03:40:54,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:40:54,805 INFO L82 PathProgramCache]: Analyzing trace with hash -1976327923, now seen corresponding path program 2 times [2019-01-14 03:40:54,805 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:40:54,806 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:40:54,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:54,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:40:54,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:54,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:40:54,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:40:54,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:40:54,857 INFO L82 PathProgramCache]: Analyzing trace with hash 3556, now seen corresponding path program 5 times [2019-01-14 03:40:54,857 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:40:54,857 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:40:54,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:54,858 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 03:40:54,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:54,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:40:54,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:40:54,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:40:54,863 INFO L82 PathProgramCache]: Analyzing trace with hash -875586576, now seen corresponding path program 2 times [2019-01-14 03:40:54,863 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:40:54,863 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:40:54,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:54,864 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 03:40:54,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:54,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:40:54,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:40:58,406 WARN L181 SmtUtils]: Spent 3.39 s on a formula simplification. DAG size of input: 313 DAG size of output: 234 [2019-01-14 03:40:58,675 WARN L181 SmtUtils]: Spent 261.00 ms on a formula simplification that was a NOOP. DAG size: 126 [2019-01-14 03:40:58,678 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 03:40:58,678 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 03:40:58,678 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 03:40:58,678 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 03:40:58,678 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 03:40:58,678 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:40:58,678 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 03:40:58,678 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 03:40:58,678 INFO L131 ssoRankerPreferences]: Filename of dumped script: string_false-unreach-call_true-termination.i_Iteration14_Lasso [2019-01-14 03:40:58,679 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 03:40:58,679 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 03:40:58,686 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:58,695 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:58,697 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:58,699 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:58,705 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:58,707 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:58,708 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:58,710 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:58,711 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:59,269 WARN L181 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 74 [2019-01-14 03:40:59,414 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:59,417 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:59,418 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:59,420 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:59,421 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:59,422 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:59,424 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:59,426 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:59,428 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:59,429 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:00,591 WARN L181 SmtUtils]: Spent 606.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2019-01-14 03:41:00,782 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 03:41:00,782 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 03:41:00,782 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:41:00,783 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:41:00,783 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:41:00,783 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:41:00,783 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:41:00,783 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:41:00,785 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:41:00,785 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:41:00,785 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:41:00,786 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:41:00,786 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:41:00,786 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:41:00,786 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:41:00,787 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:41:00,787 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:41:00,787 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:41:00,787 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:41:00,787 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:41:00,789 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:41:00,789 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:41:00,789 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:41:00,789 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:41:00,790 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:41:00,790 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:41:00,790 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:41:00,790 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:41:00,790 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:41:00,791 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:41:00,791 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:41:00,792 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:41:00,792 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:41:00,792 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:41:00,792 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:41:00,792 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:41:00,793 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:41:00,804 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:41:00,805 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:41:00,805 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:41:00,805 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:41:00,805 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:41:00,805 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:41:00,806 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:41:00,807 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:41:00,807 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:41:00,808 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:41:00,808 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:41:00,808 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:41:00,808 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:41:00,808 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:41:00,809 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:41:00,809 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:41:00,812 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:41:00,813 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:41:00,814 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:41:00,814 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:41:00,815 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:41:00,815 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:41:00,815 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:41:00,815 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:41:00,815 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:41:00,815 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:41:00,816 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:41:00,816 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:41:00,816 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:41:00,816 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:41:00,816 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:41:00,817 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:41:00,820 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:41:00,821 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:41:00,821 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:41:00,821 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:41:00,822 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:41:00,822 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:41:00,822 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:41:00,822 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:41:00,823 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:41:00,823 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:41:00,829 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:41:00,830 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:41:00,830 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:41:00,830 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:41:00,831 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:41:00,837 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:41:00,837 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:41:00,838 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:41:00,839 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:41:00,840 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:41:00,840 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:41:00,841 INFO L205 nArgumentSynthesizer]: 12 stem disjuncts [2019-01-14 03:41:00,841 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:41:00,841 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:41:00,849 INFO L402 nArgumentSynthesizer]: We have 28 Motzkin's Theorem applications. [2019-01-14 03:41:00,849 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:41:00,875 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:41:00,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 [2019-01-14 03:41:00,876 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:41:00,876 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2019-01-14 03:41:00,876 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:41:00,882 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:41:00,883 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-14 03:41:00,883 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:41:00,891 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:41:00,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 [2019-01-14 03:41:00,893 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:41:00,893 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:41:00,894 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:41:00,898 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:41:00,898 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:41:00,899 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:41:00,901 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:41:00,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 [2019-01-14 03:41:00,901 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:41:00,902 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:41:00,902 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:41:00,902 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:41:00,902 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:41:00,902 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:41:00,906 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:41:00,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 [2019-01-14 03:41:00,907 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:41:00,907 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-14 03:41:00,908 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:41:00,911 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:41:00,911 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-14 03:41:00,912 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:41:00,916 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:41:00,917 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:41:00,917 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:41:00,917 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:41:00,917 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:41:00,917 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:41:00,918 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:41:00,918 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:41:00,919 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:41:00,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 [2019-01-14 03:41:00,920 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:41:00,923 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:41:00,923 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:41:00,923 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:41:00,924 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:41:00,924 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:41:00,928 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:41:00,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 [2019-01-14 03:41:00,929 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:41:00,929 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:41:00,929 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:41:00,929 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:41:00,929 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:41:00,930 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:41:00,930 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:41:00,930 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:41:00,930 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:41:00,931 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:41:00,931 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:41:00,931 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:41:00,931 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:41:00,936 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:41:00,936 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:41:00,972 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 03:41:00,993 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-14 03:41:00,993 INFO L444 ModelExtractionUtils]: 23 out of 28 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 03:41:00,994 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 03:41:00,994 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 03:41:00,995 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 03:41:00,998 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~#string_B~0.offset, v_rep(select #length ULTIMATE.start_main_~#string_B~0.base)_5, ULTIMATE.start_main_~j~0) = -1*ULTIMATE.start_main_~#string_B~0.offset + 1*v_rep(select #length ULTIMATE.start_main_~#string_B~0.base)_5 - 1*ULTIMATE.start_main_~j~0 Supporting invariants [] [2019-01-14 03:41:01,195 INFO L297 tatePredicateManager]: 26 out of 26 supporting invariants were superfluous and have been removed [2019-01-14 03:41:01,197 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-14 03:41:01,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:41:01,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:41:01,251 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:41:01,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:41:01,271 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:41:01,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 03:41:01,298 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-14 03:41:01,298 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 48 states and 54 transitions. cyclomatic complexity: 11 Second operand 3 states. [2019-01-14 03:41:01,314 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. [2019-01-14 03:41:01,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 03:41:01,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 03:41:01,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 25 transitions. [2019-01-14 03:41:01,316 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 25 transitions. Stem has 44 letters. Loop has 2 letters. [2019-01-14 03:41:01,317 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:41:01,317 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 25 transitions. Stem has 46 letters. Loop has 2 letters. [2019-01-14 03:41:01,317 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:41:01,317 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 25 transitions. Stem has 44 letters. Loop has 4 letters. [2019-01-14 03:41:01,317 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:41:01,318 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 52 states and 60 transitions. [2019-01-14 03:41:01,318 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 03:41:01,322 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 52 states to 52 states and 60 transitions. [2019-01-14 03:41:01,322 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2019-01-14 03:41:01,323 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2019-01-14 03:41:01,323 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 60 transitions. [2019-01-14 03:41:01,323 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 03:41:01,323 INFO L706 BuchiCegarLoop]: Abstraction has 52 states and 60 transitions. [2019-01-14 03:41:01,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states and 60 transitions. [2019-01-14 03:41:01,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-01-14 03:41:01,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-01-14 03:41:01,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 60 transitions. [2019-01-14 03:41:01,329 INFO L729 BuchiCegarLoop]: Abstraction has 52 states and 60 transitions. [2019-01-14 03:41:01,329 INFO L609 BuchiCegarLoop]: Abstraction has 52 states and 60 transitions. [2019-01-14 03:41:01,329 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2019-01-14 03:41:01,329 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states and 60 transitions. [2019-01-14 03:41:01,329 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 03:41:01,330 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:41:01,330 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:41:01,331 INFO L867 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] [2019-01-14 03:41:01,332 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 03:41:01,332 INFO L794 eck$LassoCheckResult]: Stem: 2383#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2381#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.allocOnStack(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.allocOnStack(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; 2366#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; 2367#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 2368#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; 2369#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 2405#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; 2404#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 2403#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; 2402#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 2400#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; 2395#L21-3 assume !(main_~i~0 < 5); 2364#L21-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 2365#L23 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 2385#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; 2388#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; 2401#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 2399#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; 2398#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 2397#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; 2394#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); 2382#L25-4 call main_#t~mem6 := read~int(main_~#string_B~0.base, 4 + main_~#string_B~0.offset, 1); 2359#L27 assume !!(0 == main_#t~mem6);havoc main_#t~mem6;main_~nc_A~0 := 0; 2360#L30-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 2361#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; 2362#L30-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 2363#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; 2389#L30-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 2370#L30-1 assume !(0 != main_#t~mem7);havoc main_#t~mem7; 2357#L30-4 main_~nc_B~0 := 0; 2358#L34-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 2378#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; 2379#L34-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 2380#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; 2390#L34-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 2387#L34-1 assume !(0 != main_#t~mem9);havoc main_#t~mem9; 2371#L34-4 assume !!(main_~nc_B~0 >= main_~nc_A~0);main_~j~0 := 0;main_~i~0 := main_~j~0; 2372#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); 2376#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; 2384#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); 2406#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; 2373#L43-2 [2019-01-14 03:41:01,332 INFO L796 eck$LassoCheckResult]: Loop: 2373#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); 2374#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; 2373#L43-2 [2019-01-14 03:41:01,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:41:01,332 INFO L82 PathProgramCache]: Analyzing trace with hash -875586574, now seen corresponding path program 3 times [2019-01-14 03:41:01,332 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:41:01,333 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:41:01,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:41:01,340 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 03:41:01,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:41:01,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:41:01,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:41:01,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:41:01,390 INFO L82 PathProgramCache]: Analyzing trace with hash 3556, now seen corresponding path program 6 times [2019-01-14 03:41:01,390 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:41:01,391 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:41:01,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:41:01,391 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 03:41:01,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:41:01,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:41:01,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:41:01,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:41:01,405 INFO L82 PathProgramCache]: Analyzing trace with hash 374894997, now seen corresponding path program 3 times [2019-01-14 03:41:01,405 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:41:01,405 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:41:01,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:41:01,406 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 03:41:01,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:41:01,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:41:02,107 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-01-14 03:41:02,107 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 03:41:02,107 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 [2019-01-14 03:41:02,129 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 03:41:02,203 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-14 03:41:02,203 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 03:41:02,208 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:41:02,543 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-01-14 03:41:02,563 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 03:41:02,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2019-01-14 03:41:02,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-14 03:41:02,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2019-01-14 03:41:02,643 INFO L87 Difference]: Start difference. First operand 52 states and 60 transitions. cyclomatic complexity: 14 Second operand 14 states. [2019-01-14 03:41:02,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 03:41:02,989 INFO L93 Difference]: Finished difference Result 96 states and 110 transitions. [2019-01-14 03:41:02,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-01-14 03:41:02,992 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 96 states and 110 transitions. [2019-01-14 03:41:02,994 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 03:41:02,994 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 96 states to 58 states and 66 transitions. [2019-01-14 03:41:02,995 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2019-01-14 03:41:02,995 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2019-01-14 03:41:02,995 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 66 transitions. [2019-01-14 03:41:02,995 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 03:41:02,995 INFO L706 BuchiCegarLoop]: Abstraction has 58 states and 66 transitions. [2019-01-14 03:41:02,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states and 66 transitions. [2019-01-14 03:41:02,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2019-01-14 03:41:02,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-01-14 03:41:02,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 64 transitions. [2019-01-14 03:41:02,999 INFO L729 BuchiCegarLoop]: Abstraction has 56 states and 64 transitions. [2019-01-14 03:41:02,999 INFO L609 BuchiCegarLoop]: Abstraction has 56 states and 64 transitions. [2019-01-14 03:41:02,999 INFO L442 BuchiCegarLoop]: ======== Iteration 16============ [2019-01-14 03:41:02,999 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 64 transitions. [2019-01-14 03:41:03,000 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 03:41:03,000 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:41:03,000 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:41:03,002 INFO L867 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] [2019-01-14 03:41:03,002 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 03:41:03,002 INFO L794 eck$LassoCheckResult]: Stem: 2713#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2708#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.allocOnStack(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.allocOnStack(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; 2696#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; 2697#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 2698#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; 2699#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 2736#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; 2735#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 2733#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; 2731#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 2729#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; 2724#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 2723#L21-3 assume !(main_~i~0 < 5); 2694#L21-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 2695#L23 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 2714#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; 2715#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 2717#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; 2734#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 2732#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; 2730#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 2728#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; 2727#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 2722#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; 2721#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 2720#L25-3 assume !(main_~i~0 < 5); 2712#L25-4 call main_#t~mem6 := read~int(main_~#string_B~0.base, 4 + main_~#string_B~0.offset, 1); 2689#L27 assume !!(0 == main_#t~mem6);havoc main_#t~mem6;main_~nc_A~0 := 0; 2690#L30-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 2691#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; 2692#L30-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 2693#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; 2737#L30-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 2719#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; 2718#L30-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 2700#L30-1 assume !(0 != main_#t~mem7);havoc main_#t~mem7; 2687#L30-4 main_~nc_B~0 := 0; 2688#L34-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 2709#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; 2710#L34-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 2711#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; 2738#L34-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 2726#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; 2725#L34-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 2716#L34-1 assume !(0 != main_#t~mem9);havoc main_#t~mem9; 2701#L34-4 assume !!(main_~nc_B~0 >= main_~nc_A~0);main_~j~0 := 0;main_~i~0 := main_~j~0; 2702#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); 2740#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; 2739#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); 2706#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; 2703#L43-2 [2019-01-14 03:41:03,002 INFO L796 eck$LassoCheckResult]: Loop: 2703#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); 2704#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; 2703#L43-2 [2019-01-14 03:41:03,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:41:03,003 INFO L82 PathProgramCache]: Analyzing trace with hash -1412851758, now seen corresponding path program 4 times [2019-01-14 03:41:03,003 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:41:03,003 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:41:03,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:41:03,004 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 03:41:03,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:41:03,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:41:03,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:41:03,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:41:03,079 INFO L82 PathProgramCache]: Analyzing trace with hash 3556, now seen corresponding path program 7 times [2019-01-14 03:41:03,080 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:41:03,080 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:41:03,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:41:03,081 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 03:41:03,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:41:03,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:41:03,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:41:03,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:41:03,096 INFO L82 PathProgramCache]: Analyzing trace with hash -540871307, now seen corresponding path program 4 times [2019-01-14 03:41:03,096 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:41:03,097 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:41:03,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:41:03,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:41:03,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:41:03,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:41:03,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:41:08,437 WARN L181 SmtUtils]: Spent 5.15 s on a formula simplification. DAG size of input: 361 DAG size of output: 272 [2019-01-14 03:41:08,771 WARN L181 SmtUtils]: Spent 321.00 ms on a formula simplification that was a NOOP. DAG size: 136 [2019-01-14 03:41:08,774 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 03:41:08,774 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 03:41:08,774 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 03:41:08,774 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 03:41:08,774 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 03:41:08,774 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:41:08,774 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 03:41:08,774 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 03:41:08,774 INFO L131 ssoRankerPreferences]: Filename of dumped script: string_false-unreach-call_true-termination.i_Iteration16_Lasso [2019-01-14 03:41:08,774 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 03:41:08,775 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 03:41:08,781 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:08,790 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:08,791 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:08,793 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:08,795 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:08,797 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:08,798 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:08,800 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:08,802 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:08,803 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:08,805 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:08,806 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:08,808 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:08,810 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:09,579 WARN L181 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 80 [2019-01-14 03:41:09,703 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:09,712 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:09,713 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:09,715 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:09,717 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:09,988 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-01-14 03:41:11,832 WARN L181 SmtUtils]: Spent 1.63 s on a formula simplification. DAG size of input: 97 DAG size of output: 69 [2019-01-14 03:41:11,865 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 03:41:11,866 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 03:41:11,866 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:41:11,866 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:41:11,867 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:41:11,873 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:41:11,873 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:41:11,874 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:41:11,874 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:41:11,877 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:41:11,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 [2019-01-14 03:41:11,878 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:41:11,878 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:41:11,878 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:41:11,878 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:41:11,878 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:41:11,878 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:41:11,879 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:41:11,879 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:41:11,879 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:41:11,879 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:41:11,880 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:41:11,883 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:41:11,883 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:41:11,883 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:41:11,884 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:41:11,884 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:41:11,884 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:41:11,884 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:41:11,885 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:41:11,885 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:41:11,885 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:41:11,885 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:41:11,886 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:41:11,888 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:41:11,889 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:41:11,889 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:41:11,889 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:41:11,890 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:41:11,893 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:41:11,893 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:41:11,893 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:41:11,893 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:41:11,893 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:41:11,894 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:41:11,894 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:41:11,894 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:41:11,895 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:41:11,895 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:41:11,895 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:41:11,895 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:41:11,895 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:41:11,895 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:41:11,896 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:41:11,898 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:41:11,898 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:41:11,899 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:41:11,899 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:41:11,899 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:41:11,899 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:41:11,899 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:41:11,904 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:41:11,904 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:41:11,904 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:41:11,905 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:41:11,908 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:41:11,908 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:41:11,908 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:41:11,908 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:41:11,908 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:41:11,909 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:41:11,909 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:41:11,909 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:41:11,910 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:41:11,910 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:41:11,910 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:41:11,910 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:41:11,910 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:41:11,910 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:41:11,911 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:41:11,911 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:41:11,911 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:41:11,911 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:41:11,911 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:41:11,912 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:41:11,912 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:41:11,912 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:41:11,912 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:41:11,912 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:41:11,913 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:41:11,916 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:41:11,916 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:41:11,916 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:41:11,916 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:41:11,917 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:41:11,917 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:41:11,917 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:41:11,917 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:41:11,918 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:41:11,918 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:41:11,918 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:41:11,918 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:41:11,918 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:41:11,918 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:41:11,918 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:41:11,919 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:41:11,922 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:41:11,922 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:41:11,923 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:41:11,923 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:41:11,923 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:41:11,923 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:41:11,923 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:41:11,923 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:41:11,924 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:41:11,927 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:41:11,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 [2019-01-14 03:41:11,928 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:41:11,928 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:41:11,928 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:41:11,928 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:41:11,929 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:41:11,929 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:41:11,934 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:41:11,934 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:41:11,938 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:41:11,938 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2019-01-14 03:41:11,938 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:41:11,938 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:41:11,939 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-14 03:41:11,939 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:41:11,948 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:41:11,948 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:41:11,949 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:41:11,949 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:41:11,949 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:41:11,949 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:41:11,954 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:41:11,954 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:41:11,994 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 03:41:12,031 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2019-01-14 03:41:12,031 INFO L444 ModelExtractionUtils]: 18 out of 28 variables were initially zero. Simplification set additionally 6 variables to zero. [2019-01-14 03:41:12,032 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 03:41:12,033 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 03:41:12,033 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 03:41:12,033 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~#string_A~0.offset, ULTIMATE.start_main_~j~0, v_rep(select #length ULTIMATE.start_main_~#string_B~0.base)_6) = -1*ULTIMATE.start_main_~#string_A~0.offset - 1*ULTIMATE.start_main_~j~0 + 1*v_rep(select #length ULTIMATE.start_main_~#string_B~0.base)_6 Supporting invariants [] [2019-01-14 03:41:12,399 INFO L297 tatePredicateManager]: 31 out of 32 supporting invariants were superfluous and have been removed [2019-01-14 03:41:12,402 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-14 03:41:12,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:41:12,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:41:12,473 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:41:12,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:41:12,595 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:41:12,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 03:41:12,609 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2019-01-14 03:41:12,609 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 56 states and 64 transitions. cyclomatic complexity: 14 Second operand 4 states. [2019-01-14 03:41:12,660 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 56 states and 64 transitions. cyclomatic complexity: 14. Second operand 4 states. Result 58 states and 68 transitions. Complement of second has 6 states. [2019-01-14 03:41:12,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 03:41:12,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 03:41:12,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 25 transitions. [2019-01-14 03:41:12,662 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 50 letters. Loop has 2 letters. [2019-01-14 03:41:12,662 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:41:12,663 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 03:41:12,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:41:12,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:41:12,724 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:41:12,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:41:12,744 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:41:12,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 03:41:12,759 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 2 loop predicates [2019-01-14 03:41:12,759 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 56 states and 64 transitions. cyclomatic complexity: 14 Second operand 4 states. [2019-01-14 03:41:12,823 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 56 states and 64 transitions. cyclomatic complexity: 14. Second operand 4 states. Result 58 states and 68 transitions. Complement of second has 6 states. [2019-01-14 03:41:12,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 03:41:12,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 03:41:12,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 25 transitions. [2019-01-14 03:41:12,827 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 50 letters. Loop has 2 letters. [2019-01-14 03:41:12,827 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:41:12,827 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 03:41:12,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:41:12,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:41:12,889 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:41:12,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:41:12,955 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:41:13,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 03:41:13,023 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2019-01-14 03:41:13,023 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 56 states and 64 transitions. cyclomatic complexity: 14 Second operand 4 states. [2019-01-14 03:41:13,097 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 56 states and 64 transitions. cyclomatic complexity: 14. Second operand 4 states. Result 60 states and 71 transitions. Complement of second has 5 states. [2019-01-14 03:41:13,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 03:41:13,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 03:41:13,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2019-01-14 03:41:13,100 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 50 letters. Loop has 2 letters. [2019-01-14 03:41:13,101 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:41:13,101 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 52 letters. Loop has 2 letters. [2019-01-14 03:41:13,101 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:41:13,101 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 50 letters. Loop has 4 letters. [2019-01-14 03:41:13,101 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:41:13,101 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 71 transitions. [2019-01-14 03:41:13,104 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-14 03:41:13,107 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 58 states and 67 transitions. [2019-01-14 03:41:13,107 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2019-01-14 03:41:13,107 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2019-01-14 03:41:13,107 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 67 transitions. [2019-01-14 03:41:13,107 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 03:41:13,107 INFO L706 BuchiCegarLoop]: Abstraction has 58 states and 67 transitions. [2019-01-14 03:41:13,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states and 67 transitions. [2019-01-14 03:41:13,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 50. [2019-01-14 03:41:13,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-01-14 03:41:13,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2019-01-14 03:41:13,117 INFO L729 BuchiCegarLoop]: Abstraction has 50 states and 55 transitions. [2019-01-14 03:41:13,117 INFO L609 BuchiCegarLoop]: Abstraction has 50 states and 55 transitions. [2019-01-14 03:41:13,117 INFO L442 BuchiCegarLoop]: ======== Iteration 17============ [2019-01-14 03:41:13,117 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 55 transitions. [2019-01-14 03:41:13,120 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-14 03:41:13,120 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:41:13,120 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:41:13,121 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 03:41:13,121 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 03:41:13,121 INFO L794 eck$LassoCheckResult]: Stem: 3589#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3584#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.allocOnStack(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.allocOnStack(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; 3574#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; 3575#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 3576#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; 3577#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 3614#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; 3613#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 3612#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; 3611#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 3610#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; 3609#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 3608#L21-3 assume !(main_~i~0 < 5); 3572#L21-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 3573#L23 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 3590#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; 3591#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 3593#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; 3607#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 3605#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; 3604#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 3601#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; 3600#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 3599#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; 3597#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 3596#L25-3 assume !(main_~i~0 < 5); 3588#L25-4 call main_#t~mem6 := read~int(main_~#string_B~0.base, 4 + main_~#string_B~0.offset, 1); 3567#L27 assume !!(0 == main_#t~mem6);havoc main_#t~mem6;main_~nc_A~0 := 0; 3568#L30-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 3569#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; 3570#L30-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 3571#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; 3598#L30-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 3595#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; 3594#L30-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 3578#L30-1 assume !(0 != main_#t~mem7);havoc main_#t~mem7; 3565#L30-4 main_~nc_B~0 := 0; 3566#L34-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 3585#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; 3586#L34-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 3587#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; 3606#L34-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 3603#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; 3602#L34-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 3592#L34-1 assume !(0 != main_#t~mem9);havoc main_#t~mem9; 3579#L34-4 assume !!(main_~nc_B~0 >= main_~nc_A~0);main_~j~0 := 0;main_~i~0 := main_~j~0; 3580#L43-2 [2019-01-14 03:41:13,121 INFO L796 eck$LassoCheckResult]: Loop: 3580#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); 3581#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; 3580#L43-2 [2019-01-14 03:41:13,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:41:13,122 INFO L82 PathProgramCache]: Analyzing trace with hash 1972313288, now seen corresponding path program 2 times [2019-01-14 03:41:13,122 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:41:13,122 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:41:13,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:41:13,122 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 03:41:13,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:41:13,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:41:13,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:41:13,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:41:13,176 INFO L82 PathProgramCache]: Analyzing trace with hash 3558, now seen corresponding path program 1 times [2019-01-14 03:41:13,176 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:41:13,176 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:41:13,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:41:13,181 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 03:41:13,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:41:13,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:41:13,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:41:13,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:41:13,193 INFO L82 PathProgramCache]: Analyzing trace with hash 1312494829, now seen corresponding path program 5 times [2019-01-14 03:41:13,193 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:41:13,193 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:41:13,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:41:13,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:41:13,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:41:13,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:41:13,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:41:13,578 WARN L181 SmtUtils]: Spent 336.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2019-01-14 03:41:13,875 WARN L181 SmtUtils]: Spent 295.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2019-01-14 03:41:18,397 WARN L181 SmtUtils]: Spent 4.51 s on a formula simplification. DAG size of input: 312 DAG size of output: 232 [2019-01-14 03:41:18,598 WARN L181 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-01-14 03:41:18,601 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 03:41:18,601 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 03:41:18,601 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 03:41:18,601 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 03:41:18,601 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 03:41:18,602 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:41:18,602 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 03:41:18,602 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 03:41:18,602 INFO L131 ssoRankerPreferences]: Filename of dumped script: string_false-unreach-call_true-termination.i_Iteration17_Lasso [2019-01-14 03:41:18,602 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 03:41:18,602 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 03:41:18,606 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:18,612 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:18,614 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:18,634 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:18,666 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:18,690 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:18,695 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:18,696 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:18,710 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:18,713 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:18,715 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:18,725 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:18,729 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:18,731 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:18,732 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:19,237 WARN L181 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2019-01-14 03:41:19,371 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:19,373 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:19,378 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:19,379 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:19,951 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 03:41:19,952 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 03:41:19,952 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:41:19,953 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:41:19,954 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:41:19,954 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:41:19,954 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:41:19,954 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:41:19,954 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:41:19,954 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:41:19,955 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:41:19,955 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:41:19,956 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:41:19,956 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:41:19,956 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:41:19,956 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:41:19,956 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:41:19,956 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:41:19,957 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:41:19,958 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:41:19,958 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:41:19,959 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:41:19,959 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:41:19,959 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:41:19,959 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:41:19,960 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:41:19,960 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:41:19,961 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:41:19,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 [2019-01-14 03:41:19,962 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:41:19,962 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:41:19,963 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:41:19,963 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:41:19,963 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:41:19,963 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:41:19,963 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:41:19,963 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:41:19,964 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:41:19,964 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:41:19,964 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:41:19,964 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:41:19,964 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:41:19,964 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:41:19,965 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:41:19,965 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:41:19,965 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:41:19,965 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:41:19,966 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:41:19,966 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:41:19,966 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:41:19,966 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:41:19,966 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:41:19,966 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:41:19,966 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:41:19,967 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:41:19,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 [2019-01-14 03:41:19,967 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:41:19,967 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:41:19,968 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:41:19,975 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:41:19,975 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:41:19,975 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:41:19,975 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:41:19,976 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:41:19,976 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:41:19,977 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:41:19,977 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:41:19,977 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:41:19,977 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:41:19,977 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:41:19,978 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:41:19,982 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:41:19,982 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:41:19,982 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:41:19,983 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:41:19,983 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:41:19,983 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:41:19,983 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:41:19,983 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:41:19,987 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:41:19,988 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:41:19,988 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:41:19,988 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:41:19,989 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:41:19,989 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:41:19,989 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:41:19,989 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:41:19,989 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:41:19,989 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:41:19,992 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:41:19,992 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:41:19,992 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:41:19,993 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:41:19,993 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:41:19,993 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:41:19,993 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:41:19,993 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:41:19,993 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:41:19,997 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:41:19,997 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:41:19,997 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:41:19,998 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:41:19,998 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:41:19,998 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:41:19,998 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:41:19,998 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:41:19,998 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:41:19,999 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:41:19,999 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:41:19,999 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:41:19,999 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:41:19,999 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:41:20,000 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:41:20,005 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:41:20,005 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:41:20,006 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:41:20,006 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:41:20,006 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:41:20,006 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:41:20,007 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:41:20,007 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:41:20,007 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:41:20,007 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:41:20,007 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:41:20,007 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:41:20,011 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:41:20,011 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:41:20,012 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2019-01-14 03:41:20,012 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:41:20,012 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:41:20,013 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-14 03:41:20,013 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:41:20,021 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:41:20,022 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:41:20,022 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:41:20,022 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-14 03:41:20,022 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:41:20,023 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:41:20,023 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-14 03:41:20,023 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:41:20,027 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:41:20,027 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:41:20,028 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:41:20,028 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:41:20,028 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:41:20,028 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:41:20,028 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:41:20,028 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:41:20,033 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:41:20,033 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:41:20,034 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:41:20,034 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:41:20,034 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:41:20,034 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:41:20,035 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:41:20,035 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:41:20,036 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:41:20,043 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:41:20,043 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:41:20,044 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:41:20,044 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:41:20,044 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:41:20,044 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:41:20,044 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:41:20,046 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:41:20,051 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:41:20,052 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:41:20,052 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-14 03:41:20,052 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:41:20,052 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:41:20,053 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-14 03:41:20,053 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:41:20,056 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:41:20,057 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:41:20,057 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:41:20,057 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:41:20,057 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:41:20,057 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:41:20,058 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:41:20,058 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:41:20,064 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:41:20,065 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:41:20,065 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:41:20,065 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:41:20,065 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:41:20,065 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:41:20,070 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:41:20,070 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:41:20,087 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 03:41:20,114 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2019-01-14 03:41:20,115 INFO L444 ModelExtractionUtils]: 18 out of 28 variables were initially zero. Simplification set additionally 7 variables to zero. [2019-01-14 03:41:20,115 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 03:41:20,117 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 03:41:20,117 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 03:41:20,117 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#string_A~0.base)_7, ULTIMATE.start_main_~i~0) = 1*v_rep(select #length ULTIMATE.start_main_~#string_A~0.base)_7 - 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2019-01-14 03:41:20,842 INFO L297 tatePredicateManager]: 41 out of 43 supporting invariants were superfluous and have been removed [2019-01-14 03:41:20,853 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-14 03:41:20,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:41:20,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:41:20,959 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:41:21,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:41:21,006 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:41:21,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 03:41:21,040 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2019-01-14 03:41:21,040 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 50 states and 55 transitions. cyclomatic complexity: 9 Second operand 4 states. [2019-01-14 03:41:21,106 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 50 states and 55 transitions. cyclomatic complexity: 9. Second operand 4 states. Result 59 states and 69 transitions. Complement of second has 7 states. [2019-01-14 03:41:21,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 1 non-accepting loop states 2 accepting loop states [2019-01-14 03:41:21,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 03:41:21,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 23 transitions. [2019-01-14 03:41:21,108 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 46 letters. Loop has 2 letters. [2019-01-14 03:41:21,108 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:41:21,108 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 48 letters. Loop has 2 letters. [2019-01-14 03:41:21,109 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:41:21,109 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 46 letters. Loop has 4 letters. [2019-01-14 03:41:21,109 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:41:21,110 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 69 transitions. [2019-01-14 03:41:21,111 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-14 03:41:21,111 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 57 states and 65 transitions. [2019-01-14 03:41:21,111 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2019-01-14 03:41:21,112 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2019-01-14 03:41:21,112 INFO L73 IsDeterministic]: Start isDeterministic. Operand 57 states and 65 transitions. [2019-01-14 03:41:21,112 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 03:41:21,112 INFO L706 BuchiCegarLoop]: Abstraction has 57 states and 65 transitions. [2019-01-14 03:41:21,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states and 65 transitions. [2019-01-14 03:41:21,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 53. [2019-01-14 03:41:21,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-01-14 03:41:21,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 60 transitions. [2019-01-14 03:41:21,114 INFO L729 BuchiCegarLoop]: Abstraction has 53 states and 60 transitions. [2019-01-14 03:41:21,114 INFO L609 BuchiCegarLoop]: Abstraction has 53 states and 60 transitions. [2019-01-14 03:41:21,114 INFO L442 BuchiCegarLoop]: ======== Iteration 18============ [2019-01-14 03:41:21,115 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 60 transitions. [2019-01-14 03:41:21,115 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-14 03:41:21,115 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:41:21,115 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:41:21,116 INFO L867 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] [2019-01-14 03:41:21,116 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 03:41:21,116 INFO L794 eck$LassoCheckResult]: Stem: 4048#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 4046#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.allocOnStack(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.allocOnStack(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; 4033#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; 4034#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 4035#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; 4036#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 4075#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; 4073#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 4071#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; 4069#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 4067#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; 4064#L21-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 4063#L21-3 assume !(main_~i~0 < 5); 4031#L21-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 4032#L23 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 4052#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; 4053#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 4055#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; 4076#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 4074#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; 4072#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 4070#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; 4068#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 4066#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; 4065#L25-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 4062#L25-3 assume !(main_~i~0 < 5); 4047#L25-4 call main_#t~mem6 := read~int(main_~#string_B~0.base, 4 + main_~#string_B~0.offset, 1); 4026#L27 assume !!(0 == main_#t~mem6);havoc main_#t~mem6;main_~nc_A~0 := 0; 4027#L30-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 4028#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; 4029#L30-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 4030#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; 4060#L30-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 4057#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; 4056#L30-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 4037#L30-1 assume !(0 != main_#t~mem7);havoc main_#t~mem7; 4024#L30-4 main_~nc_B~0 := 0; 4025#L34-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 4043#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; 4044#L34-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 4045#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; 4061#L34-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 4059#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; 4058#L34-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 4054#L34-1 assume !(0 != main_#t~mem9);havoc main_#t~mem9; 4038#L34-4 assume !!(main_~nc_B~0 >= main_~nc_A~0);main_~j~0 := 0;main_~i~0 := main_~j~0; 4039#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); 4041#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; 4051#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); 4049#L43 [2019-01-14 03:41:21,116 INFO L796 eck$LassoCheckResult]: Loop: 4049#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; 4050#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); 4049#L43 [2019-01-14 03:41:21,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:41:21,117 INFO L82 PathProgramCache]: Analyzing trace with hash 2032634054, now seen corresponding path program 2 times [2019-01-14 03:41:21,117 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:41:21,117 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:41:21,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:41:21,118 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 03:41:21,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:41:21,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:41:21,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:41:21,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:41:21,157 INFO L82 PathProgramCache]: Analyzing trace with hash 3708, now seen corresponding path program 2 times [2019-01-14 03:41:21,157 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:41:21,157 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:41:21,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:41:21,158 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 03:41:21,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:41:21,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:41:21,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:41:21,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:41:21,162 INFO L82 PathProgramCache]: Analyzing trace with hash -848791039, now seen corresponding path program 5 times [2019-01-14 03:41:21,162 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:41:21,162 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:41:21,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:41:21,163 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 03:41:21,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:41:21,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:41:21,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:41:21,408 WARN L181 SmtUtils]: Spent 199.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-01-14 03:41:28,110 WARN L181 SmtUtils]: Spent 6.66 s on a formula simplification. DAG size of input: 351 DAG size of output: 260 [2019-01-14 03:41:28,719 WARN L181 SmtUtils]: Spent 598.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-01-14 03:41:28,722 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 03:41:28,722 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 03:41:28,722 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 03:41:28,723 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 03:41:28,723 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 03:41:28,723 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:41:28,723 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 03:41:28,723 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 03:41:28,723 INFO L131 ssoRankerPreferences]: Filename of dumped script: string_false-unreach-call_true-termination.i_Iteration18_Lasso [2019-01-14 03:41:28,723 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 03:41:28,723 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 03:41:28,728 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:28,735 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:28,737 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:28,742 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:28,744 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:28,746 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:28,748 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:28,750 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:28,752 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:29,612 WARN L181 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 84 [2019-01-14 03:41:29,746 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:29,749 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:29,751 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:29,753 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:29,755 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:29,757 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:29,759 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:29,761 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:30,411 WARN L181 SmtUtils]: Spent 271.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-01-14 03:41:30,551 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 03:41:30,552 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 03:41:30,552 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:41:30,553 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:41:30,553 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:41:30,553 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:41:30,553 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:41:30,553 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:41:30,553 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:41:30,553 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:41:30,554 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:41:30,554 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:41:30,555 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:41:30,555 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:41:30,555 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:41:30,555 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:41:30,555 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:41:30,555 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:41:30,555 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:41:30,556 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:41:30,556 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:41:30,556 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:41:30,556 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:41:30,556 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:41:30,557 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:41:30,557 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:41:30,557 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:41:30,557 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:41:30,557 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:41:30,558 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:41:30,558 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:41:30,558 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:41:30,558 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:41:30,558 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:41:30,558 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:41:30,559 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:41:30,559 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:41:30,559 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:41:30,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 [2019-01-14 03:41:30,560 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:41:30,560 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:41:30,560 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:41:30,560 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:41:30,560 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:41:30,560 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:41:30,560 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:41:30,561 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:41:30,561 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:41:30,561 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:41:30,561 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:41:30,562 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:41:30,562 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:41:30,562 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:41:30,562 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:41:30,562 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:41:30,562 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:41:30,563 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:41:30,563 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:41:30,563 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:41:30,563 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:41:30,563 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:41:30,564 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:41:30,564 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:41:30,565 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:41:30,565 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:41:30,565 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:41:30,565 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:41:30,566 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:41:30,566 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:41:30,566 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:41:30,566 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:41:30,566 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:41:30,566 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:41:30,567 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:41:30,567 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:41:30,567 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:41:30,567 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:41:30,567 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:41:30,569 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:41:30,569 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:41:30,590 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 03:41:30,610 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2019-01-14 03:41:30,610 INFO L444 ModelExtractionUtils]: 20 out of 28 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-01-14 03:41:30,611 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 03:41:30,611 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 03:41:30,611 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 03:41:30,611 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~nc_A~0) = -1*ULTIMATE.start_main_~i~0 + 1*ULTIMATE.start_main_~j~0 + 1*ULTIMATE.start_main_~nc_A~0 Supporting invariants [] [2019-01-14 03:41:31,329 INFO L297 tatePredicateManager]: 50 out of 50 supporting invariants were superfluous and have been removed [2019-01-14 03:41:31,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:41:31,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:41:31,394 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:41:31,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:41:31,417 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:41:31,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 03:41:31,469 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-14 03:41:31,469 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 53 states and 60 transitions. cyclomatic complexity: 12 Second operand 3 states. [2019-01-14 03:41:31,495 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. [2019-01-14 03:41:31,497 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 [2019-01-14 03:41:31,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 03:41:31,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2019-01-14 03:41:31,498 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 49 letters. Loop has 2 letters. [2019-01-14 03:41:31,498 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:41:31,499 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 51 letters. Loop has 2 letters. [2019-01-14 03:41:31,499 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:41:31,499 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 49 letters. Loop has 4 letters. [2019-01-14 03:41:31,499 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:41:31,500 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 66 states and 77 transitions. [2019-01-14 03:41:31,500 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 03:41:31,501 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 66 states to 0 states and 0 transitions. [2019-01-14 03:41:31,501 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 03:41:31,501 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 03:41:31,501 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 03:41:31,501 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 03:41:31,501 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 03:41:31,501 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 03:41:31,501 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 03:41:31,501 INFO L442 BuchiCegarLoop]: ======== Iteration 19============ [2019-01-14 03:41:31,501 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 03:41:31,502 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 03:41:31,502 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 03:41:31,509 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 03:41:31 BoogieIcfgContainer [2019-01-14 03:41:31,509 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 03:41:31,511 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 03:41:31,511 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 03:41:31,511 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 03:41:31,511 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 03:40:29" (3/4) ... [2019-01-14 03:41:31,517 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 03:41:31,517 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 03:41:31,518 INFO L168 Benchmark]: Toolchain (without parser) took 63429.52 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 472.9 MB). Free memory was 947.3 MB in the beginning and 1.0 GB in the end (delta: -71.6 MB). Peak memory consumption was 401.3 MB. Max. memory is 11.5 GB. [2019-01-14 03:41:31,523 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 03:41:31,524 INFO L168 Benchmark]: CACSL2BoogieTranslator took 367.73 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 936.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-14 03:41:31,525 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.62 ms. Allocated memory is still 1.0 GB. Free memory was 936.6 MB in the beginning and 931.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-01-14 03:41:31,525 INFO L168 Benchmark]: Boogie Preprocessor took 100.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 931.2 MB in the beginning and 1.1 GB in the end (delta: -192.8 MB). Peak memory consumption was 13.7 MB. Max. memory is 11.5 GB. [2019-01-14 03:41:31,526 INFO L168 Benchmark]: RCFGBuilder took 553.48 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 31.5 MB). Peak memory consumption was 31.5 MB. Max. memory is 11.5 GB. [2019-01-14 03:41:31,528 INFO L168 Benchmark]: BuchiAutomizer took 62351.52 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 343.9 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 73.5 MB). Peak memory consumption was 417.5 MB. Max. memory is 11.5 GB. [2019-01-14 03:41:31,529 INFO L168 Benchmark]: Witness Printer took 6.98 ms. Allocated memory is still 1.5 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 03:41:31,537 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 367.73 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 936.6 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 43.62 ms. Allocated memory is still 1.0 GB. Free memory was 936.6 MB in the beginning and 931.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 100.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 931.2 MB in the beginning and 1.1 GB in the end (delta: -192.8 MB). Peak memory consumption was 13.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 553.48 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 31.5 MB). Peak memory consumption was 31.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 62351.52 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 343.9 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 73.5 MB). Peak memory consumption was 417.5 MB. Max. memory is 11.5 GB. * Witness Printer took 6.98 ms. Allocated memory is still 1.5 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - 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 18 terminating modules (10 trivial, 7 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -2 * i + 9 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 -1 * string_B + -1 * nc_B + unknown-#length-unknown[string_B] and consists of 3 locations. One deterministic module has affine ranking function unknown-#length-unknown[string_B] + -1 * j + -1 * string_B and consists of 3 locations. One deterministic module has affine ranking function -1 * string_B + unknown-#length-unknown[string_B] + -1 * j and consists of 3 locations. One deterministic module has affine ranking function unknown-#length-unknown[string_A] + -1 * i and consists of 5 locations. One deterministic module has affine ranking function -1 * i + j + nc_A and consists of 4 locations. One nondeterministic module has affine ranking function -1 * string_A + -1 * j + unknown-#length-unknown[string_B] and consists of 4 locations. 10 modules have a trivial ranking function, the largest among these consists of 14 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 62.2s and 19 iterations. TraceHistogramMax:5. Analysis of lassos took 57.9s. Construction of modules took 1.2s. Büchi inclusion checks took 2.7s. Highest rank in rank-based complementation 3. Minimization of det autom 8. Minimization of nondet autom 10. Automata minimization 0.0s AutomataMinimizationTime, 17 MinimizatonAttempts, 58 StatesRemovedByMinimization, 12 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 56 states and ocurred in iteration 15. Nontrivial modules had stage [7, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 327 SDtfs, 398 SDslu, 396 SDs, 0 SdLazy, 622 SolverSat, 156 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc4 concLT0 SILN0 SILU6 SILI0 SILT0 lasso8 LassoPreprocessingBenchmarks: Lassos: inital312 mio100 ax100 hnf99 lsp96 ukn46 mio100 lsp54 div100 bol100 ite100 ukn100 eq172 hnf83 smp93 dnf324 smp85 tf100 neg92 sie129 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 36ms VariablesStem: 5 VariablesLoop: 2 DisjunctsStem: 12 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 28 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...