./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/loops/string-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_36c1ed6d-2c10-4884-afdf-a94e276eebcd/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_36c1ed6d-2c10-4884-afdf-a94e276eebcd/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_36c1ed6d-2c10-4884-afdf-a94e276eebcd/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_36c1ed6d-2c10-4884-afdf-a94e276eebcd/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/loops/string-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_36c1ed6d-2c10-4884-afdf-a94e276eebcd/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_36c1ed6d-2c10-4884-afdf-a94e276eebcd/bin/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.24-cad4683 [2019-11-16 00:09:11,587 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:09:11,589 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:09:11,599 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:09:11,603 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:09:11,604 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:09:11,605 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:09:11,607 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:09:11,609 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:09:11,610 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:09:11,611 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:09:11,612 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:09:11,612 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:09:11,613 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:09:11,614 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:09:11,615 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:09:11,616 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:09:11,616 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:09:11,618 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:09:11,621 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:09:11,622 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:09:11,623 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:09:11,625 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:09:11,625 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:09:11,629 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:09:11,629 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:09:11,629 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:09:11,630 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:09:11,631 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:09:11,632 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:09:11,632 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:09:11,633 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:09:11,633 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:09:11,634 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:09:11,635 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:09:11,636 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:09:11,636 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:09:11,637 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:09:11,637 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:09:11,638 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:09:11,639 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:09:11,639 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_36c1ed6d-2c10-4884-afdf-a94e276eebcd/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-16 00:09:11,657 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:09:11,657 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:09:11,659 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:09:11,659 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:09:11,659 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:09:11,659 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-16 00:09:11,659 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-16 00:09:11,660 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-16 00:09:11,660 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-16 00:09:11,660 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-16 00:09:11,660 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-16 00:09:11,661 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:09:11,661 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-16 00:09:11,661 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-16 00:09:11,661 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:09:11,661 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-16 00:09:11,662 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:09:11,662 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-16 00:09:11,662 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-16 00:09:11,662 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-16 00:09:11,662 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-16 00:09:11,663 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-16 00:09:11,663 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-16 00:09:11,663 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:09:11,663 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-16 00:09:11,664 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:09:11,664 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:09:11,664 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-16 00:09:11,664 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:09:11,665 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-16 00:09:11,665 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-16 00:09:11,666 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-16 00:09:11,666 INFO L138 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/run_dir_36c1ed6d-2c10-4884-afdf-a94e276eebcd/bin/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 [2019-11-16 00:09:11,691 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:09:11,701 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:09:11,703 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:09:11,705 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:09:11,705 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:09:11,706 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_36c1ed6d-2c10-4884-afdf-a94e276eebcd/bin/uautomizer/../../sv-benchmarks/c/loops/string-1.i [2019-11-16 00:09:11,752 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_36c1ed6d-2c10-4884-afdf-a94e276eebcd/bin/uautomizer/data/b678d76d8/06086b98e0204a4c8d8f248f42e5155c/FLAGb05faa3d3 [2019-11-16 00:09:12,135 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:09:12,135 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_36c1ed6d-2c10-4884-afdf-a94e276eebcd/sv-benchmarks/c/loops/string-1.i [2019-11-16 00:09:12,141 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_36c1ed6d-2c10-4884-afdf-a94e276eebcd/bin/uautomizer/data/b678d76d8/06086b98e0204a4c8d8f248f42e5155c/FLAGb05faa3d3 [2019-11-16 00:09:12,155 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_36c1ed6d-2c10-4884-afdf-a94e276eebcd/bin/uautomizer/data/b678d76d8/06086b98e0204a4c8d8f248f42e5155c [2019-11-16 00:09:12,158 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:09:12,160 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-16 00:09:12,161 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:09:12,161 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:09:12,164 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:09:12,165 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:09:12" (1/1) ... [2019-11-16 00:09:12,168 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1187cc41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:09:12, skipping insertion in model container [2019-11-16 00:09:12,168 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:09:12" (1/1) ... [2019-11-16 00:09:12,175 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:09:12,191 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:09:12,404 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:09:12,411 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:09:12,445 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:09:12,463 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:09:12,464 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:09:12 WrapperNode [2019-11-16 00:09:12,464 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:09:12,465 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-16 00:09:12,465 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-16 00:09:12,465 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-16 00:09:12,473 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:09:12" (1/1) ... [2019-11-16 00:09:12,481 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:09:12" (1/1) ... [2019-11-16 00:09:12,503 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-16 00:09:12,504 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:09:12,504 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:09:12,504 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:09:12,513 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:09:12" (1/1) ... [2019-11-16 00:09:12,513 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:09:12" (1/1) ... [2019-11-16 00:09:12,515 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:09:12" (1/1) ... [2019-11-16 00:09:12,516 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:09:12" (1/1) ... [2019-11-16 00:09:12,522 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:09:12" (1/1) ... [2019-11-16 00:09:12,527 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:09:12" (1/1) ... [2019-11-16 00:09:12,529 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:09:12" (1/1) ... [2019-11-16 00:09:12,531 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:09:12,531 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:09:12,532 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:09:12,532 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:09:12,533 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:09:12" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_36c1ed6d-2c10-4884-afdf-a94e276eebcd/bin/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 [2019-11-16 00:09:12,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-16 00:09:12,593 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:09:12,593 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:09:12,594 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-16 00:09:12,594 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-16 00:09:12,594 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-16 00:09:12,944 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:09:12,944 INFO L284 CfgBuilder]: Removed 11 assume(true) statements. [2019-11-16 00:09:12,945 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:09:12 BoogieIcfgContainer [2019-11-16 00:09:12,945 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:09:12,946 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-16 00:09:12,946 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-16 00:09:12,949 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-16 00:09:12,950 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:09:12,950 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 16.11 12:09:12" (1/3) ... [2019-11-16 00:09:12,951 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4537ffad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.11 12:09:12, skipping insertion in model container [2019-11-16 00:09:12,952 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:09:12,952 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:09:12" (2/3) ... [2019-11-16 00:09:12,952 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4537ffad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.11 12:09:12, skipping insertion in model container [2019-11-16 00:09:12,952 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:09:12,953 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:09:12" (3/3) ... [2019-11-16 00:09:12,954 INFO L371 chiAutomizerObserver]: Analyzing ICFG string-1.i [2019-11-16 00:09:12,993 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-16 00:09:12,993 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-16 00:09:12,993 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-16 00:09:12,994 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:09:12,994 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:09:12,994 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-16 00:09:12,994 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:09:12,994 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-16 00:09:13,006 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2019-11-16 00:09:13,023 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2019-11-16 00:09:13,023 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:09:13,023 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:09:13,029 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-16 00:09:13,029 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-16 00:09:13,029 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-16 00:09:13,029 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2019-11-16 00:09:13,031 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2019-11-16 00:09:13,032 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:09:13,032 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:09:13,032 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-16 00:09:13,032 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-16 00:09:13,038 INFO L791 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.allocOnStack(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.allocOnStack(5);havoc main_~i~0;havoc main_~j~0;havoc main_~nc_A~0;havoc main_~nc_B~0;main_~found~0 := 0;main_~i~0 := 0; 14#L19-3true [2019-11-16 00:09:13,039 INFO L793 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 [2019-11-16 00:09:13,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:09:13,044 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-11-16 00:09:13,050 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:09:13,050 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983706738] [2019-11-16 00:09:13,050 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:13,051 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:13,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:09:13,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:09:13,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:09:13,156 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:09:13,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:09:13,158 INFO L82 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2019-11-16 00:09:13,158 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:09:13,158 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680132170] [2019-11-16 00:09:13,158 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:13,159 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:13,159 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:09:13,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:09:13,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:09:13,175 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:09:13,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:09:13,176 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2019-11-16 00:09:13,177 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:09:13,177 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735734633] [2019-11-16 00:09:13,177 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:13,177 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:13,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:09:13,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:09:13,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:09:13,217 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:09:13,502 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-11-16 00:09:13,522 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:09:13,523 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:09:13,523 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:09:13,523 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:09:13,524 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:09:13,524 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:09:13,524 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:09:13,524 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:09:13,524 INFO L131 ssoRankerPreferences]: Filename of dumped script: string-1.i_Iteration1_Lasso [2019-11-16 00:09:13,524 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:09:13,525 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:09:13,549 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:13,554 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:13,557 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:13,560 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:13,563 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:13,566 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:13,573 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:13,576 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:13,579 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:13,582 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:13,586 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:13,593 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:13,596 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:13,600 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:13,700 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:13,703 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:13,706 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:13,708 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:13,711 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:13,714 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:13,717 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:13,722 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:14,133 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 19 [2019-11-16 00:09:14,196 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:09:14,203 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:09:14,205 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:09:14,206 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:09:14,207 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:09:14,208 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:09:14,209 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:09:14,209 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:09:14,211 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:09:14,211 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:09:14,214 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:09:14,217 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:09:14,224 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:09:14,224 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:09:14,224 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:09:14,225 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:09:14,226 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:09:14,226 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:09:14,227 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:09:14,233 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:09:14,233 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:09:14,234 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:09:14,237 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:09:14,237 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:09:14,238 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:09:14,238 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:09:14,238 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:09:14,239 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:09:14,240 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:09:14,246 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:09:14,247 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:09:14,247 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:09:14,247 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:09:14,247 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:09:14,247 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:09:14,248 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:09:14,248 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:09:14,249 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:09:14,253 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:09:14,254 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:09:14,254 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:09:14,255 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:09:14,255 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:09:14,255 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:09:14,256 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:09:14,256 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:09:14,257 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:09:14,260 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:09:14,261 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:09:14,261 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:09:14,262 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:09:14,262 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:09:14,264 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:09:14,265 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:09:14,268 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:09:14,285 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:09:14,286 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:09:14,286 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:09:14,286 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:09:14,286 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:09:14,286 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:09:14,287 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:09:14,287 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:09:14,288 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:09:14,288 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:09:14,289 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:09:14,289 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:09:14,289 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:09:14,289 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:09:14,290 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:09:14,290 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:09:14,290 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:09:14,291 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:09:14,291 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:09:14,292 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:09:14,292 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:09:14,292 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:09:14,293 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:09:14,293 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:09:14,293 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:09:14,293 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:09:14,294 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:09:14,295 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:09:14,295 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:09:14,296 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:09:14,296 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:09:14,296 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:09:14,298 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:09:14,298 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:09:14,309 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:09:14,309 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:09:14,310 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:09:14,310 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:09:14,310 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:09:14,310 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:09:14,311 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:09:14,311 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:09:14,311 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:09:14,312 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:09:14,313 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:09:14,315 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:09:14,315 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:09:14,316 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:09:14,316 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:09:14,316 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:09:14,317 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:09:14,317 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:09:14,318 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:09:14,318 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:09:14,319 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:09:14,319 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:09:14,319 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:09:14,319 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:09:14,321 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:09:14,322 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:09:14,325 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:09:14,326 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:09:14,326 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:09:14,327 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:09:14,327 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:09:14,327 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:09:14,329 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:09:14,329 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:09:14,334 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:09:14,334 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:09:14,335 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:09:14,335 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:09:14,336 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:09:14,336 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:09:14,339 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:09:14,339 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:09:14,371 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:09:14,392 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-16 00:09:14,393 INFO L444 ModelExtractionUtils]: 9 out of 13 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-16 00:09:14,395 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:09:14,396 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-16 00:09:14,397 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:09:14,397 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 9 Supporting invariants [] [2019-11-16 00:09:14,406 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-11-16 00:09:14,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:09:14,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:14,463 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:09:14,464 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:09:14,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:14,477 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-16 00:09:14,477 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:09:14,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:09:14,504 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-16 00:09:14,505 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states. Second operand 3 states. [2019-11-16 00:09:14,559 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states.. Second operand 3 states. Result 56 states and 85 transitions. Complement of second has 8 states. [2019-11-16 00:09:14,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-16 00:09:14,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-16 00:09:14,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2019-11-16 00:09:14,564 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 43 transitions. Stem has 2 letters. Loop has 2 letters. [2019-11-16 00:09:14,564 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:09:14,564 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 43 transitions. Stem has 4 letters. Loop has 2 letters. [2019-11-16 00:09:14,565 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:09:14,565 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 43 transitions. Stem has 2 letters. Loop has 4 letters. [2019-11-16 00:09:14,565 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:09:14,566 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 56 states and 85 transitions. [2019-11-16 00:09:14,570 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2019-11-16 00:09:14,574 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 56 states to 19 states and 28 transitions. [2019-11-16 00:09:14,575 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-11-16 00:09:14,575 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-11-16 00:09:14,576 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 28 transitions. [2019-11-16 00:09:14,576 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:09:14,577 INFO L688 BuchiCegarLoop]: Abstraction has 19 states and 28 transitions. [2019-11-16 00:09:14,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 28 transitions. [2019-11-16 00:09:14,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-11-16 00:09:14,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-11-16 00:09:14,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 28 transitions. [2019-11-16 00:09:14,603 INFO L711 BuchiCegarLoop]: Abstraction has 19 states and 28 transitions. [2019-11-16 00:09:14,603 INFO L591 BuchiCegarLoop]: Abstraction has 19 states and 28 transitions. [2019-11-16 00:09:14,603 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-16 00:09:14,603 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 28 transitions. [2019-11-16 00:09:14,604 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2019-11-16 00:09:14,604 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:09:14,605 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:09:14,605 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-16 00:09:14,605 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-16 00:09:14,605 INFO L791 eck$LassoCheckResult]: Stem: 151#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 150#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~post1, main_#t~mem3, main_#t~nondet5, main_#t~post4, main_#t~mem6, main_#t~post8, main_#t~mem7, main_#t~post10, main_#t~mem9, main_#t~mem11, main_#t~mem12, main_#t~post13, main_#t~post14, main_~#string_A~0.base, main_~#string_A~0.offset, main_~#string_B~0.base, main_~#string_B~0.offset, main_~i~0, main_~j~0, main_~nc_A~0, main_~nc_B~0, main_~found~0;call main_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.allocOnStack(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.allocOnStack(5);havoc main_~i~0;havoc main_~j~0;havoc main_~nc_A~0;havoc main_~nc_B~0;main_~found~0 := 0;main_~i~0 := 0; 135#L19-3 assume !(main_~i~0 < 5); 133#L19-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 134#L21 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 148#L23-3 [2019-11-16 00:09:14,606 INFO L793 eck$LassoCheckResult]: Loop: 148#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; 149#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 148#L23-3 [2019-11-16 00:09:14,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:09:14,606 INFO L82 PathProgramCache]: Analyzing trace with hash 28696938, now seen corresponding path program 1 times [2019-11-16 00:09:14,606 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:09:14,607 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183501393] [2019-11-16 00:09:14,607 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:14,607 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:14,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:09:14,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:14,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:09:14,675 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183501393] [2019-11-16 00:09:14,675 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:09:14,675 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:09:14,676 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221174439] [2019-11-16 00:09:14,678 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-16 00:09:14,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:09:14,678 INFO L82 PathProgramCache]: Analyzing trace with hash 1891, now seen corresponding path program 1 times [2019-11-16 00:09:14,678 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:09:14,678 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535746418] [2019-11-16 00:09:14,678 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:14,679 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:14,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:09:14,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:09:14,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:09:14,702 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:09:14,738 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:09:14,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:09:14,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:09:14,741 INFO L87 Difference]: Start difference. First operand 19 states and 28 transitions. cyclomatic complexity: 14 Second operand 3 states. [2019-11-16 00:09:14,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:09:14,793 INFO L93 Difference]: Finished difference Result 24 states and 30 transitions. [2019-11-16 00:09:14,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:09:14,794 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 30 transitions. [2019-11-16 00:09:14,796 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2019-11-16 00:09:14,798 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 24 states and 30 transitions. [2019-11-16 00:09:14,798 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2019-11-16 00:09:14,798 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2019-11-16 00:09:14,798 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 30 transitions. [2019-11-16 00:09:14,799 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:09:14,799 INFO L688 BuchiCegarLoop]: Abstraction has 24 states and 30 transitions. [2019-11-16 00:09:14,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 30 transitions. [2019-11-16 00:09:14,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 20. [2019-11-16 00:09:14,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-11-16 00:09:14,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2019-11-16 00:09:14,802 INFO L711 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2019-11-16 00:09:14,803 INFO L591 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2019-11-16 00:09:14,803 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-16 00:09:14,803 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 25 transitions. [2019-11-16 00:09:14,804 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2019-11-16 00:09:14,804 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:09:14,804 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:09:14,805 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:09:14,805 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-16 00:09:14,805 INFO L791 eck$LassoCheckResult]: Stem: 201#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 199#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~post1, main_#t~mem3, main_#t~nondet5, main_#t~post4, main_#t~mem6, main_#t~post8, main_#t~mem7, main_#t~post10, main_#t~mem9, main_#t~mem11, main_#t~mem12, main_#t~post13, main_#t~post14, main_~#string_A~0.base, main_~#string_A~0.offset, main_~#string_B~0.base, main_~#string_B~0.offset, main_~i~0, main_~j~0, main_~nc_A~0, main_~nc_B~0, main_~found~0;call main_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.allocOnStack(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.allocOnStack(5);havoc main_~i~0;havoc main_~j~0;havoc main_~nc_A~0;havoc main_~nc_B~0;main_~found~0 := 0;main_~i~0 := 0; 184#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; 185#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 186#L19-3 assume !(main_~i~0 < 5); 182#L19-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 183#L21 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 197#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; 198#L23-2 [2019-11-16 00:09:14,805 INFO L793 eck$LassoCheckResult]: Loop: 198#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 200#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; 198#L23-2 [2019-11-16 00:09:14,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:09:14,806 INFO L82 PathProgramCache]: Analyzing trace with hash 265181045, now seen corresponding path program 1 times [2019-11-16 00:09:14,806 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:09:14,806 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010064415] [2019-11-16 00:09:14,806 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:14,807 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:14,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:09:14,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:14,833 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:09:14,833 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010064415] [2019-11-16 00:09:14,833 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1253884519] [2019-11-16 00:09:14,834 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_36c1ed6d-2c10-4884-afdf-a94e276eebcd/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:09:14,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:14,897 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-16 00:09:14,898 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:09:14,915 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:09:14,916 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:09:14,916 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-11-16 00:09:14,916 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749845265] [2019-11-16 00:09:14,917 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-16 00:09:14,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:09:14,917 INFO L82 PathProgramCache]: Analyzing trace with hash 1951, now seen corresponding path program 2 times [2019-11-16 00:09:14,917 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:09:14,917 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041366016] [2019-11-16 00:09:14,917 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:14,918 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:14,918 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:09:14,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:09:14,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:09:14,925 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:09:14,973 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:09:14,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:09:14,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:09:14,974 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. cyclomatic complexity: 10 Second operand 5 states. [2019-11-16 00:09:15,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:09:15,035 INFO L93 Difference]: Finished difference Result 30 states and 37 transitions. [2019-11-16 00:09:15,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:09:15,036 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 37 transitions. [2019-11-16 00:09:15,037 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2019-11-16 00:09:15,038 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 37 transitions. [2019-11-16 00:09:15,038 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2019-11-16 00:09:15,038 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2019-11-16 00:09:15,039 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 37 transitions. [2019-11-16 00:09:15,039 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:09:15,039 INFO L688 BuchiCegarLoop]: Abstraction has 30 states and 37 transitions. [2019-11-16 00:09:15,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 37 transitions. [2019-11-16 00:09:15,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2019-11-16 00:09:15,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-11-16 00:09:15,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2019-11-16 00:09:15,043 INFO L711 BuchiCegarLoop]: Abstraction has 24 states and 29 transitions. [2019-11-16 00:09:15,043 INFO L591 BuchiCegarLoop]: Abstraction has 24 states and 29 transitions. [2019-11-16 00:09:15,043 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-16 00:09:15,043 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 29 transitions. [2019-11-16 00:09:15,044 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2019-11-16 00:09:15,044 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:09:15,044 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:09:15,045 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-11-16 00:09:15,045 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-16 00:09:15,045 INFO L791 eck$LassoCheckResult]: Stem: 282#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 279#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~post1, main_#t~mem3, main_#t~nondet5, main_#t~post4, main_#t~mem6, main_#t~post8, main_#t~mem7, main_#t~post10, main_#t~mem9, main_#t~mem11, main_#t~mem12, main_#t~post13, main_#t~post14, main_~#string_A~0.base, main_~#string_A~0.offset, main_~#string_B~0.base, main_~#string_B~0.offset, main_~i~0, main_~j~0, main_~nc_A~0, main_~nc_B~0, main_~found~0;call main_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.allocOnStack(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.allocOnStack(5);havoc main_~i~0;havoc main_~j~0;havoc main_~nc_A~0;havoc main_~nc_B~0;main_~found~0 := 0;main_~i~0 := 0; 263#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; 264#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 265#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; 266#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 283#L19-3 assume !(main_~i~0 < 5); 261#L19-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 262#L21 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 280#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; 281#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 277#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; 278#L23-2 [2019-11-16 00:09:15,045 INFO L793 eck$LassoCheckResult]: Loop: 278#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 284#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; 278#L23-2 [2019-11-16 00:09:15,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:09:15,046 INFO L82 PathProgramCache]: Analyzing trace with hash 780717205, now seen corresponding path program 1 times [2019-11-16 00:09:15,046 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:09:15,046 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973336053] [2019-11-16 00:09:15,046 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:15,046 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:15,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:09:15,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:15,086 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:09:15,086 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973336053] [2019-11-16 00:09:15,086 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1131256037] [2019-11-16 00:09:15,086 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_36c1ed6d-2c10-4884-afdf-a94e276eebcd/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:09:15,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:15,150 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-16 00:09:15,152 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:09:15,172 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:09:15,173 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:09:15,173 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-11-16 00:09:15,173 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555269050] [2019-11-16 00:09:15,174 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-16 00:09:15,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:09:15,174 INFO L82 PathProgramCache]: Analyzing trace with hash 1951, now seen corresponding path program 3 times [2019-11-16 00:09:15,174 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:09:15,174 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965156415] [2019-11-16 00:09:15,174 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:15,175 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:15,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:09:15,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:09:15,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:09:15,192 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:09:15,248 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:09:15,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:09:15,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:09:15,249 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. cyclomatic complexity: 10 Second operand 6 states. [2019-11-16 00:09:15,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:09:15,339 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2019-11-16 00:09:15,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:09:15,339 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 44 transitions. [2019-11-16 00:09:15,341 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2019-11-16 00:09:15,341 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 36 states and 44 transitions. [2019-11-16 00:09:15,342 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2019-11-16 00:09:15,342 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2019-11-16 00:09:15,342 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 44 transitions. [2019-11-16 00:09:15,342 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:09:15,342 INFO L688 BuchiCegarLoop]: Abstraction has 36 states and 44 transitions. [2019-11-16 00:09:15,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 44 transitions. [2019-11-16 00:09:15,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 28. [2019-11-16 00:09:15,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-16 00:09:15,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2019-11-16 00:09:15,347 INFO L711 BuchiCegarLoop]: Abstraction has 28 states and 33 transitions. [2019-11-16 00:09:15,347 INFO L591 BuchiCegarLoop]: Abstraction has 28 states and 33 transitions. [2019-11-16 00:09:15,347 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-16 00:09:15,347 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 33 transitions. [2019-11-16 00:09:15,348 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2019-11-16 00:09:15,348 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:09:15,348 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:09:15,349 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 1, 1, 1, 1, 1] [2019-11-16 00:09:15,349 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-16 00:09:15,349 INFO L791 eck$LassoCheckResult]: Stem: 386#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 382#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~post1, main_#t~mem3, main_#t~nondet5, main_#t~post4, main_#t~mem6, main_#t~post8, main_#t~mem7, main_#t~post10, main_#t~mem9, main_#t~mem11, main_#t~mem12, main_#t~post13, main_#t~post14, main_~#string_A~0.base, main_~#string_A~0.offset, main_~#string_B~0.base, main_~#string_B~0.offset, main_~i~0, main_~j~0, main_~nc_A~0, main_~nc_B~0, main_~found~0;call main_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.allocOnStack(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.allocOnStack(5);havoc main_~i~0;havoc main_~j~0;havoc main_~nc_A~0;havoc main_~nc_B~0;main_~found~0 := 0;main_~i~0 := 0; 365#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; 390#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; 372#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 367#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; 368#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 387#L19-3 assume !(main_~i~0 < 5); 363#L19-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 364#L21 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 383#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; 384#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 385#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; 389#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 380#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; 381#L23-2 [2019-11-16 00:09:15,349 INFO L793 eck$LassoCheckResult]: Loop: 381#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 388#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; 381#L23-2 [2019-11-16 00:09:15,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:09:15,350 INFO L82 PathProgramCache]: Analyzing trace with hash 2111137973, now seen corresponding path program 2 times [2019-11-16 00:09:15,350 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:09:15,350 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243484340] [2019-11-16 00:09:15,350 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:15,351 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:15,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:09:15,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:15,404 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-16 00:09:15,404 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243484340] [2019-11-16 00:09:15,405 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1077310845] [2019-11-16 00:09:15,405 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_36c1ed6d-2c10-4884-afdf-a94e276eebcd/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:09:15,496 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-16 00:09:15,496 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:09:15,497 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-16 00:09:15,498 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:09:15,525 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-16 00:09:15,525 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:09:15,525 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-11-16 00:09:15,526 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099214240] [2019-11-16 00:09:15,526 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-16 00:09:15,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:09:15,526 INFO L82 PathProgramCache]: Analyzing trace with hash 1951, now seen corresponding path program 4 times [2019-11-16 00:09:15,526 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:09:15,527 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957320516] [2019-11-16 00:09:15,527 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:15,527 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:15,527 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:09:15,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:09:15,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:09:15,545 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:09:15,577 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:09:15,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:09:15,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:09:15,578 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. cyclomatic complexity: 10 Second operand 7 states. [2019-11-16 00:09:15,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:09:15,650 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2019-11-16 00:09:15,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:09:15,650 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 51 transitions. [2019-11-16 00:09:15,651 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2019-11-16 00:09:15,652 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 42 states and 51 transitions. [2019-11-16 00:09:15,652 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2019-11-16 00:09:15,652 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2019-11-16 00:09:15,653 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 51 transitions. [2019-11-16 00:09:15,653 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:09:15,653 INFO L688 BuchiCegarLoop]: Abstraction has 42 states and 51 transitions. [2019-11-16 00:09:15,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 51 transitions. [2019-11-16 00:09:15,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 32. [2019-11-16 00:09:15,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-16 00:09:15,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2019-11-16 00:09:15,656 INFO L711 BuchiCegarLoop]: Abstraction has 32 states and 37 transitions. [2019-11-16 00:09:15,656 INFO L591 BuchiCegarLoop]: Abstraction has 32 states and 37 transitions. [2019-11-16 00:09:15,656 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-16 00:09:15,656 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 37 transitions. [2019-11-16 00:09:15,657 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2019-11-16 00:09:15,657 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:09:15,657 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:09:15,658 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 4, 3, 1, 1, 1, 1, 1] [2019-11-16 00:09:15,658 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-16 00:09:15,658 INFO L791 eck$LassoCheckResult]: Stem: 510#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 507#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~post1, main_#t~mem3, main_#t~nondet5, main_#t~post4, main_#t~mem6, main_#t~post8, main_#t~mem7, main_#t~post10, main_#t~mem9, main_#t~mem11, main_#t~mem12, main_#t~post13, main_#t~post14, main_~#string_A~0.base, main_~#string_A~0.offset, main_~#string_B~0.base, main_~#string_B~0.offset, main_~i~0, main_~j~0, main_~nc_A~0, main_~nc_B~0, main_~found~0;call main_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.allocOnStack(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.allocOnStack(5);havoc main_~i~0;havoc main_~j~0;havoc main_~nc_A~0;havoc main_~nc_B~0;main_~found~0 := 0;main_~i~0 := 0; 490#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; 491#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 492#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; 493#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 497#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; 516#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 515#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; 512#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 511#L19-3 assume !(main_~i~0 < 5); 488#L19-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 489#L21 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 508#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; 509#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 505#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; 506#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 519#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; 518#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 517#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; 514#L23-2 [2019-11-16 00:09:15,658 INFO L793 eck$LassoCheckResult]: Loop: 514#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; 514#L23-2 [2019-11-16 00:09:15,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:09:15,658 INFO L82 PathProgramCache]: Analyzing trace with hash 213314517, now seen corresponding path program 3 times [2019-11-16 00:09:15,658 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:09:15,658 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712917629] [2019-11-16 00:09:15,659 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:15,659 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:15,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:09:15,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:15,735 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-16 00:09:15,735 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712917629] [2019-11-16 00:09:15,736 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1278559128] [2019-11-16 00:09:15,736 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_36c1ed6d-2c10-4884-afdf-a94e276eebcd/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:09:15,813 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-11-16 00:09:15,813 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:09:15,814 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-16 00:09:15,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:09:15,826 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-16 00:09:15,826 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:09:15,826 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-11-16 00:09:15,826 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416385940] [2019-11-16 00:09:15,827 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-16 00:09:15,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:09:15,827 INFO L82 PathProgramCache]: Analyzing trace with hash 1951, now seen corresponding path program 5 times [2019-11-16 00:09:15,827 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:09:15,827 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553268202] [2019-11-16 00:09:15,827 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:15,828 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:15,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:09:15,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:09:15,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:09:15,833 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:09:15,884 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:09:15,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-16 00:09:15,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:09:15,884 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. cyclomatic complexity: 10 Second operand 8 states. [2019-11-16 00:09:15,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:09:15,962 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2019-11-16 00:09:15,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:09:15,962 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 56 transitions. [2019-11-16 00:09:15,963 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2019-11-16 00:09:15,964 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 46 states and 56 transitions. [2019-11-16 00:09:15,964 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2019-11-16 00:09:15,964 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2019-11-16 00:09:15,964 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 56 transitions. [2019-11-16 00:09:15,965 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:09:15,965 INFO L688 BuchiCegarLoop]: Abstraction has 46 states and 56 transitions. [2019-11-16 00:09:15,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 56 transitions. [2019-11-16 00:09:15,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 36. [2019-11-16 00:09:15,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-11-16 00:09:15,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2019-11-16 00:09:15,968 INFO L711 BuchiCegarLoop]: Abstraction has 36 states and 41 transitions. [2019-11-16 00:09:15,968 INFO L591 BuchiCegarLoop]: Abstraction has 36 states and 41 transitions. [2019-11-16 00:09:15,968 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-16 00:09:15,968 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 41 transitions. [2019-11-16 00:09:15,969 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2019-11-16 00:09:15,969 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:09:15,969 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:09:15,970 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 4, 1, 1, 1, 1, 1] [2019-11-16 00:09:15,970 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-16 00:09:15,970 INFO L791 eck$LassoCheckResult]: Stem: 654#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 652#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~post1, main_#t~mem3, main_#t~nondet5, main_#t~post4, main_#t~mem6, main_#t~post8, main_#t~mem7, main_#t~post10, main_#t~mem9, main_#t~mem11, main_#t~mem12, main_#t~post13, main_#t~post14, main_~#string_A~0.base, main_~#string_A~0.offset, main_~#string_B~0.base, main_~#string_B~0.offset, main_~i~0, main_~j~0, main_~nc_A~0, main_~nc_B~0, main_~found~0;call main_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.allocOnStack(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.allocOnStack(5);havoc main_~i~0;havoc main_~j~0;havoc main_~nc_A~0;havoc main_~nc_B~0;main_~found~0 := 0;main_~i~0 := 0; 636#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; 637#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 638#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; 639#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 661#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; 660#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 659#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; 658#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 657#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; 656#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); 634#L19-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 635#L21 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 650#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; 651#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 653#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; 669#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 668#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; 667#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 666#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; 665#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 664#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 [2019-11-16 00:09:15,970 INFO L793 eck$LassoCheckResult]: Loop: 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; 663#L23-2 [2019-11-16 00:09:15,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:09:15,970 INFO L82 PathProgramCache]: Analyzing trace with hash 1212159477, now seen corresponding path program 4 times [2019-11-16 00:09:15,970 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:09:15,971 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009485049] [2019-11-16 00:09:15,971 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:15,971 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:15,971 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:09:15,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:09:16,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:09:16,018 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:09:16,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:09:16,018 INFO L82 PathProgramCache]: Analyzing trace with hash 1951, now seen corresponding path program 6 times [2019-11-16 00:09:16,018 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:09:16,019 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080717486] [2019-11-16 00:09:16,019 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:16,019 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:16,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:09:16,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:09:16,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:09:16,024 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:09:16,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:09:16,025 INFO L82 PathProgramCache]: Analyzing trace with hash 949121171, now seen corresponding path program 5 times [2019-11-16 00:09:16,025 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:09:16,025 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052613883] [2019-11-16 00:09:16,025 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:16,025 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:16,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:09:16,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:16,163 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-11-16 00:09:16,163 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052613883] [2019-11-16 00:09:16,164 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:09:16,164 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-16 00:09:16,164 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66992063] [2019-11-16 00:09:16,205 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:09:16,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-16 00:09:16,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:09:16,205 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. cyclomatic complexity: 10 Second operand 9 states. [2019-11-16 00:09:16,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:09:16,308 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2019-11-16 00:09:16,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-16 00:09:16,308 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 41 transitions. [2019-11-16 00:09:16,309 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2019-11-16 00:09:16,309 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 37 states and 41 transitions. [2019-11-16 00:09:16,309 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2019-11-16 00:09:16,310 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2019-11-16 00:09:16,310 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 41 transitions. [2019-11-16 00:09:16,310 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:09:16,310 INFO L688 BuchiCegarLoop]: Abstraction has 37 states and 41 transitions. [2019-11-16 00:09:16,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 41 transitions. [2019-11-16 00:09:16,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2019-11-16 00:09:16,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-11-16 00:09:16,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2019-11-16 00:09:16,313 INFO L711 BuchiCegarLoop]: Abstraction has 36 states and 40 transitions. [2019-11-16 00:09:16,313 INFO L591 BuchiCegarLoop]: Abstraction has 36 states and 40 transitions. [2019-11-16 00:09:16,313 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-16 00:09:16,313 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 40 transitions. [2019-11-16 00:09:16,313 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2019-11-16 00:09:16,314 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:09:16,314 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:09:16,314 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:09:16,315 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-16 00:09:16,315 INFO L791 eck$LassoCheckResult]: Stem: 741#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 739#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~post1, main_#t~mem3, main_#t~nondet5, main_#t~post4, main_#t~mem6, main_#t~post8, main_#t~mem7, main_#t~post10, main_#t~mem9, main_#t~mem11, main_#t~mem12, main_#t~post13, main_#t~post14, main_~#string_A~0.base, main_~#string_A~0.offset, main_~#string_B~0.base, main_~#string_B~0.offset, main_~i~0, main_~j~0, main_~nc_A~0, main_~nc_B~0, main_~found~0;call main_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.allocOnStack(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.allocOnStack(5);havoc main_~i~0;havoc main_~j~0;havoc main_~nc_A~0;havoc main_~nc_B~0;main_~found~0 := 0;main_~i~0 := 0; 723#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; 724#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 725#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; 726#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 756#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; 755#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 754#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; 753#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 752#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; 743#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 742#L19-3 assume !(main_~i~0 < 5); 721#L19-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 722#L21 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 737#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; 738#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; 751#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 750#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; 749#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 748#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; 747#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 746#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); 735#L23-4 call main_#t~mem6 := read~int(main_~#string_B~0.base, 4 + main_~#string_B~0.offset, 1); 736#L25 assume !!(0 == main_#t~mem6);havoc main_#t~mem6;main_~nc_A~0 := 0; 729#L28-3 [2019-11-16 00:09:16,315 INFO L793 eck$LassoCheckResult]: Loop: 729#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 727#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; 729#L28-3 [2019-11-16 00:09:16,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:09:16,315 INFO L82 PathProgramCache]: Analyzing trace with hash 1572377782, now seen corresponding path program 1 times [2019-11-16 00:09:16,315 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:09:16,315 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784938404] [2019-11-16 00:09:16,316 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:16,316 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:16,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:09:16,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:09:16,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:09:16,403 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:09:16,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:09:16,405 INFO L82 PathProgramCache]: Analyzing trace with hash 2406, now seen corresponding path program 1 times [2019-11-16 00:09:16,406 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:09:16,406 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397167290] [2019-11-16 00:09:16,406 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:16,407 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:16,407 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:09:16,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:09:16,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:09:16,414 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:09:16,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:09:16,414 INFO L82 PathProgramCache]: Analyzing trace with hash -773438245, now seen corresponding path program 1 times [2019-11-16 00:09:16,414 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:09:16,415 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778649351] [2019-11-16 00:09:16,415 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:16,415 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:16,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:09:16,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:09:16,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:09:16,469 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:09:19,784 WARN L191 SmtUtils]: Spent 3.28 s on a formula simplification. DAG size of input: 216 DAG size of output: 164 [2019-11-16 00:09:19,972 WARN L191 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2019-11-16 00:09:19,974 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:09:19,974 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:09:19,974 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:09:19,974 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:09:19,974 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:09:19,974 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:09:19,975 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:09:19,975 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:09:19,975 INFO L131 ssoRankerPreferences]: Filename of dumped script: string-1.i_Iteration8_Lasso [2019-11-16 00:09:19,975 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:09:19,975 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:09:19,978 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:19,984 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:19,985 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:19,987 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:19,988 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:19,993 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:19,994 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:19,999 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:20,001 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:20,003 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:20,004 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:20,006 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:20,008 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:20,013 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:20,016 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:20,149 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:20,155 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:20,156 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:20,158 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:20,159 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:20,161 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:20,386 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:09:20,386 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:09:20,386 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:09:20,387 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:09:20,387 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:09:20,387 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:09:20,387 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:09:20,388 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:09:20,388 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:09:20,388 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:09:20,389 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:09:20,389 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:09:20,389 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:09:20,389 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:09:20,390 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:09:20,390 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:09:20,390 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:09:20,390 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:09:20,390 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:09:20,391 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:09:20,391 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:09:20,391 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:09:20,392 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:09:20,392 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:09:20,392 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:09:20,392 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:09:20,392 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:09:20,392 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:09:20,393 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:09:20,393 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:09:20,393 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:09:20,393 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:09:20,393 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:09:20,394 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:09:20,394 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:09:20,394 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:09:20,394 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:09:20,394 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:09:20,395 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:09:20,395 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:09:20,395 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:09:20,395 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:09:20,395 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:09:20,397 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:09:20,397 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:09:20,399 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:09:20,399 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:09:20,400 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:09:20,400 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:09:20,400 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:09:20,400 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:09:20,400 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:09:20,406 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:09:20,406 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:09:20,407 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:09:20,407 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:09:20,407 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:09:20,407 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:09:20,408 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:09:20,408 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:09:20,408 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:09:20,408 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:09:20,408 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:09:20,409 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:09:20,409 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:09:20,409 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:09:20,409 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:09:20,410 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:09:20,410 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:09:20,410 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:09:20,410 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:09:20,410 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:09:20,411 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:09:20,411 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:09:20,411 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:09:20,411 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:09:20,411 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:09:20,412 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:09:20,412 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:09:20,412 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:09:20,412 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:09:20,413 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:09:20,413 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:09:20,413 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:09:20,413 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:09:20,413 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:09:20,414 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:09:20,414 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:09:20,414 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:09:20,414 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:09:20,414 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:09:20,415 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:09:20,415 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:09:20,415 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:09:20,415 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:09:20,416 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:09:20,416 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:09:20,416 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:09:20,416 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:09:20,417 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:09:20,417 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:09:20,417 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:09:20,417 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:09:20,417 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:09:20,418 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:09:20,418 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:09:20,418 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:09:20,418 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:09:20,418 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:09:20,419 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:09:20,419 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:09:20,419 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:09:20,419 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:09:20,420 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:09:20,420 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:09:20,420 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:09:20,420 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:09:20,420 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:09:20,424 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:09:20,424 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:09:20,424 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:09:20,425 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:09:20,425 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:09:20,426 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:09:20,426 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:09:20,430 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:09:20,430 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:09:20,431 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:09:20,431 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:09:20,431 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:09:20,431 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:09:20,438 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:09:20,438 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:09:20,441 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:09:20,442 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:09:20,442 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:09:20,443 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:09:20,443 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:09:20,443 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:09:20,444 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:09:20,444 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:09:20,447 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:09:20,448 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:09:20,448 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:09:20,448 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-11-16 00:09:20,448 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:09:20,448 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:09:20,451 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-11-16 00:09:20,451 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:09:20,458 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:09:20,459 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:09:20,459 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:09:20,459 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:09:20,459 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:09:20,460 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:09:20,460 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:09:20,460 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:09:20,463 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:09:20,464 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:09:20,465 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:09:20,465 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:09:20,465 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:09:20,465 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:09:20,467 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:09:20,467 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:09:20,469 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:09:20,469 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:09:20,471 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:09:20,471 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:09:20,471 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:09:20,471 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:09:20,471 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:09:20,472 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:09:20,472 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:09:20,472 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:09:20,473 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:09:20,474 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:09:20,474 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:09:20,474 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:09:20,474 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:09:20,475 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:09:20,475 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:09:20,476 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:09:20,477 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:09:20,477 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:09:20,478 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:09:20,478 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:09:20,478 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:09:20,488 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:09:20,488 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:09:20,514 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:09:20,520 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-16 00:09:20,520 INFO L444 ModelExtractionUtils]: 8 out of 13 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-16 00:09:20,520 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:09:20,531 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-16 00:09:20,532 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:09:20,532 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#string_A~0.base)_2, ULTIMATE.start_main_~#string_A~0.offset, ULTIMATE.start_main_~nc_A~0) = 1*v_rep(select #length ULTIMATE.start_main_~#string_A~0.base)_2 - 1*ULTIMATE.start_main_~#string_A~0.offset - 1*ULTIMATE.start_main_~nc_A~0 Supporting invariants [] [2019-11-16 00:09:20,558 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2019-11-16 00:09:20,562 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-16 00:09:20,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:09:20,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:20,610 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:09:20,612 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:09:20,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:20,620 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-16 00:09:20,620 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:09:20,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:09:20,630 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-16 00:09:20,631 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 36 states and 40 transitions. cyclomatic complexity: 8 Second operand 3 states. [2019-11-16 00:09:20,650 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 36 states and 40 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 44 states and 52 transitions. Complement of second has 4 states. [2019-11-16 00:09:20,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-16 00:09:20,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-16 00:09:20,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2019-11-16 00:09:20,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 28 letters. Loop has 2 letters. [2019-11-16 00:09:20,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:09:20,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 30 letters. Loop has 2 letters. [2019-11-16 00:09:20,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:09:20,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 28 letters. Loop has 4 letters. [2019-11-16 00:09:20,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:09:20,653 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 52 transitions. [2019-11-16 00:09:20,653 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-11-16 00:09:20,657 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 38 states and 43 transitions. [2019-11-16 00:09:20,657 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2019-11-16 00:09:20,657 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2019-11-16 00:09:20,657 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 43 transitions. [2019-11-16 00:09:20,657 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:09:20,657 INFO L688 BuchiCegarLoop]: Abstraction has 38 states and 43 transitions. [2019-11-16 00:09:20,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 43 transitions. [2019-11-16 00:09:20,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-11-16 00:09:20,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-11-16 00:09:20,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2019-11-16 00:09:20,659 INFO L711 BuchiCegarLoop]: Abstraction has 38 states and 43 transitions. [2019-11-16 00:09:20,659 INFO L591 BuchiCegarLoop]: Abstraction has 38 states and 43 transitions. [2019-11-16 00:09:20,659 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-16 00:09:20,659 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 43 transitions. [2019-11-16 00:09:20,660 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-11-16 00:09:20,660 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:09:20,660 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:09:20,660 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:09:20,660 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-16 00:09:20,661 INFO L791 eck$LassoCheckResult]: Stem: 949#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 946#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~post1, main_#t~mem3, main_#t~nondet5, main_#t~post4, main_#t~mem6, main_#t~post8, main_#t~mem7, main_#t~post10, main_#t~mem9, main_#t~mem11, main_#t~mem12, main_#t~post13, main_#t~post14, main_~#string_A~0.base, main_~#string_A~0.offset, main_~#string_B~0.base, main_~#string_B~0.offset, main_~i~0, main_~j~0, main_~nc_A~0, main_~nc_B~0, main_~found~0;call main_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.allocOnStack(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.allocOnStack(5);havoc main_~i~0;havoc main_~j~0;havoc main_~nc_A~0;havoc main_~nc_B~0;main_~found~0 := 0;main_~i~0 := 0; 929#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; 930#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 931#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; 932#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 957#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; 956#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 955#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; 954#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 953#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; 952#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 951#L19-3 assume !(main_~i~0 < 5); 927#L19-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 928#L21 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 948#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; 947#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 944#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; 945#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 964#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; 963#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 962#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; 961#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 960#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; 959#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 958#L23-3 assume !(main_~i~0 < 5); 942#L23-4 call main_#t~mem6 := read~int(main_~#string_B~0.base, 4 + main_~#string_B~0.offset, 1); 943#L25 assume !!(0 == main_#t~mem6);havoc main_#t~mem6;main_~nc_A~0 := 0; 950#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 933#L28-1 assume !(0 != main_#t~mem7);havoc main_#t~mem7; 934#L28-4 main_~nc_B~0 := 0; 940#L32-3 [2019-11-16 00:09:20,661 INFO L793 eck$LassoCheckResult]: Loop: 940#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 941#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; 940#L32-3 [2019-11-16 00:09:20,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:09:20,661 INFO L82 PathProgramCache]: Analyzing trace with hash 1793218173, now seen corresponding path program 1 times [2019-11-16 00:09:20,661 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:09:20,661 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079010896] [2019-11-16 00:09:20,662 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:20,662 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:20,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:09:20,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:09:20,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:09:20,695 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:09:20,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:09:20,695 INFO L82 PathProgramCache]: Analyzing trace with hash 2854, now seen corresponding path program 1 times [2019-11-16 00:09:20,695 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:09:20,696 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480776100] [2019-11-16 00:09:20,696 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:20,696 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:20,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:09:20,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:09:20,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:09:20,700 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:09:20,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:09:20,701 INFO L82 PathProgramCache]: Analyzing trace with hash 1000780450, now seen corresponding path program 1 times [2019-11-16 00:09:20,701 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:09:20,701 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536035345] [2019-11-16 00:09:20,701 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:20,701 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:20,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:09:20,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:09:20,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:09:20,732 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:09:23,491 WARN L191 SmtUtils]: Spent 2.70 s on a formula simplification. DAG size of input: 227 DAG size of output: 174 [2019-11-16 00:09:23,618 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2019-11-16 00:09:23,620 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:09:23,620 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:09:23,620 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:09:23,620 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:09:23,620 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:09:23,621 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:09:23,621 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:09:23,621 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:09:23,621 INFO L131 ssoRankerPreferences]: Filename of dumped script: string-1.i_Iteration9_Lasso [2019-11-16 00:09:23,621 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:09:23,621 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:09:23,623 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:23,627 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:23,633 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:23,764 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:23,766 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:23,768 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:23,773 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:23,778 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:23,781 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:23,806 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:23,808 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:23,817 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:23,820 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:23,822 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:23,824 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:23,826 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:23,828 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:23,829 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:23,834 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:23,835 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:24,079 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:09:24,079 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:09:24,079 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:09:24,080 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:09:24,080 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:09:24,080 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:09:24,080 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:09:24,080 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:09:24,080 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:09:24,081 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:09:24,081 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:09:24,081 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:09:24,081 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:09:24,082 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:09:24,082 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:09:24,082 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:09:24,082 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:09:24,082 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:09:24,083 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:09:24,084 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:09:24,084 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:09:24,084 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:09:24,084 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:09:24,084 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:09:24,085 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:09:24,085 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:09:24,086 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:09:24,086 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:09:24,087 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:09:24,087 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:09:24,087 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:09:24,087 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:09:24,088 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:09:24,088 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:09:24,097 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:09:24,109 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-11-16 00:09:24,109 INFO L444 ModelExtractionUtils]: 18 out of 25 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-11-16 00:09:24,109 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:09:24,110 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-16 00:09:24,110 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:09:24,110 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~#string_B~0.offset, ULTIMATE.start_main_~nc_B~0, v_rep(select #length ULTIMATE.start_main_~#string_B~0.base)_3) = -1*ULTIMATE.start_main_~#string_B~0.offset - 1*ULTIMATE.start_main_~nc_B~0 + 1*v_rep(select #length ULTIMATE.start_main_~#string_B~0.base)_3 Supporting invariants [] [2019-11-16 00:09:24,119 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2019-11-16 00:09:24,120 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-16 00:09:24,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:09:24,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:24,158 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:09:24,160 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:09:24,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:24,165 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-16 00:09:24,166 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:09:24,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:09:24,189 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-16 00:09:24,189 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 38 states and 43 transitions. cyclomatic complexity: 9 Second operand 3 states. [2019-11-16 00:09:24,204 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 38 states and 43 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 43 states and 51 transitions. Complement of second has 4 states. [2019-11-16 00:09:24,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-16 00:09:24,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-16 00:09:24,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2019-11-16 00:09:24,206 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 31 letters. Loop has 2 letters. [2019-11-16 00:09:24,206 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:09:24,206 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 33 letters. Loop has 2 letters. [2019-11-16 00:09:24,206 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:09:24,206 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 31 letters. Loop has 4 letters. [2019-11-16 00:09:24,207 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:09:24,207 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 51 transitions. [2019-11-16 00:09:24,208 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-16 00:09:24,208 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 40 states and 46 transitions. [2019-11-16 00:09:24,208 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2019-11-16 00:09:24,208 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2019-11-16 00:09:24,209 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 46 transitions. [2019-11-16 00:09:24,209 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:09:24,209 INFO L688 BuchiCegarLoop]: Abstraction has 40 states and 46 transitions. [2019-11-16 00:09:24,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 46 transitions. [2019-11-16 00:09:24,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-11-16 00:09:24,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-11-16 00:09:24,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2019-11-16 00:09:24,212 INFO L711 BuchiCegarLoop]: Abstraction has 40 states and 46 transitions. [2019-11-16 00:09:24,212 INFO L591 BuchiCegarLoop]: Abstraction has 40 states and 46 transitions. [2019-11-16 00:09:24,212 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-11-16 00:09:24,212 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 46 transitions. [2019-11-16 00:09:24,212 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-16 00:09:24,212 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:09:24,212 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:09:24,213 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:09:24,213 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-16 00:09:24,214 INFO L791 eck$LassoCheckResult]: Stem: 1167#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1164#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~post1, main_#t~mem3, main_#t~nondet5, main_#t~post4, main_#t~mem6, main_#t~post8, main_#t~mem7, main_#t~post10, main_#t~mem9, main_#t~mem11, main_#t~mem12, main_#t~post13, main_#t~post14, main_~#string_A~0.base, main_~#string_A~0.offset, main_~#string_B~0.base, main_~#string_B~0.offset, main_~i~0, main_~j~0, main_~nc_A~0, main_~nc_B~0, main_~found~0;call main_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.allocOnStack(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.allocOnStack(5);havoc main_~i~0;havoc main_~j~0;havoc main_~nc_A~0;havoc main_~nc_B~0;main_~found~0 := 0;main_~i~0 := 0; 1145#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; 1146#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1147#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; 1148#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 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; 1174#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1173#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; 1172#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1171#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; 1170#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1169#L19-3 assume !(main_~i~0 < 5); 1143#L19-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 1144#L21 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 1165#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; 1166#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1162#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; 1163#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1182#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; 1181#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1180#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; 1179#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1178#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; 1177#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1176#L23-3 assume !(main_~i~0 < 5); 1160#L23-4 call main_#t~mem6 := read~int(main_~#string_B~0.base, 4 + main_~#string_B~0.offset, 1); 1161#L25 assume !!(0 == main_#t~mem6);havoc main_#t~mem6;main_~nc_A~0 := 0; 1168#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 1149#L28-1 assume !(0 != main_#t~mem7);havoc main_#t~mem7; 1150#L28-4 main_~nc_B~0 := 0; 1156#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 1158#L32-1 assume !(0 != main_#t~mem9);havoc main_#t~mem9; 1153#L32-4 assume !!(main_~nc_B~0 >= main_~nc_A~0);main_~j~0 := 0;main_~i~0 := main_~j~0; 1154#L41-2 [2019-11-16 00:09:24,214 INFO L793 eck$LassoCheckResult]: Loop: 1154#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); 1155#L41 assume main_#t~mem11 == main_#t~mem12;havoc main_#t~mem12;havoc main_#t~mem11;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; 1154#L41-2 [2019-11-16 00:09:24,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:09:24,214 INFO L82 PathProgramCache]: Analyzing trace with hash 959422888, now seen corresponding path program 1 times [2019-11-16 00:09:24,214 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:09:24,215 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175150394] [2019-11-16 00:09:24,215 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:24,215 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:24,215 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:09:24,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:09:24,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:09:24,259 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:09:24,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:09:24,260 INFO L82 PathProgramCache]: Analyzing trace with hash 3556, now seen corresponding path program 1 times [2019-11-16 00:09:24,260 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:09:24,260 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974983686] [2019-11-16 00:09:24,260 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:24,260 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:24,261 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:09:24,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:09:24,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:09:24,272 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:09:24,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:09:24,274 INFO L82 PathProgramCache]: Analyzing trace with hash -1412570677, now seen corresponding path program 1 times [2019-11-16 00:09:24,274 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:09:24,274 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257019906] [2019-11-16 00:09:24,274 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:24,274 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:24,274 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:09:24,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:24,327 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-11-16 00:09:24,327 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257019906] [2019-11-16 00:09:24,328 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:09:24,328 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:09:24,328 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426179927] [2019-11-16 00:09:24,390 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:09:24,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:09:24,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:09:24,391 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. cyclomatic complexity: 10 Second operand 4 states. [2019-11-16 00:09:24,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:09:24,411 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2019-11-16 00:09:24,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:09:24,411 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 56 transitions. [2019-11-16 00:09:24,412 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-16 00:09:24,413 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 41 states and 46 transitions. [2019-11-16 00:09:24,413 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2019-11-16 00:09:24,413 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2019-11-16 00:09:24,413 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 46 transitions. [2019-11-16 00:09:24,413 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:09:24,413 INFO L688 BuchiCegarLoop]: Abstraction has 41 states and 46 transitions. [2019-11-16 00:09:24,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 46 transitions. [2019-11-16 00:09:24,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2019-11-16 00:09:24,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-11-16 00:09:24,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2019-11-16 00:09:24,416 INFO L711 BuchiCegarLoop]: Abstraction has 40 states and 45 transitions. [2019-11-16 00:09:24,416 INFO L591 BuchiCegarLoop]: Abstraction has 40 states and 45 transitions. [2019-11-16 00:09:24,416 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-11-16 00:09:24,416 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 45 transitions. [2019-11-16 00:09:24,416 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-16 00:09:24,416 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:09:24,417 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:09:24,418 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:09:24,418 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-16 00:09:24,418 INFO L791 eck$LassoCheckResult]: Stem: 1265#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1263#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~post1, main_#t~mem3, main_#t~nondet5, main_#t~post4, main_#t~mem6, main_#t~post8, main_#t~mem7, main_#t~post10, main_#t~mem9, main_#t~mem11, main_#t~mem12, main_#t~post13, main_#t~post14, main_~#string_A~0.base, main_~#string_A~0.offset, main_~#string_B~0.base, main_~#string_B~0.offset, main_~i~0, main_~j~0, main_~nc_A~0, main_~nc_B~0, main_~found~0;call main_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.allocOnStack(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.allocOnStack(5);havoc main_~i~0;havoc main_~j~0;havoc main_~nc_A~0;havoc main_~nc_B~0;main_~found~0 := 0;main_~i~0 := 0; 1243#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; 1244#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1245#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; 1246#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1251#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; 1272#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1271#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; 1270#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1269#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; 1268#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1267#L19-3 assume !(main_~i~0 < 5); 1241#L19-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 1242#L21 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 1261#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; 1262#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1264#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; 1280#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1279#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; 1278#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1277#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; 1276#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1275#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; 1274#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1273#L23-3 assume !(main_~i~0 < 5); 1259#L23-4 call main_#t~mem6 := read~int(main_~#string_B~0.base, 4 + main_~#string_B~0.offset, 1); 1260#L25 assume !!(0 == main_#t~mem6);havoc main_#t~mem6;main_~nc_A~0 := 0; 1266#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 1249#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; 1250#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 1247#L28-1 assume !(0 != main_#t~mem7);havoc main_#t~mem7; 1248#L28-4 main_~nc_B~0 := 0; 1255#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 1257#L32-1 assume !(0 != main_#t~mem9);havoc main_#t~mem9; 1252#L32-4 assume !!(main_~nc_B~0 >= main_~nc_A~0);main_~j~0 := 0;main_~i~0 := main_~j~0; 1253#L41-2 [2019-11-16 00:09:24,418 INFO L793 eck$LassoCheckResult]: Loop: 1253#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); 1254#L41 assume main_#t~mem11 == main_#t~mem12;havoc main_#t~mem12;havoc main_#t~mem11;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; 1253#L41-2 [2019-11-16 00:09:24,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:09:24,418 INFO L82 PathProgramCache]: Analyzing trace with hash 94364173, now seen corresponding path program 1 times [2019-11-16 00:09:24,418 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:09:24,419 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292610712] [2019-11-16 00:09:24,419 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:24,419 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:24,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:09:24,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:24,507 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-11-16 00:09:24,507 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292610712] [2019-11-16 00:09:24,507 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [632799897] [2019-11-16 00:09:24,507 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_36c1ed6d-2c10-4884-afdf-a94e276eebcd/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:09:24,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:24,596 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-16 00:09:24,598 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:09:24,659 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-11-16 00:09:24,659 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:09:24,659 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2019-11-16 00:09:24,659 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174584813] [2019-11-16 00:09:24,660 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-16 00:09:24,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:09:24,660 INFO L82 PathProgramCache]: Analyzing trace with hash 3556, now seen corresponding path program 2 times [2019-11-16 00:09:24,660 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:09:24,660 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616588336] [2019-11-16 00:09:24,661 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:24,661 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:24,661 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:09:24,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:09:24,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:09:24,666 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:09:24,741 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:09:24,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:09:24,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:09:24,741 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. cyclomatic complexity: 9 Second operand 5 states. [2019-11-16 00:09:24,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:09:24,766 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2019-11-16 00:09:24,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:09:24,767 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 48 transitions. [2019-11-16 00:09:24,768 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-16 00:09:24,768 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 42 states and 46 transitions. [2019-11-16 00:09:24,768 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2019-11-16 00:09:24,768 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2019-11-16 00:09:24,769 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 46 transitions. [2019-11-16 00:09:24,769 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:09:24,769 INFO L688 BuchiCegarLoop]: Abstraction has 42 states and 46 transitions. [2019-11-16 00:09:24,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 46 transitions. [2019-11-16 00:09:24,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2019-11-16 00:09:24,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-11-16 00:09:24,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2019-11-16 00:09:24,771 INFO L711 BuchiCegarLoop]: Abstraction has 40 states and 44 transitions. [2019-11-16 00:09:24,771 INFO L591 BuchiCegarLoop]: Abstraction has 40 states and 44 transitions. [2019-11-16 00:09:24,771 INFO L424 BuchiCegarLoop]: ======== Iteration 12============ [2019-11-16 00:09:24,772 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 44 transitions. [2019-11-16 00:09:24,772 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-16 00:09:24,772 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:09:24,772 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:09:24,773 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:09:24,773 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-16 00:09:24,774 INFO L791 eck$LassoCheckResult]: Stem: 1465#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1463#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~post1, main_#t~mem3, main_#t~nondet5, main_#t~post4, main_#t~mem6, main_#t~post8, main_#t~mem7, main_#t~post10, main_#t~mem9, main_#t~mem11, main_#t~mem12, main_#t~post13, main_#t~post14, main_~#string_A~0.base, main_~#string_A~0.offset, main_~#string_B~0.base, main_~#string_B~0.offset, main_~i~0, main_~j~0, main_~nc_A~0, main_~nc_B~0, main_~found~0;call main_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.allocOnStack(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.allocOnStack(5);havoc main_~i~0;havoc main_~j~0;havoc main_~nc_A~0;havoc main_~nc_B~0;main_~found~0 := 0;main_~i~0 := 0; 1444#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; 1445#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1446#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; 1447#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1473#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; 1472#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1471#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; 1470#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1469#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; 1468#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1467#L19-3 assume !(main_~i~0 < 5); 1442#L19-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 1443#L21 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 1461#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; 1462#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1464#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; 1481#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1480#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; 1479#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1478#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; 1477#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1476#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; 1475#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1474#L23-3 assume !(main_~i~0 < 5); 1459#L23-4 call main_#t~mem6 := read~int(main_~#string_B~0.base, 4 + main_~#string_B~0.offset, 1); 1460#L25 assume !!(0 == main_#t~mem6);havoc main_#t~mem6;main_~nc_A~0 := 0; 1466#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 1450#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; 1451#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 1448#L28-1 assume !(0 != main_#t~mem7);havoc main_#t~mem7; 1449#L28-4 main_~nc_B~0 := 0; 1455#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 1456#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; 1457#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 1458#L32-1 assume !(0 != main_#t~mem9);havoc main_#t~mem9; 1452#L32-4 assume !!(main_~nc_B~0 >= main_~nc_A~0);main_~j~0 := 0;main_~i~0 := main_~j~0; 1453#L41-2 [2019-11-16 00:09:24,774 INFO L793 eck$LassoCheckResult]: Loop: 1453#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); 1454#L41 assume main_#t~mem11 == main_#t~mem12;havoc main_#t~mem12;havoc main_#t~mem11;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; 1453#L41-2 [2019-11-16 00:09:24,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:09:24,774 INFO L82 PathProgramCache]: Analyzing trace with hash 489706120, now seen corresponding path program 1 times [2019-11-16 00:09:24,774 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:09:24,774 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935567254] [2019-11-16 00:09:24,774 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:24,775 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:24,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:09:24,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:09:24,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:09:24,830 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:09:24,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:09:24,830 INFO L82 PathProgramCache]: Analyzing trace with hash 3556, now seen corresponding path program 3 times [2019-11-16 00:09:24,831 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:09:24,831 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314177994] [2019-11-16 00:09:24,831 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:24,831 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:24,831 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:09:24,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:09:24,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:09:24,838 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:09:24,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:09:24,839 INFO L82 PathProgramCache]: Analyzing trace with hash -1838818645, now seen corresponding path program 1 times [2019-11-16 00:09:24,839 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:09:24,839 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012561797] [2019-11-16 00:09:24,839 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:24,839 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:24,839 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:09:24,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:09:24,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:09:24,882 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:09:28,783 WARN L191 SmtUtils]: Spent 3.78 s on a formula simplification. DAG size of input: 264 DAG size of output: 202 [2019-11-16 00:09:28,989 WARN L191 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2019-11-16 00:09:28,991 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:09:28,992 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:09:28,992 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:09:28,992 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:09:28,992 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:09:28,992 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:09:28,992 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:09:28,992 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:09:28,992 INFO L131 ssoRankerPreferences]: Filename of dumped script: string-1.i_Iteration12_Lasso [2019-11-16 00:09:28,992 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:09:28,992 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:09:28,995 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:29,003 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:29,005 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:29,006 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:29,008 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:29,009 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:29,011 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:29,013 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:29,015 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:29,296 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 65 [2019-11-16 00:09:29,374 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:29,376 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:29,377 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:29,379 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:29,381 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:29,382 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:29,384 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:29,385 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:29,386 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:29,388 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:29,745 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:09:29,745 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:09:29,746 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:09:29,746 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:09:29,746 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:09:29,747 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:09:29,747 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:09:29,747 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:09:29,747 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:09:29,747 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:09:29,748 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:09:29,748 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:09:29,748 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:09:29,748 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:09:29,749 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:09:29,749 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:09:29,749 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:09:29,749 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:09:29,749 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:09:29,750 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:09:29,750 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:09:29,750 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:09:29,750 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:09:29,750 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:09:29,750 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:09:29,751 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:09:29,751 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:09:29,751 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:09:29,751 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:09:29,751 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:09:29,752 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:09:29,752 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:09:29,752 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:09:29,752 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:09:29,752 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:09:29,752 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:09:29,752 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:09:29,753 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:09:29,753 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:09:29,753 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:09:29,753 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:09:29,754 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:09:29,754 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:09:29,754 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:09:29,754 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:09:29,754 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:09:29,754 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:09:29,755 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:09:29,755 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:09:29,755 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:09:29,755 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:09:29,755 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:09:29,756 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:09:29,756 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:09:29,757 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:09:29,757 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:09:29,758 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:09:29,758 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:09:29,758 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:09:29,758 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:09:29,759 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:09:29,759 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:09:29,759 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:09:29,760 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:09:29,760 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:09:29,760 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:09:29,760 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:09:29,760 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:09:29,760 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:09:29,761 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:09:29,761 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:09:29,761 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:09:29,761 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:09:29,762 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:09:29,762 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:09:29,762 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:09:29,762 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:09:29,763 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:09:29,763 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:09:29,763 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:09:29,764 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:09:29,764 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:09:29,764 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:09:29,764 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:09:29,764 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:09:29,765 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:09:29,765 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:09:29,766 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:09:29,766 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:09:29,767 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:09:29,767 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:09:29,767 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:09:29,767 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:09:29,767 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:09:29,767 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:09:29,768 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:09:29,768 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:09:29,769 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:09:29,769 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:09:29,769 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:09:29,769 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:09:29,770 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:09:29,770 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:09:29,771 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:09:29,771 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:09:29,771 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:09:29,771 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:09:29,771 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:09:29,771 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:09:29,772 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:09:29,772 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:09:29,772 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:09:29,772 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:09:29,773 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:09:29,773 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:09:29,773 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-11-16 00:09:29,773 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:09:29,773 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:09:29,774 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-11-16 00:09:29,774 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:09:29,778 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:09:29,778 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:09:29,778 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:09:29,779 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:09:29,779 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:09:29,779 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:09:29,779 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:09:29,779 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:09:29,782 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:09:29,782 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:09:29,782 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:09:29,782 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:09:29,782 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:09:29,783 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:09:29,783 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:09:29,783 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:09:29,785 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:09:29,786 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:09:29,786 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:09:29,786 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-11-16 00:09:29,786 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:09:29,786 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:09:29,788 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-11-16 00:09:29,788 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:09:29,793 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:09:29,794 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:09:29,794 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:09:29,794 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:09:29,794 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:09:29,794 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:09:29,795 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:09:29,795 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:09:29,796 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:09:29,796 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:09:29,797 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:09:29,797 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:09:29,797 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:09:29,797 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:09:29,799 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:09:29,799 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:09:29,823 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:09:29,860 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-11-16 00:09:29,861 INFO L444 ModelExtractionUtils]: 22 out of 28 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-11-16 00:09:29,861 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:09:29,862 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-16 00:09:29,862 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:09:29,862 INFO L512 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 [] [2019-11-16 00:09:29,913 INFO L297 tatePredicateManager]: 14 out of 14 supporting invariants were superfluous and have been removed [2019-11-16 00:09:29,917 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-16 00:09:29,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:09:29,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:29,970 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:09:29,971 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:09:29,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:29,981 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-16 00:09:29,982 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:09:30,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:09:30,000 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-16 00:09:30,000 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 40 states and 44 transitions. cyclomatic complexity: 8 Second operand 3 states. [2019-11-16 00:09:30,026 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 40 states and 44 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 44 states and 50 transitions. Complement of second has 5 states. [2019-11-16 00:09:30,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-16 00:09:30,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-16 00:09:30,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 22 transitions. [2019-11-16 00:09:30,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 38 letters. Loop has 2 letters. [2019-11-16 00:09:30,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:09:30,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 40 letters. Loop has 2 letters. [2019-11-16 00:09:30,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:09:30,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 38 letters. Loop has 4 letters. [2019-11-16 00:09:30,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:09:30,028 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 50 transitions. [2019-11-16 00:09:30,028 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-16 00:09:30,029 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 44 states and 50 transitions. [2019-11-16 00:09:30,029 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2019-11-16 00:09:30,029 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2019-11-16 00:09:30,029 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 50 transitions. [2019-11-16 00:09:30,030 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:09:30,030 INFO L688 BuchiCegarLoop]: Abstraction has 44 states and 50 transitions. [2019-11-16 00:09:30,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states and 50 transitions. [2019-11-16 00:09:30,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-11-16 00:09:30,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-11-16 00:09:30,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2019-11-16 00:09:30,033 INFO L711 BuchiCegarLoop]: Abstraction has 44 states and 50 transitions. [2019-11-16 00:09:30,033 INFO L591 BuchiCegarLoop]: Abstraction has 44 states and 50 transitions. [2019-11-16 00:09:30,033 INFO L424 BuchiCegarLoop]: ======== Iteration 13============ [2019-11-16 00:09:30,033 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 50 transitions. [2019-11-16 00:09:30,034 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-16 00:09:30,034 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:09:30,034 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:09:30,035 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:09:30,035 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-16 00:09:30,036 INFO L791 eck$LassoCheckResult]: Stem: 1751#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1748#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~post1, main_#t~mem3, main_#t~nondet5, main_#t~post4, main_#t~mem6, main_#t~post8, main_#t~mem7, main_#t~post10, main_#t~mem9, main_#t~mem11, main_#t~mem12, main_#t~post13, main_#t~post14, main_~#string_A~0.base, main_~#string_A~0.offset, main_~#string_B~0.base, main_~#string_B~0.offset, main_~i~0, main_~j~0, main_~nc_A~0, main_~nc_B~0, main_~found~0;call main_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.allocOnStack(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.allocOnStack(5);havoc main_~i~0;havoc main_~j~0;havoc main_~nc_A~0;havoc main_~nc_B~0;main_~found~0 := 0;main_~i~0 := 0; 1725#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; 1726#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1727#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; 1728#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1759#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; 1758#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1757#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; 1756#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1755#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; 1754#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1753#L19-3 assume !(main_~i~0 < 5); 1723#L19-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 1724#L21 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 1749#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; 1750#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1746#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; 1747#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1766#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; 1765#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1764#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; 1763#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1762#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; 1761#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1760#L23-3 assume !(main_~i~0 < 5); 1744#L23-4 call main_#t~mem6 := read~int(main_~#string_B~0.base, 4 + main_~#string_B~0.offset, 1); 1745#L25 assume !!(0 == main_#t~mem6);havoc main_#t~mem6;main_~nc_A~0 := 0; 1752#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 1731#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; 1732#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 1729#L28-1 assume !(0 != main_#t~mem7);havoc main_#t~mem7; 1730#L28-4 main_~nc_B~0 := 0; 1740#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 1741#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; 1742#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 1743#L32-1 assume !(0 != main_#t~mem9);havoc main_#t~mem9; 1733#L32-4 assume !!(main_~nc_B~0 >= main_~nc_A~0);main_~j~0 := 0;main_~i~0 := main_~j~0; 1734#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); 1739#L41 assume !(main_#t~mem11 == main_#t~mem12);havoc main_#t~mem12;havoc main_#t~mem11;main_~i~0 := 1 + (main_~i~0 - main_~j~0);main_~j~0 := 0; 1735#L41-2 [2019-11-16 00:09:30,036 INFO L793 eck$LassoCheckResult]: Loop: 1735#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); 1736#L41 assume main_#t~mem11 == main_#t~mem12;havoc main_#t~mem12;havoc main_#t~mem11;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; 1735#L41-2 [2019-11-16 00:09:30,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:09:30,036 INFO L82 PathProgramCache]: Analyzing trace with hash -1838818643, now seen corresponding path program 1 times [2019-11-16 00:09:30,037 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:09:30,037 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421913995] [2019-11-16 00:09:30,037 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:30,037 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:30,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:09:30,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:09:30,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:09:30,077 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:09:30,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:09:30,078 INFO L82 PathProgramCache]: Analyzing trace with hash 3556, now seen corresponding path program 4 times [2019-11-16 00:09:30,078 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:09:30,078 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960224820] [2019-11-16 00:09:30,078 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:30,078 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:30,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:09:30,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:09:30,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:09:30,084 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:09:30,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:09:30,085 INFO L82 PathProgramCache]: Analyzing trace with hash -1873154672, now seen corresponding path program 1 times [2019-11-16 00:09:30,085 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:09:30,085 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815492127] [2019-11-16 00:09:30,085 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:30,085 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:30,086 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:09:30,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:30,146 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2019-11-16 00:09:30,147 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815492127] [2019-11-16 00:09:30,147 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [419827217] [2019-11-16 00:09:30,147 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_36c1ed6d-2c10-4884-afdf-a94e276eebcd/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:09:30,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:30,282 INFO L256 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-16 00:09:30,295 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:09:30,352 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2019-11-16 00:09:30,352 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:09:30,352 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2019-11-16 00:09:30,352 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643037602] [2019-11-16 00:09:30,472 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:09:30,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-16 00:09:30,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:09:30,473 INFO L87 Difference]: Start difference. First operand 44 states and 50 transitions. cyclomatic complexity: 11 Second operand 9 states. [2019-11-16 00:09:30,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:09:30,614 INFO L93 Difference]: Finished difference Result 59 states and 66 transitions. [2019-11-16 00:09:30,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:09:30,614 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 66 transitions. [2019-11-16 00:09:30,615 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-16 00:09:30,615 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 47 states and 53 transitions. [2019-11-16 00:09:30,616 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2019-11-16 00:09:30,616 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2019-11-16 00:09:30,616 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 53 transitions. [2019-11-16 00:09:30,616 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:09:30,616 INFO L688 BuchiCegarLoop]: Abstraction has 47 states and 53 transitions. [2019-11-16 00:09:30,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 53 transitions. [2019-11-16 00:09:30,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2019-11-16 00:09:30,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-11-16 00:09:30,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2019-11-16 00:09:30,619 INFO L711 BuchiCegarLoop]: Abstraction has 46 states and 52 transitions. [2019-11-16 00:09:30,619 INFO L591 BuchiCegarLoop]: Abstraction has 46 states and 52 transitions. [2019-11-16 00:09:30,619 INFO L424 BuchiCegarLoop]: ======== Iteration 14============ [2019-11-16 00:09:30,619 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 52 transitions. [2019-11-16 00:09:30,619 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-16 00:09:30,620 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:09:30,620 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:09:30,623 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:09:30,623 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-16 00:09:30,624 INFO L791 eck$LassoCheckResult]: Stem: 1992#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1990#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~post1, main_#t~mem3, main_#t~nondet5, main_#t~post4, main_#t~mem6, main_#t~post8, main_#t~mem7, main_#t~post10, main_#t~mem9, main_#t~mem11, main_#t~mem12, main_#t~post13, main_#t~post14, main_~#string_A~0.base, main_~#string_A~0.offset, main_~#string_B~0.base, main_~#string_B~0.offset, main_~i~0, main_~j~0, main_~nc_A~0, main_~nc_B~0, main_~found~0;call main_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.allocOnStack(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.allocOnStack(5);havoc main_~i~0;havoc main_~j~0;havoc main_~nc_A~0;havoc main_~nc_B~0;main_~found~0 := 0;main_~i~0 := 0; 1967#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; 1968#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1969#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; 1970#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 2002#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; 2001#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 2000#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; 1999#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1998#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; 1996#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1995#L19-3 assume !(main_~i~0 < 5); 1965#L19-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 1966#L21 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 1988#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; 1989#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1991#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; 2010#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 2009#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; 2008#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 2007#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; 2006#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 2005#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; 2004#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 2003#L23-3 assume !(main_~i~0 < 5); 1986#L23-4 call main_#t~mem6 := read~int(main_~#string_B~0.base, 4 + main_~#string_B~0.offset, 1); 1987#L25 assume !!(0 == main_#t~mem6);havoc main_#t~mem6;main_~nc_A~0 := 0; 1993#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 1973#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; 1974#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 1994#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; 1997#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 1971#L28-1 assume !(0 != main_#t~mem7);havoc main_#t~mem7; 1972#L28-4 main_~nc_B~0 := 0; 1982#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 1983#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; 1984#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 1985#L32-1 assume !(0 != main_#t~mem9);havoc main_#t~mem9; 1975#L32-4 assume !!(main_~nc_B~0 >= main_~nc_A~0);main_~j~0 := 0;main_~i~0 := main_~j~0; 1976#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); 1981#L41 assume !(main_#t~mem11 == main_#t~mem12);havoc main_#t~mem12;havoc main_#t~mem11;main_~i~0 := 1 + (main_~i~0 - main_~j~0);main_~j~0 := 0; 1977#L41-2 [2019-11-16 00:09:30,625 INFO L793 eck$LassoCheckResult]: Loop: 1977#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); 1978#L41 assume main_#t~mem11 == main_#t~mem12;havoc main_#t~mem12;havoc main_#t~mem11;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; 1977#L41-2 [2019-11-16 00:09:30,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:09:30,625 INFO L82 PathProgramCache]: Analyzing trace with hash -1199867054, now seen corresponding path program 2 times [2019-11-16 00:09:30,625 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:09:30,627 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641430518] [2019-11-16 00:09:30,627 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:30,627 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:30,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:09:30,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:30,754 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-11-16 00:09:30,754 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641430518] [2019-11-16 00:09:30,754 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [925990043] [2019-11-16 00:09:30,754 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_36c1ed6d-2c10-4884-afdf-a94e276eebcd/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:09:30,845 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-16 00:09:30,845 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:09:30,846 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-16 00:09:30,847 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:09:30,884 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-11-16 00:09:30,885 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:09:30,885 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2019-11-16 00:09:30,885 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347561947] [2019-11-16 00:09:30,885 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-16 00:09:30,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:09:30,886 INFO L82 PathProgramCache]: Analyzing trace with hash 3556, now seen corresponding path program 5 times [2019-11-16 00:09:30,886 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:09:30,886 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334201393] [2019-11-16 00:09:30,886 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:30,886 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:30,886 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:09:30,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:09:30,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:09:30,891 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:09:30,961 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:09:30,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-16 00:09:30,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2019-11-16 00:09:30,962 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. cyclomatic complexity: 11 Second operand 13 states. [2019-11-16 00:09:31,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:09:31,130 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2019-11-16 00:09:31,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:09:31,131 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 52 states and 58 transitions. [2019-11-16 00:09:31,131 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-16 00:09:31,132 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 52 states to 50 states and 56 transitions. [2019-11-16 00:09:31,132 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2019-11-16 00:09:31,132 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2019-11-16 00:09:31,132 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 56 transitions. [2019-11-16 00:09:31,132 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:09:31,132 INFO L688 BuchiCegarLoop]: Abstraction has 50 states and 56 transitions. [2019-11-16 00:09:31,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states and 56 transitions. [2019-11-16 00:09:31,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2019-11-16 00:09:31,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-11-16 00:09:31,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2019-11-16 00:09:31,135 INFO L711 BuchiCegarLoop]: Abstraction has 48 states and 54 transitions. [2019-11-16 00:09:31,135 INFO L591 BuchiCegarLoop]: Abstraction has 48 states and 54 transitions. [2019-11-16 00:09:31,135 INFO L424 BuchiCegarLoop]: ======== Iteration 15============ [2019-11-16 00:09:31,135 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 48 states and 54 transitions. [2019-11-16 00:09:31,136 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-16 00:09:31,136 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:09:31,136 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:09:31,137 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:09:31,137 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-16 00:09:31,137 INFO L791 eck$LassoCheckResult]: Stem: 2232#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2230#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~post1, main_#t~mem3, main_#t~nondet5, main_#t~post4, main_#t~mem6, main_#t~post8, main_#t~mem7, main_#t~post10, main_#t~mem9, main_#t~mem11, main_#t~mem12, main_#t~post13, main_#t~post14, main_~#string_A~0.base, main_~#string_A~0.offset, main_~#string_B~0.base, main_~#string_B~0.offset, main_~i~0, main_~j~0, main_~nc_A~0, main_~nc_B~0, main_~found~0;call main_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.allocOnStack(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.allocOnStack(5);havoc main_~i~0;havoc main_~j~0;havoc main_~nc_A~0;havoc main_~nc_B~0;main_~found~0 := 0;main_~i~0 := 0; 2206#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; 2207#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 2208#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; 2209#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 2243#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; 2242#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 2241#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; 2239#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 2238#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; 2236#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 2235#L19-3 assume !(main_~i~0 < 5); 2204#L19-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 2205#L21 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 2227#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; 2228#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 2231#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; 2251#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 2250#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; 2249#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 2248#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; 2247#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 2246#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; 2245#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 2244#L23-3 assume !(main_~i~0 < 5); 2225#L23-4 call main_#t~mem6 := read~int(main_~#string_B~0.base, 4 + main_~#string_B~0.offset, 1); 2226#L25 assume !!(0 == main_#t~mem6);havoc main_#t~mem6;main_~nc_A~0 := 0; 2233#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 2212#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; 2213#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 2234#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; 2237#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 2210#L28-1 assume !(0 != main_#t~mem7);havoc main_#t~mem7; 2211#L28-4 main_~nc_B~0 := 0; 2221#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 2222#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; 2223#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 2224#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; 2240#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 2229#L32-1 assume !(0 != main_#t~mem9);havoc main_#t~mem9; 2214#L32-4 assume !!(main_~nc_B~0 >= main_~nc_A~0);main_~j~0 := 0;main_~i~0 := main_~j~0; 2215#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); 2220#L41 assume !(main_#t~mem11 == main_#t~mem12);havoc main_#t~mem12;havoc main_#t~mem11;main_~i~0 := 1 + (main_~i~0 - main_~j~0);main_~j~0 := 0; 2216#L41-2 [2019-11-16 00:09:31,137 INFO L793 eck$LassoCheckResult]: Loop: 2216#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); 2217#L41 assume main_#t~mem11 == main_#t~mem12;havoc main_#t~mem12;havoc main_#t~mem11;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; 2216#L41-2 [2019-11-16 00:09:31,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:09:31,138 INFO L82 PathProgramCache]: Analyzing trace with hash -1976327923, now seen corresponding path program 3 times [2019-11-16 00:09:31,138 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:09:31,138 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339066996] [2019-11-16 00:09:31,138 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:31,138 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:31,138 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:09:31,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:09:31,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:09:31,195 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:09:31,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:09:31,195 INFO L82 PathProgramCache]: Analyzing trace with hash 3556, now seen corresponding path program 6 times [2019-11-16 00:09:31,195 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:09:31,195 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307449626] [2019-11-16 00:09:31,196 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:31,196 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:31,196 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:09:31,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:09:31,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:09:31,201 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:09:31,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:09:31,202 INFO L82 PathProgramCache]: Analyzing trace with hash -875586576, now seen corresponding path program 2 times [2019-11-16 00:09:31,202 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:09:31,202 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810857426] [2019-11-16 00:09:31,202 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:31,203 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:31,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:09:31,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:09:31,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:09:31,262 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:09:33,902 WARN L191 SmtUtils]: Spent 2.53 s on a formula simplification. DAG size of input: 313 DAG size of output: 236 [2019-11-16 00:09:34,141 WARN L191 SmtUtils]: Spent 230.00 ms on a formula simplification that was a NOOP. DAG size: 131 [2019-11-16 00:09:34,144 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:09:34,144 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:09:34,144 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:09:34,144 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:09:34,144 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:09:34,144 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:09:34,144 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:09:34,144 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:09:34,144 INFO L131 ssoRankerPreferences]: Filename of dumped script: string-1.i_Iteration15_Lasso [2019-11-16 00:09:34,144 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:09:34,144 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:09:34,146 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:34,149 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:34,151 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:34,152 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:34,156 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:34,158 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:34,159 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:34,160 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:34,719 WARN L191 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 83 [2019-11-16 00:09:34,822 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:34,842 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:34,843 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:34,845 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:34,847 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:34,849 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:34,850 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:34,854 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:34,855 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:34,857 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:34,860 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:35,790 WARN L191 SmtUtils]: Spent 610.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 45 [2019-11-16 00:09:35,904 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:09:35,904 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:09:35,904 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:09:35,905 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:09:35,905 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:09:35,905 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:09:35,905 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:09:35,905 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:09:35,905 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:09:35,905 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:09:35,906 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:09:35,906 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:09:35,906 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:09:35,906 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:09:35,907 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:09:35,907 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:09:35,907 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:09:35,907 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:09:35,907 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:09:35,907 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:09:35,907 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:09:35,908 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:09:35,908 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:09:35,908 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:09:35,908 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:09:35,908 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:09:35,908 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:09:35,908 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:09:35,908 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:09:35,909 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:09:35,909 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:09:35,909 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:09:35,909 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:09:35,909 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:09:35,910 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:09:35,910 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:09:35,911 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:09:35,911 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:09:35,911 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:09:35,911 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:09:35,912 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:09:35,912 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:09:35,912 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:09:35,913 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:09:35,913 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:09:35,914 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:09:35,914 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:09:35,914 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:09:35,914 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:09:35,914 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:09:35,914 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:09:35,915 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:09:35,915 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:09:35,915 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:09:35,915 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:09:35,915 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:09:35,916 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:09:35,916 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:09:35,916 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:09:35,916 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:09:35,916 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:09:35,916 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:09:35,916 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:09:35,917 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:09:35,917 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:09:35,917 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-11-16 00:09:35,917 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:09:35,917 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:09:35,918 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-11-16 00:09:35,918 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:09:35,922 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:09:35,922 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:09:35,923 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:09:35,923 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:09:35,923 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:09:35,923 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:09:35,924 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:09:35,924 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:09:35,925 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:09:35,930 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:09:35,930 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:09:35,931 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-16 00:09:35,931 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:09:35,931 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:09:35,931 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-16 00:09:35,932 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:09:35,933 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:09:35,933 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:09:35,934 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:09:35,935 INFO L202 nArgumentSynthesizer]: 12 stem disjuncts [2019-11-16 00:09:35,935 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:09:35,935 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:09:35,938 INFO L400 nArgumentSynthesizer]: We have 28 Motzkin's Theorem applications. [2019-11-16 00:09:35,938 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:09:35,964 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:09:35,964 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:09:35,965 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:09:35,965 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:09:35,965 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:09:35,965 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:09:35,966 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:09:35,966 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:09:35,967 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:09:35,967 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:09:35,968 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:09:35,968 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:09:35,969 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:09:35,969 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:09:35,969 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:09:35,969 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:09:35,970 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:09:35,971 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:09:35,971 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:09:35,972 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:09:35,972 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:09:35,972 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:09:35,972 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:09:35,972 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:09:35,972 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:09:35,974 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:09:35,975 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:09:35,975 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:09:35,976 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:09:35,976 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:09:35,976 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:09:35,976 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:09:35,976 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:09:35,976 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:09:35,977 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:09:35,977 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:09:35,978 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:09:35,979 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:09:35,979 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:09:35,979 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:09:35,980 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:09:35,980 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:09:35,982 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:09:35,982 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:09:35,983 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:09:35,983 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:09:35,983 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:09:35,983 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:09:35,984 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:09:35,984 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:09:35,986 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:09:35,987 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:09:35,987 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:09:35,987 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:09:35,988 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:09:35,988 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:09:35,988 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:09:35,988 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:09:35,989 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:09:35,990 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:09:35,990 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:09:35,990 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:09:35,990 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:09:35,991 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:09:35,992 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:09:35,992 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:09:35,993 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:09:35,993 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:09:35,994 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:09:35,994 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:09:35,995 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:09:35,995 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:09:35,995 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:09:35,995 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:09:35,995 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:09:35,996 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:09:35,996 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:09:35,997 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:09:35,997 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:09:35,997 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:09:35,997 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:09:35,997 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:09:35,998 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:09:35,998 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:09:35,998 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:09:35,998 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:09:35,999 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:09:35,999 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:09:35,999 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:09:36,000 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:09:36,002 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:09:36,002 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:09:36,042 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:09:36,078 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-11-16 00:09:36,078 INFO L444 ModelExtractionUtils]: 22 out of 28 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-11-16 00:09:36,078 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:09:36,079 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-16 00:09:36,079 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:09:36,079 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0) = -2*ULTIMATE.start_main_~j~0 + 1 Supporting invariants [] [2019-11-16 00:09:36,258 INFO L297 tatePredicateManager]: 38 out of 41 supporting invariants were superfluous and have been removed [2019-11-16 00:09:36,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:09:36,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:36,330 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-16 00:09:36,334 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:09:36,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:36,531 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-16 00:09:36,531 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:09:36,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:09:36,561 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.9 stem predicates 2 loop predicates [2019-11-16 00:09:36,561 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 48 states and 54 transitions. cyclomatic complexity: 11 Second operand 11 states. [2019-11-16 00:09:36,765 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 48 states and 54 transitions. cyclomatic complexity: 11. Second operand 11 states. Result 79 states and 95 transitions. Complement of second has 14 states. [2019-11-16 00:09:36,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 9 stem states 1 non-accepting loop states 2 accepting loop states [2019-11-16 00:09:36,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-11-16 00:09:36,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 51 transitions. [2019-11-16 00:09:36,766 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 51 transitions. Stem has 44 letters. Loop has 2 letters. [2019-11-16 00:09:36,766 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:09:36,766 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 51 transitions. Stem has 46 letters. Loop has 2 letters. [2019-11-16 00:09:36,766 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:09:36,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 51 transitions. Stem has 44 letters. Loop has 4 letters. [2019-11-16 00:09:36,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:09:36,767 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 79 states and 95 transitions. [2019-11-16 00:09:36,768 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-16 00:09:36,769 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 79 states to 79 states and 95 transitions. [2019-11-16 00:09:36,769 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2019-11-16 00:09:36,769 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 43 [2019-11-16 00:09:36,769 INFO L73 IsDeterministic]: Start isDeterministic. Operand 79 states and 95 transitions. [2019-11-16 00:09:36,769 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:09:36,769 INFO L688 BuchiCegarLoop]: Abstraction has 79 states and 95 transitions. [2019-11-16 00:09:36,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states and 95 transitions. [2019-11-16 00:09:36,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 63. [2019-11-16 00:09:36,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-11-16 00:09:36,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 73 transitions. [2019-11-16 00:09:36,774 INFO L711 BuchiCegarLoop]: Abstraction has 63 states and 73 transitions. [2019-11-16 00:09:36,774 INFO L591 BuchiCegarLoop]: Abstraction has 63 states and 73 transitions. [2019-11-16 00:09:36,774 INFO L424 BuchiCegarLoop]: ======== Iteration 16============ [2019-11-16 00:09:36,774 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 63 states and 73 transitions. [2019-11-16 00:09:36,775 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-16 00:09:36,775 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:09:36,775 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:09:36,776 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:09:36,776 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-16 00:09:36,776 INFO L791 eck$LassoCheckResult]: Stem: 2718#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2713#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~post1, main_#t~mem3, main_#t~nondet5, main_#t~post4, main_#t~mem6, main_#t~post8, main_#t~mem7, main_#t~post10, main_#t~mem9, main_#t~mem11, main_#t~mem12, main_#t~post13, main_#t~post14, main_~#string_A~0.base, main_~#string_A~0.offset, main_~#string_B~0.base, main_~#string_B~0.offset, main_~i~0, main_~j~0, main_~nc_A~0, main_~nc_B~0, main_~found~0;call main_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.allocOnStack(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.allocOnStack(5);havoc main_~i~0;havoc main_~j~0;havoc main_~nc_A~0;havoc main_~nc_B~0;main_~found~0 := 0;main_~i~0 := 0; 2690#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; 2691#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 2692#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; 2693#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 2738#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; 2736#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 2734#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; 2732#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 2730#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; 2726#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 2725#L19-3 assume !(main_~i~0 < 5); 2688#L19-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 2689#L21 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 2711#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; 2712#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 2717#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; 2739#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 2737#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; 2735#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 2733#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; 2731#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 2729#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; 2728#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 2727#L23-3 assume !(main_~i~0 < 5); 2709#L23-4 call main_#t~mem6 := read~int(main_~#string_B~0.base, 4 + main_~#string_B~0.offset, 1); 2710#L25 assume !!(0 == main_#t~mem6);havoc main_#t~mem6;main_~nc_A~0 := 0; 2721#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 2722#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; 2723#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 2724#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; 2740#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 2741#L28-1 assume !(0 != main_#t~mem7);havoc main_#t~mem7; 2719#L28-4 main_~nc_B~0 := 0; 2720#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 2715#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; 2716#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 2750#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; 2749#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 2708#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; 2742#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 2714#L32-1 assume !(0 != main_#t~mem9);havoc main_#t~mem9; 2698#L32-4 assume !!(main_~nc_B~0 >= main_~nc_A~0);main_~j~0 := 0;main_~i~0 := main_~j~0; 2699#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); 2704#L41 assume !(main_#t~mem11 == main_#t~mem12);havoc main_#t~mem12;havoc main_#t~mem11;main_~i~0 := 1 + (main_~i~0 - main_~j~0);main_~j~0 := 0; 2700#L41-2 [2019-11-16 00:09:36,776 INFO L793 eck$LassoCheckResult]: Loop: 2700#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); 2701#L41 assume main_#t~mem11 == main_#t~mem12;havoc main_#t~mem12;havoc main_#t~mem11;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; 2700#L41-2 [2019-11-16 00:09:36,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:09:36,777 INFO L82 PathProgramCache]: Analyzing trace with hash -830913528, now seen corresponding path program 4 times [2019-11-16 00:09:36,777 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:09:36,777 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952924549] [2019-11-16 00:09:36,777 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:36,777 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:36,778 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:09:36,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:09:36,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:09:36,813 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:09:36,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:09:36,813 INFO L82 PathProgramCache]: Analyzing trace with hash 3556, now seen corresponding path program 7 times [2019-11-16 00:09:36,813 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:09:36,813 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242329465] [2019-11-16 00:09:36,814 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:36,814 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:36,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:09:36,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:09:36,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:09:36,819 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:09:36,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:09:36,819 INFO L82 PathProgramCache]: Analyzing trace with hash 356019243, now seen corresponding path program 3 times [2019-11-16 00:09:36,819 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:09:36,820 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061299412] [2019-11-16 00:09:36,820 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:36,820 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:36,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:09:36,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:09:36,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:09:36,865 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:09:39,910 WARN L191 SmtUtils]: Spent 2.98 s on a formula simplification. DAG size of input: 325 DAG size of output: 245 [2019-11-16 00:09:40,053 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2019-11-16 00:09:40,056 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:09:40,056 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:09:40,056 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:09:40,056 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:09:40,056 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:09:40,056 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:09:40,056 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:09:40,056 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:09:40,056 INFO L131 ssoRankerPreferences]: Filename of dumped script: string-1.i_Iteration16_Lasso [2019-11-16 00:09:40,056 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:09:40,057 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:09:40,059 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:40,060 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:40,062 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:40,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:40,066 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:40,067 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:40,069 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:40,070 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:40,080 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:40,081 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:40,578 WARN L191 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 78 [2019-11-16 00:09:40,668 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:40,674 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:40,675 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:40,677 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:40,678 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:40,680 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:40,681 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:40,682 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:40,683 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:41,342 WARN L191 SmtUtils]: Spent 449.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 42 [2019-11-16 00:09:41,504 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:09:41,504 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:09:41,504 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:09:41,505 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:09:41,505 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:09:41,505 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:09:41,505 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:09:41,505 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:09:41,505 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:09:41,505 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:09:41,506 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:09:41,506 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:09:41,506 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:09:41,506 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:09:41,506 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:09:41,507 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:09:41,507 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:09:41,507 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:09:41,508 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:09:41,508 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:09:41,508 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:09:41,508 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:09:41,509 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:09:41,509 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:09:41,509 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:09:41,509 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:09:41,509 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:09:41,509 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:09:41,509 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:09:41,510 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:09:41,510 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:09:41,510 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:09:41,510 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:09:41,510 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:09:41,511 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:09:41,511 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:09:41,512 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:09:41,512 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:09:41,512 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:09:41,512 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:09:41,512 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:09:41,512 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:09:41,513 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:09:41,513 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:09:41,513 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:09:41,513 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:09:41,514 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:09:41,514 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:09:41,514 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:09:41,514 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:09:41,514 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:09:41,514 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:09:41,515 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:09:41,515 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:09:41,516 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:09:41,516 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:09:41,516 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:09:41,516 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:09:41,516 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:09:41,516 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:09:41,516 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:09:41,518 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:09:41,519 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:09:41,519 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:09:41,519 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:09:41,520 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:09:41,520 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:09:41,520 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:09:41,520 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:09:41,520 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:09:41,521 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:09:41,521 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:09:41,521 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:09:41,521 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:09:41,522 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:09:41,522 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:09:41,522 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:09:41,522 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:09:41,522 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:09:41,523 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:09:41,523 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:09:41,523 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:09:41,523 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:09:41,524 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:09:41,524 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:09:41,524 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:09:41,524 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:09:41,526 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:09:41,527 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:09:41,527 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:09:41,527 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:09:41,527 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:09:41,528 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:09:41,528 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:09:41,528 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:09:41,529 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:09:41,529 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:09:41,530 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:09:41,530 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:09:41,530 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:09:41,530 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:09:41,531 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:09:41,531 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:09:41,533 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:09:41,533 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:09:41,534 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:09:41,534 INFO L202 nArgumentSynthesizer]: 12 stem disjuncts [2019-11-16 00:09:41,534 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:09:41,534 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:09:41,537 INFO L400 nArgumentSynthesizer]: We have 28 Motzkin's Theorem applications. [2019-11-16 00:09:41,537 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:09:41,553 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:09:41,553 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:09:41,554 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:09:41,554 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-16 00:09:41,554 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:09:41,554 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:09:41,555 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-16 00:09:41,555 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:09:41,556 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:09:41,556 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:09:41,557 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:09:41,557 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:09:41,557 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:09:41,557 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:09:41,559 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:09:41,559 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:09:41,575 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:09:41,592 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-11-16 00:09:41,592 INFO L444 ModelExtractionUtils]: 23 out of 28 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-11-16 00:09:41,592 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:09:41,593 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-16 00:09:41,593 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:09:41,593 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 3 Supporting invariants [] [2019-11-16 00:09:41,747 INFO L297 tatePredicateManager]: 39 out of 40 supporting invariants were superfluous and have been removed [2019-11-16 00:09:41,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:09:41,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:41,810 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-16 00:09:41,811 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:09:41,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:41,950 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-16 00:09:41,950 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:09:41,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:09:41,968 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 2 loop predicates [2019-11-16 00:09:41,968 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 63 states and 73 transitions. cyclomatic complexity: 16 Second operand 6 states. [2019-11-16 00:09:42,059 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 63 states and 73 transitions. cyclomatic complexity: 16. Second operand 6 states. Result 84 states and 104 transitions. Complement of second has 9 states. [2019-11-16 00:09:42,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 4 stem states 1 non-accepting loop states 2 accepting loop states [2019-11-16 00:09:42,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-11-16 00:09:42,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 40 transitions. [2019-11-16 00:09:42,061 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 40 transitions. Stem has 46 letters. Loop has 2 letters. [2019-11-16 00:09:42,061 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:09:42,061 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 40 transitions. Stem has 48 letters. Loop has 2 letters. [2019-11-16 00:09:42,061 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:09:42,061 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 40 transitions. Stem has 46 letters. Loop has 4 letters. [2019-11-16 00:09:42,061 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:09:42,061 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84 states and 104 transitions. [2019-11-16 00:09:42,063 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-16 00:09:42,063 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84 states to 82 states and 100 transitions. [2019-11-16 00:09:42,063 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2019-11-16 00:09:42,064 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2019-11-16 00:09:42,064 INFO L73 IsDeterministic]: Start isDeterministic. Operand 82 states and 100 transitions. [2019-11-16 00:09:42,064 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:09:42,064 INFO L688 BuchiCegarLoop]: Abstraction has 82 states and 100 transitions. [2019-11-16 00:09:42,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states and 100 transitions. [2019-11-16 00:09:42,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 63. [2019-11-16 00:09:42,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-11-16 00:09:42,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 73 transitions. [2019-11-16 00:09:42,067 INFO L711 BuchiCegarLoop]: Abstraction has 63 states and 73 transitions. [2019-11-16 00:09:42,067 INFO L591 BuchiCegarLoop]: Abstraction has 63 states and 73 transitions. [2019-11-16 00:09:42,067 INFO L424 BuchiCegarLoop]: ======== Iteration 17============ [2019-11-16 00:09:42,067 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 63 states and 73 transitions. [2019-11-16 00:09:42,068 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-16 00:09:42,068 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:09:42,068 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:09:42,073 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:09:42,073 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-16 00:09:42,074 INFO L791 eck$LassoCheckResult]: Stem: 3209#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3203#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~post1, main_#t~mem3, main_#t~nondet5, main_#t~post4, main_#t~mem6, main_#t~post8, main_#t~mem7, main_#t~post10, main_#t~mem9, main_#t~mem11, main_#t~mem12, main_#t~post13, main_#t~post14, main_~#string_A~0.base, main_~#string_A~0.offset, main_~#string_B~0.base, main_~#string_B~0.offset, main_~i~0, main_~j~0, main_~nc_A~0, main_~nc_B~0, main_~found~0;call main_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.allocOnStack(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.allocOnStack(5);havoc main_~i~0;havoc main_~j~0;havoc main_~nc_A~0;havoc main_~nc_B~0;main_~found~0 := 0;main_~i~0 := 0; 3180#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; 3181#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 3182#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; 3183#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 3228#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; 3226#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 3224#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; 3222#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 3220#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; 3216#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 3215#L19-3 assume !(main_~i~0 < 5); 3178#L19-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 3179#L21 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 3201#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; 3202#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 3208#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; 3229#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 3227#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; 3225#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 3223#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; 3221#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 3219#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; 3218#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 3217#L23-3 assume !(main_~i~0 < 5); 3199#L23-4 call main_#t~mem6 := read~int(main_~#string_B~0.base, 4 + main_~#string_B~0.offset, 1); 3200#L25 assume !!(0 == main_#t~mem6);havoc main_#t~mem6;main_~nc_A~0 := 0; 3212#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 3213#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; 3214#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 3186#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; 3187#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 3184#L28-1 assume !(0 != main_#t~mem7);havoc main_#t~mem7; 3185#L28-4 main_~nc_B~0 := 0; 3195#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 3196#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; 3197#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 3198#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; 3233#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 3204#L32-1 assume !(0 != main_#t~mem9);havoc main_#t~mem9; 3205#L32-4 assume !!(main_~nc_B~0 >= main_~nc_A~0);main_~j~0 := 0;main_~i~0 := main_~j~0; 3235#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); 3234#L41 assume !(main_#t~mem11 == main_#t~mem12);havoc main_#t~mem12;havoc main_#t~mem11;main_~i~0 := 1 + (main_~i~0 - main_~j~0);main_~j~0 := 0; 3189#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); 3193#L41 assume !(main_#t~mem11 == main_#t~mem12);havoc main_#t~mem12;havoc main_#t~mem11;main_~i~0 := 1 + (main_~i~0 - main_~j~0);main_~j~0 := 0; 3190#L41-2 [2019-11-16 00:09:42,074 INFO L793 eck$LassoCheckResult]: Loop: 3190#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); 3191#L41 assume main_#t~mem11 == main_#t~mem12;havoc main_#t~mem12;havoc main_#t~mem11;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; 3190#L41-2 [2019-11-16 00:09:42,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:09:42,074 INFO L82 PathProgramCache]: Analyzing trace with hash -875586574, now seen corresponding path program 5 times [2019-11-16 00:09:42,074 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:09:42,074 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185099227] [2019-11-16 00:09:42,075 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:42,075 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:42,075 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:09:42,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:09:42,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:09:42,124 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:09:42,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:09:42,124 INFO L82 PathProgramCache]: Analyzing trace with hash 3556, now seen corresponding path program 8 times [2019-11-16 00:09:42,124 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:09:42,124 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594822203] [2019-11-16 00:09:42,125 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:42,125 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:42,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:09:42,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:09:42,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:09:42,130 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:09:42,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:09:42,131 INFO L82 PathProgramCache]: Analyzing trace with hash 374894997, now seen corresponding path program 4 times [2019-11-16 00:09:42,131 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:09:42,131 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599509182] [2019-11-16 00:09:42,131 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:42,132 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:42,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:09:42,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:42,248 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-11-16 00:09:42,248 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599509182] [2019-11-16 00:09:42,248 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1225329535] [2019-11-16 00:09:42,248 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_36c1ed6d-2c10-4884-afdf-a94e276eebcd/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:09:42,375 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-16 00:09:42,376 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:09:42,377 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-16 00:09:42,378 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:09:42,516 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-11-16 00:09:42,516 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:09:42,517 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2019-11-16 00:09:42,517 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340908917] [2019-11-16 00:09:42,568 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:09:42,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-16 00:09:42,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2019-11-16 00:09:42,568 INFO L87 Difference]: Start difference. First operand 63 states and 73 transitions. cyclomatic complexity: 17 Second operand 14 states. [2019-11-16 00:09:42,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:09:42,856 INFO L93 Difference]: Finished difference Result 101 states and 115 transitions. [2019-11-16 00:09:42,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-16 00:09:42,858 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 101 states and 115 transitions. [2019-11-16 00:09:42,859 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-16 00:09:42,859 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 101 states to 54 states and 60 transitions. [2019-11-16 00:09:42,859 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2019-11-16 00:09:42,859 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2019-11-16 00:09:42,860 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 60 transitions. [2019-11-16 00:09:42,860 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:09:42,860 INFO L688 BuchiCegarLoop]: Abstraction has 54 states and 60 transitions. [2019-11-16 00:09:42,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 60 transitions. [2019-11-16 00:09:42,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2019-11-16 00:09:42,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-11-16 00:09:42,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 58 transitions. [2019-11-16 00:09:42,862 INFO L711 BuchiCegarLoop]: Abstraction has 52 states and 58 transitions. [2019-11-16 00:09:42,862 INFO L591 BuchiCegarLoop]: Abstraction has 52 states and 58 transitions. [2019-11-16 00:09:42,862 INFO L424 BuchiCegarLoop]: ======== Iteration 18============ [2019-11-16 00:09:42,862 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states and 58 transitions. [2019-11-16 00:09:42,863 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-16 00:09:42,863 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:09:42,863 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:09:42,864 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:09:42,864 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-16 00:09:42,864 INFO L791 eck$LassoCheckResult]: Stem: 3553#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3551#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~post1, main_#t~mem3, main_#t~nondet5, main_#t~post4, main_#t~mem6, main_#t~post8, main_#t~mem7, main_#t~post10, main_#t~mem9, main_#t~mem11, main_#t~mem12, main_#t~post13, main_#t~post14, main_~#string_A~0.base, main_~#string_A~0.offset, main_~#string_B~0.base, main_~#string_B~0.offset, main_~i~0, main_~j~0, main_~nc_A~0, main_~nc_B~0, main_~found~0;call main_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.allocOnStack(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.allocOnStack(5);havoc main_~i~0;havoc main_~j~0;havoc main_~nc_A~0;havoc main_~nc_B~0;main_~found~0 := 0;main_~i~0 := 0; 3526#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; 3527#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 3528#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; 3529#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 3565#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; 3564#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 3563#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; 3561#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 3560#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; 3558#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 3557#L19-3 assume !(main_~i~0 < 5); 3524#L19-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 3525#L21 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 3547#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; 3548#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 3552#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; 3573#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 3572#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; 3571#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 3570#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; 3569#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 3568#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; 3567#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 3566#L23-3 assume !(main_~i~0 < 5); 3545#L23-4 call main_#t~mem6 := read~int(main_~#string_B~0.base, 4 + main_~#string_B~0.offset, 1); 3546#L25 assume !!(0 == main_#t~mem6);havoc main_#t~mem6;main_~nc_A~0 := 0; 3554#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 3555#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; 3575#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 3532#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; 3533#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 3556#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; 3559#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 3530#L28-1 assume !(0 != main_#t~mem7);havoc main_#t~mem7; 3531#L28-4 main_~nc_B~0 := 0; 3541#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 3542#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; 3550#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 3574#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; 3543#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 3544#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; 3562#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 3549#L32-1 assume !(0 != main_#t~mem9);havoc main_#t~mem9; 3534#L32-4 assume !!(main_~nc_B~0 >= main_~nc_A~0);main_~j~0 := 0;main_~i~0 := main_~j~0; 3535#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); 3539#L41 assume !(main_#t~mem11 == main_#t~mem12);havoc main_#t~mem12;havoc main_#t~mem11;main_~i~0 := 1 + (main_~i~0 - main_~j~0);main_~j~0 := 0; 3536#L41-2 [2019-11-16 00:09:42,864 INFO L793 eck$LassoCheckResult]: Loop: 3536#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); 3537#L41 assume main_#t~mem11 == main_#t~mem12;havoc main_#t~mem12;havoc main_#t~mem11;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; 3536#L41-2 [2019-11-16 00:09:42,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:09:42,864 INFO L82 PathProgramCache]: Analyzing trace with hash 1312494829, now seen corresponding path program 6 times [2019-11-16 00:09:42,865 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:09:42,865 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511182901] [2019-11-16 00:09:42,865 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:42,865 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:42,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:09:42,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:09:42,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:09:42,917 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:09:42,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:09:42,919 INFO L82 PathProgramCache]: Analyzing trace with hash 3556, now seen corresponding path program 9 times [2019-11-16 00:09:42,919 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:09:42,919 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838593189] [2019-11-16 00:09:42,919 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:42,919 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:42,919 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:09:42,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:09:42,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:09:42,928 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:09:42,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:09:42,929 INFO L82 PathProgramCache]: Analyzing trace with hash -1412851760, now seen corresponding path program 5 times [2019-11-16 00:09:42,929 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:09:42,929 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726771500] [2019-11-16 00:09:42,929 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:42,930 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:42,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:09:42,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:09:42,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:09:42,997 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:09:45,853 WARN L191 SmtUtils]: Spent 2.78 s on a formula simplification. DAG size of input: 337 DAG size of output: 252 [2019-11-16 00:09:46,030 WARN L191 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 135 [2019-11-16 00:09:46,032 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:09:46,032 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:09:46,033 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:09:46,033 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:09:46,033 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:09:46,033 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:09:46,033 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:09:46,033 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:09:46,033 INFO L131 ssoRankerPreferences]: Filename of dumped script: string-1.i_Iteration18_Lasso [2019-11-16 00:09:46,033 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:09:46,033 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:09:46,036 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:46,040 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:46,049 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:46,051 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:46,053 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:46,054 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:46,055 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:46,057 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:46,071 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:46,073 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:46,075 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:46,076 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:46,077 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:46,706 WARN L191 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 81 [2019-11-16 00:09:46,814 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:46,815 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:46,817 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:46,818 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:46,819 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:46,821 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:47,673 WARN L191 SmtUtils]: Spent 554.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 45 [2019-11-16 00:09:47,751 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:09:47,751 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:09:47,753 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:09:47,754 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:09:47,754 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:09:47,754 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:09:47,754 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:09:47,754 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:09:47,754 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:09:47,754 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:09:47,755 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:09:47,755 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:09:47,755 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:09:47,755 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:09:47,755 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:09:47,755 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:09:47,755 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:09:47,756 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:09:47,756 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:09:47,756 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:09:47,756 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:09:47,756 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:09:47,756 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:09:47,756 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:09:47,756 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:09:47,757 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:09:47,757 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:09:47,757 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:09:47,758 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:09:47,758 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:09:47,758 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:09:47,759 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:09:47,759 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:09:47,759 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:09:47,759 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:09:47,759 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:09:47,760 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:09:47,760 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:09:47,760 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:09:47,760 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:09:47,761 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:09:47,761 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:09:47,761 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:09:47,761 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:09:47,761 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:09:47,762 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:09:47,762 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:09:47,762 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:09:47,762 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:09:47,763 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:09:47,763 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:09:47,763 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:09:47,763 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:09:47,763 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:09:47,764 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:09:47,764 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:09:47,764 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:09:47,765 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:09:47,765 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:09:47,765 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:09:47,765 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:09:47,766 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:09:47,766 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:09:47,767 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:09:47,767 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:09:47,767 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:09:47,767 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:09:47,768 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:09:47,768 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:09:47,768 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:09:47,769 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:09:47,769 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:09:47,770 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:09:47,770 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:09:47,770 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:09:47,770 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:09:47,770 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:09:47,771 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:09:47,771 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:09:47,771 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:09:47,771 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:09:47,772 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:09:47,772 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:09:47,772 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:09:47,772 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:09:47,773 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:09:47,773 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:09:47,773 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:09:47,773 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:09:47,774 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:09:47,774 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:09:47,774 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:09:47,774 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:09:47,775 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:09:47,775 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:09:47,775 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:09:47,775 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:09:47,775 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:09:47,776 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:09:47,776 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:09:47,776 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:09:47,777 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:09:47,777 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:09:47,777 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:09:47,777 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:09:47,777 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:09:47,778 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:09:47,778 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:09:47,778 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:09:47,778 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:09:47,779 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:09:47,779 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:09:47,779 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:09:47,779 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:09:47,780 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:09:47,781 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:09:47,781 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:09:47,781 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:09:47,781 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:09:47,781 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:09:47,782 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:09:47,782 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:09:47,782 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:09:47,782 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:09:47,783 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:09:47,783 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:09:47,783 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-16 00:09:47,783 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:09:47,784 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:09:47,784 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-16 00:09:47,784 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:09:47,786 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:09:47,786 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:09:47,786 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:09:47,787 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:09:47,787 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:09:47,787 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:09:47,787 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:09:47,788 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:09:47,789 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:09:47,790 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:09:47,790 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:09:47,790 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-16 00:09:47,791 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:09:47,791 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:09:47,791 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-16 00:09:47,791 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:09:47,793 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:09:47,793 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:09:47,793 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:09:47,794 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:09:47,794 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:09:47,794 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:09:47,794 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:09:47,794 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:09:47,795 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:09:47,796 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:09:47,796 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:09:47,796 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-16 00:09:47,796 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:09:47,796 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:09:47,797 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-16 00:09:47,797 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:09:47,798 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:09:47,799 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:09:47,799 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:09:47,799 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:09:47,800 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:09:47,800 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:09:47,801 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:09:47,802 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:09:47,819 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:09:47,837 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-16 00:09:47,838 INFO L444 ModelExtractionUtils]: 24 out of 28 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-16 00:09:47,838 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:09:47,839 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-16 00:09:47,839 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:09:47,839 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0) = -2*ULTIMATE.start_main_~j~0 + 5 Supporting invariants [] [2019-11-16 00:09:48,102 INFO L297 tatePredicateManager]: 57 out of 59 supporting invariants were superfluous and have been removed [2019-11-16 00:09:48,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:09:48,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:48,169 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-16 00:09:48,170 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:09:48,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:48,380 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-16 00:09:48,380 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:09:48,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:09:48,417 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.10 stem predicates 2 loop predicates [2019-11-16 00:09:48,418 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 52 states and 58 transitions. cyclomatic complexity: 11 Second operand 12 states. [2019-11-16 00:09:48,641 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 52 states and 58 transitions. cyclomatic complexity: 11. Second operand 12 states. Result 85 states and 101 transitions. Complement of second has 15 states. [2019-11-16 00:09:48,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 13 states 10 stem states 1 non-accepting loop states 2 accepting loop states [2019-11-16 00:09:48,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-11-16 00:09:48,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 55 transitions. [2019-11-16 00:09:48,642 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 55 transitions. Stem has 48 letters. Loop has 2 letters. [2019-11-16 00:09:48,643 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:09:48,643 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 55 transitions. Stem has 50 letters. Loop has 2 letters. [2019-11-16 00:09:48,643 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:09:48,643 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 55 transitions. Stem has 48 letters. Loop has 4 letters. [2019-11-16 00:09:48,643 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:09:48,643 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 85 states and 101 transitions. [2019-11-16 00:09:48,644 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-16 00:09:48,645 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 85 states to 85 states and 101 transitions. [2019-11-16 00:09:48,645 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2019-11-16 00:09:48,645 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 43 [2019-11-16 00:09:48,645 INFO L73 IsDeterministic]: Start isDeterministic. Operand 85 states and 101 transitions. [2019-11-16 00:09:48,645 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:09:48,645 INFO L688 BuchiCegarLoop]: Abstraction has 85 states and 101 transitions. [2019-11-16 00:09:48,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states and 101 transitions. [2019-11-16 00:09:48,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 69. [2019-11-16 00:09:48,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-11-16 00:09:48,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 79 transitions. [2019-11-16 00:09:48,648 INFO L711 BuchiCegarLoop]: Abstraction has 69 states and 79 transitions. [2019-11-16 00:09:48,648 INFO L591 BuchiCegarLoop]: Abstraction has 69 states and 79 transitions. [2019-11-16 00:09:48,648 INFO L424 BuchiCegarLoop]: ======== Iteration 19============ [2019-11-16 00:09:48,648 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 69 states and 79 transitions. [2019-11-16 00:09:48,649 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-16 00:09:48,649 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:09:48,649 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:09:48,650 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:09:48,650 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-16 00:09:48,650 INFO L791 eck$LassoCheckResult]: Stem: 4137#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 4132#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~post1, main_#t~mem3, main_#t~nondet5, main_#t~post4, main_#t~mem6, main_#t~post8, main_#t~mem7, main_#t~post10, main_#t~mem9, main_#t~mem11, main_#t~mem12, main_#t~post13, main_#t~post14, main_~#string_A~0.base, main_~#string_A~0.offset, main_~#string_B~0.base, main_~#string_B~0.offset, main_~i~0, main_~j~0, main_~nc_A~0, main_~nc_B~0, main_~found~0;call main_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.allocOnStack(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.allocOnStack(5);havoc main_~i~0;havoc main_~j~0;havoc main_~nc_A~0;havoc main_~nc_B~0;main_~found~0 := 0;main_~i~0 := 0; 4107#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; 4108#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 4109#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; 4110#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 4156#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; 4154#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 4152#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; 4150#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 4148#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; 4144#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 4143#L19-3 assume !(main_~i~0 < 5); 4105#L19-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 4106#L21 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 4130#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; 4131#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 4136#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; 4157#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 4155#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; 4153#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 4151#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; 4149#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 4147#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; 4146#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 4145#L23-3 assume !(main_~i~0 < 5); 4126#L23-4 call main_#t~mem6 := read~int(main_~#string_B~0.base, 4 + main_~#string_B~0.offset, 1); 4127#L25 assume !!(0 == main_#t~mem6);havoc main_#t~mem6;main_~nc_A~0 := 0; 4140#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 4113#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; 4114#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 4163#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; 4141#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 4142#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; 4158#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 4160#L28-1 assume !(0 != main_#t~mem7);havoc main_#t~mem7; 4138#L28-4 main_~nc_B~0 := 0; 4139#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 4134#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; 4135#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 4166#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; 4167#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 4173#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; 4172#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 4171#L32-1 assume !(0 != main_#t~mem9);havoc main_#t~mem9; 4170#L32-4 assume !!(main_~nc_B~0 >= main_~nc_A~0);main_~j~0 := 0;main_~i~0 := main_~j~0; 4168#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); 4120#L41 assume !(main_#t~mem11 == main_#t~mem12);havoc main_#t~mem12;havoc main_#t~mem11;main_~i~0 := 1 + (main_~i~0 - main_~j~0);main_~j~0 := 0; 4116#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); 4169#L41 assume !(main_#t~mem11 == main_#t~mem12);havoc main_#t~mem12;havoc main_#t~mem11;main_~i~0 := 1 + (main_~i~0 - main_~j~0);main_~j~0 := 0; 4117#L41-2 [2019-11-16 00:09:48,650 INFO L793 eck$LassoCheckResult]: Loop: 4117#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); 4118#L41 assume main_#t~mem11 == main_#t~mem12;havoc main_#t~mem12;havoc main_#t~mem11;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; 4117#L41-2 [2019-11-16 00:09:48,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:09:48,651 INFO L82 PathProgramCache]: Analyzing trace with hash -1412851758, now seen corresponding path program 7 times [2019-11-16 00:09:48,651 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:09:48,651 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653900196] [2019-11-16 00:09:48,651 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:48,651 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:48,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:09:48,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:09:48,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:09:48,698 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:09:48,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:09:48,698 INFO L82 PathProgramCache]: Analyzing trace with hash 3556, now seen corresponding path program 10 times [2019-11-16 00:09:48,699 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:09:48,699 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568960542] [2019-11-16 00:09:48,699 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:48,699 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:48,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:09:48,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:09:48,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:09:48,704 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:09:48,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:09:48,705 INFO L82 PathProgramCache]: Analyzing trace with hash -540871307, now seen corresponding path program 6 times [2019-11-16 00:09:48,705 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:09:48,705 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983722526] [2019-11-16 00:09:48,705 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:48,706 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:48,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:09:48,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:09:48,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:09:48,754 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:09:51,751 WARN L191 SmtUtils]: Spent 2.93 s on a formula simplification. DAG size of input: 361 DAG size of output: 268 [2019-11-16 00:09:51,989 WARN L191 SmtUtils]: Spent 226.00 ms on a formula simplification that was a NOOP. DAG size: 137 [2019-11-16 00:09:51,992 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:09:51,992 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:09:51,992 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:09:51,992 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:09:51,992 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:09:51,992 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:09:51,992 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:09:51,992 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:09:51,992 INFO L131 ssoRankerPreferences]: Filename of dumped script: string-1.i_Iteration19_Lasso [2019-11-16 00:09:51,992 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:09:51,992 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:09:51,995 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:52,009 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:52,015 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:52,017 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:52,759 WARN L191 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 91 [2019-11-16 00:09:52,956 WARN L191 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-11-16 00:09:52,956 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:52,959 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:52,961 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:52,963 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:52,965 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:52,969 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:52,970 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:52,972 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:52,974 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:52,976 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:52,977 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:52,979 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:52,981 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:52,982 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:52,985 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:53,145 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 36 [2019-11-16 00:09:53,383 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-16 00:09:55,663 WARN L191 SmtUtils]: Spent 2.19 s on a formula simplification. DAG size of input: 106 DAG size of output: 78 [2019-11-16 00:09:55,767 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:09:55,767 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:09:55,768 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:09:55,768 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:09:55,768 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:09:55,768 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:09:55,768 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:09:55,768 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:09:55,769 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:09:55,769 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:09:55,769 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:09:55,769 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:09:55,769 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:09:55,770 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:09:55,770 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:09:55,770 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:09:55,770 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:09:55,770 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:09:55,770 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:09:55,770 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:09:55,771 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:09:55,771 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:09:55,771 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:09:55,771 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:09:55,771 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:09:55,771 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:09:55,771 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:09:55,771 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:09:55,772 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:09:55,772 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:09:55,772 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:09:55,772 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:09:55,773 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:09:55,773 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:09:55,773 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:09:55,773 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:09:55,773 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:09:55,773 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:09:55,773 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:09:55,774 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:09:55,774 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-16 00:09:55,774 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:09:55,774 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:09:55,774 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-16 00:09:55,775 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:09:55,776 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:09:55,776 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:09:55,776 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:09:55,776 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:09:55,778 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:09:55,778 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:09:55,779 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:09:55,779 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:09:55,780 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:09:55,780 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:09:55,780 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:09:55,781 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:09:55,781 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:09:55,781 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:09:55,781 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:09:55,781 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:09:55,782 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:09:55,782 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:09:55,783 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:09:55,783 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:09:55,783 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:09:55,783 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:09:55,784 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:09:55,784 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:09:55,785 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:09:55,785 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:09:55,786 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:09:55,786 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:09:55,786 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:09:55,786 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:09:55,786 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:09:55,787 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:09:55,787 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:09:55,788 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:09:55,788 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:09:55,789 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:09:55,789 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:09:55,789 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:09:55,789 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:09:55,789 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:09:55,791 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:09:55,791 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:09:55,792 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:09:55,792 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:09:55,792 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:09:55,792 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:09:55,794 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:09:55,794 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:09:55,815 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:09:55,841 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2019-11-16 00:09:55,841 INFO L444 ModelExtractionUtils]: 18 out of 28 variables were initially zero. Simplification set additionally 7 variables to zero. [2019-11-16 00:09:55,841 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:09:55,842 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-16 00:09:55,842 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:09:55,842 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0) = -2*ULTIMATE.start_main_~j~0 + 1 Supporting invariants [] [2019-11-16 00:09:56,021 INFO L297 tatePredicateManager]: 46 out of 50 supporting invariants were superfluous and have been removed [2019-11-16 00:09:56,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:09:56,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:56,118 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 32 conjunts are in the unsatisfiable core [2019-11-16 00:09:56,119 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:09:56,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:56,453 WARN L254 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-16 00:09:56,454 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:09:56,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:09:56,524 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.12 stem predicates 2 loop predicates [2019-11-16 00:09:56,524 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 69 states and 79 transitions. cyclomatic complexity: 16 Second operand 14 states. [2019-11-16 00:09:56,743 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 69 states and 79 transitions. cyclomatic complexity: 16. Second operand 14 states. Result 87 states and 103 transitions. Complement of second has 13 states. [2019-11-16 00:09:56,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 11 stem states 0 non-accepting loop states 1 accepting loop states [2019-11-16 00:09:56,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-11-16 00:09:56,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 53 transitions. [2019-11-16 00:09:56,744 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 53 transitions. Stem has 50 letters. Loop has 2 letters. [2019-11-16 00:09:56,744 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:09:56,744 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-16 00:09:56,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:09:56,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:56,801 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 32 conjunts are in the unsatisfiable core [2019-11-16 00:09:56,801 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:09:57,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:57,063 WARN L254 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-16 00:09:57,063 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:09:57,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:09:57,087 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.12 stem predicates 2 loop predicates [2019-11-16 00:09:57,087 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 69 states and 79 transitions. cyclomatic complexity: 16 Second operand 14 states. [2019-11-16 00:09:57,423 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 69 states and 79 transitions. cyclomatic complexity: 16. Second operand 14 states. Result 87 states and 103 transitions. Complement of second has 13 states. [2019-11-16 00:09:57,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 11 stem states 0 non-accepting loop states 1 accepting loop states [2019-11-16 00:09:57,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-11-16 00:09:57,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 53 transitions. [2019-11-16 00:09:57,424 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 53 transitions. Stem has 50 letters. Loop has 2 letters. [2019-11-16 00:09:57,424 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:09:57,424 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-16 00:09:57,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:09:57,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:57,524 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 32 conjunts are in the unsatisfiable core [2019-11-16 00:09:57,524 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:09:57,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:57,771 WARN L254 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-16 00:09:57,771 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:09:57,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:09:57,795 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.12 stem predicates 2 loop predicates [2019-11-16 00:09:57,795 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 69 states and 79 transitions. cyclomatic complexity: 16 Second operand 14 states. [2019-11-16 00:09:58,034 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 69 states and 79 transitions. cyclomatic complexity: 16. Second operand 14 states. Result 99 states and 121 transitions. Complement of second has 19 states. [2019-11-16 00:09:58,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 15 states 12 stem states 1 non-accepting loop states 2 accepting loop states [2019-11-16 00:09:58,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-11-16 00:09:58,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 66 transitions. [2019-11-16 00:09:58,035 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 66 transitions. Stem has 50 letters. Loop has 2 letters. [2019-11-16 00:09:58,035 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:09:58,035 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 66 transitions. Stem has 52 letters. Loop has 2 letters. [2019-11-16 00:09:58,035 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:09:58,036 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 66 transitions. Stem has 50 letters. Loop has 4 letters. [2019-11-16 00:09:58,036 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:09:58,036 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 99 states and 121 transitions. [2019-11-16 00:09:58,037 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2019-11-16 00:09:58,038 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 99 states to 99 states and 121 transitions. [2019-11-16 00:09:58,038 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 49 [2019-11-16 00:09:58,038 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2019-11-16 00:09:58,038 INFO L73 IsDeterministic]: Start isDeterministic. Operand 99 states and 121 transitions. [2019-11-16 00:09:58,038 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:09:58,039 INFO L688 BuchiCegarLoop]: Abstraction has 99 states and 121 transitions. [2019-11-16 00:09:58,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states and 121 transitions. [2019-11-16 00:09:58,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 71. [2019-11-16 00:09:58,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-11-16 00:09:58,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 82 transitions. [2019-11-16 00:09:58,041 INFO L711 BuchiCegarLoop]: Abstraction has 71 states and 82 transitions. [2019-11-16 00:09:58,041 INFO L591 BuchiCegarLoop]: Abstraction has 71 states and 82 transitions. [2019-11-16 00:09:58,041 INFO L424 BuchiCegarLoop]: ======== Iteration 20============ [2019-11-16 00:09:58,041 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 71 states and 82 transitions. [2019-11-16 00:09:58,042 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-16 00:09:58,042 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:09:58,042 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:09:58,043 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 5, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:09:58,043 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-16 00:09:58,043 INFO L791 eck$LassoCheckResult]: Stem: 5283#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 5281#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~post1, main_#t~mem3, main_#t~nondet5, main_#t~post4, main_#t~mem6, main_#t~post8, main_#t~mem7, main_#t~post10, main_#t~mem9, main_#t~mem11, main_#t~mem12, main_#t~post13, main_#t~post14, main_~#string_A~0.base, main_~#string_A~0.offset, main_~#string_B~0.base, main_~#string_B~0.offset, main_~i~0, main_~j~0, main_~nc_A~0, main_~nc_B~0, main_~found~0;call main_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.allocOnStack(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.allocOnStack(5);havoc main_~i~0;havoc main_~j~0;havoc main_~nc_A~0;havoc main_~nc_B~0;main_~found~0 := 0;main_~i~0 := 0; 5255#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; 5256#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 5257#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; 5258#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 5302#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; 5300#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 5298#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; 5296#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 5294#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; 5290#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 5289#L19-3 assume !(main_~i~0 < 5); 5253#L19-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 5254#L21 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 5276#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; 5277#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 5282#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; 5303#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 5301#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; 5299#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 5297#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; 5295#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 5293#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; 5292#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 5291#L23-3 assume !(main_~i~0 < 5); 5274#L23-4 call main_#t~mem6 := read~int(main_~#string_B~0.base, 4 + main_~#string_B~0.offset, 1); 5275#L25 assume !!(0 == main_#t~mem6);havoc main_#t~mem6;main_~nc_A~0 := 0; 5286#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 5261#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; 5262#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 5308#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; 5287#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 5288#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; 5304#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 5305#L28-1 assume !(0 != main_#t~mem7);havoc main_#t~mem7; 5284#L28-4 main_~nc_B~0 := 0; 5285#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 5312#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; 5313#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 5279#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; 5280#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 5323#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; 5322#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 5310#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; 5309#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 5278#L32-1 assume !(0 != main_#t~mem9);havoc main_#t~mem9; 5263#L32-4 assume !!(main_~nc_B~0 >= main_~nc_A~0);main_~j~0 := 0;main_~i~0 := main_~j~0; 5264#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); 5269#L41 assume !(main_#t~mem11 == main_#t~mem12);havoc main_#t~mem12;havoc main_#t~mem11;main_~i~0 := 1 + (main_~i~0 - main_~j~0);main_~j~0 := 0; 5265#L41-2 [2019-11-16 00:09:58,043 INFO L793 eck$LassoCheckResult]: Loop: 5265#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); 5266#L41 assume main_#t~mem11 == main_#t~mem12;havoc main_#t~mem12;havoc main_#t~mem11;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; 5265#L41-2 [2019-11-16 00:09:58,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:09:58,043 INFO L82 PathProgramCache]: Analyzing trace with hash -1368178712, now seen corresponding path program 8 times [2019-11-16 00:09:58,043 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:09:58,044 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637061356] [2019-11-16 00:09:58,044 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:58,044 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:58,044 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:09:58,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:09:58,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:09:58,086 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:09:58,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:09:58,087 INFO L82 PathProgramCache]: Analyzing trace with hash 3556, now seen corresponding path program 11 times [2019-11-16 00:09:58,087 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:09:58,087 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698392378] [2019-11-16 00:09:58,087 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:58,087 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:58,088 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:09:58,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:09:58,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:09:58,093 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:09:58,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:09:58,093 INFO L82 PathProgramCache]: Analyzing trace with hash -559747061, now seen corresponding path program 7 times [2019-11-16 00:09:58,095 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:09:58,095 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481836681] [2019-11-16 00:09:58,095 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:58,095 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:58,096 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:09:58,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:09:58,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:09:58,143 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:10:01,447 WARN L191 SmtUtils]: Spent 3.20 s on a formula simplification. DAG size of input: 349 DAG size of output: 258 [2019-11-16 00:10:01,689 WARN L191 SmtUtils]: Spent 235.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2019-11-16 00:10:01,691 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:10:01,691 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:10:01,691 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:10:01,692 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:10:01,692 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:10:01,692 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:10:01,692 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:10:01,692 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:10:01,692 INFO L131 ssoRankerPreferences]: Filename of dumped script: string-1.i_Iteration20_Lasso [2019-11-16 00:10:01,692 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:10:01,692 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:10:01,694 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:10:01,701 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:10:01,703 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:10:01,705 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:10:01,706 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:10:01,708 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:10:01,710 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:10:01,714 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:10:01,716 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:10:01,718 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:10:01,721 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:10:01,723 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:10:01,725 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:10:01,730 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:10:01,732 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:10:01,734 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:10:01,735 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:10:01,737 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:10:02,332 WARN L191 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 85 [2019-11-16 00:10:02,478 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:10:03,205 WARN L191 SmtUtils]: Spent 415.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 42 [2019-11-16 00:10:03,240 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:10:03,240 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:10:03,241 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:10:03,241 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:10:03,241 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:10:03,241 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:10:03,241 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:10:03,242 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:10:03,242 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:10:03,242 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:10:03,242 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:10:03,242 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:10:03,243 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:10:03,243 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:10:03,243 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:10:03,243 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:10:03,243 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:10:03,243 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:10:03,243 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:10:03,244 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:10:03,244 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:10:03,244 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:10:03,244 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:10:03,244 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:10:03,244 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:10:03,244 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:10:03,245 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:10:03,245 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:10:03,245 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:10:03,245 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:10:03,245 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:10:03,245 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:10:03,246 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:10:03,246 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:10:03,246 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:10:03,246 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:10:03,246 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:10:03,246 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:10:03,246 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:10:03,247 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:10:03,247 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:10:03,247 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:10:03,247 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:10:03,247 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:10:03,247 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:10:03,247 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:10:03,248 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:10:03,248 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:10:03,248 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:10:03,248 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:10:03,248 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:10:03,248 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:10:03,249 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:10:03,249 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:10:03,249 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:10:03,249 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:10:03,249 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:10:03,250 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:10:03,250 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:10:03,250 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:10:03,250 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:10:03,251 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:10:03,251 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:10:03,252 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:10:03,252 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:10:03,253 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:10:03,253 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:10:03,253 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:10:03,253 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:10:03,253 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:10:03,254 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:10:03,254 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:10:03,254 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:10:03,254 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:10:03,255 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:10:03,255 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:10:03,255 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:10:03,255 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:10:03,255 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:10:03,255 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:10:03,256 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:10:03,256 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:10:03,256 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:10:03,256 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:10:03,257 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:10:03,257 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:10:03,257 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:10:03,257 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:10:03,258 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:10:03,258 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:10:03,259 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:10:03,259 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:10:03,259 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:10:03,259 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:10:03,259 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:10:03,260 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:10:03,260 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:10:03,260 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:10:03,260 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:10:03,261 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:10:03,261 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:10:03,261 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:10:03,262 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:10:03,262 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:10:03,262 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:10:03,262 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:10:03,262 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:10:03,263 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:10:03,263 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:10:03,263 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:10:03,263 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:10:03,264 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:10:03,264 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:10:03,264 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:10:03,264 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:10:03,265 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:10:03,265 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:10:03,266 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:10:03,266 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:10:03,266 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:10:03,266 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:10:03,266 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:10:03,267 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:10:03,267 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:10:03,267 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:10:03,267 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:10:03,268 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:10:03,268 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:10:03,268 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:10:03,268 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:10:03,269 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:10:03,269 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:10:03,269 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:10:03,269 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:10:03,270 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:10:03,270 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:10:03,270 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:10:03,270 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:10:03,270 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:10:03,271 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:10:03,271 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:10:03,271 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:10:03,271 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:10:03,272 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:10:03,272 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:10:03,272 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:10:03,272 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:10:03,272 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:10:03,273 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:10:03,273 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:10:03,273 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:10:03,273 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:10:03,273 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:10:03,274 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:10:03,274 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-16 00:10:03,274 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:10:03,274 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:10:03,275 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-16 00:10:03,275 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:10:03,276 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:10:03,276 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:10:03,277 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:10:03,277 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:10:03,277 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:10:03,277 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:10:03,277 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:10:03,278 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:10:03,278 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:10:03,278 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:10:03,278 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:10:03,279 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:10:03,279 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-11-16 00:10:03,279 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:10:03,279 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:10:03,280 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-11-16 00:10:03,280 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:10:03,283 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:10:03,284 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:10:03,284 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:10:03,284 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:10:03,284 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:10:03,285 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:10:03,285 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:10:03,285 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:10:03,287 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:10:03,287 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:10:03,288 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:10:03,288 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:10:03,288 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:10:03,288 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:10:03,288 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:10:03,289 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:10:03,289 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:10:03,289 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:10:03,289 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:10:03,290 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:10:03,290 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:10:03,290 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:10:03,290 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:10:03,292 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:10:03,292 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:10:03,314 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:10:03,346 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-11-16 00:10:03,346 INFO L444 ModelExtractionUtils]: 20 out of 28 variables were initially zero. Simplification set additionally 5 variables to zero. [2019-11-16 00:10:03,347 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:10:03,347 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-16 00:10:03,347 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:10:03,348 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0) = -2*ULTIMATE.start_main_~j~0 + 3 Supporting invariants [] [2019-11-16 00:10:03,539 INFO L297 tatePredicateManager]: 44 out of 46 supporting invariants were superfluous and have been removed [2019-11-16 00:10:03,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:10:03,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:10:03,594 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-16 00:10:03,595 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:10:03,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:10:03,725 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-16 00:10:03,725 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:10:03,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:10:03,742 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.7 stem predicates 2 loop predicates [2019-11-16 00:10:03,742 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 71 states and 82 transitions. cyclomatic complexity: 17 Second operand 9 states. [2019-11-16 00:10:03,856 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 71 states and 82 transitions. cyclomatic complexity: 17. Second operand 9 states. Result 96 states and 117 transitions. Complement of second has 12 states. [2019-11-16 00:10:03,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 7 stem states 1 non-accepting loop states 2 accepting loop states [2019-11-16 00:10:03,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-11-16 00:10:03,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 42 transitions. [2019-11-16 00:10:03,857 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 42 transitions. Stem has 50 letters. Loop has 2 letters. [2019-11-16 00:10:03,857 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:10:03,857 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 42 transitions. Stem has 52 letters. Loop has 2 letters. [2019-11-16 00:10:03,857 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:10:03,857 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 42 transitions. Stem has 50 letters. Loop has 4 letters. [2019-11-16 00:10:03,857 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:10:03,858 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 96 states and 117 transitions. [2019-11-16 00:10:03,859 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-16 00:10:03,859 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 96 states to 93 states and 113 transitions. [2019-11-16 00:10:03,860 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 44 [2019-11-16 00:10:03,860 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 48 [2019-11-16 00:10:03,860 INFO L73 IsDeterministic]: Start isDeterministic. Operand 93 states and 113 transitions. [2019-11-16 00:10:03,860 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:10:03,860 INFO L688 BuchiCegarLoop]: Abstraction has 93 states and 113 transitions. [2019-11-16 00:10:03,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states and 113 transitions. [2019-11-16 00:10:03,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 78. [2019-11-16 00:10:03,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-11-16 00:10:03,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 92 transitions. [2019-11-16 00:10:03,862 INFO L711 BuchiCegarLoop]: Abstraction has 78 states and 92 transitions. [2019-11-16 00:10:03,862 INFO L591 BuchiCegarLoop]: Abstraction has 78 states and 92 transitions. [2019-11-16 00:10:03,862 INFO L424 BuchiCegarLoop]: ======== Iteration 21============ [2019-11-16 00:10:03,862 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 78 states and 92 transitions. [2019-11-16 00:10:03,863 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-16 00:10:03,863 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:10:03,863 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:10:03,864 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 5, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:10:03,864 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-16 00:10:03,864 INFO L791 eck$LassoCheckResult]: Stem: 5840#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 5838#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~post1, main_#t~mem3, main_#t~nondet5, main_#t~post4, main_#t~mem6, main_#t~post8, main_#t~mem7, main_#t~post10, main_#t~mem9, main_#t~mem11, main_#t~mem12, main_#t~post13, main_#t~post14, main_~#string_A~0.base, main_~#string_A~0.offset, main_~#string_B~0.base, main_~#string_B~0.offset, main_~i~0, main_~j~0, main_~nc_A~0, main_~nc_B~0, main_~found~0;call main_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.allocOnStack(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.allocOnStack(5);havoc main_~i~0;havoc main_~j~0;havoc main_~nc_A~0;havoc main_~nc_B~0;main_~found~0 := 0;main_~i~0 := 0; 5811#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; 5812#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 5813#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; 5814#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 5857#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; 5855#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 5853#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; 5851#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 5849#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; 5845#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 5844#L19-3 assume !(main_~i~0 < 5); 5809#L19-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 5810#L21 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 5833#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; 5834#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 5839#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; 5858#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 5856#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; 5854#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 5852#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; 5850#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 5848#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; 5847#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 5846#L23-3 assume !(main_~i~0 < 5); 5830#L23-4 call main_#t~mem6 := read~int(main_~#string_B~0.base, 4 + main_~#string_B~0.offset, 1); 5831#L25 assume !!(0 == main_#t~mem6);havoc main_#t~mem6;main_~nc_A~0 := 0; 5841#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 5817#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; 5818#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 5861#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; 5842#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 5843#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; 5886#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 5860#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; 5859#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 5815#L28-1 assume !(0 != main_#t~mem7);havoc main_#t~mem7; 5816#L28-4 main_~nc_B~0 := 0; 5826#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 5827#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; 5828#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 5829#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; 5837#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 5864#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; 5862#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 5863#L32-1 assume !(0 != main_#t~mem9);havoc main_#t~mem9; 5819#L32-4 assume !!(main_~nc_B~0 >= main_~nc_A~0);main_~j~0 := 0;main_~i~0 := main_~j~0; 5820#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); 5825#L41 assume !(main_#t~mem11 == main_#t~mem12);havoc main_#t~mem12;havoc main_#t~mem11;main_~i~0 := 1 + (main_~i~0 - main_~j~0);main_~j~0 := 0; 5821#L41-2 [2019-11-16 00:10:03,864 INFO L793 eck$LassoCheckResult]: Loop: 5821#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); 5822#L41 assume main_#t~mem11 == main_#t~mem12;havoc main_#t~mem12;havoc main_#t~mem11;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; 5821#L41-2 [2019-11-16 00:10:03,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:10:03,865 INFO L82 PathProgramCache]: Analyzing trace with hash -456376174, now seen corresponding path program 9 times [2019-11-16 00:10:03,865 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:10:03,865 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560196991] [2019-11-16 00:10:03,865 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:10:03,865 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:10:03,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:10:03,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:10:03,995 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 20 proven. 12 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-11-16 00:10:03,996 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560196991] [2019-11-16 00:10:03,996 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1148007777] [2019-11-16 00:10:03,996 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_36c1ed6d-2c10-4884-afdf-a94e276eebcd/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:10:04,161 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-11-16 00:10:04,161 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:10:04,162 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-16 00:10:04,163 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:10:04,243 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 20 proven. 12 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-11-16 00:10:04,243 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:10:04,243 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 21 [2019-11-16 00:10:04,243 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935903453] [2019-11-16 00:10:04,249 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-16 00:10:04,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:10:04,249 INFO L82 PathProgramCache]: Analyzing trace with hash 3556, now seen corresponding path program 12 times [2019-11-16 00:10:04,249 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:10:04,250 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080847695] [2019-11-16 00:10:04,250 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:10:04,250 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:10:04,250 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:10:04,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:10:04,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:10:04,256 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:10:04,323 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:10:04,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-16 00:10:04,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=291, Unknown=0, NotChecked=0, Total=420 [2019-11-16 00:10:04,324 INFO L87 Difference]: Start difference. First operand 78 states and 92 transitions. cyclomatic complexity: 22 Second operand 21 states. [2019-11-16 00:10:04,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:10:04,527 INFO L93 Difference]: Finished difference Result 90 states and 107 transitions. [2019-11-16 00:10:04,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-16 00:10:04,527 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 90 states and 107 transitions. [2019-11-16 00:10:04,528 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-11-16 00:10:04,529 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 90 states to 88 states and 105 transitions. [2019-11-16 00:10:04,529 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 44 [2019-11-16 00:10:04,529 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 [2019-11-16 00:10:04,529 INFO L73 IsDeterministic]: Start isDeterministic. Operand 88 states and 105 transitions. [2019-11-16 00:10:04,529 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:10:04,529 INFO L688 BuchiCegarLoop]: Abstraction has 88 states and 105 transitions. [2019-11-16 00:10:04,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states and 105 transitions. [2019-11-16 00:10:04,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 80. [2019-11-16 00:10:04,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-11-16 00:10:04,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 94 transitions. [2019-11-16 00:10:04,531 INFO L711 BuchiCegarLoop]: Abstraction has 80 states and 94 transitions. [2019-11-16 00:10:04,531 INFO L591 BuchiCegarLoop]: Abstraction has 80 states and 94 transitions. [2019-11-16 00:10:04,531 INFO L424 BuchiCegarLoop]: ======== Iteration 22============ [2019-11-16 00:10:04,531 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 80 states and 94 transitions. [2019-11-16 00:10:04,531 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-16 00:10:04,531 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:10:04,531 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:10:04,532 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:10:04,532 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-16 00:10:04,532 INFO L791 eck$LassoCheckResult]: Stem: 6192#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 6188#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~post1, main_#t~mem3, main_#t~nondet5, main_#t~post4, main_#t~mem6, main_#t~post8, main_#t~mem7, main_#t~post10, main_#t~mem9, main_#t~mem11, main_#t~mem12, main_#t~post13, main_#t~post14, main_~#string_A~0.base, main_~#string_A~0.offset, main_~#string_B~0.base, main_~#string_B~0.offset, main_~i~0, main_~j~0, main_~nc_A~0, main_~nc_B~0, main_~found~0;call main_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.allocOnStack(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.allocOnStack(5);havoc main_~i~0;havoc main_~j~0;havoc main_~nc_A~0;havoc main_~nc_B~0;main_~found~0 := 0;main_~i~0 := 0; 6162#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; 6163#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 6164#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; 6165#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 6211#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; 6209#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 6207#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; 6205#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 6203#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; 6199#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 6198#L19-3 assume !(main_~i~0 < 5); 6160#L19-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 6161#L21 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 6186#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; 6187#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 6191#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; 6212#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 6210#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; 6208#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 6206#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; 6204#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 6202#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; 6201#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 6200#L23-3 assume !(main_~i~0 < 5); 6181#L23-4 call main_#t~mem6 := read~int(main_~#string_B~0.base, 4 + main_~#string_B~0.offset, 1); 6182#L25 assume !!(0 == main_#t~mem6);havoc main_#t~mem6;main_~nc_A~0 := 0; 6195#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 6168#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; 6169#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 6219#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; 6196#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 6197#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; 6216#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 6214#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; 6213#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 6215#L28-1 assume !(0 != main_#t~mem7);havoc main_#t~mem7; 6193#L28-4 main_~nc_B~0 := 0; 6194#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 6227#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; 6179#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 6180#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; 6239#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 6238#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; 6221#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 6222#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; 6235#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 6232#L32-1 assume !(0 != main_#t~mem9);havoc main_#t~mem9; 6229#L32-4 assume !!(main_~nc_B~0 >= main_~nc_A~0);main_~j~0 := 0;main_~i~0 := main_~j~0; 6226#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); 6225#L41 assume !(main_#t~mem11 == main_#t~mem12);havoc main_#t~mem12;havoc main_#t~mem11;main_~i~0 := 1 + (main_~i~0 - main_~j~0);main_~j~0 := 0; 6172#L41-2 [2019-11-16 00:10:04,532 INFO L793 eck$LassoCheckResult]: Loop: 6172#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); 6173#L41 assume main_#t~mem11 == main_#t~mem12;havoc main_#t~mem12;havoc main_#t~mem11;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; 6172#L41-2 [2019-11-16 00:10:04,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:10:04,532 INFO L82 PathProgramCache]: Analyzing trace with hash -446163379, now seen corresponding path program 10 times [2019-11-16 00:10:04,532 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:10:04,532 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460692566] [2019-11-16 00:10:04,532 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:10:04,532 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:10:04,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:10:04,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:10:04,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:10:04,586 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:10:04,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:10:04,587 INFO L82 PathProgramCache]: Analyzing trace with hash 3556, now seen corresponding path program 13 times [2019-11-16 00:10:04,587 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:10:04,587 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085491310] [2019-11-16 00:10:04,587 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:10:04,587 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:10:04,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:10:04,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:10:04,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:10:04,592 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:10:04,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:10:04,593 INFO L82 PathProgramCache]: Analyzing trace with hash 733724976, now seen corresponding path program 8 times [2019-11-16 00:10:04,593 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:10:04,593 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869153752] [2019-11-16 00:10:04,593 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:10:04,593 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:10:04,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:10:04,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:10:04,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:10:04,634 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:10:08,648 WARN L191 SmtUtils]: Spent 3.91 s on a formula simplification. DAG size of input: 361 DAG size of output: 268 [2019-11-16 00:10:09,090 WARN L191 SmtUtils]: Spent 433.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-11-16 00:10:09,092 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:10:09,092 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:10:09,092 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:10:09,092 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:10:09,092 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:10:09,093 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:10:09,093 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:10:09,093 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:10:09,093 INFO L131 ssoRankerPreferences]: Filename of dumped script: string-1.i_Iteration22_Lasso [2019-11-16 00:10:09,093 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:10:09,093 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:10:09,095 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:10:09,101 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:10:09,104 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:10:09,105 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:10:09,107 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:10:09,109 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:10:09,111 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:10:09,112 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:10:09,118 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:10:09,119 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:10:09,121 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:10:09,123 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:10:09,126 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:10:09,127 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:10:09,129 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:10:09,141 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:10:09,142 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:10:09,144 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:10:09,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:10:09,705 WARN L191 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 84 [2019-11-16 00:10:10,438 WARN L191 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2019-11-16 00:10:10,510 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:10:10,510 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:10:10,510 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:10:10,510 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:10:10,510 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:10:10,511 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:10:10,511 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:10:10,511 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:10:10,511 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:10:10,511 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:10:10,511 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:10:10,512 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:10:10,512 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:10:10,512 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:10:10,512 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:10:10,512 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:10:10,513 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:10:10,513 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:10:10,514 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:10:10,514 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:10:10,514 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:10:10,514 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:10:10,514 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:10:10,514 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:10:10,514 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:10:10,515 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:10:10,515 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:10:10,515 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:10:10,515 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:10:10,515 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:10:10,516 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:10:10,516 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:10:10,516 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:10:10,516 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:10:10,516 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:10:10,516 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:10:10,516 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:10:10,517 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:10:10,517 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:10:10,517 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:10:10,517 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:10:10,517 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:10:10,517 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:10:10,517 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:10:10,517 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:10:10,518 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:10:10,518 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:10:10,518 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:10:10,518 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:10:10,518 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:10:10,518 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:10:10,519 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:10:10,519 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:10:10,519 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:10:10,519 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:10:10,519 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:10:10,519 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:10:10,520 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:10:10,520 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:10:10,520 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:10:10,520 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:10:10,520 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:10:10,520 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:10:10,520 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:10:10,522 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:10:10,523 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:10:10,523 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:10:10,523 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:10:10,523 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:10:10,524 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:10:10,524 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:10:10,524 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:10:10,525 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:10:10,525 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:10:10,525 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:10:10,525 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:10:10,526 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:10:10,526 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:10:10,526 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:10:10,526 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:10:10,526 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:10:10,527 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:10:10,527 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:10:10,527 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:10:10,527 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:10:10,528 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:10:10,528 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:10:10,528 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:10:10,528 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:10:10,528 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:10:10,529 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:10:10,529 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:10:10,529 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:10:10,529 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:10:10,529 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:10:10,530 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:10:10,530 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:10:10,530 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:10:10,530 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:10:10,531 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:10:10,531 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:10:10,531 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:10:10,531 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:10:10,531 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:10:10,532 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:10:10,532 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:10:10,533 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:10:10,533 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:10:10,533 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:10:10,534 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:10:10,534 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:10:10,534 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:10:10,534 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:10:10,534 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:10:10,534 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:10:10,535 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:10:10,535 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:10:10,535 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:10:10,536 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:10:10,536 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:10:10,536 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:10:10,536 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:10:10,536 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:10:10,536 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:10:10,537 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:10:10,537 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:10:10,538 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:10:10,538 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:10:10,538 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:10:10,538 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:10:10,538 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:10:10,538 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:10:10,538 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:10:10,539 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:10:10,539 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:10:10,540 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:10:10,540 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:10:10,540 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:10:10,540 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:10:10,540 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:10:10,540 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:10:10,541 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:10:10,541 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:10:10,541 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:10:10,542 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:10:10,542 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:10:10,542 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:10:10,542 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:10:10,542 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:10:10,542 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:10:10,543 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:10:10,543 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:10:10,543 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:10:10,544 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:10:10,544 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:10:10,544 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:10:10,544 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:10:10,544 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:10:10,544 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:10:10,545 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:10:10,545 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:10:10,545 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:10:10,546 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:10:10,546 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-16 00:10:10,546 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:10:10,546 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:10:10,547 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-16 00:10:10,547 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:10:10,548 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:10:10,548 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:10:10,549 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:10:10,549 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:10:10,549 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:10:10,549 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:10:10,549 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:10:10,550 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:10:10,550 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:10:10,550 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:10:10,550 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:10:10,551 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:10:10,551 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:10:10,551 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:10:10,551 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:10:10,552 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:10:10,552 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:10:10,554 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:10:10,554 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:10:10,554 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:10:10,555 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-16 00:10:10,555 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:10:10,555 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:10:10,555 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-16 00:10:10,556 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:10:10,557 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:10:10,557 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:10:10,557 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:10:10,558 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:10:10,558 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:10:10,558 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:10:10,558 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:10:10,559 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:10:10,560 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:10:10,561 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:10:10,561 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:10:10,561 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-11-16 00:10:10,561 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:10:10,562 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:10:10,562 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-11-16 00:10:10,563 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:10:10,565 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:10:10,566 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:10:10,566 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:10:10,566 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:10:10,567 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:10:10,567 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:10:10,567 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:10:10,567 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:10:10,568 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:10:10,569 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:10:10,569 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:10:10,569 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-16 00:10:10,569 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:10:10,569 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:10:10,570 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-16 00:10:10,570 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:10:10,571 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:10:10,572 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:10:10,572 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:10:10,572 INFO L202 nArgumentSynthesizer]: 12 stem disjuncts [2019-11-16 00:10:10,573 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:10:10,573 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:10:10,575 INFO L400 nArgumentSynthesizer]: We have 28 Motzkin's Theorem applications. [2019-11-16 00:10:10,575 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:10:10,585 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:10:10,586 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:10:10,586 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:10:10,587 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-16 00:10:10,587 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:10:10,587 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:10:10,588 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-16 00:10:10,588 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:10:10,589 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:10:10,590 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:10:10,590 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:10:10,590 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:10:10,590 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:10:10,591 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:10:10,591 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:10:10,591 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:10:10,592 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:10:10,592 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:10:10,592 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:10:10,593 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:10:10,593 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:10:10,593 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:10:10,593 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:10:10,594 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:10:10,594 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:10:10,595 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:10:10,595 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:10:10,595 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-16 00:10:10,595 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:10:10,596 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:10:10,596 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-16 00:10:10,596 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:10:10,597 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:10:10,598 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:10:10,598 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:10:10,598 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:10:10,598 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:10:10,598 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:10:10,600 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:10:10,600 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:10:10,616 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:10:10,637 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2019-11-16 00:10:10,637 INFO L444 ModelExtractionUtils]: 19 out of 28 variables were initially zero. Simplification set additionally 6 variables to zero. [2019-11-16 00:10:10,638 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:10:10,638 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-16 00:10:10,638 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:10:10,639 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 7 Supporting invariants [] [2019-11-16 00:10:10,813 INFO L297 tatePredicateManager]: 38 out of 40 supporting invariants were superfluous and have been removed [2019-11-16 00:10:10,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:10:10,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:10:10,886 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-16 00:10:10,887 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:10:11,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:10:11,008 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-16 00:10:11,008 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:10:11,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:10:11,029 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.7 stem predicates 2 loop predicates [2019-11-16 00:10:11,029 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 80 states and 94 transitions. cyclomatic complexity: 22 Second operand 9 states. [2019-11-16 00:10:11,181 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 80 states and 94 transitions. cyclomatic complexity: 22. Second operand 9 states. Result 114 states and 138 transitions. Complement of second has 12 states. [2019-11-16 00:10:11,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 7 stem states 1 non-accepting loop states 2 accepting loop states [2019-11-16 00:10:11,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-11-16 00:10:11,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 53 transitions. [2019-11-16 00:10:11,182 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 53 transitions. Stem has 52 letters. Loop has 2 letters. [2019-11-16 00:10:11,182 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:10:11,182 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 53 transitions. Stem has 54 letters. Loop has 2 letters. [2019-11-16 00:10:11,182 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:10:11,182 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 53 transitions. Stem has 52 letters. Loop has 4 letters. [2019-11-16 00:10:11,182 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:10:11,183 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 114 states and 138 transitions. [2019-11-16 00:10:11,184 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-16 00:10:11,184 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 114 states to 114 states and 138 transitions. [2019-11-16 00:10:11,187 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 52 [2019-11-16 00:10:11,187 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 56 [2019-11-16 00:10:11,187 INFO L73 IsDeterministic]: Start isDeterministic. Operand 114 states and 138 transitions. [2019-11-16 00:10:11,187 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:10:11,187 INFO L688 BuchiCegarLoop]: Abstraction has 114 states and 138 transitions. [2019-11-16 00:10:11,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states and 138 transitions. [2019-11-16 00:10:11,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 91. [2019-11-16 00:10:11,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-11-16 00:10:11,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 106 transitions. [2019-11-16 00:10:11,190 INFO L711 BuchiCegarLoop]: Abstraction has 91 states and 106 transitions. [2019-11-16 00:10:11,190 INFO L591 BuchiCegarLoop]: Abstraction has 91 states and 106 transitions. [2019-11-16 00:10:11,190 INFO L424 BuchiCegarLoop]: ======== Iteration 23============ [2019-11-16 00:10:11,190 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 91 states and 106 transitions. [2019-11-16 00:10:11,190 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-16 00:10:11,191 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:10:11,191 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:10:11,191 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:10:11,191 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-16 00:10:11,191 INFO L791 eck$LassoCheckResult]: Stem: 6757#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 6755#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~post1, main_#t~mem3, main_#t~nondet5, main_#t~post4, main_#t~mem6, main_#t~post8, main_#t~mem7, main_#t~post10, main_#t~mem9, main_#t~mem11, main_#t~mem12, main_#t~post13, main_#t~post14, main_~#string_A~0.base, main_~#string_A~0.offset, main_~#string_B~0.base, main_~#string_B~0.offset, main_~i~0, main_~j~0, main_~nc_A~0, main_~nc_B~0, main_~found~0;call main_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.allocOnStack(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.allocOnStack(5);havoc main_~i~0;havoc main_~j~0;havoc main_~nc_A~0;havoc main_~nc_B~0;main_~found~0 := 0;main_~i~0 := 0; 6727#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; 6728#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 6729#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; 6730#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 6776#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; 6774#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 6772#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; 6770#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 6768#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; 6764#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 6763#L19-3 assume !(main_~i~0 < 5); 6725#L19-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 6726#L21 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 6750#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; 6751#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 6756#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; 6777#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 6775#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; 6773#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 6771#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; 6769#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 6767#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; 6766#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 6765#L23-3 assume !(main_~i~0 < 5); 6746#L23-4 call main_#t~mem6 := read~int(main_~#string_B~0.base, 4 + main_~#string_B~0.offset, 1); 6747#L25 assume !!(0 == main_#t~mem6);havoc main_#t~mem6;main_~nc_A~0 := 0; 6759#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 6760#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; 6779#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 6780#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; 6761#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 6762#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; 6790#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 6789#L28-1 assume !(0 != main_#t~mem7);havoc main_#t~mem7; 6788#L28-4 main_~nc_B~0 := 0; 6742#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 6743#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; 6811#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 6810#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; 6808#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 6806#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; 6804#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 6802#L32-1 assume !(0 != main_#t~mem9);havoc main_#t~mem9; 6801#L32-4 assume !!(main_~nc_B~0 >= main_~nc_A~0);main_~j~0 := 0;main_~i~0 := main_~j~0; 6798#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); 6794#L41 assume !(main_#t~mem11 == main_#t~mem12);havoc main_#t~mem12;havoc main_#t~mem11;main_~i~0 := 1 + (main_~i~0 - main_~j~0);main_~j~0 := 0; 6792#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); 6741#L41 assume main_#t~mem11 == main_#t~mem12;havoc main_#t~mem12;havoc main_#t~mem11;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; 6739#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); 6740#L41 assume !(main_#t~mem11 == main_#t~mem12);havoc main_#t~mem12;havoc main_#t~mem11;main_~i~0 := 1 + (main_~i~0 - main_~j~0);main_~j~0 := 0; 6737#L41-2 [2019-11-16 00:10:11,191 INFO L793 eck$LassoCheckResult]: Loop: 6737#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); 6738#L41 assume main_#t~mem11 == main_#t~mem12;havoc main_#t~mem12;havoc main_#t~mem11;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; 6737#L41-2 [2019-11-16 00:10:11,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:10:11,192 INFO L82 PathProgramCache]: Analyzing trace with hash -540873227, now seen corresponding path program 9 times [2019-11-16 00:10:11,192 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:10:11,192 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45796178] [2019-11-16 00:10:11,192 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:10:11,192 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:10:11,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:10:11,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:10:11,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:10:11,240 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:10:11,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:10:11,241 INFO L82 PathProgramCache]: Analyzing trace with hash 3556, now seen corresponding path program 14 times [2019-11-16 00:10:11,241 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:10:11,241 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261999049] [2019-11-16 00:10:11,241 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:10:11,241 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:10:11,241 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:10:11,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:10:11,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:10:11,247 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:10:11,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:10:11,247 INFO L82 PathProgramCache]: Analyzing trace with hash -88125736, now seen corresponding path program 10 times [2019-11-16 00:10:11,247 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:10:11,248 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453972760] [2019-11-16 00:10:11,248 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:10:11,248 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:10:11,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:10:11,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:10:11,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:10:11,292 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:10:19,173 WARN L191 SmtUtils]: Spent 7.80 s on a formula simplification. DAG size of input: 384 DAG size of output: 282 [2019-11-16 00:10:19,668 WARN L191 SmtUtils]: Spent 486.00 ms on a formula simplification that was a NOOP. DAG size: 148 [2019-11-16 00:10:19,673 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:10:19,673 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:10:19,673 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:10:19,673 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:10:19,673 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:10:19,673 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:10:19,673 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:10:19,673 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:10:19,674 INFO L131 ssoRankerPreferences]: Filename of dumped script: string-1.i_Iteration23_Lasso [2019-11-16 00:10:19,674 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:10:19,674 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:10:19,676 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:10:20,922 WARN L191 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 92 [2019-11-16 00:10:21,039 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:10:21,041 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:10:21,043 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:10:21,044 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:10:21,045 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:10:21,047 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:10:21,048 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:10:21,049 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:10:21,050 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:10:21,052 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:10:21,053 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:10:21,055 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:10:21,057 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:10:21,058 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:10:21,060 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:10:21,061 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:10:21,062 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:10:21,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:10:21,274 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-16 00:10:23,533 WARN L191 SmtUtils]: Spent 2.18 s on a formula simplification. DAG size of input: 106 DAG size of output: 78 [2019-11-16 00:10:23,648 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:10:23,649 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:10:23,649 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:10:23,649 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:10:23,649 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:10:23,649 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:10:23,649 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:10:23,650 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:10:23,650 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:10:23,651 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:10:23,651 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:10:23,652 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:10:23,652 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:10:23,652 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:10:23,652 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:10:23,653 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:10:23,653 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:10:23,674 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:10:23,698 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2019-11-16 00:10:23,698 INFO L444 ModelExtractionUtils]: 20 out of 28 variables were initially zero. Simplification set additionally 5 variables to zero. [2019-11-16 00:10:23,699 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:10:23,699 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-16 00:10:23,699 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:10:23,699 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 5 Supporting invariants [] [2019-11-16 00:10:23,931 INFO L297 tatePredicateManager]: 50 out of 53 supporting invariants were superfluous and have been removed [2019-11-16 00:10:23,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:10:24,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:10:24,006 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-16 00:10:24,007 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:10:24,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:10:24,174 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-16 00:10:24,174 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:10:24,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:10:24,194 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.10 stem predicates 2 loop predicates [2019-11-16 00:10:24,194 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 91 states and 106 transitions. cyclomatic complexity: 23 Second operand 12 states. [2019-11-16 00:10:24,348 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 91 states and 106 transitions. cyclomatic complexity: 23. Second operand 12 states. Result 116 states and 140 transitions. Complement of second has 15 states. [2019-11-16 00:10:24,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 13 states 10 stem states 1 non-accepting loop states 2 accepting loop states [2019-11-16 00:10:24,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-11-16 00:10:24,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 55 transitions. [2019-11-16 00:10:24,349 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 55 transitions. Stem has 52 letters. Loop has 2 letters. [2019-11-16 00:10:24,349 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:10:24,349 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-16 00:10:24,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:10:24,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:10:24,404 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-16 00:10:24,405 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:10:24,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:10:24,574 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-16 00:10:24,575 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:10:24,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:10:24,594 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.10 stem predicates 2 loop predicates [2019-11-16 00:10:24,594 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 91 states and 106 transitions. cyclomatic complexity: 23 Second operand 12 states. [2019-11-16 00:10:24,783 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 91 states and 106 transitions. cyclomatic complexity: 23. Second operand 12 states. Result 116 states and 140 transitions. Complement of second has 15 states. [2019-11-16 00:10:24,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 13 states 10 stem states 1 non-accepting loop states 2 accepting loop states [2019-11-16 00:10:24,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-11-16 00:10:24,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 55 transitions. [2019-11-16 00:10:24,784 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 55 transitions. Stem has 52 letters. Loop has 2 letters. [2019-11-16 00:10:24,784 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:10:24,784 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-16 00:10:24,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:10:24,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:10:24,842 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-16 00:10:24,843 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:10:25,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:10:25,009 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-16 00:10:25,009 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:10:25,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:10:25,029 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.10 stem predicates 2 loop predicates [2019-11-16 00:10:25,029 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 91 states and 106 transitions. cyclomatic complexity: 23 Second operand 12 states. [2019-11-16 00:10:25,217 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 91 states and 106 transitions. cyclomatic complexity: 23. Second operand 12 states. Result 127 states and 158 transitions. Complement of second has 15 states. [2019-11-16 00:10:25,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 13 states 10 stem states 1 non-accepting loop states 2 accepting loop states [2019-11-16 00:10:25,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-11-16 00:10:25,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 58 transitions. [2019-11-16 00:10:25,218 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 58 transitions. Stem has 52 letters. Loop has 2 letters. [2019-11-16 00:10:25,218 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:10:25,218 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 58 transitions. Stem has 54 letters. Loop has 2 letters. [2019-11-16 00:10:25,218 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:10:25,218 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 58 transitions. Stem has 52 letters. Loop has 4 letters. [2019-11-16 00:10:25,218 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:10:25,219 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 127 states and 158 transitions. [2019-11-16 00:10:25,220 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2019-11-16 00:10:25,220 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 127 states to 124 states and 152 transitions. [2019-11-16 00:10:25,221 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 56 [2019-11-16 00:10:25,221 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 63 [2019-11-16 00:10:25,221 INFO L73 IsDeterministic]: Start isDeterministic. Operand 124 states and 152 transitions. [2019-11-16 00:10:25,221 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:10:25,221 INFO L688 BuchiCegarLoop]: Abstraction has 124 states and 152 transitions. [2019-11-16 00:10:25,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states and 152 transitions. [2019-11-16 00:10:25,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 90. [2019-11-16 00:10:25,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-11-16 00:10:25,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 104 transitions. [2019-11-16 00:10:25,223 INFO L711 BuchiCegarLoop]: Abstraction has 90 states and 104 transitions. [2019-11-16 00:10:25,223 INFO L591 BuchiCegarLoop]: Abstraction has 90 states and 104 transitions. [2019-11-16 00:10:25,223 INFO L424 BuchiCegarLoop]: ======== Iteration 24============ [2019-11-16 00:10:25,223 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 90 states and 104 transitions. [2019-11-16 00:10:25,224 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-11-16 00:10:25,224 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:10:25,224 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:10:25,225 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:10:25,225 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-16 00:10:25,225 INFO L791 eck$LassoCheckResult]: Stem: 8041#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8039#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~post1, main_#t~mem3, main_#t~nondet5, main_#t~post4, main_#t~mem6, main_#t~post8, main_#t~mem7, main_#t~post10, main_#t~mem9, main_#t~mem11, main_#t~mem12, main_#t~post13, main_#t~post14, main_~#string_A~0.base, main_~#string_A~0.offset, main_~#string_B~0.base, main_~#string_B~0.offset, main_~i~0, main_~j~0, main_~nc_A~0, main_~nc_B~0, main_~found~0;call main_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.allocOnStack(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.allocOnStack(5);havoc main_~i~0;havoc main_~j~0;havoc main_~nc_A~0;havoc main_~nc_B~0;main_~found~0 := 0;main_~i~0 := 0; 8013#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; 8014#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 8015#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; 8016#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 8060#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; 8058#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 8056#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; 8054#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 8052#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; 8048#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 8047#L19-3 assume !(main_~i~0 < 5); 8011#L19-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 8012#L21 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 8034#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; 8035#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 8040#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; 8061#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 8059#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; 8057#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 8055#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; 8053#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 8051#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; 8050#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 8049#L23-3 assume !(main_~i~0 < 5); 8032#L23-4 call main_#t~mem6 := read~int(main_~#string_B~0.base, 4 + main_~#string_B~0.offset, 1); 8033#L25 assume !!(0 == main_#t~mem6);havoc main_#t~mem6;main_~nc_A~0 := 0; 8044#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 8019#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; 8020#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 8067#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; 8045#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 8046#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; 8080#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 8079#L28-1 assume !(0 != main_#t~mem7);havoc main_#t~mem7; 8078#L28-4 main_~nc_B~0 := 0; 8028#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 8029#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; 8074#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 8072#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; 8073#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 8099#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; 8098#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 8036#L32-1 assume !(0 != main_#t~mem9);havoc main_#t~mem9; 8021#L32-4 assume !!(main_~nc_B~0 >= main_~nc_A~0);main_~j~0 := 0;main_~i~0 := main_~j~0; 8022#L41-2 [2019-11-16 00:10:25,225 INFO L793 eck$LassoCheckResult]: Loop: 8022#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); 8027#L41 assume !(main_#t~mem11 == main_#t~mem12);havoc main_#t~mem12;havoc main_#t~mem11;main_~i~0 := 1 + (main_~i~0 - main_~j~0);main_~j~0 := 0; 8022#L41-2 [2019-11-16 00:10:25,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:10:25,225 INFO L82 PathProgramCache]: Analyzing trace with hash 1972313288, now seen corresponding path program 2 times [2019-11-16 00:10:25,225 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:10:25,225 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205950700] [2019-11-16 00:10:25,225 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:10:25,226 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:10:25,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:10:25,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:10:25,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:10:25,253 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:10:25,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:10:25,253 INFO L82 PathProgramCache]: Analyzing trace with hash 3558, now seen corresponding path program 1 times [2019-11-16 00:10:25,253 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:10:25,253 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251732042] [2019-11-16 00:10:25,254 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:10:25,254 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:10:25,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:10:25,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:10:25,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:10:25,259 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:10:25,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:10:25,259 INFO L82 PathProgramCache]: Analyzing trace with hash 1312494829, now seen corresponding path program 11 times [2019-11-16 00:10:25,259 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:10:25,259 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005792163] [2019-11-16 00:10:25,259 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:10:25,260 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:10:25,260 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:10:25,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:10:25,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:10:25,287 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:10:29,114 WARN L191 SmtUtils]: Spent 3.76 s on a formula simplification. DAG size of input: 312 DAG size of output: 235 [2019-11-16 00:10:29,343 WARN L191 SmtUtils]: Spent 223.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-11-16 00:10:29,346 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:10:29,346 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:10:29,346 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:10:29,346 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:10:29,346 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:10:29,347 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:10:29,347 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:10:29,347 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:10:29,347 INFO L131 ssoRankerPreferences]: Filename of dumped script: string-1.i_Iteration24_Lasso [2019-11-16 00:10:29,347 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:10:29,347 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:10:29,348 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:10:29,350 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:10:29,351 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:10:29,785 WARN L191 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 78 [2019-11-16 00:10:29,883 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:10:29,885 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:10:29,887 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:10:29,889 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:10:29,890 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:10:29,892 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:10:29,894 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:10:29,895 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:10:29,897 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:10:29,898 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:10:29,900 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:10:29,901 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:10:29,904 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:10:29,905 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:10:29,907 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:10:29,908 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:10:30,372 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:10:30,372 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:10:30,372 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:10:30,372 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:10:30,372 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:10:30,373 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:10:30,373 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:10:30,373 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:10:30,373 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:10:30,373 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:10:30,373 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:10:30,373 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:10:30,374 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:10:30,374 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:10:30,374 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:10:30,374 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:10:30,374 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:10:30,374 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:10:30,374 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:10:30,375 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:10:30,375 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:10:30,375 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:10:30,375 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:10:30,375 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:10:30,375 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:10:30,376 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:10:30,376 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:10:30,376 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:10:30,377 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:10:30,377 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:10:30,377 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:10:30,377 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:10:30,377 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:10:30,378 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:10:30,378 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:10:30,379 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:10:30,379 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:10:30,380 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:10:30,380 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:10:30,380 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:10:30,380 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:10:30,380 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:10:30,381 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:10:30,382 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:10:30,382 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:10:30,383 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:10:30,383 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-11-16 00:10:30,383 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-16 00:10:30,383 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:10:30,387 INFO L400 nArgumentSynthesizer]: We have 28 Motzkin's Theorem applications. [2019-11-16 00:10:30,387 INFO L401 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-11-16 00:10:30,400 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:10:30,400 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:10:30,401 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:10:30,401 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-16 00:10:30,401 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:10:30,401 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:10:30,401 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-16 00:10:30,402 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:10:30,403 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:10:30,403 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:10:30,403 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:10:30,404 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-11-16 00:10:30,404 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:10:30,404 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:10:30,405 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-11-16 00:10:30,405 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:10:30,408 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:10:30,408 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:10:30,408 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:10:30,409 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:10:30,409 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:10:30,409 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:10:30,409 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:10:30,409 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:10:30,410 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:10:30,410 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:10:30,411 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:10:30,411 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:10:30,411 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:10:30,411 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:10:30,411 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:10:30,411 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:10:30,412 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:10:30,412 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:10:30,412 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:10:30,413 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:10:30,413 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:10:30,413 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:10:30,413 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:10:30,413 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:10:30,414 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:10:30,414 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:10:30,415 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:10:30,415 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:10:30,415 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:10:30,415 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:10:30,415 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:10:30,416 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:10:30,416 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:10:30,417 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:10:30,417 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:10:30,417 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:10:30,418 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-16 00:10:30,418 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:10:30,418 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:10:30,418 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-16 00:10:30,418 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:10:30,420 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:10:30,420 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:10:30,420 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:10:30,420 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-16 00:10:30,420 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:10:30,421 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:10:30,421 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-16 00:10:30,421 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:10:30,422 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:10:30,423 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:10:30,423 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:10:30,423 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:10:30,423 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:10:30,423 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:10:30,424 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:10:30,424 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:10:30,425 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:10:30,425 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:10:30,425 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:10:30,426 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-16 00:10:30,426 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:10:30,426 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:10:30,426 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-16 00:10:30,426 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:10:30,428 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:10:30,428 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:10:30,428 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:10:30,428 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:10:30,429 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:10:30,429 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:10:30,429 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:10:30,429 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:10:30,430 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:10:30,430 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:10:30,431 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:10:30,431 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:10:30,431 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:10:30,431 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:10:30,432 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:10:30,433 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:10:30,445 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:10:30,454 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-16 00:10:30,454 INFO L444 ModelExtractionUtils]: 23 out of 28 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-11-16 00:10:30,455 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:10:30,455 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-16 00:10:30,455 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:10:30,456 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#string_A~0.base)_12, ULTIMATE.start_main_~i~0) = 5*v_rep(select #length ULTIMATE.start_main_~#string_A~0.base)_12 - 2*ULTIMATE.start_main_~i~0 Supporting invariants [] [2019-11-16 00:10:30,718 INFO L297 tatePredicateManager]: 42 out of 44 supporting invariants were superfluous and have been removed [2019-11-16 00:10:30,726 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-16 00:10:30,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:10:30,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:10:30,806 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-16 00:10:30,807 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:10:30,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:10:30,845 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-16 00:10:30,846 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:10:30,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:10:30,890 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2019-11-16 00:10:30,890 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 90 states and 104 transitions. cyclomatic complexity: 22 Second operand 4 states. [2019-11-16 00:10:30,993 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 90 states and 104 transitions. cyclomatic complexity: 22. Second operand 4 states. Result 120 states and 147 transitions. Complement of second has 7 states. [2019-11-16 00:10:30,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 1 non-accepting loop states 2 accepting loop states [2019-11-16 00:10:30,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-16 00:10:30,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 23 transitions. [2019-11-16 00:10:30,994 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 46 letters. Loop has 2 letters. [2019-11-16 00:10:30,994 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:10:30,994 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 48 letters. Loop has 2 letters. [2019-11-16 00:10:30,994 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:10:30,994 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 46 letters. Loop has 4 letters. [2019-11-16 00:10:30,995 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:10:30,995 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 120 states and 147 transitions. [2019-11-16 00:10:30,996 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-11-16 00:10:30,997 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 120 states to 113 states and 136 transitions. [2019-11-16 00:10:30,997 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 44 [2019-11-16 00:10:30,997 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 49 [2019-11-16 00:10:30,997 INFO L73 IsDeterministic]: Start isDeterministic. Operand 113 states and 136 transitions. [2019-11-16 00:10:30,997 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:10:30,997 INFO L688 BuchiCegarLoop]: Abstraction has 113 states and 136 transitions. [2019-11-16 00:10:30,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states and 136 transitions. [2019-11-16 00:10:30,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 99. [2019-11-16 00:10:30,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-11-16 00:10:30,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 118 transitions. [2019-11-16 00:10:30,999 INFO L711 BuchiCegarLoop]: Abstraction has 99 states and 118 transitions. [2019-11-16 00:10:30,999 INFO L591 BuchiCegarLoop]: Abstraction has 99 states and 118 transitions. [2019-11-16 00:10:30,999 INFO L424 BuchiCegarLoop]: ======== Iteration 25============ [2019-11-16 00:10:31,000 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 99 states and 118 transitions. [2019-11-16 00:10:31,000 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-11-16 00:10:31,000 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:10:31,000 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:10:31,001 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:10:31,001 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-16 00:10:31,002 INFO L791 eck$LassoCheckResult]: Stem: 8606#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8604#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~post1, main_#t~mem3, main_#t~nondet5, main_#t~post4, main_#t~mem6, main_#t~post8, main_#t~mem7, main_#t~post10, main_#t~mem9, main_#t~mem11, main_#t~mem12, main_#t~post13, main_#t~post14, main_~#string_A~0.base, main_~#string_A~0.offset, main_~#string_B~0.base, main_~#string_B~0.offset, main_~i~0, main_~j~0, main_~nc_A~0, main_~nc_B~0, main_~found~0;call main_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.allocOnStack(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.allocOnStack(5);havoc main_~i~0;havoc main_~j~0;havoc main_~nc_A~0;havoc main_~nc_B~0;main_~found~0 := 0;main_~i~0 := 0; 8577#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; 8578#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 8579#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; 8580#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 8625#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; 8623#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 8621#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; 8619#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 8617#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; 8613#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 8612#L19-3 assume !(main_~i~0 < 5); 8575#L19-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 8576#L21 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 8600#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; 8601#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 8605#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; 8626#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 8624#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; 8622#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 8620#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; 8618#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 8616#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; 8615#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 8614#L23-3 assume !(main_~i~0 < 5); 8594#L23-4 call main_#t~mem6 := read~int(main_~#string_B~0.base, 4 + main_~#string_B~0.offset, 1); 8595#L25 assume !!(0 == main_#t~mem6);havoc main_#t~mem6;main_~nc_A~0 := 0; 8608#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 8609#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; 8632#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 8633#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; 8610#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 8611#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; 8640#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 8639#L28-1 assume !(0 != main_#t~mem7);havoc main_#t~mem7; 8638#L28-4 main_~nc_B~0 := 0; 8590#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 8591#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; 8636#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 8635#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; 8634#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 8630#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; 8631#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 8602#L32-1 assume !(0 != main_#t~mem9);havoc main_#t~mem9; 8585#L32-4 assume !!(main_~nc_B~0 >= main_~nc_A~0);main_~j~0 := 0;main_~i~0 := main_~j~0; 8586#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); 8587#L41 assume main_#t~mem11 == main_#t~mem12;havoc main_#t~mem12;havoc main_#t~mem11;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; 8673#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); 8596#L41 [2019-11-16 00:10:31,002 INFO L793 eck$LassoCheckResult]: Loop: 8596#L41 assume !(main_#t~mem11 == main_#t~mem12);havoc main_#t~mem12;havoc main_#t~mem11;main_~i~0 := 1 + (main_~i~0 - main_~j~0);main_~j~0 := 0; 8597#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); 8596#L41 [2019-11-16 00:10:31,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:10:31,002 INFO L82 PathProgramCache]: Analyzing trace with hash 2032634054, now seen corresponding path program 2 times [2019-11-16 00:10:31,002 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:10:31,003 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352668490] [2019-11-16 00:10:31,003 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:10:31,003 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:10:31,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:10:31,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:10:31,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:10:31,042 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:10:31,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:10:31,043 INFO L82 PathProgramCache]: Analyzing trace with hash 3708, now seen corresponding path program 2 times [2019-11-16 00:10:31,043 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:10:31,044 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551837118] [2019-11-16 00:10:31,044 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:10:31,044 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:10:31,044 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:10:31,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:10:31,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:10:31,048 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:10:31,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:10:31,049 INFO L82 PathProgramCache]: Analyzing trace with hash -848791039, now seen corresponding path program 11 times [2019-11-16 00:10:31,049 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:10:31,049 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040597564] [2019-11-16 00:10:31,049 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:10:31,049 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:10:31,050 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:10:31,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:10:31,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:10:31,089 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:10:38,761 WARN L191 SmtUtils]: Spent 7.56 s on a formula simplification. DAG size of input: 351 DAG size of output: 258 [2019-11-16 00:10:39,211 WARN L191 SmtUtils]: Spent 443.00 ms on a formula simplification that was a NOOP. DAG size: 142 [2019-11-16 00:10:39,214 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:10:39,214 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:10:39,214 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:10:39,214 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:10:39,215 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:10:39,215 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:10:39,215 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:10:39,215 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:10:39,215 INFO L131 ssoRankerPreferences]: Filename of dumped script: string-1.i_Iteration25_Lasso [2019-11-16 00:10:39,215 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:10:39,215 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:10:39,217 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:10:39,219 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:10:39,220 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:10:39,221 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:10:39,222 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:10:39,224 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:10:39,225 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:10:39,226 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:10:39,228 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:10:39,229 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:10:39,230 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:10:39,231 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:10:39,233 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:10:39,235 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:10:39,236 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:10:39,238 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:10:40,152 WARN L191 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 85 [2019-11-16 00:10:40,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:10:40,744 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:10:40,744 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:10:40,744 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:10:40,745 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:10:40,745 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:10:40,745 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:10:40,745 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:10:40,746 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:10:40,746 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:10:40,746 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:10:40,747 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:10:40,747 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:10:40,747 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:10:40,747 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:10:40,747 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:10:40,747 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:10:40,747 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:10:40,747 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:10:40,748 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:10:40,748 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:10:40,748 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:10:40,748 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:10:40,748 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:10:40,748 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:10:40,748 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:10:40,749 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:10:40,749 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:10:40,749 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:10:40,749 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:10:40,749 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:10:40,749 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:10:40,750 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:10:40,750 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:10:40,750 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:10:40,750 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:10:40,750 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:10:40,750 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:10:40,750 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:10:40,751 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:10:40,751 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:10:40,751 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:10:40,751 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:10:40,751 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:10:40,751 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:10:40,751 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:10:40,751 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:10:40,752 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:10:40,752 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:10:40,752 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:10:40,752 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:10:40,752 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:10:40,752 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:10:40,752 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:10:40,753 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:10:40,753 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:10:40,753 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:10:40,753 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:10:40,753 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:10:40,753 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:10:40,754 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:10:40,754 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:10:40,754 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:10:40,754 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:10:40,754 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:10:40,754 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:10:40,755 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:10:40,755 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:10:40,755 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:10:40,755 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:10:40,755 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:10:40,755 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:10:40,755 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:10:40,756 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:10:40,756 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:10:40,756 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:10:40,756 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:10:40,756 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:10:40,756 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:10:40,756 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:10:40,759 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:10:40,759 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:10:40,759 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:10:40,760 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:10:40,760 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:10:40,760 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:10:40,760 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:10:40,761 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:10:40,761 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:10:40,761 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:10:40,761 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:10:40,761 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:10:40,762 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:10:40,762 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:10:40,762 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:10:40,762 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:10:40,763 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:10:40,763 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:10:40,763 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:10:40,763 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:10:40,763 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:10:40,764 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:10:40,764 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:10:40,764 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:10:40,764 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:10:40,765 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:10:40,765 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:10:40,765 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:10:40,766 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:10:40,766 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:10:40,766 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:10:40,767 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:10:40,767 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:10:40,767 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:10:40,767 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:10:40,767 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:10:40,767 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:10:40,768 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:10:40,768 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:10:40,768 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:10:40,769 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:10:40,769 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:10:40,769 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:10:40,769 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:10:40,769 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:10:40,770 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:10:40,770 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:10:40,771 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:10:40,771 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:10:40,771 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:10:40,771 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:10:40,771 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:10:40,772 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:10:40,772 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:10:40,772 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:10:40,772 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:10:40,773 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:10:40,773 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:10:40,773 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:10:40,773 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:10:40,774 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:10:40,774 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:10:40,775 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:10:40,776 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:10:40,776 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:10:40,776 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:10:40,776 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:10:40,777 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:10:40,777 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:10:40,777 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:10:40,778 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:10:40,778 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:10:40,779 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:10:40,779 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-11-16 00:10:40,779 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:10:40,779 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:10:40,780 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-11-16 00:10:40,780 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:10:40,783 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:10:40,783 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:10:40,783 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:10:40,784 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:10:40,784 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:10:40,784 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:10:40,784 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:10:40,784 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:10:40,785 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:10:40,786 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:10:40,786 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:10:40,786 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-16 00:10:40,786 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:10:40,786 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:10:40,787 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-16 00:10:40,787 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:10:40,789 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:10:40,789 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:10:40,790 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:10:40,790 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:10:40,790 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:10:40,790 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:10:40,790 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:10:40,791 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:10:40,791 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:10:40,792 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:10:40,792 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:10:40,792 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:10:40,792 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:10:40,792 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:10:40,793 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:10:40,793 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:10:40,794 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:10:40,795 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:10:40,795 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:10:40,795 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-11-16 00:10:40,796 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-16 00:10:40,796 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:10:40,799 INFO L400 nArgumentSynthesizer]: We have 28 Motzkin's Theorem applications. [2019-11-16 00:10:40,799 INFO L401 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-11-16 00:10:40,824 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:10:40,825 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:10:40,825 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:10:40,825 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:10:40,826 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:10:40,826 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:10:40,827 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:10:40,827 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:10:40,840 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:10:40,854 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2019-11-16 00:10:40,854 INFO L444 ModelExtractionUtils]: 20 out of 28 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-11-16 00:10:40,854 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:10:40,855 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-16 00:10:40,855 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:10:40,855 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~nc_A~0, ULTIMATE.start_main_~j~0) = -1*ULTIMATE.start_main_~i~0 + 1*ULTIMATE.start_main_~nc_A~0 + 1*ULTIMATE.start_main_~j~0 Supporting invariants [] [2019-11-16 00:10:41,054 INFO L297 tatePredicateManager]: 33 out of 33 supporting invariants were superfluous and have been removed [2019-11-16 00:10:41,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:10:41,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:10:41,124 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:10:41,125 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:10:41,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:10:41,133 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-16 00:10:41,133 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:10:41,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:10:41,146 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-16 00:10:41,146 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 99 states and 118 transitions. cyclomatic complexity: 29 Second operand 3 states. [2019-11-16 00:10:41,189 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 99 states and 118 transitions. cyclomatic complexity: 29. Second operand 3 states. Result 137 states and 171 transitions. Complement of second has 6 states. [2019-11-16 00:10:41,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-16 00:10:41,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-16 00:10:41,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2019-11-16 00:10:41,190 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 49 letters. Loop has 2 letters. [2019-11-16 00:10:41,190 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:10:41,190 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 51 letters. Loop has 2 letters. [2019-11-16 00:10:41,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:10:41,191 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 49 letters. Loop has 4 letters. [2019-11-16 00:10:41,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:10:41,191 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 137 states and 171 transitions. [2019-11-16 00:10:41,192 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-16 00:10:41,193 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 137 states to 103 states and 121 transitions. [2019-11-16 00:10:41,193 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2019-11-16 00:10:41,193 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2019-11-16 00:10:41,193 INFO L73 IsDeterministic]: Start isDeterministic. Operand 103 states and 121 transitions. [2019-11-16 00:10:41,193 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:10:41,193 INFO L688 BuchiCegarLoop]: Abstraction has 103 states and 121 transitions. [2019-11-16 00:10:41,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states and 121 transitions. [2019-11-16 00:10:41,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 88. [2019-11-16 00:10:41,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-11-16 00:10:41,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 105 transitions. [2019-11-16 00:10:41,195 INFO L711 BuchiCegarLoop]: Abstraction has 88 states and 105 transitions. [2019-11-16 00:10:41,195 INFO L591 BuchiCegarLoop]: Abstraction has 88 states and 105 transitions. [2019-11-16 00:10:41,195 INFO L424 BuchiCegarLoop]: ======== Iteration 26============ [2019-11-16 00:10:41,196 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 88 states and 105 transitions. [2019-11-16 00:10:41,196 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-16 00:10:41,196 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:10:41,196 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:10:41,197 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:10:41,197 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-16 00:10:41,197 INFO L791 eck$LassoCheckResult]: Stem: 9149#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 9145#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~post1, main_#t~mem3, main_#t~nondet5, main_#t~post4, main_#t~mem6, main_#t~post8, main_#t~mem7, main_#t~post10, main_#t~mem9, main_#t~mem11, main_#t~mem12, main_#t~post13, main_#t~post14, main_~#string_A~0.base, main_~#string_A~0.offset, main_~#string_B~0.base, main_~#string_B~0.offset, main_~i~0, main_~j~0, main_~nc_A~0, main_~nc_B~0, main_~found~0;call main_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.allocOnStack(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.allocOnStack(5);havoc main_~i~0;havoc main_~j~0;havoc main_~nc_A~0;havoc main_~nc_B~0;main_~found~0 := 0;main_~i~0 := 0; 9121#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; 9122#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 9123#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; 9124#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 9165#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; 9163#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 9161#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; 9159#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 9157#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; 9153#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 9152#L19-3 assume !(main_~i~0 < 5); 9119#L19-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 9120#L21 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 9143#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; 9144#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 9148#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; 9166#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 9164#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; 9162#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 9160#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; 9158#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 9156#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; 9155#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 9154#L23-3 assume !(main_~i~0 < 5); 9138#L23-4 call main_#t~mem6 := read~int(main_~#string_B~0.base, 4 + main_~#string_B~0.offset, 1); 9139#L25 assume !!(0 == main_#t~mem6);havoc main_#t~mem6;main_~nc_A~0 := 0; 9150#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 9127#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; 9128#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 9151#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; 9175#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 9173#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; 9170#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 9125#L28-1 assume !(0 != main_#t~mem7);havoc main_#t~mem7; 9126#L28-4 main_~nc_B~0 := 0; 9134#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 9135#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; 9136#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 9137#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; 9174#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 9172#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; 9169#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 9168#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; 9167#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 9146#L32-1 assume !(0 != main_#t~mem9);havoc main_#t~mem9; 9147#L32-4 assume !!(main_~nc_B~0 >= main_~nc_A~0);main_~j~0 := 0;main_~i~0 := main_~j~0; 9188#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); 9189#L41 assume !(main_#t~mem11 == main_#t~mem12);havoc main_#t~mem12;havoc main_#t~mem11;main_~i~0 := 1 + (main_~i~0 - main_~j~0);main_~j~0 := 0; 9206#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); 9205#L41 assume !(main_#t~mem11 == main_#t~mem12);havoc main_#t~mem12;havoc main_#t~mem11;main_~i~0 := 1 + (main_~i~0 - main_~j~0);main_~j~0 := 0; 9183#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); 9184#L41 assume main_#t~mem11 == main_#t~mem12;havoc main_#t~mem12;havoc main_#t~mem11;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; 9179#L41-2 [2019-11-16 00:10:41,197 INFO L793 eck$LassoCheckResult]: Loop: 9179#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); 9180#L41 assume main_#t~mem11 == main_#t~mem12;havoc main_#t~mem12;havoc main_#t~mem11;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; 9179#L41-2 [2019-11-16 00:10:41,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:10:41,197 INFO L82 PathProgramCache]: Analyzing trace with hash -1046009104, now seen corresponding path program 12 times [2019-11-16 00:10:41,197 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:10:41,198 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715949602] [2019-11-16 00:10:41,198 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:10:41,198 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:10:41,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:10:41,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:10:41,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:10:41,239 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:10:41,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:10:41,239 INFO L82 PathProgramCache]: Analyzing trace with hash 3556, now seen corresponding path program 15 times [2019-11-16 00:10:41,239 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:10:41,239 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158910196] [2019-11-16 00:10:41,240 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:10:41,240 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:10:41,240 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:10:41,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:10:41,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:10:41,244 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:10:41,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:10:41,245 INFO L82 PathProgramCache]: Analyzing trace with hash -192399085, now seen corresponding path program 13 times [2019-11-16 00:10:41,245 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:10:41,245 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406819588] [2019-11-16 00:10:41,245 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:10:41,245 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:10:41,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:10:41,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:10:41,392 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 4 proven. 20 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-11-16 00:10:41,392 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406819588] [2019-11-16 00:10:41,392 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [747951069] [2019-11-16 00:10:41,392 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_36c1ed6d-2c10-4884-afdf-a94e276eebcd/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:10:41,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:10:41,606 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-16 00:10:41,607 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:10:41,734 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-11-16 00:10:41,734 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:10:41,734 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2019-11-16 00:10:41,734 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755745188] [2019-11-16 00:10:41,842 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:10:41,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-16 00:10:41,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2019-11-16 00:10:41,842 INFO L87 Difference]: Start difference. First operand 88 states and 105 transitions. cyclomatic complexity: 27 Second operand 15 states. [2019-11-16 00:10:41,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:10:41,982 INFO L93 Difference]: Finished difference Result 136 states and 160 transitions. [2019-11-16 00:10:41,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-16 00:10:41,982 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 136 states and 160 transitions. [2019-11-16 00:10:41,983 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-16 00:10:41,984 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 136 states to 88 states and 104 transitions. [2019-11-16 00:10:41,984 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2019-11-16 00:10:41,984 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2019-11-16 00:10:41,984 INFO L73 IsDeterministic]: Start isDeterministic. Operand 88 states and 104 transitions. [2019-11-16 00:10:41,984 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:10:41,984 INFO L688 BuchiCegarLoop]: Abstraction has 88 states and 104 transitions. [2019-11-16 00:10:41,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states and 104 transitions. [2019-11-16 00:10:41,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2019-11-16 00:10:41,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-11-16 00:10:41,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 104 transitions. [2019-11-16 00:10:41,986 INFO L711 BuchiCegarLoop]: Abstraction has 88 states and 104 transitions. [2019-11-16 00:10:41,986 INFO L591 BuchiCegarLoop]: Abstraction has 88 states and 104 transitions. [2019-11-16 00:10:41,986 INFO L424 BuchiCegarLoop]: ======== Iteration 27============ [2019-11-16 00:10:41,986 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 88 states and 104 transitions. [2019-11-16 00:10:41,987 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-16 00:10:41,987 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:10:41,987 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:10:41,988 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [6, 5, 5, 5, 5, 5, 5, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:10:41,988 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-16 00:10:41,988 INFO L791 eck$LassoCheckResult]: Stem: 9568#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 9564#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~post1, main_#t~mem3, main_#t~nondet5, main_#t~post4, main_#t~mem6, main_#t~post8, main_#t~mem7, main_#t~post10, main_#t~mem9, main_#t~mem11, main_#t~mem12, main_#t~post13, main_#t~post14, main_~#string_A~0.base, main_~#string_A~0.offset, main_~#string_B~0.base, main_~#string_B~0.offset, main_~i~0, main_~j~0, main_~nc_A~0, main_~nc_B~0, main_~found~0;call main_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.allocOnStack(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.allocOnStack(5);havoc main_~i~0;havoc main_~j~0;havoc main_~nc_A~0;havoc main_~nc_B~0;main_~found~0 := 0;main_~i~0 := 0; 9540#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; 9541#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 9542#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; 9543#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 9584#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; 9582#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 9580#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; 9578#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 9576#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; 9572#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 9571#L19-3 assume !(main_~i~0 < 5); 9538#L19-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 9539#L21 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 9562#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; 9563#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 9567#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; 9585#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 9583#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; 9581#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 9579#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; 9577#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 9575#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; 9574#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 9573#L23-3 assume !(main_~i~0 < 5); 9557#L23-4 call main_#t~mem6 := read~int(main_~#string_B~0.base, 4 + main_~#string_B~0.offset, 1); 9558#L25 assume !!(0 == main_#t~mem6);havoc main_#t~mem6;main_~nc_A~0 := 0; 9569#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 9546#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; 9547#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 9570#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; 9595#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 9593#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; 9590#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 9591#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; 9625#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 9587#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; 9586#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 9544#L28-1 assume !(0 != main_#t~mem7);havoc main_#t~mem7; 9545#L28-4 main_~nc_B~0 := 0; 9553#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 9554#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; 9555#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 9556#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; 9596#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 9594#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; 9592#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 9589#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; 9588#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 9565#L32-1 assume !(0 != main_#t~mem9);havoc main_#t~mem9; 9566#L32-4 assume !!(main_~nc_B~0 >= main_~nc_A~0);main_~j~0 := 0;main_~i~0 := main_~j~0; 9611#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); 9605#L41 assume !(main_#t~mem11 == main_#t~mem12);havoc main_#t~mem12;havoc main_#t~mem11;main_~i~0 := 1 + (main_~i~0 - main_~j~0);main_~j~0 := 0; 9608#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); 9607#L41 assume main_#t~mem11 == main_#t~mem12;havoc main_#t~mem12;havoc main_#t~mem11;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; 9597#L41-2 [2019-11-16 00:10:41,988 INFO L793 eck$LassoCheckResult]: Loop: 9597#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); 9598#L41 assume main_#t~mem11 == main_#t~mem12;havoc main_#t~mem12;havoc main_#t~mem11;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; 9597#L41-2 [2019-11-16 00:10:41,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:10:41,988 INFO L82 PathProgramCache]: Analyzing trace with hash -1780163307, now seen corresponding path program 14 times [2019-11-16 00:10:41,988 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:10:41,988 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755217129] [2019-11-16 00:10:41,989 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:10:41,989 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:10:41,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:10:41,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:10:42,152 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2019-11-16 00:10:42,152 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755217129] [2019-11-16 00:10:42,153 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:10:42,153 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-16 00:10:42,153 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031148774] [2019-11-16 00:10:42,153 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-16 00:10:42,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:10:42,153 INFO L82 PathProgramCache]: Analyzing trace with hash 3556, now seen corresponding path program 16 times [2019-11-16 00:10:42,154 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:10:42,154 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183095089] [2019-11-16 00:10:42,154 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:10:42,154 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:10:42,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:10:42,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:10:42,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:10:42,162 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:10:42,262 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:10:42,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-16 00:10:42,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:10:42,262 INFO L87 Difference]: Start difference. First operand 88 states and 104 transitions. cyclomatic complexity: 26 Second operand 9 states. [2019-11-16 00:10:42,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:10:42,318 INFO L93 Difference]: Finished difference Result 74 states and 86 transitions. [2019-11-16 00:10:42,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-16 00:10:42,319 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 74 states and 86 transitions. [2019-11-16 00:10:42,319 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-16 00:10:42,320 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 74 states to 72 states and 84 transitions. [2019-11-16 00:10:42,320 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2019-11-16 00:10:42,320 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2019-11-16 00:10:42,320 INFO L73 IsDeterministic]: Start isDeterministic. Operand 72 states and 84 transitions. [2019-11-16 00:10:42,320 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:10:42,321 INFO L688 BuchiCegarLoop]: Abstraction has 72 states and 84 transitions. [2019-11-16 00:10:42,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states and 84 transitions. [2019-11-16 00:10:42,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-11-16 00:10:42,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-11-16 00:10:42,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 84 transitions. [2019-11-16 00:10:42,322 INFO L711 BuchiCegarLoop]: Abstraction has 72 states and 84 transitions. [2019-11-16 00:10:42,322 INFO L591 BuchiCegarLoop]: Abstraction has 72 states and 84 transitions. [2019-11-16 00:10:42,322 INFO L424 BuchiCegarLoop]: ======== Iteration 28============ [2019-11-16 00:10:42,322 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 72 states and 84 transitions. [2019-11-16 00:10:42,322 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-16 00:10:42,323 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:10:42,323 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:10:42,323 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 5, 5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:10:42,323 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-16 00:10:42,323 INFO L791 eck$LassoCheckResult]: Stem: 9740#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 9736#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~post1, main_#t~mem3, main_#t~nondet5, main_#t~post4, main_#t~mem6, main_#t~post8, main_#t~mem7, main_#t~post10, main_#t~mem9, main_#t~mem11, main_#t~mem12, main_#t~post13, main_#t~post14, main_~#string_A~0.base, main_~#string_A~0.offset, main_~#string_B~0.base, main_~#string_B~0.offset, main_~i~0, main_~j~0, main_~nc_A~0, main_~nc_B~0, main_~found~0;call main_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.allocOnStack(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.allocOnStack(5);havoc main_~i~0;havoc main_~j~0;havoc main_~nc_A~0;havoc main_~nc_B~0;main_~found~0 := 0;main_~i~0 := 0; 9714#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; 9715#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 9716#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; 9717#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 9753#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; 9751#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 9749#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; 9747#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 9745#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; 9744#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 9743#L19-3 assume !(main_~i~0 < 5); 9712#L19-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 9713#L21 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 9738#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; 9739#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 9734#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; 9735#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 9768#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; 9767#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 9766#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; 9765#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 9763#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; 9761#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 9759#L23-3 assume !(main_~i~0 < 5); 9729#L23-4 call main_#t~mem6 := read~int(main_~#string_B~0.base, 4 + main_~#string_B~0.offset, 1); 9730#L25 assume !!(0 == main_#t~mem6);havoc main_#t~mem6;main_~nc_A~0 := 0; 9742#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 9718#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; 9719#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 9756#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; 9755#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 9754#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; 9752#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 9750#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; 9748#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 9746#L28-1 assume !(0 != main_#t~mem7);havoc main_#t~mem7; 9741#L28-4 main_~nc_B~0 := 0; 9725#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 9726#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; 9727#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 9728#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; 9764#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 9762#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; 9760#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 9758#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; 9757#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 9737#L32-1 assume !(0 != main_#t~mem9);havoc main_#t~mem9; 9720#L32-4 assume !!(main_~nc_B~0 >= main_~nc_A~0);main_~j~0 := 0;main_~i~0 := main_~j~0; 9721#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); 9783#L41 assume !(main_#t~mem11 == main_#t~mem12);havoc main_#t~mem12;havoc main_#t~mem11;main_~i~0 := 1 + (main_~i~0 - main_~j~0);main_~j~0 := 0; 9782#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); 9779#L41 assume !(main_#t~mem11 == main_#t~mem12);havoc main_#t~mem12;havoc main_#t~mem11;main_~i~0 := 1 + (main_~i~0 - main_~j~0);main_~j~0 := 0; 9776#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); 9775#L41 assume main_#t~mem11 == main_#t~mem12;havoc main_#t~mem12;havoc main_#t~mem11;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; 9771#L41-2 [2019-11-16 00:10:42,323 INFO L793 eck$LassoCheckResult]: Loop: 9771#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); 9772#L41 assume main_#t~mem11 == main_#t~mem12;havoc main_#t~mem12;havoc main_#t~mem11;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; 9771#L41-2 [2019-11-16 00:10:42,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:10:42,323 INFO L82 PathProgramCache]: Analyzing trace with hash 735069909, now seen corresponding path program 15 times [2019-11-16 00:10:42,323 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:10:42,324 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132606806] [2019-11-16 00:10:42,324 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:10:42,324 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:10:42,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:10:42,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:10:42,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:10:42,365 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:10:42,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:10:42,365 INFO L82 PathProgramCache]: Analyzing trace with hash 3556, now seen corresponding path program 17 times [2019-11-16 00:10:42,365 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:10:42,366 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875673483] [2019-11-16 00:10:42,366 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:10:42,366 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:10:42,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:10:42,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:10:42,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:10:42,370 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:10:42,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:10:42,371 INFO L82 PathProgramCache]: Analyzing trace with hash 2027548600, now seen corresponding path program 16 times [2019-11-16 00:10:42,371 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:10:42,371 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169520031] [2019-11-16 00:10:42,371 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:10:42,371 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:10:42,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:10:42,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:10:42,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:10:42,415 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:10:47,634 WARN L191 SmtUtils]: Spent 5.12 s on a formula simplification. DAG size of input: 408 DAG size of output: 302 [2019-11-16 00:10:47,890 WARN L191 SmtUtils]: Spent 244.00 ms on a formula simplification that was a NOOP. DAG size: 152 [2019-11-16 00:10:47,893 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:10:47,893 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:10:47,893 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:10:47,893 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:10:47,893 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:10:47,893 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:10:47,893 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:10:47,893 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:10:47,893 INFO L131 ssoRankerPreferences]: Filename of dumped script: string-1.i_Iteration28_Lasso [2019-11-16 00:10:47,893 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:10:47,893 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:10:47,895 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:10:47,899 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:10:47,900 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:10:47,902 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:10:47,904 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:10:47,909 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:10:47,911 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:10:47,912 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:10:47,913 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:10:47,915 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:10:47,916 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:10:47,917 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:10:47,919 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:10:47,921 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:10:47,923 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:10:47,925 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:10:47,926 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:10:47,928 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:10:48,797 WARN L191 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 96 [2019-11-16 00:10:48,969 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:10:49,181 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2019-11-16 00:10:57,140 WARN L191 SmtUtils]: Spent 7.80 s on a formula simplification. DAG size of input: 181 DAG size of output: 125 [2019-11-16 00:10:57,156 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:10:57,157 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:10:57,157 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:10:57,157 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:10:57,157 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:10:57,157 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:10:57,158 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:10:57,158 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:10:57,158 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:10:57,158 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:10:57,158 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:10:57,158 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:10:57,159 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:10:57,159 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:10:57,159 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:10:57,159 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:10:57,159 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:10:57,159 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:10:57,159 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:10:57,160 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:10:57,160 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:10:57,160 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:10:57,160 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:10:57,160 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:10:57,160 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:10:57,161 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:10:57,161 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:10:57,161 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:10:57,162 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:10:57,162 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:10:57,162 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:10:57,162 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:10:57,162 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:10:57,162 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:10:57,162 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:10:57,163 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:10:57,163 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:10:57,163 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:10:57,163 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:10:57,163 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:10:57,163 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:10:57,163 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:10:57,164 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:10:57,164 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:10:57,164 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:10:57,164 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:10:57,164 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:10:57,164 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:10:57,164 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:10:57,165 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:10:57,165 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:10:57,165 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:10:57,165 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:10:57,165 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:10:57,167 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:10:57,167 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:10:57,168 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:10:57,168 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:10:57,168 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:10:57,168 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:10:57,168 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:10:57,168 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:10:57,169 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:10:57,169 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:10:57,169 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:10:57,170 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:10:57,170 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:10:57,170 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:10:57,170 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:10:57,170 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:10:57,170 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:10:57,171 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:10:57,171 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:10:57,171 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:10:57,171 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:10:57,172 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:10:57,172 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:10:57,172 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:10:57,172 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:10:57,172 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:10:57,172 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:10:57,173 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:10:57,173 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:10:57,173 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:10:57,173 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:10:57,174 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:10:57,174 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:10:57,174 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:10:57,174 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:10:57,174 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:10:57,175 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:10:57,175 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:10:57,175 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:10:57,175 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:10:57,176 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:10:57,176 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:10:57,176 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:10:57,176 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:10:57,176 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:10:57,176 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:10:57,177 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:10:57,177 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:10:57,177 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:10:57,177 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:10:57,178 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:10:57,178 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:10:57,178 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:10:57,178 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:10:57,178 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:10:57,179 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:10:57,179 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:10:57,179 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:10:57,179 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:10:57,180 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:10:57,180 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:10:57,180 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:10:57,180 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:10:57,180 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:10:57,181 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:10:57,181 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:10:57,181 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:10:57,181 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:10:57,181 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:10:57,182 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:10:57,182 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:10:57,183 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:10:57,183 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:10:57,183 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:10:57,184 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:10:57,184 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:10:57,184 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:10:57,184 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:10:57,184 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:10:57,184 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:10:57,185 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:10:57,185 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:10:57,185 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:10:57,185 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:10:57,186 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:10:57,186 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:10:57,186 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:10:57,186 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:10:57,186 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:10:57,187 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:10:57,187 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:10:57,187 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:10:57,187 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:10:57,188 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:10:57,188 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:10:57,188 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:10:57,188 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:10:57,189 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:10:57,189 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:10:57,190 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:10:57,190 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:10:57,190 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:10:57,190 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:10:57,190 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:10:57,191 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:10:57,192 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:10:57,192 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:10:57,193 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:10:57,193 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:10:57,193 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:10:57,193 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:10:57,194 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:10:57,194 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:10:57,194 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:10:57,195 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:10:57,195 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:10:57,195 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:10:57,195 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:10:57,196 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:10:57,196 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:10:57,196 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:10:57,197 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:10:57,198 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:10:57,198 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:10:57,198 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:10:57,199 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:10:57,199 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:10:57,199 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:10:57,199 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:10:57,200 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:10:57,200 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:10:57,201 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:10:57,201 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-11-16 00:10:57,201 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:10:57,201 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:10:57,202 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-11-16 00:10:57,202 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:10:57,204 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:10:57,205 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:10:57,205 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:10:57,205 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:10:57,206 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:10:57,206 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:10:57,206 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:10:57,206 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:10:57,206 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:10:57,206 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:10:57,207 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:10:57,207 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:10:57,207 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:10:57,207 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:10:57,208 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:10:57,208 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:10:57,208 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:10:57,209 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:10:57,209 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:10:57,209 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:10:57,210 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-16 00:10:57,210 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:10:57,210 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:10:57,210 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-16 00:10:57,211 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:10:57,212 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:10:57,212 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:10:57,212 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:10:57,213 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:10:57,213 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:10:57,213 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:10:57,214 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:10:57,214 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:10:57,231 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:10:57,254 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-11-16 00:10:57,254 INFO L444 ModelExtractionUtils]: 22 out of 28 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-11-16 00:10:57,255 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:10:57,255 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-16 00:10:57,255 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:10:57,256 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 7 Supporting invariants [] [2019-11-16 00:10:57,511 INFO L297 tatePredicateManager]: 50 out of 51 supporting invariants were superfluous and have been removed [2019-11-16 00:10:57,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:10:57,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:10:57,578 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-16 00:10:57,579 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:10:57,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:10:57,789 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-16 00:10:57,789 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:10:57,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:10:57,805 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.6 stem predicates 2 loop predicates [2019-11-16 00:10:57,805 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 72 states and 84 transitions. cyclomatic complexity: 20 Second operand 8 states. [2019-11-16 00:10:57,895 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 72 states and 84 transitions. cyclomatic complexity: 20. Second operand 8 states. Result 85 states and 100 transitions. Complement of second has 10 states. [2019-11-16 00:10:57,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 6 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-16 00:10:57,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-16 00:10:57,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 32 transitions. [2019-11-16 00:10:57,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 32 transitions. Stem has 56 letters. Loop has 2 letters. [2019-11-16 00:10:57,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:10:57,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 32 transitions. Stem has 58 letters. Loop has 2 letters. [2019-11-16 00:10:57,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:10:57,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 32 transitions. Stem has 56 letters. Loop has 4 letters. [2019-11-16 00:10:57,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:10:57,897 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 85 states and 100 transitions. [2019-11-16 00:10:57,898 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-16 00:10:57,899 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 85 states to 77 states and 90 transitions. [2019-11-16 00:10:57,899 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2019-11-16 00:10:57,899 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2019-11-16 00:10:57,899 INFO L73 IsDeterministic]: Start isDeterministic. Operand 77 states and 90 transitions. [2019-11-16 00:10:57,899 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:10:57,899 INFO L688 BuchiCegarLoop]: Abstraction has 77 states and 90 transitions. [2019-11-16 00:10:57,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states and 90 transitions. [2019-11-16 00:10:57,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 72. [2019-11-16 00:10:57,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-11-16 00:10:57,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 84 transitions. [2019-11-16 00:10:57,901 INFO L711 BuchiCegarLoop]: Abstraction has 72 states and 84 transitions. [2019-11-16 00:10:57,901 INFO L591 BuchiCegarLoop]: Abstraction has 72 states and 84 transitions. [2019-11-16 00:10:57,901 INFO L424 BuchiCegarLoop]: ======== Iteration 29============ [2019-11-16 00:10:57,901 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 72 states and 84 transitions. [2019-11-16 00:10:57,902 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-16 00:10:57,902 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:10:57,902 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:10:57,902 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:10:57,903 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-16 00:10:57,903 INFO L791 eck$LassoCheckResult]: Stem: 10315#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10313#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~post1, main_#t~mem3, main_#t~nondet5, main_#t~post4, main_#t~mem6, main_#t~post8, main_#t~mem7, main_#t~post10, main_#t~mem9, main_#t~mem11, main_#t~mem12, main_#t~post13, main_#t~post14, main_~#string_A~0.base, main_~#string_A~0.offset, main_~#string_B~0.base, main_~#string_B~0.offset, main_~i~0, main_~j~0, main_~nc_A~0, main_~nc_B~0, main_~found~0;call main_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.allocOnStack(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.allocOnStack(5);havoc main_~i~0;havoc main_~j~0;havoc main_~nc_A~0;havoc main_~nc_B~0;main_~found~0 := 0;main_~i~0 := 0; 10289#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; 10290#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 10291#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; 10292#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 10328#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; 10326#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 10324#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; 10322#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 10320#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; 10319#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 10318#L19-3 assume !(main_~i~0 < 5); 10287#L19-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 10288#L21 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 10310#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; 10311#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 10314#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; 10343#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 10341#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; 10339#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 10338#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; 10335#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 10334#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; 10333#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 10332#L23-3 assume !(main_~i~0 < 5); 10306#L23-4 call main_#t~mem6 := read~int(main_~#string_B~0.base, 4 + main_~#string_B~0.offset, 1); 10307#L25 assume !!(0 == main_#t~mem6);havoc main_#t~mem6;main_~nc_A~0 := 0; 10317#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 10293#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; 10294#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 10331#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; 10330#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 10329#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; 10327#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 10325#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; 10323#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 10321#L28-1 assume !(0 != main_#t~mem7);havoc main_#t~mem7; 10316#L28-4 main_~nc_B~0 := 0; 10302#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 10303#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; 10304#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 10305#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; 10344#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 10342#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; 10340#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 10337#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; 10336#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 10312#L32-1 assume !(0 != main_#t~mem9);havoc main_#t~mem9; 10295#L32-4 assume !!(main_~nc_B~0 >= main_~nc_A~0);main_~j~0 := 0;main_~i~0 := main_~j~0; 10296#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); 10352#L41 assume main_#t~mem11 == main_#t~mem12;havoc main_#t~mem12;havoc main_#t~mem11;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; 10351#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); 10308#L41 assume !(main_#t~mem11 == main_#t~mem12);havoc main_#t~mem12;havoc main_#t~mem11;main_~i~0 := 1 + (main_~i~0 - main_~j~0);main_~j~0 := 0; 10309#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); 10299#L41 assume !(main_#t~mem11 == main_#t~mem12);havoc main_#t~mem12;havoc main_#t~mem11;main_~i~0 := 1 + (main_~i~0 - main_~j~0);main_~j~0 := 0; 10350#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); 10349#L41 assume main_#t~mem11 == main_#t~mem12;havoc main_#t~mem12;havoc main_#t~mem11;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; 10348#L41-2 [2019-11-16 00:10:57,903 INFO L793 eck$LassoCheckResult]: Loop: 10348#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); 10347#L41 assume main_#t~mem11 == main_#t~mem12;havoc main_#t~mem12;havoc main_#t~mem11;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; 10348#L41-2 [2019-11-16 00:10:57,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:10:57,903 INFO L82 PathProgramCache]: Analyzing trace with hash 252543160, now seen corresponding path program 17 times [2019-11-16 00:10:57,903 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:10:57,904 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333174507] [2019-11-16 00:10:57,904 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:10:57,904 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:10:57,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:10:57,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:10:57,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:10:57,980 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:10:57,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:10:57,981 INFO L82 PathProgramCache]: Analyzing trace with hash 3556, now seen corresponding path program 18 times [2019-11-16 00:10:57,981 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:10:57,981 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632816539] [2019-11-16 00:10:57,981 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:10:57,981 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:10:57,981 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:10:57,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:10:57,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:10:57,986 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:10:57,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:10:57,986 INFO L82 PathProgramCache]: Analyzing trace with hash -2119156517, now seen corresponding path program 18 times [2019-11-16 00:10:57,986 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:10:57,987 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140566556] [2019-11-16 00:10:57,987 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:10:57,987 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:10:57,987 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:10:58,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:10:58,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:10:58,038 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:11:04,678 WARN L191 SmtUtils]: Spent 6.56 s on a formula simplification. DAG size of input: 431 DAG size of output: 310 [2019-11-16 00:11:04,962 WARN L191 SmtUtils]: Spent 275.00 ms on a formula simplification that was a NOOP. DAG size: 136 [2019-11-16 00:11:04,965 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:11:04,965 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:11:04,965 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:11:04,965 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:11:04,965 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:11:04,965 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:11:04,965 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:11:04,965 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:11:04,965 INFO L131 ssoRankerPreferences]: Filename of dumped script: string-1.i_Iteration29_Lasso [2019-11-16 00:11:04,965 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:11:04,965 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:11:04,967 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:11:05,968 WARN L191 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 90 [2019-11-16 00:11:06,161 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:11:06,162 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:11:06,164 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:11:06,165 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:11:06,167 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:11:06,168 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:11:06,169 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:11:06,171 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:11:06,172 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:11:06,174 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:11:06,176 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:11:06,177 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:11:06,178 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:11:06,180 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:11:06,181 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:11:06,182 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:11:06,184 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:11:06,185 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:11:06,400 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-16 00:11:10,051 WARN L191 SmtUtils]: Spent 3.63 s on a formula simplification. DAG size of input: 115 DAG size of output: 87 [2019-11-16 00:11:10,200 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:11:10,200 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:11:10,201 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:11:10,201 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:11:10,201 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:11:10,201 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:11:10,201 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:11:10,202 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:11:10,202 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:11:10,203 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:11:10,203 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:11:10,204 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:11:10,204 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:11:10,204 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:11:10,204 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:11:10,204 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:11:10,204 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:11:10,206 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:11:10,206 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:11:10,206 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:11:10,206 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-16 00:11:10,206 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:11:10,206 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:11:10,207 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-16 00:11:10,207 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:11:10,208 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:11:10,208 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:11:10,208 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:11:10,209 INFO L202 nArgumentSynthesizer]: 36 stem disjuncts [2019-11-16 00:11:10,209 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:11:10,209 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:11:10,218 INFO L400 nArgumentSynthesizer]: We have 76 Motzkin's Theorem applications. [2019-11-16 00:11:10,218 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:11:10,281 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:11:10,281 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:11:10,282 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:11:10,282 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:11:10,282 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:11:10,282 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:11:10,284 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:11:10,284 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:11:10,296 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:11:10,312 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-11-16 00:11:10,312 INFO L444 ModelExtractionUtils]: 19 out of 28 variables were initially zero. Simplification set additionally 6 variables to zero. [2019-11-16 00:11:10,313 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:11:10,313 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-16 00:11:10,313 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:11:10,314 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0) = -2*ULTIMATE.start_main_~j~0 + 7 Supporting invariants [] [2019-11-16 00:11:10,513 INFO L297 tatePredicateManager]: 44 out of 46 supporting invariants were superfluous and have been removed [2019-11-16 00:11:10,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:11:10,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:10,584 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 26 conjunts are in the unsatisfiable core [2019-11-16 00:11:10,584 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:11:10,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:10,783 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-16 00:11:10,784 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:11:10,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:11:10,808 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.12 stem predicates 2 loop predicates [2019-11-16 00:11:10,809 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 72 states and 84 transitions. cyclomatic complexity: 20 Second operand 14 states. [2019-11-16 00:11:10,990 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 72 states and 84 transitions. cyclomatic complexity: 20. Second operand 14 states. Result 107 states and 131 transitions. Complement of second has 17 states. [2019-11-16 00:11:10,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 15 states 12 stem states 1 non-accepting loop states 2 accepting loop states [2019-11-16 00:11:10,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-11-16 00:11:10,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 47 transitions. [2019-11-16 00:11:10,993 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 47 transitions. Stem has 58 letters. Loop has 2 letters. [2019-11-16 00:11:10,993 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:11:10,993 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-16 00:11:11,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:11:11,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:11,059 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 26 conjunts are in the unsatisfiable core [2019-11-16 00:11:11,060 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:11:11,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:11,267 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-16 00:11:11,267 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:11:11,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:11:11,287 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.12 stem predicates 2 loop predicates [2019-11-16 00:11:11,287 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 72 states and 84 transitions. cyclomatic complexity: 20 Second operand 14 states. [2019-11-16 00:11:11,628 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 72 states and 84 transitions. cyclomatic complexity: 20. Second operand 14 states. Result 107 states and 131 transitions. Complement of second has 17 states. [2019-11-16 00:11:11,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 15 states 12 stem states 1 non-accepting loop states 2 accepting loop states [2019-11-16 00:11:11,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-11-16 00:11:11,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 47 transitions. [2019-11-16 00:11:11,628 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 47 transitions. Stem has 58 letters. Loop has 2 letters. [2019-11-16 00:11:11,629 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:11:11,629 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-16 00:11:11,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:11:11,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:11,697 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 26 conjunts are in the unsatisfiable core [2019-11-16 00:11:11,698 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:11:11,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:11,889 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-16 00:11:11,889 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:11:11,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:11:11,909 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.12 stem predicates 2 loop predicates [2019-11-16 00:11:11,909 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 72 states and 84 transitions. cyclomatic complexity: 20 Second operand 14 states. [2019-11-16 00:11:12,124 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 72 states and 84 transitions. cyclomatic complexity: 20. Second operand 14 states. Result 121 states and 150 transitions. Complement of second has 16 states. [2019-11-16 00:11:12,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 15 states 12 stem states 1 non-accepting loop states 2 accepting loop states [2019-11-16 00:11:12,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-11-16 00:11:12,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 49 transitions. [2019-11-16 00:11:12,125 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 49 transitions. Stem has 58 letters. Loop has 2 letters. [2019-11-16 00:11:12,125 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:11:12,125 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 49 transitions. Stem has 60 letters. Loop has 2 letters. [2019-11-16 00:11:12,125 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:11:12,125 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 49 transitions. Stem has 58 letters. Loop has 4 letters. [2019-11-16 00:11:12,126 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:11:12,126 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 121 states and 150 transitions. [2019-11-16 00:11:12,126 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-16 00:11:12,127 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 121 states to 78 states and 91 transitions. [2019-11-16 00:11:12,127 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2019-11-16 00:11:12,127 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2019-11-16 00:11:12,127 INFO L73 IsDeterministic]: Start isDeterministic. Operand 78 states and 91 transitions. [2019-11-16 00:11:12,127 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:11:12,127 INFO L688 BuchiCegarLoop]: Abstraction has 78 states and 91 transitions. [2019-11-16 00:11:12,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states and 91 transitions. [2019-11-16 00:11:12,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 74. [2019-11-16 00:11:12,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-11-16 00:11:12,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 86 transitions. [2019-11-16 00:11:12,129 INFO L711 BuchiCegarLoop]: Abstraction has 74 states and 86 transitions. [2019-11-16 00:11:12,129 INFO L591 BuchiCegarLoop]: Abstraction has 74 states and 86 transitions. [2019-11-16 00:11:12,129 INFO L424 BuchiCegarLoop]: ======== Iteration 30============ [2019-11-16 00:11:12,129 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 74 states and 86 transitions. [2019-11-16 00:11:12,130 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-16 00:11:12,130 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:11:12,130 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:11:12,130 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [6, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:11:12,131 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-16 00:11:12,131 INFO L791 eck$LassoCheckResult]: Stem: 11603#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 11598#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~post1, main_#t~mem3, main_#t~nondet5, main_#t~post4, main_#t~mem6, main_#t~post8, main_#t~mem7, main_#t~post10, main_#t~mem9, main_#t~mem11, main_#t~mem12, main_#t~post13, main_#t~post14, main_~#string_A~0.base, main_~#string_A~0.offset, main_~#string_B~0.base, main_~#string_B~0.offset, main_~i~0, main_~j~0, main_~nc_A~0, main_~nc_B~0, main_~found~0;call main_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.allocOnStack(5);call main_~#string_B~0.base, main_~#string_B~0.offset := #Ultimate.allocOnStack(5);havoc main_~i~0;havoc main_~j~0;havoc main_~nc_A~0;havoc main_~nc_B~0;main_~found~0 := 0;main_~i~0 := 0; 11575#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; 11576#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 11577#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; 11578#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 11616#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; 11614#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 11612#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; 11610#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 11608#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; 11607#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 11606#L19-3 assume !(main_~i~0 < 5); 11573#L19-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 11574#L21 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 11601#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; 11602#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 11596#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; 11597#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 11628#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; 11627#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 11626#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; 11625#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 11624#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; 11623#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 11622#L23-3 assume !(main_~i~0 < 5); 11592#L23-4 call main_#t~mem6 := read~int(main_~#string_B~0.base, 4 + main_~#string_B~0.offset, 1); 11593#L25 assume !!(0 == main_#t~mem6);havoc main_#t~mem6;main_~nc_A~0 := 0; 11605#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 11579#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; 11580#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 11619#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; 11618#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 11617#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; 11615#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 11613#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; 11611#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 11609#L28-1 assume !(0 != main_#t~mem7);havoc main_#t~mem7; 11604#L28-4 main_~nc_B~0 := 0; 11588#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 11589#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; 11590#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 11591#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; 11600#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 11632#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; 11631#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 11630#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; 11629#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 11621#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; 11620#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 11599#L32-1 assume !(0 != main_#t~mem9);havoc main_#t~mem9; 11581#L32-4 assume !!(main_~nc_B~0 >= main_~nc_A~0);main_~j~0 := 0;main_~i~0 := main_~j~0; 11582#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); 11640#L41 assume main_#t~mem11 == main_#t~mem12;havoc main_#t~mem12;havoc main_#t~mem11;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; 11639#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); 11594#L41 assume !(main_#t~mem11 == main_#t~mem12);havoc main_#t~mem12;havoc main_#t~mem11;main_~i~0 := 1 + (main_~i~0 - main_~j~0);main_~j~0 := 0; 11595#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); 11585#L41 assume !(main_#t~mem11 == main_#t~mem12);havoc main_#t~mem12;havoc main_#t~mem11;main_~i~0 := 1 + (main_~i~0 - main_~j~0);main_~j~0 := 0; 11638#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); 11637#L41 assume main_#t~mem11 == main_#t~mem12;havoc main_#t~mem12;havoc main_#t~mem11;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; 11634#L41-2 [2019-11-16 00:11:12,131 INFO L793 eck$LassoCheckResult]: Loop: 11634#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); 11633#L41 assume main_#t~mem11 == main_#t~mem12;havoc main_#t~mem12;havoc main_#t~mem11;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; 11634#L41-2 [2019-11-16 00:11:12,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:11:12,131 INFO L82 PathProgramCache]: Analyzing trace with hash -2097058957, now seen corresponding path program 19 times [2019-11-16 00:11:12,131 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:11:12,131 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457387405] [2019-11-16 00:11:12,132 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:11:12,132 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:11:12,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:11:12,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:12,277 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2019-11-16 00:11:12,277 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457387405] [2019-11-16 00:11:12,278 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:11:12,278 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-16 00:11:12,278 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650176394] [2019-11-16 00:11:12,278 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-16 00:11:12,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:11:12,279 INFO L82 PathProgramCache]: Analyzing trace with hash 3556, now seen corresponding path program 19 times [2019-11-16 00:11:12,279 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:11:12,279 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609807977] [2019-11-16 00:11:12,279 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:11:12,279 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:11:12,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:11:12,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:11:12,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:11:12,284 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:11:12,350 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:11:12,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-16 00:11:12,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:11:12,351 INFO L87 Difference]: Start difference. First operand 74 states and 86 transitions. cyclomatic complexity: 20 Second operand 9 states. [2019-11-16 00:11:12,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:11:12,384 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-11-16 00:11:12,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-16 00:11:12,385 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 50 transitions. [2019-11-16 00:11:12,385 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-16 00:11:12,386 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 0 states and 0 transitions. [2019-11-16 00:11:12,386 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-16 00:11:12,386 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-16 00:11:12,386 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-16 00:11:12,386 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:11:12,386 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:11:12,386 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:11:12,386 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:11:12,386 INFO L424 BuchiCegarLoop]: ======== Iteration 31============ [2019-11-16 00:11:12,386 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-16 00:11:12,386 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-16 00:11:12,386 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-16 00:11:12,393 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 16.11 12:11:12 BoogieIcfgContainer [2019-11-16 00:11:12,393 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-16 00:11:12,394 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-16 00:11:12,394 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-16 00:11:12,394 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-16 00:11:12,395 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:09:12" (3/4) ... [2019-11-16 00:11:12,399 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-16 00:11:12,399 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-16 00:11:12,400 INFO L168 Benchmark]: Toolchain (without parser) took 120240.87 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 605.0 MB). Free memory was 941.0 MB in the beginning and 1.5 GB in the end (delta: -600.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 11.5 GB. [2019-11-16 00:11:12,400 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 963.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:11:12,401 INFO L168 Benchmark]: CACSL2BoogieTranslator took 303.55 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 941.0 MB in the beginning and 1.1 GB in the end (delta: -194.9 MB). Peak memory consumption was 22.9 MB. Max. memory is 11.5 GB. [2019-11-16 00:11:12,401 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.53 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:11:12,401 INFO L168 Benchmark]: Boogie Preprocessor took 27.57 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-16 00:11:12,402 INFO L168 Benchmark]: RCFGBuilder took 413.84 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: 23.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. [2019-11-16 00:11:12,402 INFO L168 Benchmark]: BuchiAutomizer took 119447.66 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 464.0 MB). Free memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: -435.0 MB). Peak memory consumption was 29.0 MB. Max. memory is 11.5 GB. [2019-11-16 00:11:12,402 INFO L168 Benchmark]: Witness Printer took 4.89 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:11:12,406 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 963.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 303.55 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 941.0 MB in the beginning and 1.1 GB in the end (delta: -194.9 MB). Peak memory consumption was 22.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 38.53 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 27.57 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 413.84 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: 23.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 119447.66 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 464.0 MB). Free memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: -435.0 MB). Peak memory consumption was 29.0 MB. Max. memory is 11.5 GB. * Witness Printer took 4.89 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 30 terminating modules (15 trivial, 12 deterministic, 3 nondeterministic). One deterministic module has affine ranking function -2 * i + 9 and consists of 5 locations. One deterministic module has affine ranking function unknown-#length-unknown[string_A] + -1 * string_A + -1 * nc_A and consists of 3 locations. One deterministic module has affine ranking function -1 * string_B + -1 * nc_B + unknown-#length-unknown[string_B] and consists of 3 locations. One deterministic module has affine ranking function unknown-#length-unknown[string_A] + -1 * i + -1 * string_A and consists of 3 locations. One deterministic module has affine ranking function -2 * j + 1 and consists of 12 locations. One deterministic module has affine ranking function -2 * i + 3 and consists of 7 locations. One deterministic module has affine ranking function -2 * j + 5 and consists of 13 locations. One deterministic module has affine ranking function -2 * j + 3 and consists of 10 locations. One deterministic module has affine ranking function -2 * i + 7 and consists of 10 locations. One deterministic module has affine ranking function 5 * unknown-#length-unknown[string_A] + -2 * i and consists of 5 locations. One deterministic module has affine ranking function -1 * i + nc_A + j and consists of 4 locations. One deterministic module has affine ranking function -2 * i + 7 and consists of 8 locations. One nondeterministic module has affine ranking function -2 * j + 1 and consists of 15 locations. One nondeterministic module has affine ranking function -2 * i + 5 and consists of 13 locations. One nondeterministic module has affine ranking function -2 * j + 7 and consists of 15 locations. 15 modules have a trivial ranking function, the largest among these consists of 21 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 119.4s and 31 iterations. TraceHistogramMax:6. Analysis of lassos took 109.3s. Construction of modules took 3.0s. Büchi inclusion checks took 6.7s. Highest rank in rank-based complementation 3. Minimization of det autom 8. Minimization of nondet autom 22. Automata minimization 0.0s AutomataMinimizationTime, 29 MinimizatonAttempts, 244 StatesRemovedByMinimization, 23 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 99 states and ocurred in iteration 24. Nontrivial modules had stage [12, 0, 3, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 542 SDtfs, 1359 SDslu, 1554 SDs, 0 SdLazy, 3439 SolverSat, 445 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc5 concLT0 SILN0 SILU10 SILI0 SILT0 lasso15 LassoPreprocessingBenchmarks: Lassos: inital362 mio100 ax100 hnf99 lsp97 ukn48 mio100 lsp54 div100 bol100 ite100 ukn100 eq175 hnf83 smp95 dnf994 smp73 tf100 neg92 sie122 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 72ms VariablesStem: 11 VariablesLoop: 6 DisjunctsStem: 36 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 76 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...