./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/loops/string_true-unreach-call_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_78a83bac-e4c0-4ce0-b9d0-71f5c56d3fe5/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_78a83bac-e4c0-4ce0-b9d0-71f5c56d3fe5/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_78a83bac-e4c0-4ce0-b9d0-71f5c56d3fe5/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_78a83bac-e4c0-4ce0-b9d0-71f5c56d3fe5/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/loops/string_true-unreach-call_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_78a83bac-e4c0-4ce0-b9d0-71f5c56d3fe5/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_78a83bac-e4c0-4ce0-b9d0-71f5c56d3fe5/bin-2019/uautomizer --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 e655d34f6b59f7cc9a55d4dc4dc525a41685abad .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 03:53:10,475 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 03:53:10,476 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 03:53:10,483 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 03:53:10,484 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 03:53:10,484 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 03:53:10,485 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 03:53:10,486 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 03:53:10,487 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 03:53:10,488 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 03:53:10,488 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 03:53:10,488 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 03:53:10,489 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 03:53:10,490 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 03:53:10,490 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 03:53:10,491 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 03:53:10,491 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 03:53:10,493 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 03:53:10,494 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 03:53:10,495 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 03:53:10,496 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 03:53:10,496 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 03:53:10,498 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 03:53:10,498 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 03:53:10,498 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 03:53:10,499 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 03:53:10,500 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 03:53:10,500 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 03:53:10,501 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 03:53:10,502 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 03:53:10,502 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 03:53:10,502 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 03:53:10,502 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 03:53:10,503 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 03:53:10,503 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 03:53:10,504 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 03:53:10,504 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_78a83bac-e4c0-4ce0-b9d0-71f5c56d3fe5/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-23 03:53:10,514 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 03:53:10,515 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 03:53:10,515 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 03:53:10,516 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 03:53:10,516 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 03:53:10,516 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 03:53:10,516 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 03:53:10,518 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 03:53:10,518 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 03:53:10,519 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 03:53:10,519 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 03:53:10,519 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 03:53:10,519 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 03:53:10,519 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 03:53:10,519 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 03:53:10,519 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 03:53:10,520 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 03:53:10,520 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 03:53:10,520 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 03:53:10,520 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 03:53:10,520 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 03:53:10,520 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 03:53:10,520 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 03:53:10,520 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 03:53:10,521 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 03:53:10,521 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 03:53:10,521 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 03:53:10,521 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 03:53:10,521 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 03:53:10,521 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 03:53:10,521 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 03:53:10,522 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 03:53:10,522 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_78a83bac-e4c0-4ce0-b9d0-71f5c56d3fe5/bin-2019/uautomizer 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 -> e655d34f6b59f7cc9a55d4dc4dc525a41685abad [2018-11-23 03:53:10,545 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 03:53:10,554 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 03:53:10,557 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 03:53:10,558 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 03:53:10,559 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 03:53:10,559 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_78a83bac-e4c0-4ce0-b9d0-71f5c56d3fe5/bin-2019/uautomizer/../../sv-benchmarks/c/loops/string_true-unreach-call_true-termination.i [2018-11-23 03:53:10,604 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_78a83bac-e4c0-4ce0-b9d0-71f5c56d3fe5/bin-2019/uautomizer/data/c92e09738/fcf9f4618e7b4537bd72fbc9e49cde07/FLAGe0809af95 [2018-11-23 03:53:11,005 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 03:53:11,006 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_78a83bac-e4c0-4ce0-b9d0-71f5c56d3fe5/sv-benchmarks/c/loops/string_true-unreach-call_true-termination.i [2018-11-23 03:53:11,009 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_78a83bac-e4c0-4ce0-b9d0-71f5c56d3fe5/bin-2019/uautomizer/data/c92e09738/fcf9f4618e7b4537bd72fbc9e49cde07/FLAGe0809af95 [2018-11-23 03:53:11,019 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_78a83bac-e4c0-4ce0-b9d0-71f5c56d3fe5/bin-2019/uautomizer/data/c92e09738/fcf9f4618e7b4537bd72fbc9e49cde07 [2018-11-23 03:53:11,021 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 03:53:11,022 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 03:53:11,023 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 03:53:11,023 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 03:53:11,026 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 03:53:11,027 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:53:11" (1/1) ... [2018-11-23 03:53:11,029 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@309c6631 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:53:11, skipping insertion in model container [2018-11-23 03:53:11,029 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:53:11" (1/1) ... [2018-11-23 03:53:11,035 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 03:53:11,049 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 03:53:11,165 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 03:53:11,167 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 03:53:11,181 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 03:53:11,196 INFO L195 MainTranslator]: Completed translation [2018-11-23 03:53:11,196 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:53:11 WrapperNode [2018-11-23 03:53:11,196 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 03:53:11,197 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 03:53:11,197 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 03:53:11,197 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 03:53:11,203 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:53:11" (1/1) ... [2018-11-23 03:53:11,208 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:53:11" (1/1) ... [2018-11-23 03:53:11,220 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 03:53:11,221 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 03:53:11,221 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 03:53:11,221 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 03:53:11,263 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:53:11" (1/1) ... [2018-11-23 03:53:11,263 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:53:11" (1/1) ... [2018-11-23 03:53:11,265 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:53:11" (1/1) ... [2018-11-23 03:53:11,265 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:53:11" (1/1) ... [2018-11-23 03:53:11,270 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:53:11" (1/1) ... [2018-11-23 03:53:11,275 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:53:11" (1/1) ... [2018-11-23 03:53:11,276 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:53:11" (1/1) ... [2018-11-23 03:53:11,277 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 03:53:11,278 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 03:53:11,278 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 03:53:11,278 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 03:53:11,279 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:53:11" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_78a83bac-e4c0-4ce0-b9d0-71f5c56d3fe5/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:53:11,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 03:53:11,313 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 03:53:11,313 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 03:53:11,313 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 03:53:11,313 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 03:53:11,313 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 03:53:11,500 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 03:53:11,500 INFO L280 CfgBuilder]: Removed 11 assue(true) statements. [2018-11-23 03:53:11,500 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:53:11 BoogieIcfgContainer [2018-11-23 03:53:11,500 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 03:53:11,501 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 03:53:11,501 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 03:53:11,504 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 03:53:11,504 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 03:53:11,504 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 03:53:11" (1/3) ... [2018-11-23 03:53:11,505 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3928101 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 03:53:11, skipping insertion in model container [2018-11-23 03:53:11,505 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 03:53:11,505 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:53:11" (2/3) ... [2018-11-23 03:53:11,506 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3928101 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 03:53:11, skipping insertion in model container [2018-11-23 03:53:11,506 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 03:53:11,506 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:53:11" (3/3) ... [2018-11-23 03:53:11,507 INFO L375 chiAutomizerObserver]: Analyzing ICFG string_true-unreach-call_true-termination.i [2018-11-23 03:53:11,553 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 03:53:11,554 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 03:53:11,554 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 03:53:11,554 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 03:53:11,555 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 03:53:11,555 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 03:53:11,555 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 03:53:11,555 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 03:53:11,555 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 03:53:11,566 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2018-11-23 03:53:11,582 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2018-11-23 03:53:11,582 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 03:53:11,582 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 03:53:11,586 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 03:53:11,587 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 03:53:11,587 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 03:53:11,587 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2018-11-23 03:53:11,588 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2018-11-23 03:53:11,589 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 03:53:11,589 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 03:53:11,589 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 03:53:11,589 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 03:53:11,596 INFO L794 eck$LassoCheckResult]: Stem: 24#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 4#L-1true havoc main_#res;havoc main_#t~nondet2, main_#t~post1, main_#t~mem3, main_#t~nondet5, main_#t~post4, main_#t~mem6, main_#t~post8, main_#t~mem7, main_#t~post10, main_#t~mem9, main_#t~mem11, main_#t~mem12, main_#t~post13, main_#t~post14, main_~#string_A~0.base, main_~#string_A~0.offset, main_~#string_B~0.base, main_~#string_B~0.offset, main_~i~0, main_~j~0, main_~nc_A~0, main_~nc_B~0, main_~found~0;call main_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.alloc(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.alloc(5);havoc main_~i~0;havoc main_~j~0;havoc main_~nc_A~0;havoc main_~nc_B~0;main_~found~0 := 0;main_~i~0 := 0; 14#L19-3true [2018-11-23 03:53:11,596 INFO L796 eck$LassoCheckResult]: Loop: 14#L19-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; 17#L19-2true main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 14#L19-3true [2018-11-23 03:53:11,601 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:53:11,601 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-23 03:53:11,603 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:53:11,604 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:53:11,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:53:11,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:53:11,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:53:11,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:53:11,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:53:11,678 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:53:11,679 INFO L82 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2018-11-23 03:53:11,679 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:53:11,679 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:53:11,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:53:11,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:53:11,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:53:11,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:53:11,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:53:11,697 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:53:11,697 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2018-11-23 03:53:11,698 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:53:11,698 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:53:11,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:53:11,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:53:11,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:53:11,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:53:11,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:53:11,851 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 03:53:11,851 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 03:53:11,852 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 03:53:11,852 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 03:53:11,852 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 03:53:11,852 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:53:11,852 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 03:53:11,852 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 03:53:11,852 INFO L131 ssoRankerPreferences]: Filename of dumped script: string_true-unreach-call_true-termination.i_Iteration1_Lasso [2018-11-23 03:53:11,852 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 03:53:11,853 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 03:53:11,874 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:53:11,879 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:53:11,882 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:53:11,885 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:53:11,887 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:53:11,889 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:53:11,891 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:53:11,895 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:53:11,906 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:53:11,908 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:53:11,909 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:53:11,912 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:53:11,914 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:53:11,915 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:53:11,917 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:53:11,919 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:53:11,923 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:53:11,924 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:53:11,925 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:53:11,927 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:53:11,960 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:53:11,963 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:53:12,117 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 03:53:12,120 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 03:53:12,121 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:53:12,122 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:53:12,123 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:53:12,123 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:53:12,123 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:53:12,123 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:53:12,124 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:53:12,125 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:53:12,127 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:53:12,128 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:53:12,128 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:53:12,128 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:53:12,128 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:53:12,129 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:53:12,129 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:53:12,129 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:53:12,129 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:53:12,130 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:53:12,130 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:53:12,130 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:53:12,131 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:53:12,131 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:53:12,131 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:53:12,131 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:53:12,131 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:53:12,131 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:53:12,132 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:53:12,132 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:53:12,133 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:53:12,133 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:53:12,133 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:53:12,133 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:53:12,133 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:53:12,133 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:53:12,133 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:53:12,134 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:53:12,134 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:53:12,135 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:53:12,135 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:53:12,135 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:53:12,135 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:53:12,135 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:53:12,136 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:53:12,136 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:53:12,136 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:53:12,136 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:53:12,137 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:53:12,137 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:53:12,137 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:53:12,137 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:53:12,137 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:53:12,138 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:53:12,138 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:53:12,139 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:53:12,139 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:53:12,139 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:53:12,139 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:53:12,140 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:53:12,140 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:53:12,141 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:53:12,141 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:53:12,144 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:53:12,144 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:53:12,144 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:53:12,144 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:53:12,145 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:53:12,145 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:53:12,145 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:53:12,145 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:53:12,145 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:53:12,146 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:53:12,146 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:53:12,147 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:53:12,147 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:53:12,147 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:53:12,147 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:53:12,147 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:53:12,148 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:53:12,148 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:53:12,148 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:53:12,149 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:53:12,149 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:53:12,149 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:53:12,149 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:53:12,149 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:53:12,150 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:53:12,150 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:53:12,150 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:53:12,151 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:53:12,151 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:53:12,152 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:53:12,152 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:53:12,152 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:53:12,152 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:53:12,152 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:53:12,153 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:53:12,153 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:53:12,153 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:53:12,154 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:53:12,154 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:53:12,154 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:53:12,154 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:53:12,155 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:53:12,156 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:53:12,156 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:53:12,159 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:53:12,160 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:53:12,160 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:53:12,161 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:53:12,161 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:53:12,161 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:53:12,161 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:53:12,161 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:53:12,161 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:53:12,163 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:53:12,163 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:53:12,163 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:53:12,164 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:53:12,164 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:53:12,164 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:53:12,164 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:53:12,164 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:53:12,164 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:53:12,165 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:53:12,165 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:53:12,166 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:53:12,166 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:53:12,166 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:53:12,166 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:53:12,167 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:53:12,167 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:53:12,170 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:53:12,171 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:53:12,171 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:53:12,171 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:53:12,171 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:53:12,172 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:53:12,172 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:53:12,172 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:53:12,172 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:53:12,175 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:53:12,175 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:53:12,175 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:53:12,175 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:53:12,176 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:53:12,176 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:53:12,176 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:53:12,176 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:53:12,176 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:53:12,177 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:53:12,177 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:53:12,178 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:53:12,178 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:53:12,178 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:53:12,178 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:53:12,178 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:53:12,178 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:53:12,179 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:53:12,179 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:53:12,180 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:53:12,180 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:53:12,180 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:53:12,180 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:53:12,180 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:53:12,180 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:53:12,181 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:53:12,181 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:53:12,182 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:53:12,182 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:53:12,182 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:53:12,183 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:53:12,183 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:53:12,183 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:53:12,185 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:53:12,185 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:53:12,205 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 03:53:12,234 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-11-23 03:53:12,234 INFO L444 ModelExtractionUtils]: 6 out of 13 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-23 03:53:12,236 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 03:53:12,237 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 03:53:12,238 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 03:53:12,238 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#string_A~0.base)_1, ULTIMATE.start_main_~i~0) = 9*v_rep(select #length ULTIMATE.start_main_~#string_A~0.base)_1 - 2*ULTIMATE.start_main_~i~0 Supporting invariants [] [2018-11-23 03:53:12,252 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-23 03:53:12,256 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-23 03:53:12,273 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:53:12,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:53:12,285 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:53:12,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:53:12,295 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:53:12,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:53:12,320 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 03:53:12,321 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states. Second operand 3 states. [2018-11-23 03:53:12,362 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states.. Second operand 3 states. Result 50 states and 80 transitions. Complement of second has 8 states. [2018-11-23 03:53:12,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-23 03:53:12,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 03:53:12,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2018-11-23 03:53:12,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 2 letters. Loop has 2 letters. [2018-11-23 03:53:12,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:53:12,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 4 letters. Loop has 2 letters. [2018-11-23 03:53:12,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:53:12,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 2 letters. Loop has 4 letters. [2018-11-23 03:53:12,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:53:12,366 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 80 transitions. [2018-11-23 03:53:12,368 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-11-23 03:53:12,371 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 19 states and 28 transitions. [2018-11-23 03:53:12,371 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-11-23 03:53:12,372 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-11-23 03:53:12,372 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 28 transitions. [2018-11-23 03:53:12,372 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 03:53:12,372 INFO L705 BuchiCegarLoop]: Abstraction has 19 states and 28 transitions. [2018-11-23 03:53:12,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 28 transitions. [2018-11-23 03:53:12,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-11-23 03:53:12,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 03:53:12,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 28 transitions. [2018-11-23 03:53:12,390 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 28 transitions. [2018-11-23 03:53:12,390 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 28 transitions. [2018-11-23 03:53:12,390 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 03:53:12,390 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 28 transitions. [2018-11-23 03:53:12,391 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-11-23 03:53:12,391 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 03:53:12,391 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 03:53:12,391 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-23 03:53:12,391 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 03:53:12,391 INFO L794 eck$LassoCheckResult]: Stem: 145#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 144#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~post1, main_#t~mem3, main_#t~nondet5, main_#t~post4, main_#t~mem6, main_#t~post8, main_#t~mem7, main_#t~post10, main_#t~mem9, main_#t~mem11, main_#t~mem12, main_#t~post13, main_#t~post14, main_~#string_A~0.base, main_~#string_A~0.offset, main_~#string_B~0.base, main_~#string_B~0.offset, main_~i~0, main_~j~0, main_~nc_A~0, main_~nc_B~0, main_~found~0;call main_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.alloc(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.alloc(5);havoc main_~i~0;havoc main_~j~0;havoc main_~nc_A~0;havoc main_~nc_B~0;main_~found~0 := 0;main_~i~0 := 0; 129#L19-3 assume !(main_~i~0 < 5); 127#L19-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 128#L21 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 142#L23-3 [2018-11-23 03:53:12,391 INFO L796 eck$LassoCheckResult]: Loop: 142#L23-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; 143#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 142#L23-3 [2018-11-23 03:53:12,392 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:53:12,392 INFO L82 PathProgramCache]: Analyzing trace with hash 28696938, now seen corresponding path program 1 times [2018-11-23 03:53:12,392 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:53:12,392 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:53:12,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:53:12,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:53:12,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:53:12,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:53:12,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:53:12,424 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:53:12,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 03:53:12,425 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 03:53:12,425 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:53:12,426 INFO L82 PathProgramCache]: Analyzing trace with hash 1891, now seen corresponding path program 1 times [2018-11-23 03:53:12,426 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:53:12,426 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:53:12,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:53:12,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:53:12,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:53:12,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:53:12,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:53:12,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 03:53:12,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 03:53:12,466 INFO L87 Difference]: Start difference. First operand 19 states and 28 transitions. cyclomatic complexity: 14 Second operand 3 states. [2018-11-23 03:53:12,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:53:12,486 INFO L93 Difference]: Finished difference Result 24 states and 30 transitions. [2018-11-23 03:53:12,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 03:53:12,487 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 30 transitions. [2018-11-23 03:53:12,488 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-11-23 03:53:12,490 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 24 states and 30 transitions. [2018-11-23 03:53:12,490 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2018-11-23 03:53:12,490 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2018-11-23 03:53:12,490 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 30 transitions. [2018-11-23 03:53:12,491 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 03:53:12,491 INFO L705 BuchiCegarLoop]: Abstraction has 24 states and 30 transitions. [2018-11-23 03:53:12,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 30 transitions. [2018-11-23 03:53:12,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 20. [2018-11-23 03:53:12,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 03:53:12,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2018-11-23 03:53:12,493 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2018-11-23 03:53:12,493 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2018-11-23 03:53:12,493 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-23 03:53:12,493 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 25 transitions. [2018-11-23 03:53:12,493 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-11-23 03:53:12,493 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 03:53:12,493 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 03:53:12,494 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:53:12,494 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 03:53:12,494 INFO L794 eck$LassoCheckResult]: Stem: 195#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 193#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~post1, main_#t~mem3, main_#t~nondet5, main_#t~post4, main_#t~mem6, main_#t~post8, main_#t~mem7, main_#t~post10, main_#t~mem9, main_#t~mem11, main_#t~mem12, main_#t~post13, main_#t~post14, main_~#string_A~0.base, main_~#string_A~0.offset, main_~#string_B~0.base, main_~#string_B~0.offset, main_~i~0, main_~j~0, main_~nc_A~0, main_~nc_B~0, main_~found~0;call main_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.alloc(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.alloc(5);havoc main_~i~0;havoc main_~j~0;havoc main_~nc_A~0;havoc main_~nc_B~0;main_~found~0 := 0;main_~i~0 := 0; 178#L19-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; 179#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 180#L19-3 assume !(main_~i~0 < 5); 176#L19-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 177#L21 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 191#L23-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; 192#L23-2 [2018-11-23 03:53:12,494 INFO L796 eck$LassoCheckResult]: Loop: 192#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 194#L23-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; 192#L23-2 [2018-11-23 03:53:12,494 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:53:12,494 INFO L82 PathProgramCache]: Analyzing trace with hash 265181045, now seen corresponding path program 1 times [2018-11-23 03:53:12,494 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:53:12,494 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:53:12,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:53:12,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:53:12,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:53:12,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:53:12,511 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:53:12,511 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 03:53:12,511 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_78a83bac-e4c0-4ce0-b9d0-71f5c56d3fe5/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 03:53:12,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:53:12,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:53:12,526 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:53:12,533 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:53:12,547 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 03:53:12,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-23 03:53:12,548 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 03:53:12,548 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:53:12,548 INFO L82 PathProgramCache]: Analyzing trace with hash 1951, now seen corresponding path program 2 times [2018-11-23 03:53:12,548 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:53:12,548 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:53:12,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:53:12,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:53:12,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:53:12,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:53:12,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:53:12,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 03:53:12,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 03:53:12,585 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. cyclomatic complexity: 10 Second operand 5 states. [2018-11-23 03:53:12,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:53:12,639 INFO L93 Difference]: Finished difference Result 30 states and 37 transitions. [2018-11-23 03:53:12,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 03:53:12,640 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 37 transitions. [2018-11-23 03:53:12,641 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-11-23 03:53:12,641 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 37 transitions. [2018-11-23 03:53:12,641 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2018-11-23 03:53:12,641 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2018-11-23 03:53:12,641 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 37 transitions. [2018-11-23 03:53:12,642 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 03:53:12,642 INFO L705 BuchiCegarLoop]: Abstraction has 30 states and 37 transitions. [2018-11-23 03:53:12,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 37 transitions. [2018-11-23 03:53:12,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2018-11-23 03:53:12,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 03:53:12,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2018-11-23 03:53:12,643 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 29 transitions. [2018-11-23 03:53:12,644 INFO L608 BuchiCegarLoop]: Abstraction has 24 states and 29 transitions. [2018-11-23 03:53:12,644 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-23 03:53:12,644 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 29 transitions. [2018-11-23 03:53:12,644 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-11-23 03:53:12,644 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 03:53:12,645 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 03:53:12,645 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-11-23 03:53:12,645 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 03:53:12,645 INFO L794 eck$LassoCheckResult]: Stem: 276#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 273#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~post1, main_#t~mem3, main_#t~nondet5, main_#t~post4, main_#t~mem6, main_#t~post8, main_#t~mem7, main_#t~post10, main_#t~mem9, main_#t~mem11, main_#t~mem12, main_#t~post13, main_#t~post14, main_~#string_A~0.base, main_~#string_A~0.offset, main_~#string_B~0.base, main_~#string_B~0.offset, main_~i~0, main_~j~0, main_~nc_A~0, main_~nc_B~0, main_~found~0;call main_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.alloc(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.alloc(5);havoc main_~i~0;havoc main_~j~0;havoc main_~nc_A~0;havoc main_~nc_B~0;main_~found~0 := 0;main_~i~0 := 0; 257#L19-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; 258#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 259#L19-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; 260#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 277#L19-3 assume !(main_~i~0 < 5); 255#L19-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 256#L21 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 274#L23-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; 275#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 271#L23-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; 272#L23-2 [2018-11-23 03:53:12,645 INFO L796 eck$LassoCheckResult]: Loop: 272#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 278#L23-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; 272#L23-2 [2018-11-23 03:53:12,646 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:53:12,646 INFO L82 PathProgramCache]: Analyzing trace with hash 780717205, now seen corresponding path program 1 times [2018-11-23 03:53:12,646 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:53:12,646 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:53:12,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:53:12,647 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:53:12,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:53:12,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:53:12,679 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 03:53:12,679 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 03:53:12,679 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_78a83bac-e4c0-4ce0-b9d0-71f5c56d3fe5/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 03:53:12,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:53:12,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:53:12,698 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:53:12,705 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 03:53:12,722 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 03:53:12,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-23 03:53:12,722 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 03:53:12,722 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:53:12,722 INFO L82 PathProgramCache]: Analyzing trace with hash 1951, now seen corresponding path program 3 times [2018-11-23 03:53:12,722 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:53:12,723 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:53:12,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:53:12,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:53:12,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:53:12,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:53:12,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:53:12,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 03:53:12,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 03:53:12,756 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. cyclomatic complexity: 10 Second operand 6 states. [2018-11-23 03:53:12,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:53:12,817 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2018-11-23 03:53:12,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 03:53:12,818 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 44 transitions. [2018-11-23 03:53:12,819 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-11-23 03:53:12,819 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 36 states and 44 transitions. [2018-11-23 03:53:12,819 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2018-11-23 03:53:12,819 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2018-11-23 03:53:12,820 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 44 transitions. [2018-11-23 03:53:12,820 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 03:53:12,820 INFO L705 BuchiCegarLoop]: Abstraction has 36 states and 44 transitions. [2018-11-23 03:53:12,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 44 transitions. [2018-11-23 03:53:12,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 28. [2018-11-23 03:53:12,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 03:53:12,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2018-11-23 03:53:12,822 INFO L728 BuchiCegarLoop]: Abstraction has 28 states and 33 transitions. [2018-11-23 03:53:12,822 INFO L608 BuchiCegarLoop]: Abstraction has 28 states and 33 transitions. [2018-11-23 03:53:12,822 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-23 03:53:12,822 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 33 transitions. [2018-11-23 03:53:12,823 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-11-23 03:53:12,823 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 03:53:12,823 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 03:53:12,823 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 1, 1, 1, 1, 1] [2018-11-23 03:53:12,823 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 03:53:12,823 INFO L794 eck$LassoCheckResult]: Stem: 380#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 376#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~post1, main_#t~mem3, main_#t~nondet5, main_#t~post4, main_#t~mem6, main_#t~post8, main_#t~mem7, main_#t~post10, main_#t~mem9, main_#t~mem11, main_#t~mem12, main_#t~post13, main_#t~post14, main_~#string_A~0.base, main_~#string_A~0.offset, main_~#string_B~0.base, main_~#string_B~0.offset, main_~i~0, main_~j~0, main_~nc_A~0, main_~nc_B~0, main_~found~0;call main_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.alloc(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.alloc(5);havoc main_~i~0;havoc main_~j~0;havoc main_~nc_A~0;havoc main_~nc_B~0;main_~found~0 := 0;main_~i~0 := 0; 359#L19-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; 360#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 384#L19-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; 366#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 361#L19-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; 362#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 381#L19-3 assume !(main_~i~0 < 5); 357#L19-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 358#L21 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 377#L23-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; 378#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 379#L23-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#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 374#L23-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; 375#L23-2 [2018-11-23 03:53:12,823 INFO L796 eck$LassoCheckResult]: Loop: 375#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 382#L23-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; 375#L23-2 [2018-11-23 03:53:12,824 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:53:12,824 INFO L82 PathProgramCache]: Analyzing trace with hash 2111137973, now seen corresponding path program 2 times [2018-11-23 03:53:12,824 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:53:12,824 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:53:12,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:53:12,824 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:53:12,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:53:12,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:53:12,861 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 03:53:12,861 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 03:53:12,861 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_78a83bac-e4c0-4ce0-b9d0-71f5c56d3fe5/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 03:53:12,868 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 03:53:12,878 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 03:53:12,879 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 03:53:12,880 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:53:12,885 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 03:53:12,900 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 03:53:12,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-23 03:53:12,900 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 03:53:12,901 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:53:12,901 INFO L82 PathProgramCache]: Analyzing trace with hash 1951, now seen corresponding path program 4 times [2018-11-23 03:53:12,901 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:53:12,901 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:53:12,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:53:12,901 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:53:12,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:53:12,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:53:12,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:53:12,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 03:53:12,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 03:53:12,943 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. cyclomatic complexity: 10 Second operand 7 states. [2018-11-23 03:53:13,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:53:13,009 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2018-11-23 03:53:13,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 03:53:13,009 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 51 transitions. [2018-11-23 03:53:13,010 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-11-23 03:53:13,010 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 42 states and 51 transitions. [2018-11-23 03:53:13,011 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2018-11-23 03:53:13,011 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2018-11-23 03:53:13,011 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 51 transitions. [2018-11-23 03:53:13,011 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 03:53:13,011 INFO L705 BuchiCegarLoop]: Abstraction has 42 states and 51 transitions. [2018-11-23 03:53:13,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 51 transitions. [2018-11-23 03:53:13,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 32. [2018-11-23 03:53:13,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 03:53:13,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2018-11-23 03:53:13,014 INFO L728 BuchiCegarLoop]: Abstraction has 32 states and 37 transitions. [2018-11-23 03:53:13,014 INFO L608 BuchiCegarLoop]: Abstraction has 32 states and 37 transitions. [2018-11-23 03:53:13,014 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-23 03:53:13,014 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 37 transitions. [2018-11-23 03:53:13,014 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-11-23 03:53:13,014 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 03:53:13,015 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 03:53:13,015 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 4, 3, 1, 1, 1, 1, 1] [2018-11-23 03:53:13,015 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 03:53:13,015 INFO L794 eck$LassoCheckResult]: Stem: 504#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 501#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~post1, main_#t~mem3, main_#t~nondet5, main_#t~post4, main_#t~mem6, main_#t~post8, main_#t~mem7, main_#t~post10, main_#t~mem9, main_#t~mem11, main_#t~mem12, main_#t~post13, main_#t~post14, main_~#string_A~0.base, main_~#string_A~0.offset, main_~#string_B~0.base, main_~#string_B~0.offset, main_~i~0, main_~j~0, main_~nc_A~0, main_~nc_B~0, main_~found~0;call main_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.alloc(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.alloc(5);havoc main_~i~0;havoc main_~j~0;havoc main_~nc_A~0;havoc main_~nc_B~0;main_~found~0 := 0;main_~i~0 := 0; 484#L19-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; 485#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 486#L19-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; 487#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 491#L19-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#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 509#L19-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; 506#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 505#L19-3 assume !(main_~i~0 < 5); 482#L19-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 483#L21 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 502#L23-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; 503#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 499#L23-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; 500#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 513#L23-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#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 511#L23-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; 508#L23-2 [2018-11-23 03:53:13,015 INFO L796 eck$LassoCheckResult]: Loop: 508#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 507#L23-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; 508#L23-2 [2018-11-23 03:53:13,015 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:53:13,015 INFO L82 PathProgramCache]: Analyzing trace with hash 213314517, now seen corresponding path program 3 times [2018-11-23 03:53:13,015 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:53:13,015 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:53:13,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:53:13,016 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:53:13,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:53:13,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:53:13,051 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-23 03:53:13,052 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 03:53:13,052 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_78a83bac-e4c0-4ce0-b9d0-71f5c56d3fe5/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 03:53:13,058 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 03:53:13,078 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-23 03:53:13,078 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 03:53:13,079 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:53:13,091 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-23 03:53:13,112 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 03:53:13,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-23 03:53:13,112 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 03:53:13,113 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:53:13,113 INFO L82 PathProgramCache]: Analyzing trace with hash 1951, now seen corresponding path program 5 times [2018-11-23 03:53:13,113 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:53:13,113 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:53:13,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:53:13,114 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:53:13,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:53:13,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:53:13,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:53:13,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 03:53:13,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 03:53:13,152 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. cyclomatic complexity: 10 Second operand 8 states. [2018-11-23 03:53:13,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:53:13,196 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2018-11-23 03:53:13,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 03:53:13,197 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 56 transitions. [2018-11-23 03:53:13,197 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-11-23 03:53:13,198 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 46 states and 56 transitions. [2018-11-23 03:53:13,198 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2018-11-23 03:53:13,198 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2018-11-23 03:53:13,198 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 56 transitions. [2018-11-23 03:53:13,198 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 03:53:13,199 INFO L705 BuchiCegarLoop]: Abstraction has 46 states and 56 transitions. [2018-11-23 03:53:13,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 56 transitions. [2018-11-23 03:53:13,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 36. [2018-11-23 03:53:13,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 03:53:13,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2018-11-23 03:53:13,201 INFO L728 BuchiCegarLoop]: Abstraction has 36 states and 41 transitions. [2018-11-23 03:53:13,201 INFO L608 BuchiCegarLoop]: Abstraction has 36 states and 41 transitions. [2018-11-23 03:53:13,201 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-23 03:53:13,201 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 41 transitions. [2018-11-23 03:53:13,201 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-11-23 03:53:13,202 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 03:53:13,202 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 03:53:13,202 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 4, 1, 1, 1, 1, 1] [2018-11-23 03:53:13,202 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 03:53:13,202 INFO L794 eck$LassoCheckResult]: Stem: 648#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 646#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~post1, main_#t~mem3, main_#t~nondet5, main_#t~post4, main_#t~mem6, main_#t~post8, main_#t~mem7, main_#t~post10, main_#t~mem9, main_#t~mem11, main_#t~mem12, main_#t~post13, main_#t~post14, main_~#string_A~0.base, main_~#string_A~0.offset, main_~#string_B~0.base, main_~#string_B~0.offset, main_~i~0, main_~j~0, main_~nc_A~0, main_~nc_B~0, main_~found~0;call main_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.alloc(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.alloc(5);havoc main_~i~0;havoc main_~j~0;havoc main_~nc_A~0;havoc main_~nc_B~0;main_~found~0 := 0;main_~i~0 := 0; 630#L19-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; 631#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 632#L19-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; 633#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 655#L19-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; 654#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 653#L19-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; 652#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 651#L19-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; 650#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 649#L19-3 assume !(main_~i~0 < 5); 628#L19-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 629#L21 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 644#L23-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; 645#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 647#L23-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; 663#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 662#L23-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; 661#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 660#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 659#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 658#L23-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; 657#L23-2 [2018-11-23 03:53:13,202 INFO L796 eck$LassoCheckResult]: Loop: 657#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 656#L23-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; 657#L23-2 [2018-11-23 03:53:13,203 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:53:13,203 INFO L82 PathProgramCache]: Analyzing trace with hash 1212159477, now seen corresponding path program 4 times [2018-11-23 03:53:13,203 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:53:13,203 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:53:13,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:53:13,203 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:53:13,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:53:13,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:53:13,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:53:13,231 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:53:13,231 INFO L82 PathProgramCache]: Analyzing trace with hash 1951, now seen corresponding path program 6 times [2018-11-23 03:53:13,231 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:53:13,231 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:53:13,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:53:13,232 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:53:13,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:53:13,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:53:13,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:53:13,237 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:53:13,237 INFO L82 PathProgramCache]: Analyzing trace with hash 949121171, now seen corresponding path program 5 times [2018-11-23 03:53:13,237 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:53:13,237 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:53:13,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:53:13,238 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:53:13,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:53:13,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:53:13,376 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-23 03:53:13,376 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:53:13,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-23 03:53:13,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 03:53:13,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 03:53:13,400 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. cyclomatic complexity: 10 Second operand 9 states. [2018-11-23 03:53:13,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:53:13,472 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2018-11-23 03:53:13,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 03:53:13,473 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 41 transitions. [2018-11-23 03:53:13,473 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-11-23 03:53:13,473 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 37 states and 41 transitions. [2018-11-23 03:53:13,473 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2018-11-23 03:53:13,474 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2018-11-23 03:53:13,474 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 41 transitions. [2018-11-23 03:53:13,474 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 03:53:13,474 INFO L705 BuchiCegarLoop]: Abstraction has 37 states and 41 transitions. [2018-11-23 03:53:13,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 41 transitions. [2018-11-23 03:53:13,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2018-11-23 03:53:13,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 03:53:13,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2018-11-23 03:53:13,476 INFO L728 BuchiCegarLoop]: Abstraction has 36 states and 40 transitions. [2018-11-23 03:53:13,476 INFO L608 BuchiCegarLoop]: Abstraction has 36 states and 40 transitions. [2018-11-23 03:53:13,476 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-23 03:53:13,476 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 40 transitions. [2018-11-23 03:53:13,477 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-11-23 03:53:13,477 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 03:53:13,477 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 03:53:13,477 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:53:13,477 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 03:53:13,478 INFO L794 eck$LassoCheckResult]: Stem: 735#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 733#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~post1, main_#t~mem3, main_#t~nondet5, main_#t~post4, main_#t~mem6, main_#t~post8, main_#t~mem7, main_#t~post10, main_#t~mem9, main_#t~mem11, main_#t~mem12, main_#t~post13, main_#t~post14, main_~#string_A~0.base, main_~#string_A~0.offset, main_~#string_B~0.base, main_~#string_B~0.offset, main_~i~0, main_~j~0, main_~nc_A~0, main_~nc_B~0, main_~found~0;call main_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.alloc(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.alloc(5);havoc main_~i~0;havoc main_~j~0;havoc main_~nc_A~0;havoc main_~nc_B~0;main_~found~0 := 0;main_~i~0 := 0; 717#L19-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; 718#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 719#L19-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; 720#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 750#L19-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; 749#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 748#L19-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; 747#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 746#L19-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; 737#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 736#L19-3 assume !(main_~i~0 < 5); 715#L19-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 716#L21 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 731#L23-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; 732#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 734#L23-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; 745#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 744#L23-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; 743#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 742#L23-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#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 740#L23-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; 739#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 738#L23-3 assume !(main_~i~0 < 5); 729#L23-4 call main_#t~mem6 := read~int(main_~#string_B~0.base, 4 + main_~#string_B~0.offset, 1); 730#L25 assume !!(0 == main_#t~mem6);havoc main_#t~mem6;main_~nc_A~0 := 0; 723#L28-3 [2018-11-23 03:53:13,478 INFO L796 eck$LassoCheckResult]: Loop: 723#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 721#L28-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; 723#L28-3 [2018-11-23 03:53:13,478 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:53:13,478 INFO L82 PathProgramCache]: Analyzing trace with hash 1572377782, now seen corresponding path program 1 times [2018-11-23 03:53:13,478 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:53:13,478 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:53:13,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:53:13,479 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:53:13,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:53:13,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:53:13,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:53:13,501 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:53:13,501 INFO L82 PathProgramCache]: Analyzing trace with hash 2406, now seen corresponding path program 1 times [2018-11-23 03:53:13,501 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:53:13,501 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:53:13,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:53:13,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:53:13,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:53:13,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:53:13,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:53:13,505 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:53:13,505 INFO L82 PathProgramCache]: Analyzing trace with hash -773438245, now seen corresponding path program 1 times [2018-11-23 03:53:13,505 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:53:13,505 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:53:13,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:53:13,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:53:13,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:53:13,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:53:13,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:53:16,167 WARN L180 SmtUtils]: Spent 2.62 s on a formula simplification. DAG size of input: 213 DAG size of output: 161 [2018-11-23 03:53:16,233 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 03:53:16,234 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 03:53:16,234 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 03:53:16,234 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 03:53:16,234 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 03:53:16,234 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:53:16,234 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 03:53:16,234 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 03:53:16,234 INFO L131 ssoRankerPreferences]: Filename of dumped script: string_true-unreach-call_true-termination.i_Iteration8_Lasso [2018-11-23 03:53:16,234 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 03:53:16,234 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 03:53:16,237 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:53:16,240 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:53:16,241 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:53:16,242 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:53:16,244 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:53:16,245 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:53:16,246 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:53:16,247 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:53:16,247 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:53:16,248 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:53:16,249 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:53:16,251 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:53:16,252 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:53:16,253 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:53:16,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:53:16,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:53:16,353 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:53:16,354 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:53:16,355 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:53:16,357 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:53:16,358 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:53:16,359 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:53:16,465 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 03:53:16,465 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 03:53:16,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 [2018-11-23 03:53:16,466 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:53:16,466 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:53:16,466 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:53:16,466 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:53:16,466 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:53:16,467 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:53:16,467 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:53:16,467 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:53:16,467 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:53:16,468 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:53:16,468 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:53:16,468 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:53:16,468 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:53:16,468 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:53:16,468 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:53:16,468 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:53:16,469 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:53:16,469 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:53:16,469 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:53:16,469 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:53:16,470 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:53:16,470 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:53:16,470 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:53:16,470 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:53:16,470 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:53:16,470 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:53:16,471 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:53:16,471 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:53:16,471 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:53:16,471 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:53:16,471 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:53:16,472 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:53:16,472 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:53:16,473 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:53:16,473 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:53:16,474 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:53:16,474 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:53:16,474 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:53:16,474 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:53:16,474 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:53:16,474 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:53:16,474 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:53:16,475 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:53:16,475 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:53:16,475 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:53:16,475 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:53:16,475 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:53:16,476 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:53:16,476 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:53:16,476 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:53:16,476 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:53:16,476 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:53:16,477 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:53:16,477 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:53:16,477 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:53:16,477 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:53:16,477 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:53:16,477 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:53:16,477 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:53:16,477 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:53:16,478 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:53:16,478 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:53:16,478 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:53:16,478 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:53:16,479 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:53:16,479 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:53:16,479 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:53:16,479 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:53:16,479 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:53:16,479 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:53:16,480 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:53:16,480 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:53:16,480 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:53:16,480 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:53:16,480 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:53:16,480 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:53:16,480 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:53:16,480 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:53:16,481 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:53:16,481 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:53:16,481 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:53:16,481 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:53:16,482 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:53:16,482 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:53:16,482 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:53:16,482 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:53:16,482 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:53:16,482 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:53:16,483 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:53:16,483 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:53:16,483 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:53:16,483 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:53:16,483 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:53:16,484 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:53:16,484 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:53:16,485 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:53:16,486 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:53:16,486 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:53:16,486 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:53:16,486 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:53:16,486 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:53:16,487 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:53:16,487 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:53:16,487 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:53:16,487 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:53:16,487 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:53:16,488 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:53:16,488 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:53:16,488 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:53:16,488 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:53:16,488 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:53:16,488 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:53:16,488 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:53:16,489 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:53:16,489 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:53:16,489 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:53:16,489 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:53:16,490 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:53:16,490 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:53:16,490 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:53:16,490 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:53:16,491 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:53:16,492 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:53:16,492 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:53:16,492 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:53:16,492 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:53:16,492 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:53:16,492 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:53:16,493 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:53:16,493 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:53:16,493 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:53:16,493 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:53:16,494 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:53:16,494 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:53:16,494 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:53:16,494 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:53:16,494 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:53:16,494 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:53:16,494 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:53:16,495 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:53:16,495 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:53:16,495 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:53:16,495 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:53:16,495 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:53:16,495 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:53:16,496 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:53:16,496 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:53:16,496 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:53:16,496 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:53:16,496 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:53:16,497 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:53:16,497 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:53:16,497 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:53:16,497 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:53:16,499 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:53:16,499 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:53:16,500 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:53:16,500 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:53:16,501 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:53:16,501 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:53:16,501 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:53:16,501 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:53:16,504 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:53:16,504 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:53:16,510 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 03:53:16,519 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-23 03:53:16,519 INFO L444 ModelExtractionUtils]: 2 out of 13 variables were initially zero. Simplification set additionally 7 variables to zero. [2018-11-23 03:53:16,520 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 03:53:16,520 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 03:53:16,520 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 03:53:16,521 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#string_A~0.base)_2, ULTIMATE.start_main_~#string_A~0.offset, ULTIMATE.start_main_~nc_A~0) = 1*v_rep(select #length ULTIMATE.start_main_~#string_A~0.base)_2 - 1*ULTIMATE.start_main_~#string_A~0.offset - 1*ULTIMATE.start_main_~nc_A~0 Supporting invariants [] [2018-11-23 03:53:16,561 INFO L297 tatePredicateManager]: 13 out of 13 supporting invariants were superfluous and have been removed [2018-11-23 03:53:16,562 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-23 03:53:16,570 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:53:16,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:53:16,584 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:53:16,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:53:16,590 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:53:16,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:53:16,597 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 03:53:16,597 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 36 states and 40 transitions. cyclomatic complexity: 8 Second operand 3 states. [2018-11-23 03:53:16,624 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 36 states and 40 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 44 states and 52 transitions. Complement of second has 4 states. [2018-11-23 03:53:16,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-23 03:53:16,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 03:53:16,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2018-11-23 03:53:16,626 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 28 letters. Loop has 2 letters. [2018-11-23 03:53:16,626 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:53:16,627 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 30 letters. Loop has 2 letters. [2018-11-23 03:53:16,629 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:53:16,629 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 28 letters. Loop has 4 letters. [2018-11-23 03:53:16,629 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:53:16,629 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 52 transitions. [2018-11-23 03:53:16,630 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-11-23 03:53:16,630 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 38 states and 43 transitions. [2018-11-23 03:53:16,630 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2018-11-23 03:53:16,630 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2018-11-23 03:53:16,630 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 43 transitions. [2018-11-23 03:53:16,630 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 03:53:16,630 INFO L705 BuchiCegarLoop]: Abstraction has 38 states and 43 transitions. [2018-11-23 03:53:16,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 43 transitions. [2018-11-23 03:53:16,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-11-23 03:53:16,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 03:53:16,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2018-11-23 03:53:16,632 INFO L728 BuchiCegarLoop]: Abstraction has 38 states and 43 transitions. [2018-11-23 03:53:16,632 INFO L608 BuchiCegarLoop]: Abstraction has 38 states and 43 transitions. [2018-11-23 03:53:16,632 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-23 03:53:16,632 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 43 transitions. [2018-11-23 03:53:16,633 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-11-23 03:53:16,633 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 03:53:16,633 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 03:53:16,633 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:53:16,633 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 03:53:16,634 INFO L794 eck$LassoCheckResult]: Stem: 979#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 976#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~post1, main_#t~mem3, main_#t~nondet5, main_#t~post4, main_#t~mem6, main_#t~post8, main_#t~mem7, main_#t~post10, main_#t~mem9, main_#t~mem11, main_#t~mem12, main_#t~post13, main_#t~post14, main_~#string_A~0.base, main_~#string_A~0.offset, main_~#string_B~0.base, main_~#string_B~0.offset, main_~i~0, main_~j~0, main_~nc_A~0, main_~nc_B~0, main_~found~0;call main_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.alloc(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.alloc(5);havoc main_~i~0;havoc main_~j~0;havoc main_~nc_A~0;havoc main_~nc_B~0;main_~found~0 := 0;main_~i~0 := 0; 959#L19-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; 960#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 961#L19-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; 962#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 987#L19-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; 986#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 985#L19-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; 984#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 983#L19-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; 982#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 981#L19-3 assume !(main_~i~0 < 5); 957#L19-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 958#L21 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 977#L23-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; 978#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 974#L23-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; 975#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 994#L23-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; 993#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 992#L23-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; 991#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 990#L23-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; 989#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 988#L23-3 assume !(main_~i~0 < 5); 972#L23-4 call main_#t~mem6 := read~int(main_~#string_B~0.base, 4 + main_~#string_B~0.offset, 1); 973#L25 assume !!(0 == main_#t~mem6);havoc main_#t~mem6;main_~nc_A~0 := 0; 980#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 963#L28-1 assume !(0 != main_#t~mem7);havoc main_#t~mem7; 964#L28-4 main_~nc_B~0 := 0; 970#L32-3 [2018-11-23 03:53:16,634 INFO L796 eck$LassoCheckResult]: Loop: 970#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 971#L32-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; 970#L32-3 [2018-11-23 03:53:16,634 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:53:16,634 INFO L82 PathProgramCache]: Analyzing trace with hash 1793218173, now seen corresponding path program 1 times [2018-11-23 03:53:16,634 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:53:16,634 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:53:16,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:53:16,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:53:16,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:53:16,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:53:16,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:53:16,657 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:53:16,657 INFO L82 PathProgramCache]: Analyzing trace with hash 2854, now seen corresponding path program 1 times [2018-11-23 03:53:16,657 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:53:16,658 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:53:16,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:53:16,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:53:16,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:53:16,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:53:16,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:53:16,662 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:53:16,662 INFO L82 PathProgramCache]: Analyzing trace with hash 1000780450, now seen corresponding path program 1 times [2018-11-23 03:53:16,662 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:53:16,662 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:53:16,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:53:16,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:53:16,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:53:16,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:53:16,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:53:19,026 WARN L180 SmtUtils]: Spent 2.31 s on a formula simplification. DAG size of input: 224 DAG size of output: 166 [2018-11-23 03:53:19,104 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 03:53:19,104 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 03:53:19,104 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 03:53:19,104 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 03:53:19,104 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 03:53:19,104 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:53:19,104 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 03:53:19,104 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 03:53:19,104 INFO L131 ssoRankerPreferences]: Filename of dumped script: string_true-unreach-call_true-termination.i_Iteration9_Lasso [2018-11-23 03:53:19,104 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 03:53:19,104 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 03:53:19,106 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:53:19,113 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:53:19,118 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:53:19,119 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:53:19,121 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:53:19,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:53:19,123 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:53:19,124 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:53:19,126 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:53:19,127 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:53:19,128 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:53:19,129 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:53:19,131 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:53:19,132 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:53:19,132 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:53:19,133 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:53:19,134 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:53:19,195 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:53:19,197 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:53:19,198 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:53:19,285 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 03:53:19,286 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 03:53:19,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 [2018-11-23 03:53:19,286 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:53:19,287 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:53:19,287 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:53:19,287 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:53:19,287 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:53:19,287 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:53:19,287 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:53:19,288 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:53:19,288 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:53:19,289 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:53:19,289 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:53:19,289 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:53:19,289 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:53:19,289 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:53:19,289 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:53:19,294 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:53:19,295 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:53:19,295 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:53:19,295 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:53:19,295 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:53:19,295 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:53:19,295 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:53:19,296 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:53:19,296 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:53:19,296 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:53:19,296 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:53:19,297 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:53:19,297 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:53:19,297 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:53:19,297 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:53:19,297 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:53:19,297 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:53:19,297 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:53:19,298 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:53:19,298 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:53:19,298 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:53:19,298 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:53:19,298 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:53:19,298 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:53:19,299 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:53:19,299 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:53:19,299 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:53:19,299 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:53:19,299 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:53:19,300 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:53:19,300 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:53:19,300 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:53:19,300 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:53:19,301 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:53:19,301 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:53:19,302 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:53:19,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 [2018-11-23 03:53:19,302 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:53:19,302 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:53:19,302 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:53:19,303 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:53:19,303 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:53:19,303 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:53:19,303 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:53:19,303 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:53:19,304 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:53:19,304 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:53:19,304 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:53:19,304 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:53:19,304 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:53:19,304 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:53:19,304 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:53:19,304 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:53:19,305 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:53:19,305 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:53:19,305 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:53:19,305 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:53:19,306 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:53:19,306 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:53:19,306 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:53:19,306 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:53:19,306 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:53:19,306 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:53:19,307 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:53:19,307 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:53:19,307 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:53:19,307 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:53:19,307 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:53:19,307 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:53:19,307 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:53:19,308 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:53:19,308 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:53:19,308 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:53:19,308 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:53:19,308 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:53:19,309 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:53:19,309 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:53:19,309 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:53:19,309 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:53:19,309 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:53:19,309 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:53:19,310 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:53:19,310 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:53:19,310 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:53:19,310 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:53:19,310 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:53:19,310 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:53:19,311 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:53:19,311 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:53:19,311 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:53:19,311 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:53:19,312 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:53:19,312 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:53:19,312 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:53:19,312 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:53:19,312 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:53:19,312 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:53:19,312 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:53:19,313 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:53:19,313 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:53:19,313 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:53:19,313 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:53:19,313 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:53:19,314 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:53:19,314 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:53:19,314 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:53:19,314 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:53:19,314 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:53:19,315 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:53:19,315 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:53:19,315 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:53:19,315 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:53:19,315 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:53:19,315 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:53:19,316 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:53:19,316 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:53:19,316 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:53:19,316 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:53:19,317 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:53:19,317 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:53:19,317 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:53:19,317 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:53:19,317 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:53:19,317 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:53:19,317 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:53:19,318 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:53:19,318 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:53:19,318 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:53:19,318 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:53:19,319 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:53:19,319 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:53:19,319 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:53:19,319 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:53:19,321 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:53:19,321 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:53:19,321 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:53:19,321 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:53:19,321 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:53:19,322 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:53:19,322 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:53:19,322 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:53:19,323 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:53:19,323 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:53:19,324 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:53:19,324 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 03:53:19,324 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:53:19,324 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:53:19,325 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 03:53:19,325 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:53:19,326 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:53:19,327 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:53:19,327 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:53:19,327 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:53:19,327 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:53:19,327 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:53:19,328 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:53:19,329 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:53:19,334 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 03:53:19,341 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-23 03:53:19,341 INFO L444 ModelExtractionUtils]: 12 out of 19 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-23 03:53:19,342 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 03:53:19,343 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 03:53:19,343 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 03:53:19,343 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#string_B~0.base)_3, ULTIMATE.start_main_~#string_B~0.offset, ULTIMATE.start_main_~nc_B~0) = 1*v_rep(select #length ULTIMATE.start_main_~#string_B~0.base)_3 - 1*ULTIMATE.start_main_~#string_B~0.offset - 1*ULTIMATE.start_main_~nc_B~0 Supporting invariants [] [2018-11-23 03:53:19,379 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2018-11-23 03:53:19,380 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-23 03:53:19,423 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:53:19,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:53:19,441 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:53:19,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:53:19,447 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:53:19,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:53:19,453 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 03:53:19,453 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 38 states and 43 transitions. cyclomatic complexity: 9 Second operand 3 states. [2018-11-23 03:53:19,463 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 38 states and 43 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 43 states and 51 transitions. Complement of second has 4 states. [2018-11-23 03:53:19,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-23 03:53:19,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 03:53:19,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2018-11-23 03:53:19,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 31 letters. Loop has 2 letters. [2018-11-23 03:53:19,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:53:19,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 33 letters. Loop has 2 letters. [2018-11-23 03:53:19,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:53:19,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 31 letters. Loop has 4 letters. [2018-11-23 03:53:19,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:53:19,465 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 51 transitions. [2018-11-23 03:53:19,465 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 03:53:19,465 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 40 states and 46 transitions. [2018-11-23 03:53:19,465 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2018-11-23 03:53:19,466 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2018-11-23 03:53:19,466 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 46 transitions. [2018-11-23 03:53:19,466 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 03:53:19,466 INFO L705 BuchiCegarLoop]: Abstraction has 40 states and 46 transitions. [2018-11-23 03:53:19,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 46 transitions. [2018-11-23 03:53:19,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-11-23 03:53:19,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 03:53:19,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2018-11-23 03:53:19,469 INFO L728 BuchiCegarLoop]: Abstraction has 40 states and 46 transitions. [2018-11-23 03:53:19,469 INFO L608 BuchiCegarLoop]: Abstraction has 40 states and 46 transitions. [2018-11-23 03:53:19,469 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-23 03:53:19,470 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 46 transitions. [2018-11-23 03:53:19,470 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 03:53:19,470 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 03:53:19,470 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 03:53:19,471 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:53:19,471 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 03:53:19,471 INFO L794 eck$LassoCheckResult]: Stem: 1197#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1194#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~post1, main_#t~mem3, main_#t~nondet5, main_#t~post4, main_#t~mem6, main_#t~post8, main_#t~mem7, main_#t~post10, main_#t~mem9, main_#t~mem11, main_#t~mem12, main_#t~post13, main_#t~post14, main_~#string_A~0.base, main_~#string_A~0.offset, main_~#string_B~0.base, main_~#string_B~0.offset, main_~i~0, main_~j~0, main_~nc_A~0, main_~nc_B~0, main_~found~0;call main_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.alloc(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.alloc(5);havoc main_~i~0;havoc main_~j~0;havoc main_~nc_A~0;havoc main_~nc_B~0;main_~found~0 := 0;main_~i~0 := 0; 1175#L19-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; 1176#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1177#L19-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; 1178#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1205#L19-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; 1204#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1203#L19-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; 1202#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1201#L19-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; 1200#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1199#L19-3 assume !(main_~i~0 < 5); 1173#L19-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 1174#L21 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 1195#L23-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; 1196#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1192#L23-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; 1193#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1212#L23-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; 1211#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1210#L23-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; 1209#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1208#L23-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; 1207#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1206#L23-3 assume !(main_~i~0 < 5); 1190#L23-4 call main_#t~mem6 := read~int(main_~#string_B~0.base, 4 + main_~#string_B~0.offset, 1); 1191#L25 assume !!(0 == main_#t~mem6);havoc main_#t~mem6;main_~nc_A~0 := 0; 1198#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 1179#L28-1 assume !(0 != main_#t~mem7);havoc main_#t~mem7; 1180#L28-4 main_~nc_B~0 := 0; 1186#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 1188#L32-1 assume !(0 != main_#t~mem9);havoc main_#t~mem9; 1183#L32-4 assume !!(main_~nc_B~0 >= main_~nc_A~0);main_~j~0 := 0;main_~i~0 := main_~j~0; 1184#L41-2 [2018-11-23 03:53:19,471 INFO L796 eck$LassoCheckResult]: Loop: 1184#L41-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); 1185#L41 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; 1184#L41-2 [2018-11-23 03:53:19,471 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:53:19,472 INFO L82 PathProgramCache]: Analyzing trace with hash 959422888, now seen corresponding path program 1 times [2018-11-23 03:53:19,472 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:53:19,472 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:53:19,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:53:19,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:53:19,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:53:19,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:53:19,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:53:19,500 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:53:19,500 INFO L82 PathProgramCache]: Analyzing trace with hash 3556, now seen corresponding path program 1 times [2018-11-23 03:53:19,500 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:53:19,500 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:53:19,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:53:19,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:53:19,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:53:19,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:53:19,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:53:19,506 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:53:19,506 INFO L82 PathProgramCache]: Analyzing trace with hash -1412570677, now seen corresponding path program 1 times [2018-11-23 03:53:19,506 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:53:19,510 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:53:19,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:53:19,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:53:19,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:53:19,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:53:19,583 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-11-23 03:53:19,583 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:53:19,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 03:53:19,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 03:53:19,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 03:53:19,683 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. cyclomatic complexity: 10 Second operand 4 states. [2018-11-23 03:53:19,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:53:19,697 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2018-11-23 03:53:19,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 03:53:19,697 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 56 transitions. [2018-11-23 03:53:19,698 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 03:53:19,698 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 41 states and 46 transitions. [2018-11-23 03:53:19,698 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2018-11-23 03:53:19,698 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2018-11-23 03:53:19,698 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 46 transitions. [2018-11-23 03:53:19,699 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 03:53:19,699 INFO L705 BuchiCegarLoop]: Abstraction has 41 states and 46 transitions. [2018-11-23 03:53:19,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 46 transitions. [2018-11-23 03:53:19,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2018-11-23 03:53:19,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 03:53:19,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2018-11-23 03:53:19,700 INFO L728 BuchiCegarLoop]: Abstraction has 40 states and 45 transitions. [2018-11-23 03:53:19,700 INFO L608 BuchiCegarLoop]: Abstraction has 40 states and 45 transitions. [2018-11-23 03:53:19,700 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-23 03:53:19,701 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 45 transitions. [2018-11-23 03:53:19,701 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 03:53:19,701 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 03:53:19,701 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 03:53:19,702 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:53:19,702 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 03:53:19,702 INFO L794 eck$LassoCheckResult]: Stem: 1295#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1293#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~post1, main_#t~mem3, main_#t~nondet5, main_#t~post4, main_#t~mem6, main_#t~post8, main_#t~mem7, main_#t~post10, main_#t~mem9, main_#t~mem11, main_#t~mem12, main_#t~post13, main_#t~post14, main_~#string_A~0.base, main_~#string_A~0.offset, main_~#string_B~0.base, main_~#string_B~0.offset, main_~i~0, main_~j~0, main_~nc_A~0, main_~nc_B~0, main_~found~0;call main_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.alloc(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.alloc(5);havoc main_~i~0;havoc main_~j~0;havoc main_~nc_A~0;havoc main_~nc_B~0;main_~found~0 := 0;main_~i~0 := 0; 1273#L19-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; 1274#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1275#L19-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; 1276#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1281#L19-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; 1302#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1301#L19-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; 1300#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1299#L19-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; 1298#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1297#L19-3 assume !(main_~i~0 < 5); 1271#L19-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 1272#L21 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 1291#L23-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; 1292#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1294#L23-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; 1310#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1309#L23-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; 1308#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1307#L23-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; 1306#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1305#L23-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; 1304#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1303#L23-3 assume !(main_~i~0 < 5); 1289#L23-4 call main_#t~mem6 := read~int(main_~#string_B~0.base, 4 + main_~#string_B~0.offset, 1); 1290#L25 assume !!(0 == main_#t~mem6);havoc main_#t~mem6;main_~nc_A~0 := 0; 1296#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 1279#L28-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; 1280#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 1277#L28-1 assume !(0 != main_#t~mem7);havoc main_#t~mem7; 1278#L28-4 main_~nc_B~0 := 0; 1285#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 1287#L32-1 assume !(0 != main_#t~mem9);havoc main_#t~mem9; 1282#L32-4 assume !!(main_~nc_B~0 >= main_~nc_A~0);main_~j~0 := 0;main_~i~0 := main_~j~0; 1283#L41-2 [2018-11-23 03:53:19,702 INFO L796 eck$LassoCheckResult]: Loop: 1283#L41-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); 1284#L41 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; 1283#L41-2 [2018-11-23 03:53:19,702 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:53:19,702 INFO L82 PathProgramCache]: Analyzing trace with hash 94364173, now seen corresponding path program 1 times [2018-11-23 03:53:19,702 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:53:19,702 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:53:19,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:53:19,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:53:19,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:53:19,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:53:19,735 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-11-23 03:53:19,735 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 03:53:19,736 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_78a83bac-e4c0-4ce0-b9d0-71f5c56d3fe5/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 03:53:19,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:53:19,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:53:19,768 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:53:19,779 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-11-23 03:53:19,795 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 03:53:19,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2018-11-23 03:53:19,795 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 03:53:19,795 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:53:19,795 INFO L82 PathProgramCache]: Analyzing trace with hash 3556, now seen corresponding path program 2 times [2018-11-23 03:53:19,795 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:53:19,795 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:53:19,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:53:19,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:53:19,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:53:19,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:53:19,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:53:19,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 03:53:19,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-23 03:53:19,843 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. cyclomatic complexity: 9 Second operand 9 states. [2018-11-23 03:53:19,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:53:19,877 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2018-11-23 03:53:19,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 03:53:19,878 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 48 transitions. [2018-11-23 03:53:19,878 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 03:53:19,879 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 42 states and 46 transitions. [2018-11-23 03:53:19,879 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2018-11-23 03:53:19,879 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2018-11-23 03:53:19,879 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 46 transitions. [2018-11-23 03:53:19,879 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 03:53:19,879 INFO L705 BuchiCegarLoop]: Abstraction has 42 states and 46 transitions. [2018-11-23 03:53:19,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 46 transitions. [2018-11-23 03:53:19,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2018-11-23 03:53:19,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 03:53:19,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2018-11-23 03:53:19,881 INFO L728 BuchiCegarLoop]: Abstraction has 40 states and 44 transitions. [2018-11-23 03:53:19,881 INFO L608 BuchiCegarLoop]: Abstraction has 40 states and 44 transitions. [2018-11-23 03:53:19,881 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-23 03:53:19,881 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 44 transitions. [2018-11-23 03:53:19,881 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 03:53:19,882 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 03:53:19,882 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 03:53:19,882 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:53:19,882 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 03:53:19,882 INFO L794 eck$LassoCheckResult]: Stem: 1498#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1496#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~post1, main_#t~mem3, main_#t~nondet5, main_#t~post4, main_#t~mem6, main_#t~post8, main_#t~mem7, main_#t~post10, main_#t~mem9, main_#t~mem11, main_#t~mem12, main_#t~post13, main_#t~post14, main_~#string_A~0.base, main_~#string_A~0.offset, main_~#string_B~0.base, main_~#string_B~0.offset, main_~i~0, main_~j~0, main_~nc_A~0, main_~nc_B~0, main_~found~0;call main_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.alloc(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.alloc(5);havoc main_~i~0;havoc main_~j~0;havoc main_~nc_A~0;havoc main_~nc_B~0;main_~found~0 := 0;main_~i~0 := 0; 1476#L19-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; 1477#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1478#L19-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; 1479#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1484#L19-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; 1505#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1504#L19-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; 1503#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1502#L19-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; 1501#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1500#L19-3 assume !(main_~i~0 < 5); 1474#L19-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 1475#L21 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 1494#L23-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; 1495#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1497#L23-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; 1513#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1512#L23-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; 1511#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1510#L23-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; 1509#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1508#L23-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; 1507#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1506#L23-3 assume !(main_~i~0 < 5); 1492#L23-4 call main_#t~mem6 := read~int(main_~#string_B~0.base, 4 + main_~#string_B~0.offset, 1); 1493#L25 assume !!(0 == main_#t~mem6);havoc main_#t~mem6;main_~nc_A~0 := 0; 1499#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 1482#L28-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; 1483#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 1480#L28-1 assume !(0 != main_#t~mem7);havoc main_#t~mem7; 1481#L28-4 main_~nc_B~0 := 0; 1488#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 1489#L32-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; 1490#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 1491#L32-1 assume !(0 != main_#t~mem9);havoc main_#t~mem9; 1485#L32-4 assume !!(main_~nc_B~0 >= main_~nc_A~0);main_~j~0 := 0;main_~i~0 := main_~j~0; 1486#L41-2 [2018-11-23 03:53:19,882 INFO L796 eck$LassoCheckResult]: Loop: 1486#L41-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); 1487#L41 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; 1486#L41-2 [2018-11-23 03:53:19,883 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:53:19,883 INFO L82 PathProgramCache]: Analyzing trace with hash 489706120, now seen corresponding path program 1 times [2018-11-23 03:53:19,883 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:53:19,883 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:53:19,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:53:19,883 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:53:19,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:53:19,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:53:19,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:53:19,901 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:53:19,901 INFO L82 PathProgramCache]: Analyzing trace with hash 3556, now seen corresponding path program 3 times [2018-11-23 03:53:19,901 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:53:19,901 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:53:19,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:53:19,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:53:19,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:53:19,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:53:19,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:53:19,905 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:53:19,905 INFO L82 PathProgramCache]: Analyzing trace with hash -1838818645, now seen corresponding path program 1 times [2018-11-23 03:53:19,906 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:53:19,906 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:53:19,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:53:19,908 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:53:19,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:53:19,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:53:19,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:53:22,491 WARN L180 SmtUtils]: Spent 2.51 s on a formula simplification. DAG size of input: 261 DAG size of output: 198 [2018-11-23 03:53:22,651 WARN L180 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2018-11-23 03:53:22,652 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 03:53:22,653 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 03:53:22,653 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 03:53:22,653 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 03:53:22,653 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 03:53:22,653 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:53:22,653 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 03:53:22,653 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 03:53:22,653 INFO L131 ssoRankerPreferences]: Filename of dumped script: string_true-unreach-call_true-termination.i_Iteration12_Lasso [2018-11-23 03:53:22,653 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 03:53:22,653 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 03:53:22,656 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:53:22,661 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:53:22,662 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:53:22,663 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:53:22,665 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:53:22,666 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:53:22,667 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:53:22,668 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:53:22,669 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:53:22,670 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:53:22,671 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:53:22,673 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:53:22,674 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:53:22,675 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:53:22,676 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:53:22,910 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:53:22,911 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:53:22,912 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:53:22,913 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:53:23,091 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 03:53:23,091 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 03:53:23,092 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:53:23,092 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:53:23,092 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:53:23,092 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:53:23,092 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:53:23,092 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:53:23,092 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:53:23,093 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:53:23,093 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:53:23,093 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:53:23,093 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:53:23,093 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:53:23,093 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:53:23,094 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:53:23,094 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:53:23,094 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:53:23,094 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:53:23,094 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:53:23,094 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:53:23,095 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:53:23,095 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:53:23,095 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:53:23,095 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:53:23,095 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:53:23,095 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:53:23,095 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:53:23,096 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:53:23,096 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:53:23,096 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:53:23,096 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:53:23,096 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:53:23,096 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:53:23,097 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:53:23,097 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:53:23,098 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:53:23,098 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:53:23,098 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:53:23,098 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:53:23,098 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:53:23,099 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:53:23,099 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:53:23,099 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:53:23,099 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:53:23,099 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:53:23,099 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:53:23,100 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:53:23,100 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:53:23,100 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:53:23,100 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:53:23,100 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:53:23,100 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:53:23,100 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:53:23,101 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:53:23,101 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:53:23,101 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:53:23,101 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:53:23,101 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:53:23,101 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:53:23,102 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:53:23,102 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:53:23,103 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:53:23,103 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:53:23,103 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:53:23,103 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:53:23,103 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:53:23,103 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:53:23,104 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:53:23,104 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:53:23,104 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:53:23,104 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:53:23,104 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:53:23,105 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:53:23,105 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:53:23,105 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:53:23,105 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:53:23,105 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:53:23,105 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:53:23,105 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:53:23,106 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:53:23,106 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:53:23,106 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:53:23,106 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:53:23,106 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:53:23,107 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:53:23,107 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:53:23,107 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:53:23,107 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:53:23,107 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:53:23,107 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:53:23,108 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:53:23,108 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:53:23,108 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:53:23,108 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:53:23,108 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:53:23,109 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:53:23,109 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:53:23,110 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:53:23,110 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:53:23,110 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:53:23,110 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:53:23,110 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:53:23,111 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:53:23,111 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:53:23,111 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:53:23,111 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:53:23,111 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:53:23,111 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:53:23,112 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:53:23,112 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:53:23,112 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:53:23,112 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:53:23,112 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:53:23,112 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:53:23,112 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:53:23,112 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:53:23,112 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:53:23,113 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:53:23,113 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:53:23,113 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:53:23,113 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:53:23,113 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:53:23,113 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:53:23,113 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:53:23,113 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:53:23,113 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:53:23,114 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:53:23,114 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:53:23,114 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:53:23,115 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:53:23,115 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:53:23,127 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 03:53:23,141 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-23 03:53:23,141 INFO L444 ModelExtractionUtils]: 22 out of 28 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-23 03:53:23,142 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 03:53:23,142 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 03:53:23,142 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 03:53:23,142 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#string_A~0.base)_4, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~#string_A~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_~#string_A~0.base)_4 - 1*ULTIMATE.start_main_~i~0 - 1*ULTIMATE.start_main_~#string_A~0.offset Supporting invariants [] [2018-11-23 03:53:23,225 INFO L297 tatePredicateManager]: 15 out of 15 supporting invariants were superfluous and have been removed [2018-11-23 03:53:23,226 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-23 03:53:23,237 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:53:23,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:53:23,260 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:53:23,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:53:23,266 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:53:23,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:53:23,287 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 03:53:23,287 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 40 states and 44 transitions. cyclomatic complexity: 8 Second operand 3 states. [2018-11-23 03:53:23,296 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 40 states and 44 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 44 states and 50 transitions. Complement of second has 5 states. [2018-11-23 03:53:23,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-23 03:53:23,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 03:53:23,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 22 transitions. [2018-11-23 03:53:23,297 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 38 letters. Loop has 2 letters. [2018-11-23 03:53:23,297 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:53:23,297 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 40 letters. Loop has 2 letters. [2018-11-23 03:53:23,297 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:53:23,297 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 38 letters. Loop has 4 letters. [2018-11-23 03:53:23,297 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:53:23,298 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 50 transitions. [2018-11-23 03:53:23,298 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 03:53:23,298 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 44 states and 50 transitions. [2018-11-23 03:53:23,299 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2018-11-23 03:53:23,299 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2018-11-23 03:53:23,299 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 50 transitions. [2018-11-23 03:53:23,299 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 03:53:23,299 INFO L705 BuchiCegarLoop]: Abstraction has 44 states and 50 transitions. [2018-11-23 03:53:23,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states and 50 transitions. [2018-11-23 03:53:23,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-11-23 03:53:23,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-23 03:53:23,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2018-11-23 03:53:23,301 INFO L728 BuchiCegarLoop]: Abstraction has 44 states and 50 transitions. [2018-11-23 03:53:23,301 INFO L608 BuchiCegarLoop]: Abstraction has 44 states and 50 transitions. [2018-11-23 03:53:23,301 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-11-23 03:53:23,301 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 50 transitions. [2018-11-23 03:53:23,301 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 03:53:23,301 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 03:53:23,301 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 03:53:23,302 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:53:23,302 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 03:53:23,302 INFO L794 eck$LassoCheckResult]: Stem: 1787#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1784#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~post1, main_#t~mem3, main_#t~nondet5, main_#t~post4, main_#t~mem6, main_#t~post8, main_#t~mem7, main_#t~post10, main_#t~mem9, main_#t~mem11, main_#t~mem12, main_#t~post13, main_#t~post14, main_~#string_A~0.base, main_~#string_A~0.offset, main_~#string_B~0.base, main_~#string_B~0.offset, main_~i~0, main_~j~0, main_~nc_A~0, main_~nc_B~0, main_~found~0;call main_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.alloc(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.alloc(5);havoc main_~i~0;havoc main_~j~0;havoc main_~nc_A~0;havoc main_~nc_B~0;main_~found~0 := 0;main_~i~0 := 0; 1761#L19-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; 1762#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1763#L19-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#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1795#L19-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; 1794#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1793#L19-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; 1792#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1791#L19-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; 1790#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1789#L19-3 assume !(main_~i~0 < 5); 1759#L19-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 1760#L21 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 1786#L23-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; 1785#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1782#L23-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; 1783#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1802#L23-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; 1801#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1800#L23-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; 1799#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1798#L23-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; 1797#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1796#L23-3 assume !(main_~i~0 < 5); 1780#L23-4 call main_#t~mem6 := read~int(main_~#string_B~0.base, 4 + main_~#string_B~0.offset, 1); 1781#L25 assume !!(0 == main_#t~mem6);havoc main_#t~mem6;main_~nc_A~0 := 0; 1788#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 1767#L28-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; 1768#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 1765#L28-1 assume !(0 != main_#t~mem7);havoc main_#t~mem7; 1766#L28-4 main_~nc_B~0 := 0; 1776#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 1777#L32-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; 1778#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 1779#L32-1 assume !(0 != main_#t~mem9);havoc main_#t~mem9; 1769#L32-4 assume !!(main_~nc_B~0 >= main_~nc_A~0);main_~j~0 := 0;main_~i~0 := main_~j~0; 1770#L41-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); 1775#L41 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; 1771#L41-2 [2018-11-23 03:53:23,302 INFO L796 eck$LassoCheckResult]: Loop: 1771#L41-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); 1772#L41 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; 1771#L41-2 [2018-11-23 03:53:23,302 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:53:23,303 INFO L82 PathProgramCache]: Analyzing trace with hash -1838818643, now seen corresponding path program 1 times [2018-11-23 03:53:23,303 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:53:23,303 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:53:23,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:53:23,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:53:23,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:53:23,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:53:23,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:53:23,327 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:53:23,328 INFO L82 PathProgramCache]: Analyzing trace with hash 3556, now seen corresponding path program 4 times [2018-11-23 03:53:23,328 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:53:23,328 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:53:23,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:53:23,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:53:23,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:53:23,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:53:23,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:53:23,332 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:53:23,332 INFO L82 PathProgramCache]: Analyzing trace with hash -1873154672, now seen corresponding path program 1 times [2018-11-23 03:53:23,332 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:53:23,332 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:53:23,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:53:23,333 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:53:23,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:53:23,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:53:23,420 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-11-23 03:53:23,420 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 03:53:23,420 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_78a83bac-e4c0-4ce0-b9d0-71f5c56d3fe5/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 03:53:23,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:53:23,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:53:23,450 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:53:23,479 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-11-23 03:53:23,494 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 03:53:23,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2018-11-23 03:53:23,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 03:53:23,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-11-23 03:53:23,540 INFO L87 Difference]: Start difference. First operand 44 states and 50 transitions. cyclomatic complexity: 11 Second operand 11 states. [2018-11-23 03:53:23,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:53:23,632 INFO L93 Difference]: Finished difference Result 74 states and 82 transitions. [2018-11-23 03:53:23,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 03:53:23,632 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 74 states and 82 transitions. [2018-11-23 03:53:23,633 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 03:53:23,633 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 74 states to 50 states and 56 transitions. [2018-11-23 03:53:23,633 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2018-11-23 03:53:23,633 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2018-11-23 03:53:23,634 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 56 transitions. [2018-11-23 03:53:23,634 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 03:53:23,634 INFO L705 BuchiCegarLoop]: Abstraction has 50 states and 56 transitions. [2018-11-23 03:53:23,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states and 56 transitions. [2018-11-23 03:53:23,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2018-11-23 03:53:23,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 03:53:23,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2018-11-23 03:53:23,637 INFO L728 BuchiCegarLoop]: Abstraction has 48 states and 54 transitions. [2018-11-23 03:53:23,637 INFO L608 BuchiCegarLoop]: Abstraction has 48 states and 54 transitions. [2018-11-23 03:53:23,637 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-11-23 03:53:23,637 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 48 states and 54 transitions. [2018-11-23 03:53:23,637 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 03:53:23,637 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 03:53:23,637 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 03:53:23,638 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:53:23,638 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 03:53:23,638 INFO L794 eck$LassoCheckResult]: Stem: 2056#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2053#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~post1, main_#t~mem3, main_#t~nondet5, main_#t~post4, main_#t~mem6, main_#t~post8, main_#t~mem7, main_#t~post10, main_#t~mem9, main_#t~mem11, main_#t~mem12, main_#t~post13, main_#t~post14, main_~#string_A~0.base, main_~#string_A~0.offset, main_~#string_B~0.base, main_~#string_B~0.offset, main_~i~0, main_~j~0, main_~nc_A~0, main_~nc_B~0, main_~found~0;call main_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.alloc(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.alloc(5);havoc main_~i~0;havoc main_~j~0;havoc main_~nc_A~0;havoc main_~nc_B~0;main_~found~0 := 0;main_~i~0 := 0; 2030#L19-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#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 2032#L19-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; 2033#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 2067#L19-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; 2065#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 2064#L19-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; 2063#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 2062#L19-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; 2060#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 2059#L19-3 assume !(main_~i~0 < 5); 2028#L19-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 2029#L21 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 2051#L23-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; 2052#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 2055#L23-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; 2075#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 2074#L23-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; 2073#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 2072#L23-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; 2071#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 2070#L23-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; 2069#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 2068#L23-3 assume !(main_~i~0 < 5); 2049#L23-4 call main_#t~mem6 := read~int(main_~#string_B~0.base, 4 + main_~#string_B~0.offset, 1); 2050#L25 assume !!(0 == main_#t~mem6);havoc main_#t~mem6;main_~nc_A~0 := 0; 2057#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 2036#L28-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; 2037#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 2058#L28-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; 2061#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 2034#L28-1 assume !(0 != main_#t~mem7);havoc main_#t~mem7; 2035#L28-4 main_~nc_B~0 := 0; 2045#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 2046#L32-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; 2047#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 2048#L32-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; 2066#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 2054#L32-1 assume !(0 != main_#t~mem9);havoc main_#t~mem9; 2038#L32-4 assume !!(main_~nc_B~0 >= main_~nc_A~0);main_~j~0 := 0;main_~i~0 := main_~j~0; 2039#L41-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); 2044#L41 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; 2040#L41-2 [2018-11-23 03:53:23,638 INFO L796 eck$LassoCheckResult]: Loop: 2040#L41-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); 2041#L41 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; 2040#L41-2 [2018-11-23 03:53:23,638 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:53:23,638 INFO L82 PathProgramCache]: Analyzing trace with hash -1976327923, now seen corresponding path program 2 times [2018-11-23 03:53:23,638 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:53:23,638 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:53:23,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:53:23,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:53:23,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:53:23,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:53:23,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:53:23,666 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:53:23,666 INFO L82 PathProgramCache]: Analyzing trace with hash 3556, now seen corresponding path program 5 times [2018-11-23 03:53:23,666 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:53:23,666 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:53:23,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:53:23,667 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:53:23,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:53:23,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:53:23,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:53:23,671 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:53:23,671 INFO L82 PathProgramCache]: Analyzing trace with hash -875586576, now seen corresponding path program 2 times [2018-11-23 03:53:23,671 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:53:23,671 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:53:23,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:53:23,672 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:53:23,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:53:23,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:53:23,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:53:26,029 WARN L180 SmtUtils]: Spent 2.24 s on a formula simplification. DAG size of input: 310 DAG size of output: 234 [2018-11-23 03:53:26,194 WARN L180 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 126 [2018-11-23 03:53:26,196 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 03:53:26,196 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 03:53:26,196 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 03:53:26,196 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 03:53:26,196 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 03:53:26,196 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:53:26,196 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 03:53:26,196 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 03:53:26,196 INFO L131 ssoRankerPreferences]: Filename of dumped script: string_true-unreach-call_true-termination.i_Iteration14_Lasso [2018-11-23 03:53:26,196 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 03:53:26,197 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 03:53:26,198 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:53:26,203 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:53:26,204 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:53:26,205 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:53:26,206 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:53:26,208 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:53:26,209 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:53:26,209 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:53:26,210 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:53:26,509 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:53:26,510 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:53:26,511 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:53:26,512 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:53:26,513 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:53:26,513 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:53:26,514 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:53:26,515 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:53:26,517 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:53:26,519 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:53:26,843 WARN L180 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2018-11-23 03:53:26,895 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 03:53:26,896 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 03:53:26,896 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:53:26,896 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:53:26,896 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:53:26,896 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:53:26,896 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:53:26,897 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:53:26,897 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:53:26,897 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:53:26,897 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:53:26,897 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:53:26,898 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:53:26,898 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:53:26,898 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:53:26,898 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:53:26,898 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:53:26,898 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:53:26,898 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:53:26,898 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:53:26,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 [2018-11-23 03:53:26,899 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:53:26,899 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:53:26,899 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:53:26,899 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:53:26,899 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:53:26,899 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:53:26,899 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:53:26,899 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:53:26,899 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:53:26,900 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:53:26,900 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:53:26,900 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:53:26,900 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:53:26,900 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:53:26,900 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:53:26,901 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:53:26,901 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:53:26,901 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:53:26,901 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:53:26,901 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:53:26,902 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:53:26,902 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:53:26,902 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:53:26,903 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:53:26,903 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:53:26,903 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:53:26,903 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:53:26,903 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:53:26,903 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:53:26,903 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:53:26,904 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:53:26,904 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:53:26,904 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:53:26,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 [2018-11-23 03:53:26,904 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:53:26,905 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:53:26,905 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:53:26,905 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:53:26,905 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:53:26,905 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:53:26,905 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:53:26,905 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:53:26,906 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:53:26,906 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:53:26,906 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:53:26,906 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:53:26,906 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:53:26,906 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:53:26,906 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:53:26,906 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:53:26,906 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:53:26,906 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:53:26,907 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:53:26,907 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:53:26,907 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:53:26,907 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:53:26,907 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:53:26,907 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:53:26,909 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:53:26,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 [2018-11-23 03:53:26,909 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:53:26,909 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:53:26,909 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:53:26,910 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:53:26,910 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:53:26,910 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:53:26,912 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:53:26,912 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:53:26,912 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:53:26,913 INFO L205 nArgumentSynthesizer]: 12 stem disjuncts [2018-11-23 03:53:26,913 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:53:26,913 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:53:26,915 INFO L402 nArgumentSynthesizer]: We have 28 Motzkin's Theorem applications. [2018-11-23 03:53:26,915 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:53:26,924 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:53:26,924 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:53:26,925 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:53:26,925 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:53:26,925 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:53:26,925 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:53:26,925 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:53:26,925 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:53:26,926 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:53:26,927 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:53:26,927 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:53:26,927 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:53:26,927 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:53:26,927 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:53:26,928 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:53:26,928 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:53:26,928 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:53:26,929 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:53:26,929 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:53:26,929 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 03:53:26,929 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:53:26,929 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:53:26,930 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 03:53:26,930 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:53:26,931 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:53:26,931 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:53:26,932 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:53:26,932 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:53:26,932 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:53:26,932 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:53:26,933 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:53:26,933 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:53:26,944 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 03:53:26,953 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-23 03:53:26,953 INFO L444 ModelExtractionUtils]: 22 out of 28 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-23 03:53:26,953 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 03:53:26,954 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 03:53:26,954 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 03:53:26,954 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~nc_A~0, ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~nc_A~0 - 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2018-11-23 03:53:27,052 INFO L297 tatePredicateManager]: 25 out of 25 supporting invariants were superfluous and have been removed [2018-11-23 03:53:27,060 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:53:27,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:53:27,081 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:53:27,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:53:27,095 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:53:27,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:53:27,101 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 03:53:27,101 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 48 states and 54 transitions. cyclomatic complexity: 11 Second operand 3 states. [2018-11-23 03:53:27,109 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 48 states and 54 transitions. cyclomatic complexity: 11. Second operand 3 states. Result 52 states and 60 transitions. Complement of second has 5 states. [2018-11-23 03:53:27,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-23 03:53:27,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 03:53:27,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 25 transitions. [2018-11-23 03:53:27,110 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 25 transitions. Stem has 44 letters. Loop has 2 letters. [2018-11-23 03:53:27,110 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:53:27,110 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 25 transitions. Stem has 46 letters. Loop has 2 letters. [2018-11-23 03:53:27,110 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:53:27,110 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 25 transitions. Stem has 44 letters. Loop has 4 letters. [2018-11-23 03:53:27,111 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:53:27,111 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 52 states and 60 transitions. [2018-11-23 03:53:27,111 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 03:53:27,112 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 52 states to 52 states and 60 transitions. [2018-11-23 03:53:27,112 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2018-11-23 03:53:27,112 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2018-11-23 03:53:27,112 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 60 transitions. [2018-11-23 03:53:27,112 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 03:53:27,112 INFO L705 BuchiCegarLoop]: Abstraction has 52 states and 60 transitions. [2018-11-23 03:53:27,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states and 60 transitions. [2018-11-23 03:53:27,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-11-23 03:53:27,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-23 03:53:27,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 60 transitions. [2018-11-23 03:53:27,117 INFO L728 BuchiCegarLoop]: Abstraction has 52 states and 60 transitions. [2018-11-23 03:53:27,117 INFO L608 BuchiCegarLoop]: Abstraction has 52 states and 60 transitions. [2018-11-23 03:53:27,117 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2018-11-23 03:53:27,118 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states and 60 transitions. [2018-11-23 03:53:27,118 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 03:53:27,118 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 03:53:27,118 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 03:53:27,119 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:53:27,119 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 03:53:27,119 INFO L794 eck$LassoCheckResult]: Stem: 2417#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2414#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~post1, main_#t~mem3, main_#t~nondet5, main_#t~post4, main_#t~mem6, main_#t~post8, main_#t~mem7, main_#t~post10, main_#t~mem9, main_#t~mem11, main_#t~mem12, main_#t~post13, main_#t~post14, main_~#string_A~0.base, main_~#string_A~0.offset, main_~#string_B~0.base, main_~#string_B~0.offset, main_~i~0, main_~j~0, main_~nc_A~0, main_~nc_B~0, main_~found~0;call main_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.alloc(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.alloc(5);havoc main_~i~0;havoc main_~j~0;havoc main_~nc_A~0;havoc main_~nc_B~0;main_~found~0 := 0;main_~i~0 := 0; 2389#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 2390#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 2391#L19-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; 2392#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 2427#L19-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; 2426#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 2425#L19-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; 2424#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 2423#L19-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; 2421#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 2420#L19-3 assume !(main_~i~0 < 5); 2387#L19-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 2388#L21 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 2412#L23-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; 2413#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 2416#L23-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; 2436#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 2435#L23-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; 2434#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 2433#L23-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; 2432#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 2431#L23-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; 2430#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 2429#L23-3 assume !(main_~i~0 < 5); 2408#L23-4 call main_#t~mem6 := read~int(main_~#string_B~0.base, 4 + main_~#string_B~0.offset, 1); 2409#L25 assume !!(0 == main_#t~mem6);havoc main_#t~mem6;main_~nc_A~0 := 0; 2418#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 2395#L28-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; 2396#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 2419#L28-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; 2422#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 2393#L28-1 assume !(0 != main_#t~mem7);havoc main_#t~mem7; 2394#L28-4 main_~nc_B~0 := 0; 2404#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 2405#L32-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; 2406#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 2407#L32-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; 2428#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 2415#L32-1 assume !(0 != main_#t~mem9);havoc main_#t~mem9; 2397#L32-4 assume !!(main_~nc_B~0 >= main_~nc_A~0);main_~j~0 := 0;main_~i~0 := main_~j~0; 2398#L41-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); 2410#L41 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; 2411#L41-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); 2403#L41 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; 2399#L41-2 [2018-11-23 03:53:27,119 INFO L796 eck$LassoCheckResult]: Loop: 2399#L41-2 assume !!(main_~i~0 < main_~nc_A~0 && main_~j~0 < main_~nc_B~0);call main_#t~mem11 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);call main_#t~mem12 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~j~0, 1); 2400#L41 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; 2399#L41-2 [2018-11-23 03:53:27,119 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:53:27,119 INFO L82 PathProgramCache]: Analyzing trace with hash -875586574, now seen corresponding path program 3 times [2018-11-23 03:53:27,119 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:53:27,119 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:53:27,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:53:27,120 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:53:27,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:53:27,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:53:27,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:53:27,150 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:53:27,150 INFO L82 PathProgramCache]: Analyzing trace with hash 3556, now seen corresponding path program 6 times [2018-11-23 03:53:27,150 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:53:27,150 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:53:27,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:53:27,150 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:53:27,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:53:27,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:53:27,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:53:27,154 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:53:27,154 INFO L82 PathProgramCache]: Analyzing trace with hash 374894997, now seen corresponding path program 3 times [2018-11-23 03:53:27,154 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:53:27,154 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:53:27,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:53:27,155 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:53:27,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:53:27,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:53:27,208 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-11-23 03:53:27,208 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 03:53:27,208 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_78a83bac-e4c0-4ce0-b9d0-71f5c56d3fe5/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 03:53:27,222 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 03:53:27,242 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-23 03:53:27,242 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 03:53:27,244 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:53:27,291 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-11-23 03:53:27,306 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 03:53:27,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2018-11-23 03:53:27,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 03:53:27,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-11-23 03:53:27,345 INFO L87 Difference]: Start difference. First operand 52 states and 60 transitions. cyclomatic complexity: 14 Second operand 12 states. [2018-11-23 03:53:27,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:53:27,427 INFO L93 Difference]: Finished difference Result 66 states and 76 transitions. [2018-11-23 03:53:27,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 03:53:27,428 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 66 states and 76 transitions. [2018-11-23 03:53:27,428 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 03:53:27,428 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 66 states to 55 states and 63 transitions. [2018-11-23 03:53:27,429 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2018-11-23 03:53:27,429 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2018-11-23 03:53:27,429 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 63 transitions. [2018-11-23 03:53:27,429 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 03:53:27,429 INFO L705 BuchiCegarLoop]: Abstraction has 55 states and 63 transitions. [2018-11-23 03:53:27,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 63 transitions. [2018-11-23 03:53:27,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2018-11-23 03:53:27,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-23 03:53:27,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 62 transitions. [2018-11-23 03:53:27,431 INFO L728 BuchiCegarLoop]: Abstraction has 54 states and 62 transitions. [2018-11-23 03:53:27,431 INFO L608 BuchiCegarLoop]: Abstraction has 54 states and 62 transitions. [2018-11-23 03:53:27,431 INFO L442 BuchiCegarLoop]: ======== Iteration 16============ [2018-11-23 03:53:27,431 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states and 62 transitions. [2018-11-23 03:53:27,432 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 03:53:27,432 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 03:53:27,432 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 03:53:27,432 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:53:27,432 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 03:53:27,433 INFO L794 eck$LassoCheckResult]: Stem: 2699#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2696#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~post1, main_#t~mem3, main_#t~nondet5, main_#t~post4, main_#t~mem6, main_#t~post8, main_#t~mem7, main_#t~post10, main_#t~mem9, main_#t~mem11, main_#t~mem12, main_#t~post13, main_#t~post14, main_~#string_A~0.base, main_~#string_A~0.offset, main_~#string_B~0.base, main_~#string_B~0.offset, main_~i~0, main_~j~0, main_~nc_A~0, main_~nc_B~0, main_~found~0;call main_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.alloc(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.alloc(5);havoc main_~i~0;havoc main_~j~0;havoc main_~nc_A~0;havoc main_~nc_B~0;main_~found~0 := 0;main_~i~0 := 0; 2673#L19-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; 2674#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 2675#L19-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; 2676#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 2709#L19-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; 2708#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 2707#L19-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; 2706#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 2705#L19-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; 2703#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 2702#L19-3 assume !(main_~i~0 < 5); 2671#L19-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 2672#L21 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 2694#L23-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; 2695#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 2698#L23-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; 2719#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 2718#L23-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; 2717#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 2716#L23-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#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 2714#L23-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; 2713#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 2712#L23-3 assume !(main_~i~0 < 5); 2692#L23-4 call main_#t~mem6 := read~int(main_~#string_B~0.base, 4 + main_~#string_B~0.offset, 1); 2693#L25 assume !!(0 == main_#t~mem6);havoc main_#t~mem6;main_~nc_A~0 := 0; 2700#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 2679#L28-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; 2680#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 2701#L28-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; 2704#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 2677#L28-1 assume !(0 != main_#t~mem7);havoc main_#t~mem7; 2678#L28-4 main_~nc_B~0 := 0; 2688#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 2689#L32-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; 2690#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 2691#L32-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; 2720#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 2711#L32-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#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 2697#L32-1 assume !(0 != main_#t~mem9);havoc main_#t~mem9; 2681#L32-4 assume !!(main_~nc_B~0 >= main_~nc_A~0);main_~j~0 := 0;main_~i~0 := main_~j~0; 2682#L41-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); 2722#L41 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; 2721#L41-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); 2687#L41 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; 2683#L41-2 [2018-11-23 03:53:27,433 INFO L796 eck$LassoCheckResult]: Loop: 2683#L41-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); 2684#L41 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; 2683#L41-2 [2018-11-23 03:53:27,433 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:53:27,433 INFO L82 PathProgramCache]: Analyzing trace with hash 356019245, now seen corresponding path program 4 times [2018-11-23 03:53:27,433 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:53:27,433 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:53:27,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:53:27,434 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:53:27,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:53:27,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:53:27,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:53:27,455 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:53:27,456 INFO L82 PathProgramCache]: Analyzing trace with hash 3556, now seen corresponding path program 7 times [2018-11-23 03:53:27,456 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:53:27,456 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:53:27,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:53:27,456 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:53:27,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:53:27,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:53:27,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:53:27,460 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:53:27,460 INFO L82 PathProgramCache]: Analyzing trace with hash -1462886640, now seen corresponding path program 4 times [2018-11-23 03:53:27,460 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:53:27,460 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:53:27,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:53:27,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:53:27,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:53:27,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:53:27,535 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2018-11-23 03:53:27,535 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 03:53:27,535 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_78a83bac-e4c0-4ce0-b9d0-71f5c56d3fe5/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 03:53:27,551 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 03:53:27,576 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 03:53:27,576 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 03:53:27,578 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:53:27,615 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2018-11-23 03:53:27,630 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 03:53:27,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2018-11-23 03:53:27,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 03:53:27,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-11-23 03:53:27,691 INFO L87 Difference]: Start difference. First operand 54 states and 62 transitions. cyclomatic complexity: 14 Second operand 12 states. [2018-11-23 03:53:27,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:53:27,761 INFO L93 Difference]: Finished difference Result 77 states and 88 transitions. [2018-11-23 03:53:27,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 03:53:27,762 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 77 states and 88 transitions. [2018-11-23 03:53:27,763 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 03:53:27,763 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 77 states to 57 states and 65 transitions. [2018-11-23 03:53:27,763 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2018-11-23 03:53:27,763 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2018-11-23 03:53:27,764 INFO L73 IsDeterministic]: Start isDeterministic. Operand 57 states and 65 transitions. [2018-11-23 03:53:27,764 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 03:53:27,764 INFO L705 BuchiCegarLoop]: Abstraction has 57 states and 65 transitions. [2018-11-23 03:53:27,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states and 65 transitions. [2018-11-23 03:53:27,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2018-11-23 03:53:27,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-23 03:53:27,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 64 transitions. [2018-11-23 03:53:27,766 INFO L728 BuchiCegarLoop]: Abstraction has 56 states and 64 transitions. [2018-11-23 03:53:27,766 INFO L608 BuchiCegarLoop]: Abstraction has 56 states and 64 transitions. [2018-11-23 03:53:27,766 INFO L442 BuchiCegarLoop]: ======== Iteration 17============ [2018-11-23 03:53:27,766 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 64 transitions. [2018-11-23 03:53:27,766 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 03:53:27,766 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 03:53:27,766 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 03:53:27,767 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:53:27,767 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 03:53:27,767 INFO L794 eck$LassoCheckResult]: Stem: 3000#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2998#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~post1, main_#t~mem3, main_#t~nondet5, main_#t~post4, main_#t~mem6, main_#t~post8, main_#t~mem7, main_#t~post10, main_#t~mem9, main_#t~mem11, main_#t~mem12, main_#t~post13, main_#t~post14, main_~#string_A~0.base, main_~#string_A~0.offset, main_~#string_B~0.base, main_~#string_B~0.offset, main_~i~0, main_~j~0, main_~nc_A~0, main_~nc_B~0, main_~found~0;call main_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.alloc(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.alloc(5);havoc main_~i~0;havoc main_~j~0;havoc main_~nc_A~0;havoc main_~nc_B~0;main_~found~0 := 0;main_~i~0 := 0; 2974#L19-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; 2975#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 2976#L19-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; 2977#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 3014#L19-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; 3012#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 3011#L19-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; 3008#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 3007#L19-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; 3005#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 3004#L19-3 assume !(main_~i~0 < 5); 2972#L19-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 2973#L21 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 2995#L23-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; 2996#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 2999#L23-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; 3022#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 3021#L23-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; 3020#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 3019#L23-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; 3018#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 3017#L23-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; 3016#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 3015#L23-3 assume !(main_~i~0 < 5); 2993#L23-4 call main_#t~mem6 := read~int(main_~#string_B~0.base, 4 + main_~#string_B~0.offset, 1); 2994#L25 assume !!(0 == main_#t~mem6);havoc main_#t~mem6;main_~nc_A~0 := 0; 3001#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 2980#L28-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; 2981#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 3023#L28-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; 3002#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 3003#L28-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; 3006#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 2978#L28-1 assume !(0 != main_#t~mem7);havoc main_#t~mem7; 2979#L28-4 main_~nc_B~0 := 0; 2989#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 2990#L32-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; 2991#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 2992#L32-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; 3013#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 3010#L32-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; 3009#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 2997#L32-1 assume !(0 != main_#t~mem9);havoc main_#t~mem9; 2982#L32-4 assume !!(main_~nc_B~0 >= main_~nc_A~0);main_~j~0 := 0;main_~i~0 := main_~j~0; 2983#L41-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); 3025#L41 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; 3024#L41-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); 2988#L41 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; 2984#L41-2 [2018-11-23 03:53:27,767 INFO L796 eck$LassoCheckResult]: Loop: 2984#L41-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); 2985#L41 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; 2984#L41-2 [2018-11-23 03:53:27,767 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:53:27,767 INFO L82 PathProgramCache]: Analyzing trace with hash -1412851758, now seen corresponding path program 5 times [2018-11-23 03:53:27,768 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:53:27,768 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:53:27,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:53:27,768 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:53:27,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:53:27,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:53:27,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:53:27,797 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:53:27,798 INFO L82 PathProgramCache]: Analyzing trace with hash 3556, now seen corresponding path program 8 times [2018-11-23 03:53:27,798 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:53:27,798 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:53:27,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:53:27,798 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:53:27,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:53:27,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:53:27,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:53:27,802 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:53:27,802 INFO L82 PathProgramCache]: Analyzing trace with hash -540871307, now seen corresponding path program 5 times [2018-11-23 03:53:27,802 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:53:27,802 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:53:27,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:53:27,802 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:53:27,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:53:27,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:53:27,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:53:30,463 WARN L180 SmtUtils]: Spent 2.54 s on a formula simplification. DAG size of input: 358 DAG size of output: 266 [2018-11-23 03:53:30,650 WARN L180 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2018-11-23 03:53:30,652 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 03:53:30,652 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 03:53:30,652 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 03:53:30,652 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 03:53:30,653 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 03:53:30,653 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:53:30,653 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 03:53:30,653 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 03:53:30,653 INFO L131 ssoRankerPreferences]: Filename of dumped script: string_true-unreach-call_true-termination.i_Iteration17_Lasso [2018-11-23 03:53:30,653 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 03:53:30,653 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 03:53:30,655 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:53:30,663 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:53:30,664 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:53:30,665 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:53:30,666 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:53:30,668 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:53:30,671 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:53:30,672 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:53:30,673 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:53:30,674 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:53:30,675 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:53:30,676 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:53:30,677 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:53:30,678 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:53:30,679 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:53:31,051 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:53:31,053 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:53:31,054 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:53:31,056 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:53:31,165 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-23 03:53:32,143 WARN L180 SmtUtils]: Spent 893.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 72 [2018-11-23 03:53:32,155 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 03:53:32,155 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 03:53:32,155 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:53:32,155 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:53:32,156 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:53:32,156 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:53:32,156 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:53:32,156 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:53:32,157 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:53:32,157 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:53:32,158 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:53:32,158 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:53:32,158 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:53:32,158 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:53:32,158 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:53:32,159 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:53:32,159 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:53:32,159 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:53:32,159 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:53:32,160 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:53:32,160 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:53:32,160 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:53:32,160 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:53:32,160 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:53:32,161 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:53:32,161 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:53:32,161 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:53:32,162 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:53:32,162 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:53:32,162 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:53:32,162 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:53:32,162 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:53:32,162 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:53:32,163 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:53:32,163 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:53:32,163 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:53:32,163 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:53:32,164 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:53:32,164 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:53:32,164 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:53:32,164 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:53:32,164 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:53:32,164 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:53:32,164 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:53:32,165 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:53:32,165 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:53:32,165 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:53:32,165 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:53:32,165 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:53:32,166 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:53:32,166 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:53:32,166 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:53:32,166 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:53:32,166 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:53:32,167 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:53:32,167 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:53:32,167 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:53:32,167 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:53:32,167 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:53:32,167 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:53:32,167 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:53:32,167 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:53:32,168 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:53:32,168 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:53:32,168 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:53:32,168 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:53:32,169 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:53:32,169 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:53:32,169 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:53:32,169 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:53:32,170 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:53:32,170 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:53:32,171 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:53:32,171 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:53:32,171 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:53:32,171 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:53:32,171 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:53:32,171 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:53:32,171 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:53:32,172 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:53:32,172 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:53:32,172 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:53:32,172 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:53:32,172 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:53:32,172 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:53:32,173 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:53:32,173 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:53:32,173 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:53:32,173 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:53:32,173 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:53:32,174 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:53:32,174 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:53:32,174 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:53:32,174 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:53:32,174 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:53:32,174 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:53:32,174 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:53:32,175 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:53:32,175 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:53:32,175 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:53:32,175 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:53:32,175 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:53:32,175 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:53:32,176 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:53:32,176 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:53:32,176 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:53:32,176 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:53:32,177 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:53:32,177 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:53:32,177 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:53:32,177 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:53:32,177 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:53:32,177 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:53:32,177 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:53:32,178 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:53:32,178 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:53:32,178 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:53:32,178 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:53:32,179 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:53:32,179 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:53:32,179 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:53:32,179 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:53:32,179 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:53:32,179 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:53:32,179 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:53:32,180 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:53:32,180 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:53:32,180 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:53:32,180 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:53:32,180 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:53:32,181 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:53:32,181 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:53:32,183 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:53:32,183 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:53:32,183 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:53:32,184 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:53:32,184 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:53:32,184 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:53:32,185 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:53:32,186 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:53:32,222 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 03:53:32,238 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-11-23 03:53:32,238 INFO L444 ModelExtractionUtils]: 18 out of 28 variables were initially zero. Simplification set additionally 7 variables to zero. [2018-11-23 03:53:32,239 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 03:53:32,239 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 03:53:32,239 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 03:53:32,240 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~nc_B~0, ULTIMATE.start_main_~j~0) = 1*ULTIMATE.start_main_~nc_B~0 - 1*ULTIMATE.start_main_~j~0 Supporting invariants [] [2018-11-23 03:53:32,398 INFO L297 tatePredicateManager]: 40 out of 40 supporting invariants were superfluous and have been removed [2018-11-23 03:53:32,404 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:53:32,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:53:32,440 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:53:32,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:53:32,448 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:53:32,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:53:32,467 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 03:53:32,467 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 56 states and 64 transitions. cyclomatic complexity: 14 Second operand 3 states. [2018-11-23 03:53:32,479 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 56 states and 64 transitions. cyclomatic complexity: 14. Second operand 3 states. Result 58 states and 68 transitions. Complement of second has 5 states. [2018-11-23 03:53:32,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-23 03:53:32,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 03:53:32,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 25 transitions. [2018-11-23 03:53:32,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 25 transitions. Stem has 50 letters. Loop has 2 letters. [2018-11-23 03:53:32,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:53:32,481 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 03:53:32,497 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:53:32,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:53:32,516 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:53:32,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:53:32,522 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:53:32,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:53:32,539 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 03:53:32,539 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 56 states and 64 transitions. cyclomatic complexity: 14 Second operand 3 states. [2018-11-23 03:53:32,547 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 56 states and 64 transitions. cyclomatic complexity: 14. Second operand 3 states. Result 58 states and 68 transitions. Complement of second has 5 states. [2018-11-23 03:53:32,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-23 03:53:32,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 03:53:32,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 25 transitions. [2018-11-23 03:53:32,548 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 25 transitions. Stem has 50 letters. Loop has 2 letters. [2018-11-23 03:53:32,548 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:53:32,548 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 03:53:32,557 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:53:32,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:53:32,584 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:53:32,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:53:32,591 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:53:32,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:53:32,598 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 03:53:32,598 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 56 states and 64 transitions. cyclomatic complexity: 14 Second operand 3 states. [2018-11-23 03:53:32,608 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 56 states and 64 transitions. cyclomatic complexity: 14. Second operand 3 states. Result 60 states and 71 transitions. Complement of second has 4 states. [2018-11-23 03:53:32,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-23 03:53:32,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 03:53:32,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2018-11-23 03:53:32,609 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 26 transitions. Stem has 50 letters. Loop has 2 letters. [2018-11-23 03:53:32,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:53:32,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 26 transitions. Stem has 52 letters. Loop has 2 letters. [2018-11-23 03:53:32,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:53:32,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 26 transitions. Stem has 50 letters. Loop has 4 letters. [2018-11-23 03:53:32,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:53:32,610 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 71 transitions. [2018-11-23 03:53:32,611 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-23 03:53:32,611 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 58 states and 67 transitions. [2018-11-23 03:53:32,612 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2018-11-23 03:53:32,612 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2018-11-23 03:53:32,612 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 67 transitions. [2018-11-23 03:53:32,612 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 03:53:32,612 INFO L705 BuchiCegarLoop]: Abstraction has 58 states and 67 transitions. [2018-11-23 03:53:32,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states and 67 transitions. [2018-11-23 03:53:32,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 50. [2018-11-23 03:53:32,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-23 03:53:32,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2018-11-23 03:53:32,614 INFO L728 BuchiCegarLoop]: Abstraction has 50 states and 55 transitions. [2018-11-23 03:53:32,614 INFO L608 BuchiCegarLoop]: Abstraction has 50 states and 55 transitions. [2018-11-23 03:53:32,614 INFO L442 BuchiCegarLoop]: ======== Iteration 18============ [2018-11-23 03:53:32,614 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 55 transitions. [2018-11-23 03:53:32,615 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-23 03:53:32,616 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 03:53:32,616 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 03:53:32,616 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:53:32,616 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 03:53:32,616 INFO L794 eck$LassoCheckResult]: Stem: 3890#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3888#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~post1, main_#t~mem3, main_#t~nondet5, main_#t~post4, main_#t~mem6, main_#t~post8, main_#t~mem7, main_#t~post10, main_#t~mem9, main_#t~mem11, main_#t~mem12, main_#t~post13, main_#t~post14, main_~#string_A~0.base, main_~#string_A~0.offset, main_~#string_B~0.base, main_~#string_B~0.offset, main_~i~0, main_~j~0, main_~nc_A~0, main_~nc_B~0, main_~found~0;call main_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.alloc(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.alloc(5);havoc main_~i~0;havoc main_~j~0;havoc main_~nc_A~0;havoc main_~nc_B~0;main_~found~0 := 0;main_~i~0 := 0; 3866#L19-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; 3867#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 3868#L19-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; 3869#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 3902#L19-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; 3901#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 3900#L19-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; 3898#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 3897#L19-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; 3894#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 3893#L19-3 assume !(main_~i~0 < 5); 3864#L19-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 3865#L21 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 3885#L23-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; 3886#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 3889#L23-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; 3913#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 3912#L23-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; 3911#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 3910#L23-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; 3909#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 3908#L23-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; 3907#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 3906#L23-3 assume !(main_~i~0 < 5); 3883#L23-4 call main_#t~mem6 := read~int(main_~#string_B~0.base, 4 + main_~#string_B~0.offset, 1); 3884#L25 assume !!(0 == main_#t~mem6);havoc main_#t~mem6;main_~nc_A~0 := 0; 3891#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 3872#L28-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; 3873#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 3892#L28-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; 3899#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 3896#L28-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; 3895#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 3870#L28-1 assume !(0 != main_#t~mem7);havoc main_#t~mem7; 3871#L28-4 main_~nc_B~0 := 0; 3879#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 3880#L32-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; 3881#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 3882#L32-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; 3905#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 3904#L32-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; 3903#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 3887#L32-1 assume !(0 != main_#t~mem9);havoc main_#t~mem9; 3874#L32-4 assume !!(main_~nc_B~0 >= main_~nc_A~0);main_~j~0 := 0;main_~i~0 := main_~j~0; 3875#L41-2 [2018-11-23 03:53:32,617 INFO L796 eck$LassoCheckResult]: Loop: 3875#L41-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); 3876#L41 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; 3875#L41-2 [2018-11-23 03:53:32,617 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:53:32,617 INFO L82 PathProgramCache]: Analyzing trace with hash 1972313288, now seen corresponding path program 2 times [2018-11-23 03:53:32,617 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:53:32,617 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:53:32,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:53:32,618 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:53:32,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:53:32,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:53:32,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:53:32,639 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:53:32,639 INFO L82 PathProgramCache]: Analyzing trace with hash 3558, now seen corresponding path program 1 times [2018-11-23 03:53:32,640 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:53:32,640 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:53:32,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:53:32,640 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:53:32,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:53:32,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:53:32,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:53:32,643 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:53:32,643 INFO L82 PathProgramCache]: Analyzing trace with hash 1312494829, now seen corresponding path program 6 times [2018-11-23 03:53:32,644 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:53:32,644 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:53:32,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:53:32,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:53:32,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:53:32,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:53:32,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:53:37,314 WARN L180 SmtUtils]: Spent 4.59 s on a formula simplification. DAG size of input: 309 DAG size of output: 231 [2018-11-23 03:53:37,430 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 117 [2018-11-23 03:53:37,432 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 03:53:37,432 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 03:53:37,432 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 03:53:37,432 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 03:53:37,432 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 03:53:37,432 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:53:37,432 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 03:53:37,432 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 03:53:37,432 INFO L131 ssoRankerPreferences]: Filename of dumped script: string_true-unreach-call_true-termination.i_Iteration18_Lasso [2018-11-23 03:53:37,432 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 03:53:37,432 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 03:53:37,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:53:37,437 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:53:37,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:53:37,439 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:53:37,441 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:53:37,441 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:53:37,442 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:53:37,444 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:53:37,445 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:53:37,446 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:53:37,448 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:53:37,449 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:53:37,449 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:53:37,450 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:53:37,451 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:53:37,452 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:53:37,822 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:53:37,823 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:53:37,824 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:53:38,019 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 03:53:38,019 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 03:53:38,020 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:53:38,020 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:53:38,020 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:53:38,020 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:53:38,020 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:53:38,020 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:53:38,020 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:53:38,020 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:53:38,021 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:53:38,021 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:53:38,021 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:53:38,021 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:53:38,021 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:53:38,021 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:53:38,021 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:53:38,021 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:53:38,021 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:53:38,021 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:53:38,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 [2018-11-23 03:53:38,022 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:53:38,022 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:53:38,022 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:53:38,022 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:53:38,022 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:53:38,022 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:53:38,022 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:53:38,022 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:53:38,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 [2018-11-23 03:53:38,023 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:53:38,023 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:53:38,023 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:53:38,023 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:53:38,023 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:53:38,023 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:53:38,024 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:53:38,024 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:53:38,024 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:53:38,024 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:53:38,024 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:53:38,024 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:53:38,025 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:53:38,025 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:53:38,025 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:53:38,025 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:53:38,025 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:53:38,025 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:53:38,026 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:53:38,026 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:53:38,026 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:53:38,026 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:53:38,026 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:53:38,026 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:53:38,026 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:53:38,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 [2018-11-23 03:53:38,027 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:53:38,027 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:53:38,027 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:53:38,027 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:53:38,028 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:53:38,028 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:53:38,028 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:53:38,029 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:53:38,029 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:53:38,029 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:53:38,029 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:53:38,029 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:53:38,029 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:53:38,029 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:53:38,030 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:53:38,030 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:53:38,030 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:53:38,030 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:53:38,030 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:53:38,031 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:53:38,031 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:53:38,031 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:53:38,031 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:53:38,032 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:53:38,032 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:53:38,032 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:53:38,032 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:53:38,033 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:53:38,033 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:53:38,033 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:53:38,033 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:53:38,033 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:53:38,033 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:53:38,034 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:53:38,034 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:53:38,034 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:53:38,034 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:53:38,034 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:53:38,034 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:53:38,034 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:53:38,035 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:53:38,035 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:53:38,035 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:53:38,035 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:53:38,035 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:53:38,036 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:53:38,036 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:53:38,036 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:53:38,036 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:53:38,036 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:53:38,036 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:53:38,037 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:53:38,037 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:53:38,037 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:53:38,037 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:53:38,037 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:53:38,037 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:53:38,037 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:53:38,037 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:53:38,038 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:53:38,038 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:53:38,038 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:53:38,038 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:53:38,038 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:53:38,038 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:53:38,039 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:53:38,039 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:53:38,039 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:53:38,039 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:53:38,039 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:53:38,040 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:53:38,040 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:53:38,040 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:53:38,040 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:53:38,040 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:53:38,040 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:53:38,040 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:53:38,040 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:53:38,041 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:53:38,041 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:53:38,041 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:53:38,041 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:53:38,041 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:53:38,043 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:53:38,043 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:53:38,052 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 03:53:38,059 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-23 03:53:38,060 INFO L444 ModelExtractionUtils]: 21 out of 28 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-23 03:53:38,060 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 03:53:38,060 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 03:53:38,061 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 03:53:38,061 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, v_rep(select #length ULTIMATE.start_main_~#string_A~0.base)_7) = -1*ULTIMATE.start_main_~i~0 + 1*v_rep(select #length ULTIMATE.start_main_~#string_A~0.base)_7 Supporting invariants [] [2018-11-23 03:53:38,189 INFO L297 tatePredicateManager]: 44 out of 46 supporting invariants were superfluous and have been removed [2018-11-23 03:53:38,191 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-23 03:53:38,205 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:53:38,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:53:38,220 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:53:38,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:53:38,232 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:53:38,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:53:38,241 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 [2018-11-23 03:53:38,241 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 50 states and 55 transitions. cyclomatic complexity: 9 Second operand 4 states. [2018-11-23 03:53:38,273 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. [2018-11-23 03:53:38,273 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 [2018-11-23 03:53:38,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 03:53:38,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 23 transitions. [2018-11-23 03:53:38,274 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 46 letters. Loop has 2 letters. [2018-11-23 03:53:38,274 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:53:38,274 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 48 letters. Loop has 2 letters. [2018-11-23 03:53:38,274 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:53:38,274 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 46 letters. Loop has 4 letters. [2018-11-23 03:53:38,274 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:53:38,274 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 69 transitions. [2018-11-23 03:53:38,275 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-23 03:53:38,275 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 57 states and 65 transitions. [2018-11-23 03:53:38,275 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2018-11-23 03:53:38,275 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2018-11-23 03:53:38,275 INFO L73 IsDeterministic]: Start isDeterministic. Operand 57 states and 65 transitions. [2018-11-23 03:53:38,276 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 03:53:38,276 INFO L705 BuchiCegarLoop]: Abstraction has 57 states and 65 transitions. [2018-11-23 03:53:38,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states and 65 transitions. [2018-11-23 03:53:38,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 53. [2018-11-23 03:53:38,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-23 03:53:38,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 60 transitions. [2018-11-23 03:53:38,277 INFO L728 BuchiCegarLoop]: Abstraction has 53 states and 60 transitions. [2018-11-23 03:53:38,277 INFO L608 BuchiCegarLoop]: Abstraction has 53 states and 60 transitions. [2018-11-23 03:53:38,278 INFO L442 BuchiCegarLoop]: ======== Iteration 19============ [2018-11-23 03:53:38,278 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 60 transitions. [2018-11-23 03:53:38,278 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-23 03:53:38,278 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 03:53:38,278 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 03:53:38,279 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:53:38,279 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 03:53:38,279 INFO L794 eck$LassoCheckResult]: Stem: 4365#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 4361#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~post1, main_#t~mem3, main_#t~nondet5, main_#t~post4, main_#t~mem6, main_#t~post8, main_#t~mem7, main_#t~post10, main_#t~mem9, main_#t~mem11, main_#t~mem12, main_#t~post13, main_#t~post14, main_~#string_A~0.base, main_~#string_A~0.offset, main_~#string_B~0.base, main_~#string_B~0.offset, main_~i~0, main_~j~0, main_~nc_A~0, main_~nc_B~0, main_~found~0;call main_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.alloc(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.alloc(5);havoc main_~i~0;havoc main_~j~0;havoc main_~nc_A~0;havoc main_~nc_B~0;main_~found~0 := 0;main_~i~0 := 0; 4337#L19-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; 4338#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 4339#L19-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; 4340#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 4377#L19-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; 4376#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 4375#L19-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; 4373#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 4372#L19-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; 4369#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 4368#L19-3 assume !(main_~i~0 < 5); 4335#L19-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 4336#L21 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 4359#L23-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; 4360#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 4364#L23-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; 4387#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 4386#L23-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; 4385#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 4384#L23-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; 4383#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 4382#L23-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; 4381#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 4380#L23-3 assume !(main_~i~0 < 5); 4354#L23-4 call main_#t~mem6 := read~int(main_~#string_B~0.base, 4 + main_~#string_B~0.offset, 1); 4355#L25 assume !!(0 == main_#t~mem6);havoc main_#t~mem6;main_~nc_A~0 := 0; 4366#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 4343#L28-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; 4344#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 4367#L28-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; 4374#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 4371#L28-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; 4370#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 4341#L28-1 assume !(0 != main_#t~mem7);havoc main_#t~mem7; 4342#L28-4 main_~nc_B~0 := 0; 4350#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 4351#L32-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; 4352#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 4353#L32-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; 4363#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 4379#L32-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; 4378#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 4362#L32-1 assume !(0 != main_#t~mem9);havoc main_#t~mem9; 4345#L32-4 assume !!(main_~nc_B~0 >= main_~nc_A~0);main_~j~0 := 0;main_~i~0 := main_~j~0; 4346#L41-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); 4348#L41 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; 4358#L41-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); 4356#L41 [2018-11-23 03:53:38,279 INFO L796 eck$LassoCheckResult]: Loop: 4356#L41 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; 4357#L41-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); 4356#L41 [2018-11-23 03:53:38,279 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:53:38,279 INFO L82 PathProgramCache]: Analyzing trace with hash 2032634054, now seen corresponding path program 2 times [2018-11-23 03:53:38,280 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:53:38,280 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:53:38,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:53:38,280 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:53:38,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:53:38,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:53:38,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:53:38,307 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:53:38,307 INFO L82 PathProgramCache]: Analyzing trace with hash 3708, now seen corresponding path program 2 times [2018-11-23 03:53:38,307 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:53:38,307 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:53:38,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:53:38,308 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:53:38,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:53:38,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:53:38,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:53:38,311 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:53:38,311 INFO L82 PathProgramCache]: Analyzing trace with hash -848791039, now seen corresponding path program 6 times [2018-11-23 03:53:38,311 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:53:38,311 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:53:38,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:53:38,311 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:53:38,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:53:38,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:53:38,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:53:42,250 WARN L180 SmtUtils]: Spent 3.86 s on a formula simplification. DAG size of input: 348 DAG size of output: 256 [2018-11-23 03:53:42,415 WARN L180 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 137 [2018-11-23 03:53:42,417 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 03:53:42,417 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 03:53:42,417 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 03:53:42,417 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 03:53:42,417 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 03:53:42,417 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:53:42,417 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 03:53:42,417 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 03:53:42,417 INFO L131 ssoRankerPreferences]: Filename of dumped script: string_true-unreach-call_true-termination.i_Iteration19_Lasso [2018-11-23 03:53:42,417 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 03:53:42,417 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 03:53:42,419 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:53:42,420 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:53:42,904 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:53:42,905 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:53:42,906 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:53:42,907 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:53:42,908 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:53:42,909 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:53:42,910 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:53:42,911 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:53:42,912 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:53:42,913 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:53:42,913 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:53:42,914 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:53:42,915 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:53:42,916 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:53:42,916 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:53:43,139 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2018-11-23 03:53:43,218 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 03:53:43,218 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 03:53:43,218 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:53:43,219 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:53:43,219 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:53:43,219 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:53:43,219 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:53:43,219 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:53:43,219 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:53:43,219 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:53:43,220 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:53:43,220 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:53:43,220 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:53:43,220 INFO L205 nArgumentSynthesizer]: 8 stem disjuncts [2018-11-23 03:53:43,220 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 03:53:43,220 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:53:43,225 INFO L402 nArgumentSynthesizer]: We have 44 Motzkin's Theorem applications. [2018-11-23 03:53:43,225 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-23 03:53:43,252 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:53:43,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 [2018-11-23 03:53:43,253 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:53:43,253 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:53:43,253 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:53:43,253 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:53:43,253 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:53:43,254 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:53:43,254 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:53:43,254 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:53:43,254 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:53:43,254 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:53:43,254 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:53:43,254 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:53:43,255 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:53:43,255 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:53:43,255 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:53:43,255 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:53:43,256 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:53:43,256 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:53:43,256 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:53:43,256 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:53:43,256 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:53:43,257 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:53:43,257 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:53:43,257 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:53:43,258 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:53:43,258 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:53:43,258 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:53:43,258 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:53:43,258 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:53:43,258 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:53:43,259 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:53:43,260 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:53:43,260 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:53:43,260 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:53:43,260 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:53:43,261 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:53:43,261 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:53:43,261 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:53:43,261 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:53:43,262 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:53:43,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 [2018-11-23 03:53:43,262 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:53:43,262 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 03:53:43,262 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:53:43,262 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:53:43,263 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 03:53:43,263 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:53:43,264 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:53:43,264 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:53:43,264 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:53:43,265 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:53:43,265 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:53:43,265 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:53:43,265 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:53:43,265 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:53:43,266 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:53:43,266 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:53:43,266 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:53:43,266 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:53:43,267 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:53:43,267 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:53:43,268 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:53:43,268 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 03:53:43,275 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 03:53:43,281 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-23 03:53:43,281 INFO L444 ModelExtractionUtils]: 23 out of 28 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-23 03:53:43,282 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 03:53:43,282 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 03:53:43,282 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 03:53:43,282 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~nc_A~0) = 1*ULTIMATE.start_main_~j~0 - 1*ULTIMATE.start_main_~i~0 + 1*ULTIMATE.start_main_~nc_A~0 Supporting invariants [] [2018-11-23 03:53:43,473 INFO L297 tatePredicateManager]: 50 out of 50 supporting invariants were superfluous and have been removed [2018-11-23 03:53:43,480 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:53:43,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:53:43,496 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:53:43,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:53:43,503 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:53:43,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:53:43,511 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 03:53:43,511 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 53 states and 60 transitions. cyclomatic complexity: 12 Second operand 3 states. [2018-11-23 03:53:43,525 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 53 states and 60 transitions. cyclomatic complexity: 12. Second operand 3 states. Result 66 states and 77 transitions. Complement of second has 6 states. [2018-11-23 03:53:43,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-23 03:53:43,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 03:53:43,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2018-11-23 03:53:43,526 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 49 letters. Loop has 2 letters. [2018-11-23 03:53:43,527 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:53:43,527 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 51 letters. Loop has 2 letters. [2018-11-23 03:53:43,527 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:53:43,527 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 49 letters. Loop has 4 letters. [2018-11-23 03:53:43,527 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 03:53:43,527 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 66 states and 77 transitions. [2018-11-23 03:53:43,528 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 03:53:43,528 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 66 states to 0 states and 0 transitions. [2018-11-23 03:53:43,528 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-23 03:53:43,528 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-23 03:53:43,528 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-23 03:53:43,528 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 03:53:43,528 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 03:53:43,528 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 03:53:43,528 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 03:53:43,528 INFO L442 BuchiCegarLoop]: ======== Iteration 20============ [2018-11-23 03:53:43,528 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-23 03:53:43,528 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 03:53:43,529 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-23 03:53:43,534 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 03:53:43 BoogieIcfgContainer [2018-11-23 03:53:43,534 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-23 03:53:43,535 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 03:53:43,535 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 03:53:43,535 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 03:53:43,535 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:53:11" (3/4) ... [2018-11-23 03:53:43,547 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 03:53:43,547 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 03:53:43,547 INFO L168 Benchmark]: Toolchain (without parser) took 32525.37 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 309.9 MB). Free memory was 959.3 MB in the beginning and 850.4 MB in the end (delta: 108.9 MB). Peak memory consumption was 418.8 MB. Max. memory is 11.5 GB. [2018-11-23 03:53:43,548 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 03:53:43,548 INFO L168 Benchmark]: CACSL2BoogieTranslator took 173.50 ms. Allocated memory is still 1.0 GB. Free memory was 959.3 MB in the beginning and 945.8 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-11-23 03:53:43,548 INFO L168 Benchmark]: Boogie Procedure Inliner took 23.99 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 03:53:43,548 INFO L168 Benchmark]: Boogie Preprocessor took 56.76 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -191.4 MB). Peak memory consumption was 14.8 MB. Max. memory is 11.5 GB. [2018-11-23 03:53:43,549 INFO L168 Benchmark]: RCFGBuilder took 222.80 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: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. [2018-11-23 03:53:43,549 INFO L168 Benchmark]: BuchiAutomizer took 32033.27 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 169.9 MB). Free memory was 1.1 GB in the beginning and 850.4 MB in the end (delta: 267.2 MB). Peak memory consumption was 437.1 MB. Max. memory is 11.5 GB. [2018-11-23 03:53:43,549 INFO L168 Benchmark]: Witness Printer took 12.18 ms. Allocated memory is still 1.3 GB. Free memory is still 850.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 03:53:43,551 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 173.50 ms. Allocated memory is still 1.0 GB. Free memory was 959.3 MB in the beginning and 945.8 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 23.99 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 56.76 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -191.4 MB). Peak memory consumption was 14.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 222.80 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: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 32033.27 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 169.9 MB). Free memory was 1.1 GB in the beginning and 850.4 MB in the end (delta: 267.2 MB). Peak memory consumption was 437.1 MB. Max. memory is 11.5 GB. * Witness Printer took 12.18 ms. Allocated memory is still 1.3 GB. Free memory is still 850.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 19 terminating modules (11 trivial, 7 deterministic, 1 nondeterministic). One deterministic module has affine ranking function 9 * unknown-#length-unknown[string_A] + -2 * i and consists of 5 locations. One deterministic module has affine ranking function unknown-#length-unknown[string_A] + -1 * string_A + -1 * nc_A and consists of 3 locations. One deterministic module has affine ranking function unknown-#length-unknown[string_B] + -1 * string_B + -1 * nc_B and consists of 3 locations. One deterministic module has affine ranking function unknown-#length-unknown[string_A] + -1 * i + -1 * string_A and consists of 3 locations. One deterministic module has affine ranking function nc_A + -1 * i and consists of 3 locations. One deterministic module has affine ranking function -1 * i + unknown-#length-unknown[string_A] and consists of 5 locations. One deterministic module has affine ranking function j + -1 * i + nc_A and consists of 4 locations. One nondeterministic module has affine ranking function nc_B + -1 * j and consists of 3 locations. 11 modules have a trivial ranking function, the largest among these consists of 12 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 31.9s and 20 iterations. TraceHistogramMax:5. Analysis of lassos took 30.4s. Construction of modules took 0.4s. Büchi inclusion checks took 0.8s. Highest rank in rank-based complementation 3. Minimization of det autom 8. Minimization of nondet autom 11. Automata minimization 0.0s AutomataMinimizationTime, 18 MinimizatonAttempts, 58 StatesRemovedByMinimization, 13 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 56 states and ocurred in iteration 16. Nontrivial modules had stage [7, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 363 SDtfs, 394 SDslu, 418 SDs, 0 SdLazy, 696 SolverSat, 126 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc5 concLT0 SILN0 SILU6 SILI0 SILT0 lasso8 LassoPreprocessingBenchmarks: Lassos: inital311 mio100 ax100 hnf99 lsp95 ukn44 mio100 lsp56 div100 bol100 ite100 ukn100 eq171 hnf84 smp96 dnf356 smp88 tf100 neg95 sie110 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 32ms VariablesStem: 8 VariablesLoop: 7 DisjunctsStem: 8 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 44 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...