./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/loops/string_true-unreach-call_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/loops/string_true-unreach-call_true-termination.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e655d34f6b59f7cc9a55d4dc4dc525a41685abad ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 03:40:29,981 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 03:40:29,983 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 03:40:29,996 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 03:40:29,997 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 03:40:29,998 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 03:40:29,999 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 03:40:30,005 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 03:40:30,007 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 03:40:30,009 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 03:40:30,010 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 03:40:30,011 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 03:40:30,012 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 03:40:30,012 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 03:40:30,014 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 03:40:30,014 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 03:40:30,015 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 03:40:30,017 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 03:40:30,019 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 03:40:30,021 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 03:40:30,022 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 03:40:30,024 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 03:40:30,027 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 03:40:30,027 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 03:40:30,027 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 03:40:30,028 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 03:40:30,029 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 03:40:30,030 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 03:40:30,031 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 03:40:30,032 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 03:40:30,032 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 03:40:30,033 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 03:40:30,033 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 03:40:30,033 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 03:40:30,034 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 03:40:30,035 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 03:40:30,035 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-14 03:40:30,058 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 03:40:30,058 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 03:40:30,059 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 03:40:30,060 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 03:40:30,060 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 03:40:30,060 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 03:40:30,061 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 03:40:30,061 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 03:40:30,061 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 03:40:30,061 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 03:40:30,061 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 03:40:30,061 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 03:40:30,062 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 03:40:30,062 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 03:40:30,062 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 03:40:30,062 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 03:40:30,062 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 03:40:30,062 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 03:40:30,063 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 03:40:30,064 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 03:40:30,064 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 03:40:30,064 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 03:40:30,065 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 03:40:30,065 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 03:40:30,065 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 03:40:30,066 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 03:40:30,066 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 03:40:30,066 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 03:40:30,066 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 03:40:30,066 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 03:40:30,066 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 03:40:30,067 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 03:40:30,068 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e655d34f6b59f7cc9a55d4dc4dc525a41685abad [2019-01-14 03:40:30,105 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 03:40:30,121 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 03:40:30,125 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 03:40:30,127 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 03:40:30,128 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 03:40:30,128 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/loops/string_true-unreach-call_true-termination.i [2019-01-14 03:40:30,197 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e3bf2950/991f3597dd37420798e9a1618bb9323d/FLAGadc114e2f [2019-01-14 03:40:30,644 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 03:40:30,645 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/loops/string_true-unreach-call_true-termination.i [2019-01-14 03:40:30,650 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e3bf2950/991f3597dd37420798e9a1618bb9323d/FLAGadc114e2f [2019-01-14 03:40:31,020 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e3bf2950/991f3597dd37420798e9a1618bb9323d [2019-01-14 03:40:31,024 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 03:40:31,026 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 03:40:31,031 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 03:40:31,031 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 03:40:31,036 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 03:40:31,037 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 03:40:31" (1/1) ... [2019-01-14 03:40:31,041 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f5c3be4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:40:31, skipping insertion in model container [2019-01-14 03:40:31,042 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 03:40:31" (1/1) ... [2019-01-14 03:40:31,052 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 03:40:31,076 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 03:40:31,333 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 03:40:31,342 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 03:40:31,380 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 03:40:31,415 INFO L195 MainTranslator]: Completed translation [2019-01-14 03:40:31,415 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:40:31 WrapperNode [2019-01-14 03:40:31,415 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 03:40:31,417 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 03:40:31,417 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 03:40:31,417 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 03:40:31,427 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:40:31" (1/1) ... [2019-01-14 03:40:31,439 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:40:31" (1/1) ... [2019-01-14 03:40:31,470 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 03:40:31,471 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 03:40:31,471 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 03:40:31,471 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 03:40:31,479 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:40:31" (1/1) ... [2019-01-14 03:40:31,479 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:40:31" (1/1) ... [2019-01-14 03:40:31,482 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:40:31" (1/1) ... [2019-01-14 03:40:31,482 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:40:31" (1/1) ... [2019-01-14 03:40:31,492 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:40:31" (1/1) ... [2019-01-14 03:40:31,559 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:40:31" (1/1) ... [2019-01-14 03:40:31,561 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:40:31" (1/1) ... [2019-01-14 03:40:31,563 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 03:40:31,564 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 03:40:31,564 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 03:40:31,564 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 03:40:31,565 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:40:31" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:40:31,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 03:40:31,638 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 03:40:31,639 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 03:40:31,639 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 03:40:31,639 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 03:40:31,639 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 03:40:32,136 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 03:40:32,137 INFO L286 CfgBuilder]: Removed 11 assue(true) statements. [2019-01-14 03:40:32,138 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 03:40:32 BoogieIcfgContainer [2019-01-14 03:40:32,138 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 03:40:32,139 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 03:40:32,139 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 03:40:32,142 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 03:40:32,143 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 03:40:32,143 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 03:40:31" (1/3) ... [2019-01-14 03:40:32,145 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@599a6fd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 03:40:32, skipping insertion in model container [2019-01-14 03:40:32,145 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 03:40:32,145 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:40:31" (2/3) ... [2019-01-14 03:40:32,145 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@599a6fd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 03:40:32, skipping insertion in model container [2019-01-14 03:40:32,146 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 03:40:32,146 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 03:40:32" (3/3) ... [2019-01-14 03:40:32,148 INFO L375 chiAutomizerObserver]: Analyzing ICFG string_true-unreach-call_true-termination.i [2019-01-14 03:40:32,207 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 03:40:32,208 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 03:40:32,208 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 03:40:32,208 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 03:40:32,208 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 03:40:32,209 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 03:40:32,209 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 03:40:32,209 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 03:40:32,209 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 03:40:32,225 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2019-01-14 03:40:32,249 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2019-01-14 03:40:32,250 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:40:32,250 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:40:32,258 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-14 03:40:32,258 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 03:40:32,258 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 03:40:32,258 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2019-01-14 03:40:32,261 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2019-01-14 03:40:32,261 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:40:32,262 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:40:32,262 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-14 03:40:32,262 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 03:40:32,271 INFO L794 eck$LassoCheckResult]: Stem: 24#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 4#L-1true havoc main_#res;havoc main_#t~nondet2, main_#t~post1, main_#t~mem3, main_#t~nondet5, main_#t~post4, main_#t~mem6, main_#t~post8, main_#t~mem7, main_#t~post10, main_#t~mem9, main_#t~mem11, main_#t~mem12, main_#t~post13, main_#t~post14, main_~#string_A~0.base, main_~#string_A~0.offset, main_~#string_B~0.base, main_~#string_B~0.offset, main_~i~0, main_~j~0, main_~nc_A~0, main_~nc_B~0, main_~found~0;call main_~#string_A~0.base, main_~#string_A~0.offset := #Ultimate.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-01-14 03:40:32,272 INFO L796 eck$LassoCheckResult]: Loop: 14#L19-3true assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 17#L19-2true main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 14#L19-3true [2019-01-14 03:40:32,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:40:32,279 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-01-14 03:40:32,281 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:40:32,282 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:40:32,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:32,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:40:32,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:32,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:40:32,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:40:32,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:40:32,416 INFO L82 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2019-01-14 03:40:32,417 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:40:32,417 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:40:32,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:32,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:40:32,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:32,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:40:32,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:40:32,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:40:32,444 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2019-01-14 03:40:32,444 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:40:32,444 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:40:32,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:32,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:40:32,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:32,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:40:32,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:40:32,840 WARN L181 SmtUtils]: Spent 219.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2019-01-14 03:40:33,003 WARN L181 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-01-14 03:40:33,017 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 03:40:33,018 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 03:40:33,018 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 03:40:33,018 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 03:40:33,019 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 03:40:33,019 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:40:33,019 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 03:40:33,019 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 03:40:33,019 INFO L131 ssoRankerPreferences]: Filename of dumped script: string_true-unreach-call_true-termination.i_Iteration1_Lasso [2019-01-14 03:40:33,019 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 03:40:33,020 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 03:40:33,047 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:33,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-01-14 03:40:33,065 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:33,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-01-14 03:40:33,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-01-14 03:40:33,077 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:33,086 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:33,092 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:33,094 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:33,098 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:33,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-01-14 03:40:33,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-01-14 03:40:33,123 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:33,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-01-14 03:40:33,294 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2019-01-14 03:40:33,317 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:33,320 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:33,322 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:33,326 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:33,338 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:33,341 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:33,346 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:33,350 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:33,696 WARN L181 SmtUtils]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-01-14 03:40:34,123 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 19 [2019-01-14 03:40:34,187 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 03:40:34,191 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 03:40:34,193 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:40:34,195 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:34,195 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:40:34,196 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:34,196 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:34,196 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:34,198 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:40:34,199 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:40:34,201 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:34,201 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:40:34,202 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:34,202 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:40:34,202 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:34,202 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:34,202 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:34,204 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:40:34,204 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:40:34,205 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:34,206 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:40:34,206 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:34,206 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:40:34,207 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:34,207 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:34,207 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:34,207 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:40:34,208 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:40:34,209 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:34,209 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:40:34,210 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:34,210 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:40:34,210 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:34,210 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:34,210 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:34,211 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:40:34,211 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:40:34,212 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:34,213 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:40:34,213 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:34,213 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:40:34,213 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:34,214 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:34,214 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:34,214 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:40:34,215 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:40:34,216 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:34,216 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:40:34,217 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:34,217 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:34,217 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:34,217 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:34,220 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:40:34,220 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:40:34,225 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:34,225 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:40:34,226 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:34,226 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:40:34,226 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:34,226 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:34,227 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:34,227 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:40:34,227 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:40:34,228 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:34,229 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:40:34,229 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:34,229 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:40:34,230 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:34,230 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:34,230 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:34,230 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:40:34,231 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:40:34,232 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:34,233 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:40:34,233 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:34,234 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:40:34,234 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:34,234 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:34,234 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:34,235 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:40:34,235 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:40:34,236 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:34,236 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:40:34,237 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:34,237 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:34,237 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:34,237 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:34,239 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:40:34,240 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:40:34,244 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:34,244 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:40:34,245 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:34,245 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:40:34,245 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:34,245 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:34,245 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:34,246 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:40:34,246 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:40:34,247 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:34,248 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:40:34,248 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:34,248 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:40:34,249 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:34,249 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:34,249 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:34,249 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:40:34,250 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:40:34,250 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:34,251 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:40:34,251 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:34,252 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:34,252 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:34,252 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:34,254 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:40:34,254 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:40:34,258 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:34,259 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:40:34,259 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:34,260 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:34,260 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:34,260 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:34,262 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:40:34,262 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:40:34,269 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:34,269 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:40:34,270 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:34,270 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:34,270 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:34,270 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:34,275 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:40:34,275 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:40:34,331 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 03:40:34,372 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-14 03:40:34,374 INFO L444 ModelExtractionUtils]: 9 out of 13 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 03:40:34,379 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 03:40:34,385 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 03:40:34,386 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 03:40:34,387 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 9 Supporting invariants [] [2019-01-14 03:40:34,434 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-01-14 03:40:34,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:40:34,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:40:34,509 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:40:34,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:40:34,528 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:40:34,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 03:40:34,566 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-14 03:40:34,567 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states. Second operand 3 states. [2019-01-14 03:40:34,640 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states.. Second operand 3 states. Result 56 states and 85 transitions. Complement of second has 8 states. [2019-01-14 03:40:34,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-14 03:40:34,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 03:40:34,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2019-01-14 03:40:34,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 43 transitions. Stem has 2 letters. Loop has 2 letters. [2019-01-14 03:40:34,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:40:34,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 43 transitions. Stem has 4 letters. Loop has 2 letters. [2019-01-14 03:40:34,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:40:34,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 43 transitions. Stem has 2 letters. Loop has 4 letters. [2019-01-14 03:40:34,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:40:34,648 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 56 states and 85 transitions. [2019-01-14 03:40:34,653 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2019-01-14 03:40:34,658 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 56 states to 19 states and 28 transitions. [2019-01-14 03:40:34,659 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-01-14 03:40:34,660 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-01-14 03:40:34,660 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 28 transitions. [2019-01-14 03:40:34,661 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 03:40:34,661 INFO L706 BuchiCegarLoop]: Abstraction has 19 states and 28 transitions. [2019-01-14 03:40:34,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 28 transitions. [2019-01-14 03:40:34,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-01-14 03:40:34,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-01-14 03:40:34,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 28 transitions. [2019-01-14 03:40:34,688 INFO L729 BuchiCegarLoop]: Abstraction has 19 states and 28 transitions. [2019-01-14 03:40:34,688 INFO L609 BuchiCegarLoop]: Abstraction has 19 states and 28 transitions. [2019-01-14 03:40:34,688 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 03:40:34,688 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 28 transitions. [2019-01-14 03:40:34,689 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2019-01-14 03:40:34,690 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:40:34,690 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:40:34,690 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-14 03:40:34,690 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 03:40:34,691 INFO L794 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-01-14 03:40:34,691 INFO L796 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-01-14 03:40:34,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:40:34,691 INFO L82 PathProgramCache]: Analyzing trace with hash 28696938, now seen corresponding path program 1 times [2019-01-14 03:40:34,691 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:40:34,691 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:40:34,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:34,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:40:34,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:34,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:40:34,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 03:40:34,743 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 03:40:34,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 03:40:34,745 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 03:40:34,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:40:34,745 INFO L82 PathProgramCache]: Analyzing trace with hash 1891, now seen corresponding path program 1 times [2019-01-14 03:40:34,745 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:40:34,745 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:40:34,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:34,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:40:34,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:34,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:40:34,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:40:34,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 03:40:34,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 03:40:34,860 INFO L87 Difference]: Start difference. First operand 19 states and 28 transitions. cyclomatic complexity: 14 Second operand 3 states. [2019-01-14 03:40:35,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 03:40:35,016 INFO L93 Difference]: Finished difference Result 24 states and 30 transitions. [2019-01-14 03:40:35,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 03:40:35,017 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 30 transitions. [2019-01-14 03:40:35,020 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2019-01-14 03:40:35,022 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 24 states and 30 transitions. [2019-01-14 03:40:35,022 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2019-01-14 03:40:35,023 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2019-01-14 03:40:35,023 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 30 transitions. [2019-01-14 03:40:35,023 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 03:40:35,023 INFO L706 BuchiCegarLoop]: Abstraction has 24 states and 30 transitions. [2019-01-14 03:40:35,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 30 transitions. [2019-01-14 03:40:35,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 20. [2019-01-14 03:40:35,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-01-14 03:40:35,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2019-01-14 03:40:35,027 INFO L729 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2019-01-14 03:40:35,028 INFO L609 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2019-01-14 03:40:35,028 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 03:40:35,028 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 25 transitions. [2019-01-14 03:40:35,029 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2019-01-14 03:40:35,029 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:40:35,029 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:40:35,030 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 03:40:35,030 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 03:40:35,030 INFO L794 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-01-14 03:40:35,030 INFO L796 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-01-14 03:40:35,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:40:35,031 INFO L82 PathProgramCache]: Analyzing trace with hash 265181045, now seen corresponding path program 1 times [2019-01-14 03:40:35,031 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:40:35,031 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:40:35,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:35,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:40:35,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:35,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:40:35,065 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 03:40:35,065 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 03:40:35,066 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 03:40:35,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:40:35,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:40:35,114 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:40:35,132 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 03:40:35,155 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 03:40:35,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-01-14 03:40:35,155 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 03:40:35,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:40:35,156 INFO L82 PathProgramCache]: Analyzing trace with hash 1951, now seen corresponding path program 2 times [2019-01-14 03:40:35,156 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:40:35,156 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:40:35,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:35,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:40:35,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:35,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:40:35,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:40:35,282 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2019-01-14 03:40:35,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 03:40:35,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-14 03:40:35,330 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. cyclomatic complexity: 10 Second operand 5 states. [2019-01-14 03:40:35,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 03:40:35,399 INFO L93 Difference]: Finished difference Result 30 states and 37 transitions. [2019-01-14 03:40:35,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 03:40:35,400 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 37 transitions. [2019-01-14 03:40:35,402 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2019-01-14 03:40:35,403 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 37 transitions. [2019-01-14 03:40:35,403 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2019-01-14 03:40:35,403 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2019-01-14 03:40:35,403 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 37 transitions. [2019-01-14 03:40:35,404 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 03:40:35,404 INFO L706 BuchiCegarLoop]: Abstraction has 30 states and 37 transitions. [2019-01-14 03:40:35,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 37 transitions. [2019-01-14 03:40:35,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2019-01-14 03:40:35,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-01-14 03:40:35,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2019-01-14 03:40:35,407 INFO L729 BuchiCegarLoop]: Abstraction has 24 states and 29 transitions. [2019-01-14 03:40:35,407 INFO L609 BuchiCegarLoop]: Abstraction has 24 states and 29 transitions. [2019-01-14 03:40:35,407 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 03:40:35,407 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 29 transitions. [2019-01-14 03:40:35,408 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2019-01-14 03:40:35,408 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:40:35,408 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:40:35,409 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-01-14 03:40:35,409 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 03:40:35,409 INFO L794 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-01-14 03:40:35,410 INFO L796 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-01-14 03:40:35,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:40:35,410 INFO L82 PathProgramCache]: Analyzing trace with hash 780717205, now seen corresponding path program 1 times [2019-01-14 03:40:35,410 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:40:35,410 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:40:35,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:35,411 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 03:40:35,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:35,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:40:35,490 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 03:40:35,491 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 03:40:35,491 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 03:40:35,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:40:35,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:40:35,536 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:40:35,600 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 03:40:35,632 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 03:40:35,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-01-14 03:40:35,632 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 03:40:35,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:40:35,634 INFO L82 PathProgramCache]: Analyzing trace with hash 1951, now seen corresponding path program 3 times [2019-01-14 03:40:35,634 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:40:35,634 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:40:35,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:35,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:40:35,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:35,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:40:35,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:40:35,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 03:40:35,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-14 03:40:35,715 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. cyclomatic complexity: 10 Second operand 6 states. [2019-01-14 03:40:35,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 03:40:35,854 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2019-01-14 03:40:35,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 03:40:35,855 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 44 transitions. [2019-01-14 03:40:35,858 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2019-01-14 03:40:35,859 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 36 states and 44 transitions. [2019-01-14 03:40:35,859 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2019-01-14 03:40:35,859 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2019-01-14 03:40:35,860 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 44 transitions. [2019-01-14 03:40:35,860 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 03:40:35,860 INFO L706 BuchiCegarLoop]: Abstraction has 36 states and 44 transitions. [2019-01-14 03:40:35,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 44 transitions. [2019-01-14 03:40:35,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 28. [2019-01-14 03:40:35,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-14 03:40:35,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2019-01-14 03:40:35,864 INFO L729 BuchiCegarLoop]: Abstraction has 28 states and 33 transitions. [2019-01-14 03:40:35,864 INFO L609 BuchiCegarLoop]: Abstraction has 28 states and 33 transitions. [2019-01-14 03:40:35,864 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-14 03:40:35,864 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 33 transitions. [2019-01-14 03:40:35,865 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2019-01-14 03:40:35,865 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:40:35,865 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:40:35,866 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 1, 1, 1, 1, 1] [2019-01-14 03:40:35,866 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 03:40:35,866 INFO L794 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-01-14 03:40:35,866 INFO L796 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-01-14 03:40:35,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:40:35,867 INFO L82 PathProgramCache]: Analyzing trace with hash 2111137973, now seen corresponding path program 2 times [2019-01-14 03:40:35,867 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:40:35,867 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:40:35,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:35,868 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 03:40:35,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:35,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:40:35,955 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-14 03:40:35,956 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 03:40:35,956 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 03:40:35,968 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 03:40:35,986 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 03:40:35,987 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 03:40:35,990 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:40:36,009 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-14 03:40:36,042 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 03:40:36,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-01-14 03:40:36,043 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 03:40:36,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:40:36,044 INFO L82 PathProgramCache]: Analyzing trace with hash 1951, now seen corresponding path program 4 times [2019-01-14 03:40:36,044 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:40:36,044 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:40:36,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:36,048 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 03:40:36,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:36,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:40:36,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:40:36,167 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2019-01-14 03:40:36,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 03:40:36,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-01-14 03:40:36,187 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. cyclomatic complexity: 10 Second operand 7 states. [2019-01-14 03:40:36,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 03:40:36,283 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2019-01-14 03:40:36,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 03:40:36,284 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 51 transitions. [2019-01-14 03:40:36,286 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2019-01-14 03:40:36,288 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 42 states and 51 transitions. [2019-01-14 03:40:36,288 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2019-01-14 03:40:36,289 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2019-01-14 03:40:36,289 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 51 transitions. [2019-01-14 03:40:36,289 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 03:40:36,289 INFO L706 BuchiCegarLoop]: Abstraction has 42 states and 51 transitions. [2019-01-14 03:40:36,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 51 transitions. [2019-01-14 03:40:36,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 32. [2019-01-14 03:40:36,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-14 03:40:36,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2019-01-14 03:40:36,293 INFO L729 BuchiCegarLoop]: Abstraction has 32 states and 37 transitions. [2019-01-14 03:40:36,293 INFO L609 BuchiCegarLoop]: Abstraction has 32 states and 37 transitions. [2019-01-14 03:40:36,293 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-14 03:40:36,294 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 37 transitions. [2019-01-14 03:40:36,294 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2019-01-14 03:40:36,294 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:40:36,295 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:40:36,295 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 4, 3, 1, 1, 1, 1, 1] [2019-01-14 03:40:36,295 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 03:40:36,296 INFO L794 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-01-14 03:40:36,296 INFO L796 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-01-14 03:40:36,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:40:36,296 INFO L82 PathProgramCache]: Analyzing trace with hash 213314517, now seen corresponding path program 3 times [2019-01-14 03:40:36,297 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:40:36,297 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:40:36,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:36,298 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 03:40:36,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:36,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:40:36,431 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-01-14 03:40:36,432 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 03:40:36,432 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 03:40:36,443 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 03:40:36,500 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-01-14 03:40:36,500 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 03:40:36,502 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:40:36,523 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-01-14 03:40:36,545 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 03:40:36,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-01-14 03:40:36,545 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 03:40:36,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:40:36,546 INFO L82 PathProgramCache]: Analyzing trace with hash 1951, now seen corresponding path program 5 times [2019-01-14 03:40:36,546 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:40:36,546 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:40:36,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:36,547 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 03:40:36,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:36,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:40:36,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:40:36,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 03:40:36,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-14 03:40:36,649 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. cyclomatic complexity: 10 Second operand 8 states. [2019-01-14 03:40:36,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 03:40:36,782 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2019-01-14 03:40:36,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 03:40:36,783 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 56 transitions. [2019-01-14 03:40:36,785 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2019-01-14 03:40:36,787 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 46 states and 56 transitions. [2019-01-14 03:40:36,787 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2019-01-14 03:40:36,789 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2019-01-14 03:40:36,789 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 56 transitions. [2019-01-14 03:40:36,791 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 03:40:36,791 INFO L706 BuchiCegarLoop]: Abstraction has 46 states and 56 transitions. [2019-01-14 03:40:36,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 56 transitions. [2019-01-14 03:40:36,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 36. [2019-01-14 03:40:36,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-14 03:40:36,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2019-01-14 03:40:36,795 INFO L729 BuchiCegarLoop]: Abstraction has 36 states and 41 transitions. [2019-01-14 03:40:36,795 INFO L609 BuchiCegarLoop]: Abstraction has 36 states and 41 transitions. [2019-01-14 03:40:36,795 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-14 03:40:36,795 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 41 transitions. [2019-01-14 03:40:36,796 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2019-01-14 03:40:36,796 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:40:36,796 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:40:36,797 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 4, 1, 1, 1, 1, 1] [2019-01-14 03:40:36,797 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 03:40:36,798 INFO L794 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-01-14 03:40:36,798 INFO L796 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-01-14 03:40:36,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:40:36,798 INFO L82 PathProgramCache]: Analyzing trace with hash 1212159477, now seen corresponding path program 4 times [2019-01-14 03:40:36,798 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:40:36,798 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:40:36,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:36,799 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 03:40:36,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:36,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:40:36,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:40:36,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:40:36,881 INFO L82 PathProgramCache]: Analyzing trace with hash 1951, now seen corresponding path program 6 times [2019-01-14 03:40:36,881 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:40:36,882 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:40:36,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:36,883 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 03:40:36,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:36,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:40:36,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:40:36,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:40:36,892 INFO L82 PathProgramCache]: Analyzing trace with hash 949121171, now seen corresponding path program 5 times [2019-01-14 03:40:36,892 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:40:36,892 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:40:36,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:36,893 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 03:40:36,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:36,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:40:37,157 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-01-14 03:40:37,158 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 03:40:37,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-14 03:40:37,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-14 03:40:37,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-01-14 03:40:37,274 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. cyclomatic complexity: 10 Second operand 9 states. [2019-01-14 03:40:37,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 03:40:37,461 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2019-01-14 03:40:37,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-14 03:40:37,462 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 41 transitions. [2019-01-14 03:40:37,463 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2019-01-14 03:40:37,463 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 37 states and 41 transitions. [2019-01-14 03:40:37,464 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2019-01-14 03:40:37,467 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2019-01-14 03:40:37,467 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 41 transitions. [2019-01-14 03:40:37,467 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 03:40:37,467 INFO L706 BuchiCegarLoop]: Abstraction has 37 states and 41 transitions. [2019-01-14 03:40:37,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 41 transitions. [2019-01-14 03:40:37,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2019-01-14 03:40:37,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-14 03:40:37,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2019-01-14 03:40:37,473 INFO L729 BuchiCegarLoop]: Abstraction has 36 states and 40 transitions. [2019-01-14 03:40:37,473 INFO L609 BuchiCegarLoop]: Abstraction has 36 states and 40 transitions. [2019-01-14 03:40:37,473 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2019-01-14 03:40:37,473 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 40 transitions. [2019-01-14 03:40:37,473 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2019-01-14 03:40:37,474 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:40:37,475 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:40:37,475 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 03:40:37,476 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 03:40:37,476 INFO L794 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-01-14 03:40:37,476 INFO L796 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-01-14 03:40:37,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:40:37,476 INFO L82 PathProgramCache]: Analyzing trace with hash 1572377782, now seen corresponding path program 1 times [2019-01-14 03:40:37,476 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:40:37,477 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:40:37,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:37,478 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 03:40:37,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:37,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:40:37,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:40:37,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:40:37,559 INFO L82 PathProgramCache]: Analyzing trace with hash 2406, now seen corresponding path program 1 times [2019-01-14 03:40:37,559 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:40:37,559 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:40:37,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:37,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:40:37,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:37,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:40:37,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:40:37,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:40:37,572 INFO L82 PathProgramCache]: Analyzing trace with hash -773438245, now seen corresponding path program 1 times [2019-01-14 03:40:37,572 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:40:37,572 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:40:37,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:37,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:40:37,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:37,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:40:37,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:40:41,123 WARN L181 SmtUtils]: Spent 3.42 s on a formula simplification. DAG size of input: 216 DAG size of output: 164 [2019-01-14 03:40:41,297 WARN L181 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2019-01-14 03:40:41,300 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 03:40:41,300 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 03:40:41,300 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 03:40:41,300 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 03:40:41,301 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 03:40:41,301 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:40:41,301 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 03:40:41,301 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 03:40:41,301 INFO L131 ssoRankerPreferences]: Filename of dumped script: string_true-unreach-call_true-termination.i_Iteration8_Lasso [2019-01-14 03:40:41,301 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 03:40:41,301 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 03:40:41,305 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:41,313 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:41,315 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:41,323 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:41,324 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:41,330 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:41,331 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:41,354 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:41,369 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:41,370 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:41,371 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:41,375 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:41,379 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:41,380 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:41,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-01-14 03:40:41,599 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:41,601 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:41,603 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:41,605 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:41,606 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:41,608 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:42,038 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 03:40:42,038 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 03:40:42,039 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:40:42,040 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:42,040 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:40:42,040 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:42,040 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:42,040 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:42,041 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:40:42,041 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:40:42,042 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:42,042 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:40:42,043 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:42,043 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:40:42,043 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:42,043 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:42,043 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:42,044 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:40:42,044 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:40:42,044 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:42,045 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:40:42,045 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:42,045 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:40:42,046 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:42,046 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:42,046 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:42,046 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:40:42,046 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:40:42,047 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:42,047 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:40:42,048 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:42,048 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:40:42,048 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:42,048 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:42,048 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:42,049 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:40:42,049 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:40:42,049 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:42,050 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:40:42,050 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:42,050 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:42,050 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:42,051 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:42,052 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:40:42,052 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:40:42,054 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:42,054 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:40:42,055 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:42,055 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:40:42,055 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:42,055 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:42,055 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:42,056 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:40:42,056 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:40:42,056 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:42,057 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:40:42,057 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:42,057 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:40:42,057 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:42,058 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:42,058 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:42,058 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:40:42,058 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:40:42,059 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:42,059 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:40:42,059 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:42,059 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:40:42,059 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:42,060 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:42,060 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:42,060 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:40:42,060 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:40:42,060 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:42,061 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:40:42,061 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:42,061 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:40:42,061 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:42,062 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:42,062 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:42,062 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:40:42,062 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:40:42,063 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:42,063 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:40:42,063 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:42,063 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:40:42,064 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:42,064 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:42,064 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:42,064 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:40:42,064 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:40:42,065 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:42,065 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:40:42,065 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:42,065 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:40:42,066 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:42,066 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:42,066 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:42,066 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:40:42,066 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:40:42,067 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:42,067 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:40:42,067 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:42,067 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:40:42,068 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:42,068 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:42,068 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:42,068 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:40:42,068 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:40:42,069 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:42,069 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:40:42,069 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:42,070 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:40:42,070 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:42,070 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:42,070 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:42,070 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:40:42,070 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:40:42,071 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:42,071 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:40:42,072 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:42,072 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:42,072 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:42,072 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:42,073 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:40:42,073 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:40:42,074 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:42,075 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:40:42,075 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:42,075 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:42,075 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:42,075 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:42,077 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:40:42,077 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:40:42,080 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:42,081 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:40:42,082 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:42,082 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:42,082 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:42,082 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:42,087 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:40:42,087 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:40:42,089 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:42,089 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:40:42,093 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:42,093 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2019-01-14 03:40:42,093 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:42,093 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:42,095 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-14 03:40:42,095 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:40:42,112 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:42,112 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:40:42,113 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:42,116 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:42,116 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:42,116 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:42,117 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:40:42,117 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:40:42,123 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:42,125 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:40:42,125 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:42,126 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:42,126 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:42,126 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:42,127 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:40:42,127 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:40:42,137 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:42,137 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:40:42,138 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:42,138 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:40:42,138 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:42,138 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:42,138 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:42,139 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:40:42,139 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:40:42,146 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:42,146 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:40:42,150 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:42,150 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:42,150 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:42,150 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:42,151 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:40:42,151 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:40:42,156 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:42,157 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:40:42,158 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:42,158 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:42,158 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:42,158 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:42,159 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:40:42,159 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:40:42,175 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 03:40:42,197 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-01-14 03:40:42,200 INFO L444 ModelExtractionUtils]: 7 out of 13 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-01-14 03:40:42,200 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 03:40:42,201 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 03:40:42,202 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 03:40:42,204 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#string_A~0.base)_2, ULTIMATE.start_main_~#string_A~0.offset, ULTIMATE.start_main_~nc_A~0) = 1*v_rep(select #length ULTIMATE.start_main_~#string_A~0.base)_2 - 1*ULTIMATE.start_main_~#string_A~0.offset - 1*ULTIMATE.start_main_~nc_A~0 Supporting invariants [] [2019-01-14 03:40:42,249 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2019-01-14 03:40:42,251 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-14 03:40:42,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:40:42,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:40:42,316 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:40:42,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:40:42,326 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:40:42,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 03:40:42,340 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-14 03:40:42,340 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 36 states and 40 transitions. cyclomatic complexity: 8 Second operand 3 states. [2019-01-14 03:40:42,368 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 36 states and 40 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 44 states and 52 transitions. Complement of second has 4 states. [2019-01-14 03:40:42,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 03:40:42,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 03:40:42,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2019-01-14 03:40:42,370 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 28 letters. Loop has 2 letters. [2019-01-14 03:40:42,372 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:40:42,372 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 30 letters. Loop has 2 letters. [2019-01-14 03:40:42,372 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:40:42,372 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 28 letters. Loop has 4 letters. [2019-01-14 03:40:42,373 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:40:42,373 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 52 transitions. [2019-01-14 03:40:42,374 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-01-14 03:40:42,374 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 38 states and 43 transitions. [2019-01-14 03:40:42,374 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2019-01-14 03:40:42,374 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2019-01-14 03:40:42,375 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 43 transitions. [2019-01-14 03:40:42,375 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 03:40:42,375 INFO L706 BuchiCegarLoop]: Abstraction has 38 states and 43 transitions. [2019-01-14 03:40:42,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 43 transitions. [2019-01-14 03:40:42,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-01-14 03:40:42,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-14 03:40:42,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2019-01-14 03:40:42,378 INFO L729 BuchiCegarLoop]: Abstraction has 38 states and 43 transitions. [2019-01-14 03:40:42,378 INFO L609 BuchiCegarLoop]: Abstraction has 38 states and 43 transitions. [2019-01-14 03:40:42,378 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2019-01-14 03:40:42,378 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 43 transitions. [2019-01-14 03:40:42,379 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-01-14 03:40:42,379 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:40:42,379 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:40:42,380 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 03:40:42,380 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 03:40:42,380 INFO L794 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-01-14 03:40:42,380 INFO L796 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-01-14 03:40:42,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:40:42,381 INFO L82 PathProgramCache]: Analyzing trace with hash 1793218173, now seen corresponding path program 1 times [2019-01-14 03:40:42,381 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:40:42,381 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:40:42,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:42,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:40:42,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:42,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:40:42,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:40:42,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:40:42,417 INFO L82 PathProgramCache]: Analyzing trace with hash 2854, now seen corresponding path program 1 times [2019-01-14 03:40:42,418 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:40:42,418 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:40:42,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:42,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:40:42,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:42,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:40:42,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:40:42,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:40:42,423 INFO L82 PathProgramCache]: Analyzing trace with hash 1000780450, now seen corresponding path program 1 times [2019-01-14 03:40:42,423 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:40:42,423 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:40:42,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:42,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:40:42,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:42,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:40:42,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:40:42,633 WARN L181 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-01-14 03:40:42,775 WARN L181 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2019-01-14 03:40:46,094 WARN L181 SmtUtils]: Spent 3.32 s on a formula simplification. DAG size of input: 227 DAG size of output: 174 [2019-01-14 03:40:46,259 WARN L181 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2019-01-14 03:40:46,261 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 03:40:46,261 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 03:40:46,261 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 03:40:46,261 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 03:40:46,261 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 03:40:46,261 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:40:46,261 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 03:40:46,261 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 03:40:46,262 INFO L131 ssoRankerPreferences]: Filename of dumped script: string_true-unreach-call_true-termination.i_Iteration9_Lasso [2019-01-14 03:40:46,262 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 03:40:46,262 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 03:40:46,265 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:46,278 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:46,293 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:46,467 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:46,469 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:46,471 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:46,473 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:46,474 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:46,476 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:46,508 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:46,534 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:46,538 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:46,541 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:46,543 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:46,544 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:46,545 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:46,547 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:46,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-01-14 03:40:46,551 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:46,552 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:46,864 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 03:40:46,864 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 03:40:46,864 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:40:46,865 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:46,865 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:40:46,865 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:46,865 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:46,865 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:46,866 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:40:46,866 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:40:46,866 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:46,873 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:40:46,875 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:46,876 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:46,876 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:46,876 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:46,877 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:40:46,877 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:40:46,880 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:46,882 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:40:46,882 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:46,882 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:46,882 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:46,882 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:46,885 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:40:46,885 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:40:46,887 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:46,887 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:40:46,887 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:46,887 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:46,888 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:46,888 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:46,893 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:40:46,894 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:40:46,905 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 03:40:46,911 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-14 03:40:46,911 INFO L444 ModelExtractionUtils]: 19 out of 25 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-01-14 03:40:46,912 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 03:40:46,912 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 03:40:46,912 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 03:40:46,913 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~#string_B~0.offset, ULTIMATE.start_main_~nc_B~0, v_rep(select #length ULTIMATE.start_main_~#string_B~0.base)_3) = -1*ULTIMATE.start_main_~#string_B~0.offset - 1*ULTIMATE.start_main_~nc_B~0 + 1*v_rep(select #length ULTIMATE.start_main_~#string_B~0.base)_3 Supporting invariants [] [2019-01-14 03:40:47,018 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2019-01-14 03:40:47,023 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-14 03:40:47,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:40:47,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:40:47,078 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:40:47,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:40:47,086 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:40:47,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 03:40:47,098 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-14 03:40:47,098 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 38 states and 43 transitions. cyclomatic complexity: 9 Second operand 3 states. [2019-01-14 03:40:47,216 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 38 states and 43 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 43 states and 51 transitions. Complement of second has 4 states. [2019-01-14 03:40:47,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 03:40:47,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 03:40:47,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2019-01-14 03:40:47,219 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 31 letters. Loop has 2 letters. [2019-01-14 03:40:47,219 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:40:47,219 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 33 letters. Loop has 2 letters. [2019-01-14 03:40:47,219 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:40:47,219 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 31 letters. Loop has 4 letters. [2019-01-14 03:40:47,223 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:40:47,223 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 51 transitions. [2019-01-14 03:40:47,225 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 03:40:47,225 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 40 states and 46 transitions. [2019-01-14 03:40:47,226 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2019-01-14 03:40:47,226 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2019-01-14 03:40:47,226 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 46 transitions. [2019-01-14 03:40:47,226 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 03:40:47,226 INFO L706 BuchiCegarLoop]: Abstraction has 40 states and 46 transitions. [2019-01-14 03:40:47,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 46 transitions. [2019-01-14 03:40:47,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-01-14 03:40:47,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-14 03:40:47,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2019-01-14 03:40:47,235 INFO L729 BuchiCegarLoop]: Abstraction has 40 states and 46 transitions. [2019-01-14 03:40:47,235 INFO L609 BuchiCegarLoop]: Abstraction has 40 states and 46 transitions. [2019-01-14 03:40:47,235 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2019-01-14 03:40:47,235 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 46 transitions. [2019-01-14 03:40:47,235 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 03:40:47,236 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:40:47,241 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:40:47,243 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 03:40:47,243 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 03:40:47,243 INFO L794 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-01-14 03:40:47,243 INFO L796 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-01-14 03:40:47,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:40:47,247 INFO L82 PathProgramCache]: Analyzing trace with hash 959422888, now seen corresponding path program 1 times [2019-01-14 03:40:47,247 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:40:47,247 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:40:47,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:47,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:40:47,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:47,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:40:47,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:40:47,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:40:47,328 INFO L82 PathProgramCache]: Analyzing trace with hash 3556, now seen corresponding path program 1 times [2019-01-14 03:40:47,328 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:40:47,328 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:40:47,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:47,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:40:47,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:47,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:40:47,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:40:47,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:40:47,343 INFO L82 PathProgramCache]: Analyzing trace with hash -1412570677, now seen corresponding path program 1 times [2019-01-14 03:40:47,343 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:40:47,343 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:40:47,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:47,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:40:47,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:47,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:40:47,554 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-01-14 03:40:47,554 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 03:40:47,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 03:40:47,673 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2019-01-14 03:40:47,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 03:40:47,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-14 03:40:47,702 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. cyclomatic complexity: 10 Second operand 4 states. [2019-01-14 03:40:47,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 03:40:47,720 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2019-01-14 03:40:47,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 03:40:47,721 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 56 transitions. [2019-01-14 03:40:47,722 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 03:40:47,723 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 41 states and 46 transitions. [2019-01-14 03:40:47,723 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2019-01-14 03:40:47,723 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2019-01-14 03:40:47,723 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 46 transitions. [2019-01-14 03:40:47,724 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 03:40:47,728 INFO L706 BuchiCegarLoop]: Abstraction has 41 states and 46 transitions. [2019-01-14 03:40:47,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 46 transitions. [2019-01-14 03:40:47,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2019-01-14 03:40:47,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-14 03:40:47,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2019-01-14 03:40:47,733 INFO L729 BuchiCegarLoop]: Abstraction has 40 states and 45 transitions. [2019-01-14 03:40:47,733 INFO L609 BuchiCegarLoop]: Abstraction has 40 states and 45 transitions. [2019-01-14 03:40:47,733 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2019-01-14 03:40:47,733 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 45 transitions. [2019-01-14 03:40:47,734 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 03:40:47,734 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:40:47,734 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:40:47,735 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 03:40:47,735 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 03:40:47,735 INFO L794 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-01-14 03:40:47,736 INFO L796 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-01-14 03:40:47,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:40:47,736 INFO L82 PathProgramCache]: Analyzing trace with hash 94364173, now seen corresponding path program 1 times [2019-01-14 03:40:47,736 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:40:47,736 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:40:47,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:47,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:40:47,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:47,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:40:48,231 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-01-14 03:40:48,231 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 03:40:48,231 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 03:40:48,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:40:48,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:40:48,283 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:40:48,317 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-01-14 03:40:48,348 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 03:40:48,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2019-01-14 03:40:48,349 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 03:40:48,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:40:48,350 INFO L82 PathProgramCache]: Analyzing trace with hash 3556, now seen corresponding path program 2 times [2019-01-14 03:40:48,350 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:40:48,350 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:40:48,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:48,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:40:48,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:48,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:40:48,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:40:48,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-14 03:40:48,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-01-14 03:40:48,443 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. cyclomatic complexity: 9 Second operand 9 states. [2019-01-14 03:40:48,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 03:40:48,510 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2019-01-14 03:40:48,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 03:40:48,511 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 48 transitions. [2019-01-14 03:40:48,513 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 03:40:48,515 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 42 states and 46 transitions. [2019-01-14 03:40:48,515 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2019-01-14 03:40:48,516 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2019-01-14 03:40:48,516 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 46 transitions. [2019-01-14 03:40:48,516 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 03:40:48,516 INFO L706 BuchiCegarLoop]: Abstraction has 42 states and 46 transitions. [2019-01-14 03:40:48,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 46 transitions. [2019-01-14 03:40:48,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2019-01-14 03:40:48,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-14 03:40:48,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2019-01-14 03:40:48,524 INFO L729 BuchiCegarLoop]: Abstraction has 40 states and 44 transitions. [2019-01-14 03:40:48,524 INFO L609 BuchiCegarLoop]: Abstraction has 40 states and 44 transitions. [2019-01-14 03:40:48,525 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2019-01-14 03:40:48,525 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 44 transitions. [2019-01-14 03:40:48,525 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 03:40:48,525 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:40:48,525 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:40:48,531 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 03:40:48,531 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 03:40:48,532 INFO L794 eck$LassoCheckResult]: Stem: 1467#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1465#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; 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; 1448#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; 1449#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1475#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; 1474#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); 1444#L19-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 1445#L21 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 1463#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; 1464#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1466#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; 1483#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1482#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); 1461#L23-4 call main_#t~mem6 := read~int(main_~#string_B~0.base, 4 + main_~#string_B~0.offset, 1); 1462#L25 assume !!(0 == main_#t~mem6);havoc main_#t~mem6;main_~nc_A~0 := 0; 1468#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 1452#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; 1453#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; 1451#L28-4 main_~nc_B~0 := 0; 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;main_#t~post10 := main_~nc_B~0;main_~nc_B~0 := 1 + main_#t~post10;havoc main_#t~post10; 1459#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 1460#L32-1 assume !(0 != main_#t~mem9);havoc main_#t~mem9; 1454#L32-4 assume !!(main_~nc_B~0 >= main_~nc_A~0);main_~j~0 := 0;main_~i~0 := main_~j~0; 1455#L41-2 [2019-01-14 03:40:48,532 INFO L796 eck$LassoCheckResult]: Loop: 1455#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); 1456#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; 1455#L41-2 [2019-01-14 03:40:48,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:40:48,532 INFO L82 PathProgramCache]: Analyzing trace with hash 489706120, now seen corresponding path program 1 times [2019-01-14 03:40:48,532 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:40:48,532 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:40:48,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:48,533 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 03:40:48,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:48,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:40:48,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:40:48,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:40:48,589 INFO L82 PathProgramCache]: Analyzing trace with hash 3556, now seen corresponding path program 3 times [2019-01-14 03:40:48,589 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:40:48,589 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:40:48,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:48,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:40:48,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:48,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:40:48,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:40:48,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:40:48,601 INFO L82 PathProgramCache]: Analyzing trace with hash -1838818645, now seen corresponding path program 1 times [2019-01-14 03:40:48,601 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:40:48,601 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:40:48,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:48,602 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 03:40:48,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:48,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:40:48,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:40:48,764 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2019-01-14 03:40:53,613 WARN L181 SmtUtils]: Spent 4.82 s on a formula simplification. DAG size of input: 264 DAG size of output: 202 [2019-01-14 03:40:53,870 WARN L181 SmtUtils]: Spent 246.00 ms on a formula simplification that was a NOOP. DAG size: 117 [2019-01-14 03:40:53,873 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 03:40:53,873 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 03:40:53,873 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 03:40:53,874 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 03:40:53,874 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 03:40:53,874 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:40:53,874 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 03:40:53,874 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 03:40:53,874 INFO L131 ssoRankerPreferences]: Filename of dumped script: string_true-unreach-call_true-termination.i_Iteration12_Lasso [2019-01-14 03:40:53,874 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 03:40:53,875 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 03:40:53,881 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:53,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-01-14 03:40:53,893 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:53,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-01-14 03:40:53,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-01-14 03:40:53,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-01-14 03:40:53,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-01-14 03:40:53,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-01-14 03:40:53,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-01-14 03:40:54,353 WARN L181 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 64 [2019-01-14 03:40:54,467 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:54,469 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:54,471 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:54,473 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:54,474 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:54,476 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:54,477 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:54,479 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:54,480 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:54,482 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:40:55,014 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 03:40:55,014 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 03:40:55,015 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:40:55,015 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:55,015 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:40:55,015 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:55,015 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:55,016 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:55,020 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:40:55,020 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:40:55,021 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:55,021 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:40:55,022 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:55,022 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:40:55,022 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:55,022 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:55,022 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:55,025 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:40:55,025 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:40:55,026 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:55,026 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:40:55,027 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:55,027 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:40:55,027 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:55,027 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:55,027 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:55,027 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:40:55,027 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:40:55,028 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:55,029 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:40:55,029 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:55,029 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:40:55,029 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:55,029 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:55,030 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:55,031 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:40:55,031 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:40:55,031 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:55,032 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:40:55,032 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:55,032 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:40:55,032 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:55,033 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:55,033 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:55,034 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:40:55,034 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:40:55,034 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:55,034 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:40:55,035 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:55,035 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:55,035 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:55,035 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:55,046 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:40:55,046 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:40:55,048 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:55,048 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:40:55,049 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:55,052 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:55,052 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:55,052 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:55,053 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:40:55,053 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:40:55,055 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:55,055 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:40:55,057 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:55,057 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:40:55,057 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:55,057 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:55,058 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:55,058 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:40:55,058 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:40:55,058 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:55,059 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:40:55,059 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:55,059 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:55,060 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:55,065 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:55,066 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:40:55,066 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:40:55,070 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:55,071 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:40:55,071 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:55,071 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:55,071 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:55,071 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:55,072 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:40:55,072 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:40:55,079 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:55,079 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:40:55,083 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:55,083 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2019-01-14 03:40:55,084 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:55,084 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:55,085 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-14 03:40:55,086 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:40:55,099 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:55,100 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:40:55,100 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:55,100 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:55,101 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:55,101 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:55,101 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:40:55,102 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:40:55,109 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:55,109 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:40:55,110 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:55,113 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:55,113 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:55,113 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:55,114 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:40:55,114 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:40:55,118 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:55,119 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:40:55,119 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:55,119 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:40:55,119 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:55,119 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:55,119 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:55,120 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:40:55,120 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:40:55,120 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:55,121 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:40:55,121 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:55,121 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2019-01-14 03:40:55,121 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:55,121 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:55,126 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-14 03:40:55,126 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:40:55,136 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:55,137 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:40:55,137 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:55,138 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:55,138 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:55,138 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:55,142 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:40:55,142 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:40:55,144 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:55,145 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:40:55,145 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:55,145 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:55,145 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:55,146 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:55,146 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:40:55,146 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:40:55,155 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:55,155 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:40:55,156 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:55,156 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:55,156 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:55,156 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:55,159 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:40:55,159 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:40:55,160 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:55,163 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:40:55,163 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:55,164 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:55,164 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:55,164 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:55,168 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:40:55,168 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:40:55,216 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 03:40:55,260 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2019-01-14 03:40:55,260 INFO L444 ModelExtractionUtils]: 15 out of 28 variables were initially zero. Simplification set additionally 10 variables to zero. [2019-01-14 03:40:55,260 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 03:40:55,261 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 03:40:55,261 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 03:40:55,261 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~nc_B~0) = -1*ULTIMATE.start_main_~j~0 + 1*ULTIMATE.start_main_~nc_B~0 Supporting invariants [] [2019-01-14 03:40:55,633 INFO L297 tatePredicateManager]: 14 out of 14 supporting invariants were superfluous and have been removed [2019-01-14 03:40:55,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:40:55,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:40:55,924 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:40:55,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:40:55,946 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:40:56,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 03:40:56,092 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-14 03:40:56,093 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 40 states and 44 transitions. cyclomatic complexity: 8 Second operand 3 states. [2019-01-14 03:40:56,132 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 40 states and 44 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 44 states and 50 transitions. Complement of second has 5 states. [2019-01-14 03:40:56,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 03:40:56,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 03:40:56,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 22 transitions. [2019-01-14 03:40:56,134 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 38 letters. Loop has 2 letters. [2019-01-14 03:40:56,135 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:40:56,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 40 letters. Loop has 2 letters. [2019-01-14 03:40:56,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:40:56,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 38 letters. Loop has 4 letters. [2019-01-14 03:40:56,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:40:56,137 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 50 transitions. [2019-01-14 03:40:56,138 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 03:40:56,139 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 44 states and 50 transitions. [2019-01-14 03:40:56,141 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2019-01-14 03:40:56,142 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2019-01-14 03:40:56,142 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 50 transitions. [2019-01-14 03:40:56,142 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 03:40:56,142 INFO L706 BuchiCegarLoop]: Abstraction has 44 states and 50 transitions. [2019-01-14 03:40:56,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states and 50 transitions. [2019-01-14 03:40:56,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-01-14 03:40:56,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-01-14 03:40:56,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2019-01-14 03:40:56,147 INFO L729 BuchiCegarLoop]: Abstraction has 44 states and 50 transitions. [2019-01-14 03:40:56,147 INFO L609 BuchiCegarLoop]: Abstraction has 44 states and 50 transitions. [2019-01-14 03:40:56,147 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2019-01-14 03:40:56,147 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 50 transitions. [2019-01-14 03:40:56,148 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 03:40:56,148 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:40:56,148 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:40:56,151 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 03:40:56,151 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 03:40:56,152 INFO L794 eck$LassoCheckResult]: Stem: 1753#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1750#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; 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; 1729#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; 1730#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1761#L19-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet2, main_~#string_A~0.base, main_~#string_A~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 1760#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); 1725#L19-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 1726#L21 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 1751#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; 1752#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1748#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; 1749#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1768#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; 1767#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); 1746#L23-4 call main_#t~mem6 := read~int(main_~#string_B~0.base, 4 + main_~#string_B~0.offset, 1); 1747#L25 assume !!(0 == main_#t~mem6);havoc main_#t~mem6;main_~nc_A~0 := 0; 1754#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 1733#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; 1734#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; 1732#L28-4 main_~nc_B~0 := 0; 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;main_#t~post10 := main_~nc_B~0;main_~nc_B~0 := 1 + main_#t~post10;havoc main_#t~post10; 1744#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 1745#L32-1 assume !(0 != main_#t~mem9);havoc main_#t~mem9; 1735#L32-4 assume !!(main_~nc_B~0 >= main_~nc_A~0);main_~j~0 := 0;main_~i~0 := main_~j~0; 1736#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); 1741#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; 1737#L41-2 [2019-01-14 03:40:56,152 INFO L796 eck$LassoCheckResult]: Loop: 1737#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); 1738#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; 1737#L41-2 [2019-01-14 03:40:56,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:40:56,152 INFO L82 PathProgramCache]: Analyzing trace with hash -1838818643, now seen corresponding path program 1 times [2019-01-14 03:40:56,152 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:40:56,152 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:40:56,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:56,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:40:56,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:56,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:40:56,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:40:56,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:40:56,202 INFO L82 PathProgramCache]: Analyzing trace with hash 3556, now seen corresponding path program 4 times [2019-01-14 03:40:56,202 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:40:56,202 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:40:56,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:56,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:40:56,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:56,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:40:56,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:40:56,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:40:56,208 INFO L82 PathProgramCache]: Analyzing trace with hash -1873154672, now seen corresponding path program 1 times [2019-01-14 03:40:56,208 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:40:56,208 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:40:56,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:56,209 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 03:40:56,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:56,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:40:56,369 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2019-01-14 03:40:56,369 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 03:40:56,369 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 03:40:56,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:40:56,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:40:56,415 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:40:56,499 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2019-01-14 03:40:56,520 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 03:40:56,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2019-01-14 03:40:56,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-14 03:40:56,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-01-14 03:40:56,586 INFO L87 Difference]: Start difference. First operand 44 states and 50 transitions. cyclomatic complexity: 11 Second operand 11 states. [2019-01-14 03:40:56,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 03:40:56,860 INFO L93 Difference]: Finished difference Result 74 states and 82 transitions. [2019-01-14 03:40:56,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-14 03:40:56,861 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 74 states and 82 transitions. [2019-01-14 03:40:56,862 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 03:40:56,863 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 74 states to 50 states and 56 transitions. [2019-01-14 03:40:56,863 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2019-01-14 03:40:56,863 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2019-01-14 03:40:56,864 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 56 transitions. [2019-01-14 03:40:56,864 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 03:40:56,864 INFO L706 BuchiCegarLoop]: Abstraction has 50 states and 56 transitions. [2019-01-14 03:40:56,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states and 56 transitions. [2019-01-14 03:40:56,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2019-01-14 03:40:56,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-01-14 03:40:56,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2019-01-14 03:40:56,867 INFO L729 BuchiCegarLoop]: Abstraction has 48 states and 54 transitions. [2019-01-14 03:40:56,867 INFO L609 BuchiCegarLoop]: Abstraction has 48 states and 54 transitions. [2019-01-14 03:40:56,867 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2019-01-14 03:40:56,867 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 48 states and 54 transitions. [2019-01-14 03:40:56,868 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 03:40:56,868 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:40:56,868 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:40:56,868 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 03:40:56,869 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 03:40:56,869 INFO L794 eck$LassoCheckResult]: Stem: 2022#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2020#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; 1996#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; 1997#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; 1999#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 2033#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; 2032#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 2031#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; 2029#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 2028#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; 2026#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 2025#L19-3 assume !(main_~i~0 < 5); 1994#L19-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 1995#L21 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 2017#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; 2018#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 2021#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; 2041#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 2040#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; 2039#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 2038#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; 2037#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 2036#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; 2035#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 2034#L23-3 assume !(main_~i~0 < 5); 2015#L23-4 call main_#t~mem6 := read~int(main_~#string_B~0.base, 4 + main_~#string_B~0.offset, 1); 2016#L25 assume !!(0 == main_#t~mem6);havoc main_#t~mem6;main_~nc_A~0 := 0; 2023#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 2002#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; 2003#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 2024#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; 2027#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 2000#L28-1 assume !(0 != main_#t~mem7);havoc main_#t~mem7; 2001#L28-4 main_~nc_B~0 := 0; 2011#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 2012#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; 2013#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 2014#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; 2030#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 2019#L32-1 assume !(0 != main_#t~mem9);havoc main_#t~mem9; 2004#L32-4 assume !!(main_~nc_B~0 >= main_~nc_A~0);main_~j~0 := 0;main_~i~0 := main_~j~0; 2005#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); 2010#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; 2006#L41-2 [2019-01-14 03:40:56,869 INFO L796 eck$LassoCheckResult]: Loop: 2006#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); 2007#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; 2006#L41-2 [2019-01-14 03:40:56,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:40:56,869 INFO L82 PathProgramCache]: Analyzing trace with hash -1976327923, now seen corresponding path program 2 times [2019-01-14 03:40:56,869 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:40:56,870 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:40:56,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:56,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:40:56,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:56,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:40:56,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:40:56,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:40:56,913 INFO L82 PathProgramCache]: Analyzing trace with hash 3556, now seen corresponding path program 5 times [2019-01-14 03:40:56,914 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:40:56,914 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:40:56,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:56,915 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 03:40:56,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:56,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:40:56,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:40:56,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:40:56,920 INFO L82 PathProgramCache]: Analyzing trace with hash -875586576, now seen corresponding path program 2 times [2019-01-14 03:40:56,920 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:40:56,920 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:40:56,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:56,920 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 03:40:56,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:56,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:40:56,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:41:00,474 WARN L181 SmtUtils]: Spent 3.38 s on a formula simplification. DAG size of input: 313 DAG size of output: 234 [2019-01-14 03:41:00,772 WARN L181 SmtUtils]: Spent 291.00 ms on a formula simplification that was a NOOP. DAG size: 126 [2019-01-14 03:41:00,775 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 03:41:00,775 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 03:41:00,775 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 03:41:00,775 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 03:41:00,775 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 03:41:00,775 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:41:00,776 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 03:41:00,776 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 03:41:00,776 INFO L131 ssoRankerPreferences]: Filename of dumped script: string_true-unreach-call_true-termination.i_Iteration14_Lasso [2019-01-14 03:41:00,776 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 03:41:00,776 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 03:41:00,782 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:00,806 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:00,823 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:00,824 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:00,830 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:00,832 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:00,833 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:00,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-01-14 03:41:00,837 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:00,838 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:00,840 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:00,841 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:00,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-01-14 03:41:01,432 WARN L181 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 75 [2019-01-14 03:41:01,547 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:01,550 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:01,551 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:01,553 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:01,555 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:01,556 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:02,540 WARN L181 SmtUtils]: Spent 549.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2019-01-14 03:41:02,753 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 03:41:02,753 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 03:41:02,755 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:41:02,757 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:41:02,757 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:41:02,758 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:41:02,758 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:41:02,758 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:41:02,758 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:41:02,759 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:41:02,760 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:41:02,760 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:41:02,761 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:41:02,761 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:41:02,761 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:41:02,761 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:41:02,761 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:41:02,761 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:41:02,762 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:41:02,762 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:41:02,762 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:41:02,763 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:41:02,763 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:41:02,763 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:41:02,763 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:41:02,763 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:41:02,763 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:41:02,763 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:41:02,773 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:41:02,773 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:41:02,774 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:41:02,774 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:41:02,774 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:41:02,774 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:41:02,775 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:41:02,775 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:41:02,779 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:41:02,780 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:41:02,780 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:41:02,780 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:41:02,780 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:41:02,780 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:41:02,784 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:41:02,784 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:41:02,785 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:41:02,786 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:41:02,786 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:41:02,786 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:41:02,786 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:41:02,787 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:41:02,789 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:41:02,789 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:41:02,789 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:41:02,790 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:41:02,790 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:41:02,790 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:41:02,790 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:41:02,791 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:41:02,794 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:41:02,794 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:41:02,794 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:41:02,794 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:41:02,795 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:41:02,795 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:41:02,795 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:41:02,796 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:41:02,796 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:41:02,796 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:41:02,796 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:41:02,796 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:41:02,796 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:41:02,797 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:41:02,797 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:41:02,797 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:41:02,797 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:41:02,797 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:41:02,798 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:41:02,801 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:41:02,801 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:41:02,801 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:41:02,802 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:41:02,804 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:41:02,804 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:41:02,805 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:41:02,805 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:41:02,805 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:41:02,805 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:41:02,805 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:41:02,805 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:41:02,806 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:41:02,806 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:41:02,806 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:41:02,806 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:41:02,807 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:41:02,810 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:41:02,810 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:41:02,810 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:41:02,810 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:41:02,811 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:41:02,811 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:41:02,812 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:41:02,812 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:41:02,812 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:41:02,812 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:41:02,812 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:41:02,812 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:41:02,812 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:41:02,816 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:41:02,816 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:41:02,820 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:41:02,820 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:41:02,820 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:41:02,820 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:41:02,821 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:41:02,821 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:41:02,823 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:41:02,827 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:41:02,827 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:41:02,828 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:41:02,828 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:41:02,828 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:41:02,828 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:41:02,828 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:41:02,832 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:41:02,833 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:41:02,833 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:41:02,834 INFO L205 nArgumentSynthesizer]: 12 stem disjuncts [2019-01-14 03:41:02,834 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:41:02,834 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:41:02,843 INFO L402 nArgumentSynthesizer]: We have 28 Motzkin's Theorem applications. [2019-01-14 03:41:02,843 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:41:02,869 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:41:02,870 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:41:02,870 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:41:02,870 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2019-01-14 03:41:02,871 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:41:02,871 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:41:02,873 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-14 03:41:02,874 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:41:02,878 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:41:02,879 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:41:02,879 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:41:02,879 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:41:02,879 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:41:02,880 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:41:02,880 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:41:02,880 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:41:02,882 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:41:02,883 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:41:02,883 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:41:02,883 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:41:02,884 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:41:02,884 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:41:02,887 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:41:02,887 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:41:02,902 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 03:41:02,929 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2019-01-14 03:41:02,929 INFO L444 ModelExtractionUtils]: 15 out of 28 variables were initially zero. Simplification set additionally 10 variables to zero. [2019-01-14 03:41:02,929 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 03:41:02,930 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 03:41:02,930 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 03:41:02,930 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~nc_B~0) = -1*ULTIMATE.start_main_~j~0 + 1*ULTIMATE.start_main_~nc_B~0 Supporting invariants [] [2019-01-14 03:41:03,297 INFO L297 tatePredicateManager]: 26 out of 26 supporting invariants were superfluous and have been removed [2019-01-14 03:41:03,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:41:03,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:41:03,341 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:41:03,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:41:03,368 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:41:03,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 03:41:03,380 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-14 03:41:03,380 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 48 states and 54 transitions. cyclomatic complexity: 11 Second operand 3 states. [2019-01-14 03:41:03,394 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 48 states and 54 transitions. cyclomatic complexity: 11. Second operand 3 states. Result 52 states and 60 transitions. Complement of second has 5 states. [2019-01-14 03:41:03,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 03:41:03,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 03:41:03,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 25 transitions. [2019-01-14 03:41:03,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 25 transitions. Stem has 44 letters. Loop has 2 letters. [2019-01-14 03:41:03,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:41:03,398 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 25 transitions. Stem has 46 letters. Loop has 2 letters. [2019-01-14 03:41:03,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:41:03,399 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 25 transitions. Stem has 44 letters. Loop has 4 letters. [2019-01-14 03:41:03,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:41:03,400 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 52 states and 60 transitions. [2019-01-14 03:41:03,400 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 03:41:03,401 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 52 states to 52 states and 60 transitions. [2019-01-14 03:41:03,401 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2019-01-14 03:41:03,401 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2019-01-14 03:41:03,401 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 60 transitions. [2019-01-14 03:41:03,401 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 03:41:03,402 INFO L706 BuchiCegarLoop]: Abstraction has 52 states and 60 transitions. [2019-01-14 03:41:03,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states and 60 transitions. [2019-01-14 03:41:03,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-01-14 03:41:03,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-01-14 03:41:03,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 60 transitions. [2019-01-14 03:41:03,409 INFO L729 BuchiCegarLoop]: Abstraction has 52 states and 60 transitions. [2019-01-14 03:41:03,409 INFO L609 BuchiCegarLoop]: Abstraction has 52 states and 60 transitions. [2019-01-14 03:41:03,409 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2019-01-14 03:41:03,409 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states and 60 transitions. [2019-01-14 03:41:03,409 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 03:41:03,410 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:41:03,413 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:41:03,414 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 03:41:03,414 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 03:41:03,414 INFO L794 eck$LassoCheckResult]: Stem: 2387#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2385#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; 2359#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; 2360#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 2361#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; 2362#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 2398#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; 2396#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 2395#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; 2394#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 2393#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; 2391#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 2390#L19-3 assume !(main_~i~0 < 5); 2357#L19-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 2358#L21 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 2382#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; 2383#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 2386#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; 2406#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 2405#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; 2404#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 2403#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; 2402#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 2401#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; 2400#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 2399#L23-3 assume !(main_~i~0 < 5); 2378#L23-4 call main_#t~mem6 := read~int(main_~#string_B~0.base, 4 + main_~#string_B~0.offset, 1); 2379#L25 assume !!(0 == main_#t~mem6);havoc main_#t~mem6;main_~nc_A~0 := 0; 2388#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 2365#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; 2366#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 2389#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; 2392#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 2363#L28-1 assume !(0 != main_#t~mem7);havoc main_#t~mem7; 2364#L28-4 main_~nc_B~0 := 0; 2374#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 2375#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; 2376#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 2377#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; 2397#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 2384#L32-1 assume !(0 != main_#t~mem9);havoc main_#t~mem9; 2367#L32-4 assume !!(main_~nc_B~0 >= main_~nc_A~0);main_~j~0 := 0;main_~i~0 := main_~j~0; 2368#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); 2380#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; 2381#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); 2373#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; 2369#L41-2 [2019-01-14 03:41:03,414 INFO L796 eck$LassoCheckResult]: Loop: 2369#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); 2370#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; 2369#L41-2 [2019-01-14 03:41:03,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:41:03,415 INFO L82 PathProgramCache]: Analyzing trace with hash -875586574, now seen corresponding path program 3 times [2019-01-14 03:41:03,415 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:41:03,415 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:41:03,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:41:03,416 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 03:41:03,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:41:03,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:41:03,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:41:03,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:41:03,479 INFO L82 PathProgramCache]: Analyzing trace with hash 3556, now seen corresponding path program 6 times [2019-01-14 03:41:03,479 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:41:03,479 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:41:03,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:41:03,483 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 03:41:03,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:41:03,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:41:03,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:41:03,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:41:03,494 INFO L82 PathProgramCache]: Analyzing trace with hash 374894997, now seen corresponding path program 3 times [2019-01-14 03:41:03,494 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:41:03,495 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:41:03,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:41:03,495 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 03:41:03,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:41:03,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:41:03,738 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-01-14 03:41:03,738 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 03:41:03,738 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 03:41:03,750 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 03:41:03,795 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-14 03:41:03,796 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 03:41:03,798 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:41:04,113 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-01-14 03:41:04,138 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 03:41:04,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2019-01-14 03:41:04,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-14 03:41:04,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2019-01-14 03:41:04,219 INFO L87 Difference]: Start difference. First operand 52 states and 60 transitions. cyclomatic complexity: 14 Second operand 14 states. [2019-01-14 03:41:04,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 03:41:04,589 INFO L93 Difference]: Finished difference Result 96 states and 110 transitions. [2019-01-14 03:41:04,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-01-14 03:41:04,590 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 96 states and 110 transitions. [2019-01-14 03:41:04,592 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 03:41:04,592 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 96 states to 58 states and 66 transitions. [2019-01-14 03:41:04,593 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2019-01-14 03:41:04,593 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2019-01-14 03:41:04,593 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 66 transitions. [2019-01-14 03:41:04,593 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 03:41:04,593 INFO L706 BuchiCegarLoop]: Abstraction has 58 states and 66 transitions. [2019-01-14 03:41:04,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states and 66 transitions. [2019-01-14 03:41:04,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2019-01-14 03:41:04,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-01-14 03:41:04,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 64 transitions. [2019-01-14 03:41:04,597 INFO L729 BuchiCegarLoop]: Abstraction has 56 states and 64 transitions. [2019-01-14 03:41:04,597 INFO L609 BuchiCegarLoop]: Abstraction has 56 states and 64 transitions. [2019-01-14 03:41:04,597 INFO L442 BuchiCegarLoop]: ======== Iteration 16============ [2019-01-14 03:41:04,597 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 64 transitions. [2019-01-14 03:41:04,598 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 03:41:04,598 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:41:04,598 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:41:04,599 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 03:41:04,599 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 03:41:04,599 INFO L794 eck$LassoCheckResult]: Stem: 2717#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; 2689#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; 2690#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 2691#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; 2692#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; 2727#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 2726#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; 2725#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 2724#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; 2722#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 2721#L19-3 assume !(main_~i~0 < 5); 2687#L19-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 2688#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; 2716#L23-3 assume !!(main_~i~0 < 5);call write~int(main_#t~nondet5, main_~#string_B~0.base, main_~#string_B~0.offset + main_~i~0, 1);havoc main_#t~nondet5; 2738#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; 2736#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 2735#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; 2734#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; 2732#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 2731#L23-3 assume !(main_~i~0 < 5); 2708#L23-4 call main_#t~mem6 := read~int(main_~#string_B~0.base, 4 + main_~#string_B~0.offset, 1); 2709#L25 assume !!(0 == main_#t~mem6);havoc main_#t~mem6;main_~nc_A~0 := 0; 2718#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 2719#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; 2739#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 2695#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; 2696#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 2720#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); 2693#L28-1 assume !(0 != main_#t~mem7);havoc main_#t~mem7; 2694#L28-4 main_~nc_B~0 := 0; 2704#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 2705#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; 2706#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 2707#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; 2715#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 2729#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; 2728#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; 2697#L32-4 assume !!(main_~nc_B~0 >= main_~nc_A~0);main_~j~0 := 0;main_~i~0 := main_~j~0; 2698#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); 2703#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; 2710#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); 2740#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; 2699#L41-2 [2019-01-14 03:41:04,599 INFO L796 eck$LassoCheckResult]: Loop: 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); 2700#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; 2699#L41-2 [2019-01-14 03:41:04,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:41:04,600 INFO L82 PathProgramCache]: Analyzing trace with hash -1412851758, now seen corresponding path program 4 times [2019-01-14 03:41:04,600 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:41:04,600 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:41:04,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:41:04,601 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 03:41:04,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:41:04,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:41:04,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:41:04,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:41:04,652 INFO L82 PathProgramCache]: Analyzing trace with hash 3556, now seen corresponding path program 7 times [2019-01-14 03:41:04,652 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:41:04,653 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:41:04,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:41:04,653 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 03:41:04,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:41:04,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:41:04,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:41:04,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:41:04,688 INFO L82 PathProgramCache]: Analyzing trace with hash -540871307, now seen corresponding path program 4 times [2019-01-14 03:41:04,688 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:41:04,688 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:41:04,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:41:04,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:41:04,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:41:04,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:41:04,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:41:05,122 WARN L181 SmtUtils]: Spent 361.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2019-01-14 03:41:05,417 WARN L181 SmtUtils]: Spent 294.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-01-14 03:41:11,091 WARN L181 SmtUtils]: Spent 5.67 s on a formula simplification. DAG size of input: 361 DAG size of output: 272 [2019-01-14 03:41:11,423 WARN L181 SmtUtils]: Spent 323.00 ms on a formula simplification that was a NOOP. DAG size: 136 [2019-01-14 03:41:11,425 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 03:41:11,426 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 03:41:11,426 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 03:41:11,426 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 03:41:11,426 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 03:41:11,426 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:41:11,426 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 03:41:11,426 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 03:41:11,426 INFO L131 ssoRankerPreferences]: Filename of dumped script: string_true-unreach-call_true-termination.i_Iteration16_Lasso [2019-01-14 03:41:11,426 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 03:41:11,426 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 03:41:11,430 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:11,447 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:11,449 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:11,450 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:11,452 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:11,454 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:11,455 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:11,457 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:11,459 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:11,461 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:12,215 WARN L181 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 80 [2019-01-14 03:41:12,378 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:12,387 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:12,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-01-14 03:41:12,391 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:12,393 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:12,394 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:12,396 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:12,398 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:12,400 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:12,667 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-01-14 03:41:14,427 WARN L181 SmtUtils]: Spent 1.63 s on a formula simplification. DAG size of input: 97 DAG size of output: 69 [2019-01-14 03:41:14,547 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 03:41:14,547 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 03:41:14,548 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:41:14,548 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:41:14,549 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:41:14,549 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:41:14,549 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:41:14,549 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:41:14,550 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:41:14,557 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:41:14,557 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:41:14,558 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:41:14,561 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:41:14,561 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:41:14,561 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:41:14,561 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:41:14,562 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:41:14,562 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:41:14,562 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:41:14,562 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:41:14,563 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:41:14,563 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:41:14,563 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:41:14,563 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:41:14,563 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:41:14,567 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:41:14,567 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:41:14,567 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:41:14,568 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:41:14,568 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:41:14,568 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:41:14,568 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:41:14,569 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:41:14,569 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:41:14,569 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:41:14,572 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:41:14,573 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:41:14,573 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:41:14,573 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:41:14,574 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:41:14,574 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:41:14,574 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:41:14,574 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:41:14,574 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:41:14,574 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:41:14,578 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:41:14,578 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:41:14,578 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:41:14,579 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:41:14,579 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:41:14,579 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:41:14,579 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:41:14,579 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:41:14,579 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:41:14,584 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:41:14,584 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:41:14,584 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:41:14,585 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:41:14,585 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:41:14,585 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:41:14,585 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:41:14,586 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:41:14,587 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:41:14,589 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:41:14,589 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:41:14,589 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:41:14,589 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:41:14,590 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:41:14,590 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:41:14,590 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:41:14,590 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:41:14,594 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:41:14,594 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:41:14,594 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:41:14,594 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:41:14,595 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:41:14,595 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:41:14,595 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:41:14,595 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:41:14,595 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:41:14,596 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:41:14,596 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:41:14,596 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:41:14,597 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:41:14,597 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:41:14,597 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:41:14,597 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:41:14,602 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:41:14,603 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:41:14,603 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:41:14,603 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2019-01-14 03:41:14,604 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:41:14,606 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:41:14,607 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-14 03:41:14,607 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:41:14,617 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:41:14,617 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:41:14,618 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:41:14,618 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:41:14,618 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:41:14,618 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:41:14,618 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:41:14,619 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:41:14,624 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:41:14,624 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:41:14,624 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:41:14,625 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:41:14,625 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:41:14,625 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:41:14,625 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:41:14,625 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:41:14,626 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:41:14,630 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:41:14,630 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:41:14,630 INFO L205 nArgumentSynthesizer]: 36 stem disjuncts [2019-01-14 03:41:14,631 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:41:14,631 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:41:14,644 INFO L402 nArgumentSynthesizer]: We have 76 Motzkin's Theorem applications. [2019-01-14 03:41:14,644 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:41:14,716 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:41:14,717 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:41:14,719 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:41:14,719 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:41:14,719 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:41:14,719 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:41:14,720 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:41:14,720 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:41:14,724 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:41:14,724 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:41:14,725 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:41:14,725 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-14 03:41:14,725 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:41:14,725 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:41:14,729 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-14 03:41:14,729 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:41:14,731 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:41:14,731 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:41:14,731 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:41:14,732 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-14 03:41:14,735 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:41:14,735 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:41:14,736 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-14 03:41:14,736 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:41:14,737 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:41:14,738 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:41:14,740 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:41:14,740 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:41:14,740 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:41:14,741 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:41:14,742 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:41:14,748 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:41:14,774 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 03:41:14,804 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-14 03:41:14,804 INFO L444 ModelExtractionUtils]: 24 out of 28 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 03:41:14,805 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 03:41:14,805 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 03:41:14,809 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 03:41:14,809 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~nc_B~0, ULTIMATE.start_main_~j~0) = 1*ULTIMATE.start_main_~nc_B~0 - 1*ULTIMATE.start_main_~j~0 Supporting invariants [] [2019-01-14 03:41:15,438 INFO L297 tatePredicateManager]: 32 out of 32 supporting invariants were superfluous and have been removed [2019-01-14 03:41:15,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:41:15,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:41:15,500 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:41:15,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:41:15,524 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:41:15,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 03:41:15,562 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-14 03:41:15,562 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 56 states and 64 transitions. cyclomatic complexity: 14 Second operand 3 states. [2019-01-14 03:41:15,584 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 56 states and 64 transitions. cyclomatic complexity: 14. Second operand 3 states. Result 58 states and 68 transitions. Complement of second has 5 states. [2019-01-14 03:41:15,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 03:41:15,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 03:41:15,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 25 transitions. [2019-01-14 03:41:15,586 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 25 transitions. Stem has 50 letters. Loop has 2 letters. [2019-01-14 03:41:15,587 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:41:15,587 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 03:41:15,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:41:15,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:41:15,642 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:41:15,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:41:15,655 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:41:15,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 03:41:15,672 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-14 03:41:15,672 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 56 states and 64 transitions. cyclomatic complexity: 14 Second operand 3 states. [2019-01-14 03:41:15,700 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 56 states and 64 transitions. cyclomatic complexity: 14. Second operand 3 states. Result 58 states and 68 transitions. Complement of second has 5 states. [2019-01-14 03:41:15,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 03:41:15,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 03:41:15,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 25 transitions. [2019-01-14 03:41:15,704 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 25 transitions. Stem has 50 letters. Loop has 2 letters. [2019-01-14 03:41:15,704 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:41:15,704 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 03:41:15,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:41:15,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:41:15,761 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:41:15,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:41:15,778 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:41:15,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 03:41:15,786 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-14 03:41:15,786 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 56 states and 64 transitions. cyclomatic complexity: 14 Second operand 3 states. [2019-01-14 03:41:15,832 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 56 states and 64 transitions. cyclomatic complexity: 14. Second operand 3 states. Result 60 states and 71 transitions. Complement of second has 4 states. [2019-01-14 03:41:15,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 03:41:15,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 03:41:15,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2019-01-14 03:41:15,835 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 26 transitions. Stem has 50 letters. Loop has 2 letters. [2019-01-14 03:41:15,836 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:41:15,836 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 26 transitions. Stem has 52 letters. Loop has 2 letters. [2019-01-14 03:41:15,836 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:41:15,837 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 26 transitions. Stem has 50 letters. Loop has 4 letters. [2019-01-14 03:41:15,837 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:41:15,837 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 71 transitions. [2019-01-14 03:41:15,838 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-14 03:41:15,840 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 58 states and 67 transitions. [2019-01-14 03:41:15,840 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2019-01-14 03:41:15,840 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2019-01-14 03:41:15,840 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 67 transitions. [2019-01-14 03:41:15,841 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 03:41:15,841 INFO L706 BuchiCegarLoop]: Abstraction has 58 states and 67 transitions. [2019-01-14 03:41:15,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states and 67 transitions. [2019-01-14 03:41:15,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 50. [2019-01-14 03:41:15,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-01-14 03:41:15,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2019-01-14 03:41:15,847 INFO L729 BuchiCegarLoop]: Abstraction has 50 states and 55 transitions. [2019-01-14 03:41:15,847 INFO L609 BuchiCegarLoop]: Abstraction has 50 states and 55 transitions. [2019-01-14 03:41:15,847 INFO L442 BuchiCegarLoop]: ======== Iteration 17============ [2019-01-14 03:41:15,847 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 55 transitions. [2019-01-14 03:41:15,848 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-14 03:41:15,848 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:41:15,848 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:41:15,848 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 03:41:15,848 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 03:41:15,849 INFO L794 eck$LassoCheckResult]: Stem: 3575#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3570#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; 3549#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; 3550#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 3551#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; 3552#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 3587#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; 3586#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 3585#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; 3583#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 3582#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; 3579#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 3578#L19-3 assume !(main_~i~0 < 5); 3547#L19-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 3548#L21 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 3573#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; 3574#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; 3569#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 3596#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; 3595#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 3594#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; 3593#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 3592#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; 3591#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 3590#L23-3 assume !(main_~i~0 < 5); 3566#L23-4 call main_#t~mem6 := read~int(main_~#string_B~0.base, 4 + main_~#string_B~0.offset, 1); 3567#L25 assume !!(0 == main_#t~mem6);havoc main_#t~mem6;main_~nc_A~0 := 0; 3576#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; 3556#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 3577#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; 3584#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 3581#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; 3580#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 3553#L28-1 assume !(0 != main_#t~mem7);havoc main_#t~mem7; 3554#L28-4 main_~nc_B~0 := 0; 3562#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 3563#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; 3564#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 3565#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; 3572#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 3589#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; 3588#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 3571#L32-1 assume !(0 != main_#t~mem9);havoc main_#t~mem9; 3557#L32-4 assume !!(main_~nc_B~0 >= main_~nc_A~0);main_~j~0 := 0;main_~i~0 := main_~j~0; 3558#L41-2 [2019-01-14 03:41:15,849 INFO L796 eck$LassoCheckResult]: Loop: 3558#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); 3560#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; 3558#L41-2 [2019-01-14 03:41:15,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:41:15,849 INFO L82 PathProgramCache]: Analyzing trace with hash 1972313288, now seen corresponding path program 2 times [2019-01-14 03:41:15,849 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:41:15,849 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:41:15,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:41:15,850 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 03:41:15,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:41:15,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:41:15,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:41:15,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:41:15,896 INFO L82 PathProgramCache]: Analyzing trace with hash 3558, now seen corresponding path program 1 times [2019-01-14 03:41:15,896 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:41:15,897 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:41:15,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:41:15,897 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 03:41:15,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:41:15,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:41:15,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:41:15,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:41:15,902 INFO L82 PathProgramCache]: Analyzing trace with hash 1312494829, now seen corresponding path program 5 times [2019-01-14 03:41:15,902 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:41:15,902 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:41:15,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:41:15,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:41:15,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:41:15,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:41:15,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:41:20,017 WARN L181 SmtUtils]: Spent 3.92 s on a formula simplification. DAG size of input: 312 DAG size of output: 232 [2019-01-14 03:41:20,268 WARN L181 SmtUtils]: Spent 246.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-01-14 03:41:20,272 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 03:41:20,272 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 03:41:20,272 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 03:41:20,272 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 03:41:20,272 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 03:41:20,272 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:41:20,273 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 03:41:20,273 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 03:41:20,273 INFO L131 ssoRankerPreferences]: Filename of dumped script: string_true-unreach-call_true-termination.i_Iteration17_Lasso [2019-01-14 03:41:20,273 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 03:41:20,273 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 03:41:20,278 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:20,289 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:20,291 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:20,294 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:20,296 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:20,297 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:20,299 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:20,300 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:20,331 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:20,346 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:20,932 WARN L181 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 71 [2019-01-14 03:41:21,103 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 48 [2019-01-14 03:41:21,103 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:21,109 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:21,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-01-14 03:41:21,115 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:21,117 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:21,119 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:21,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-01-14 03:41:21,130 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:21,133 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:21,734 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 03:41:21,734 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 03:41:21,735 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:41:21,735 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:41:21,735 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:41:21,735 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:41:21,735 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:41:21,736 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:41:21,742 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:41:21,742 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:41:21,743 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:41:21,743 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:41:21,743 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:41:21,743 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:41:21,743 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:41:21,744 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:41:21,744 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:41:21,744 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:41:21,744 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:41:21,744 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:41:21,745 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:41:21,748 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:41:21,748 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:41:21,749 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:41:21,749 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:41:21,749 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:41:21,749 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:41:21,750 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:41:21,751 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:41:21,754 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:41:21,754 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:41:21,755 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:41:21,755 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:41:21,755 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:41:21,755 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:41:21,755 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:41:21,755 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:41:21,758 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:41:21,758 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:41:21,759 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:41:21,759 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:41:21,759 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:41:21,759 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:41:21,759 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:41:21,759 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:41:21,760 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:41:21,760 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:41:21,760 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:41:21,760 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:41:21,761 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:41:21,761 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:41:21,764 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:41:21,764 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:41:21,764 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:41:21,765 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:41:21,765 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:41:21,765 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:41:21,765 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:41:21,766 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:41:21,766 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:41:21,766 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:41:21,766 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:41:21,766 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:41:21,766 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:41:21,772 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:41:21,772 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:41:21,772 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:41:21,773 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:41:21,773 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:41:21,773 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:41:21,773 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:41:21,774 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:41:21,775 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:41:21,775 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:41:21,775 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:41:21,775 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:41:21,775 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:41:21,776 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:41:21,776 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:41:21,782 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:41:21,782 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:41:21,783 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:41:21,783 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2019-01-14 03:41:21,783 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:41:21,783 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:41:21,784 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-14 03:41:21,784 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:41:21,790 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:41:21,791 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:41:21,791 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:41:21,791 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-14 03:41:21,791 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:41:21,791 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:41:21,795 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-14 03:41:21,795 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:41:21,797 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:41:21,797 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:41:21,797 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:41:21,797 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:41:21,798 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:41:21,801 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:41:21,801 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:41:21,802 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:41:21,805 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:41:21,805 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:41:21,806 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:41:21,806 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:41:21,806 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:41:21,806 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:41:21,806 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:41:21,807 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:41:21,807 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:41:21,811 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:41:21,811 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:41:21,812 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:41:21,812 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:41:21,812 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:41:21,813 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:41:21,813 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:41:21,842 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 03:41:21,865 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-01-14 03:41:21,866 INFO L444 ModelExtractionUtils]: 22 out of 28 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-01-14 03:41:21,866 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 03:41:21,866 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 03:41:21,867 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 03:41:21,867 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~nc_A~0, ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~nc_A~0 - 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2019-01-14 03:41:22,272 INFO L297 tatePredicateManager]: 42 out of 43 supporting invariants were superfluous and have been removed [2019-01-14 03:41:22,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:41:22,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:41:22,322 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:41:22,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:41:22,333 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:41:22,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 03:41:22,343 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-14 03:41:22,343 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 50 states and 55 transitions. cyclomatic complexity: 9 Second operand 3 states. [2019-01-14 03:41:22,386 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 50 states and 55 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 59 states and 69 transitions. Complement of second has 6 states. [2019-01-14 03:41:22,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 2 accepting loop states [2019-01-14 03:41:22,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 03:41:22,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2019-01-14 03:41:22,389 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 46 letters. Loop has 2 letters. [2019-01-14 03:41:22,389 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:41:22,389 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 48 letters. Loop has 2 letters. [2019-01-14 03:41:22,390 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:41:22,390 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 46 letters. Loop has 4 letters. [2019-01-14 03:41:22,390 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:41:22,390 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 69 transitions. [2019-01-14 03:41:22,391 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-14 03:41:22,392 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 57 states and 65 transitions. [2019-01-14 03:41:22,392 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2019-01-14 03:41:22,392 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2019-01-14 03:41:22,392 INFO L73 IsDeterministic]: Start isDeterministic. Operand 57 states and 65 transitions. [2019-01-14 03:41:22,392 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 03:41:22,392 INFO L706 BuchiCegarLoop]: Abstraction has 57 states and 65 transitions. [2019-01-14 03:41:22,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states and 65 transitions. [2019-01-14 03:41:22,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 53. [2019-01-14 03:41:22,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-01-14 03:41:22,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 60 transitions. [2019-01-14 03:41:22,394 INFO L729 BuchiCegarLoop]: Abstraction has 53 states and 60 transitions. [2019-01-14 03:41:22,394 INFO L609 BuchiCegarLoop]: Abstraction has 53 states and 60 transitions. [2019-01-14 03:41:22,395 INFO L442 BuchiCegarLoop]: ======== Iteration 18============ [2019-01-14 03:41:22,395 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 60 transitions. [2019-01-14 03:41:22,395 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-14 03:41:22,395 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:41:22,395 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:41:22,396 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 03:41:22,396 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 03:41:22,396 INFO L794 eck$LassoCheckResult]: Stem: 4032#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 4030#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; 4005#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; 4006#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 4007#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; 4008#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 4044#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; 4043#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 4042#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; 4040#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 4039#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; 4036#L19-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 4035#L19-3 assume !(main_~i~0 < 5); 4003#L19-4 call main_#t~mem3 := read~int(main_~#string_A~0.base, 4 + main_~#string_A~0.offset, 1); 4004#L21 assume !!(0 == main_#t~mem3);havoc main_#t~mem3;main_~i~0 := 0; 4027#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; 4028#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 4031#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; 4055#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 4054#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; 4053#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 4052#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; 4051#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 4050#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; 4049#L23-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 4048#L23-3 assume !(main_~i~0 < 5); 4022#L23-4 call main_#t~mem6 := read~int(main_~#string_B~0.base, 4 + main_~#string_B~0.offset, 1); 4023#L25 assume !!(0 == main_#t~mem6);havoc main_#t~mem6;main_~nc_A~0 := 0; 4033#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 4011#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; 4012#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 4034#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; 4041#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 4038#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; 4037#L28-3 call main_#t~mem7 := read~int(main_~#string_A~0.base, main_~#string_A~0.offset + main_~nc_A~0, 1); 4009#L28-1 assume !(0 != main_#t~mem7);havoc main_#t~mem7; 4010#L28-4 main_~nc_B~0 := 0; 4018#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 4019#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; 4020#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 4021#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; 4047#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 4046#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; 4045#L32-3 call main_#t~mem9 := read~int(main_~#string_B~0.base, main_~#string_B~0.offset + main_~nc_B~0, 1); 4029#L32-1 assume !(0 != main_#t~mem9);havoc main_#t~mem9; 4013#L32-4 assume !!(main_~nc_B~0 >= main_~nc_A~0);main_~j~0 := 0;main_~i~0 := main_~j~0; 4014#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); 4015#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; 4026#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); 4024#L41 [2019-01-14 03:41:22,396 INFO L796 eck$LassoCheckResult]: Loop: 4024#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; 4025#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); 4024#L41 [2019-01-14 03:41:22,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:41:22,397 INFO L82 PathProgramCache]: Analyzing trace with hash 2032634054, now seen corresponding path program 2 times [2019-01-14 03:41:22,397 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:41:22,397 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:41:22,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:41:22,398 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 03:41:22,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:41:22,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:41:22,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:41:22,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:41:22,434 INFO L82 PathProgramCache]: Analyzing trace with hash 3708, now seen corresponding path program 2 times [2019-01-14 03:41:22,434 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:41:22,434 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:41:22,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:41:22,435 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 03:41:22,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:41:22,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:41:22,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:41:22,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:41:22,438 INFO L82 PathProgramCache]: Analyzing trace with hash -848791039, now seen corresponding path program 5 times [2019-01-14 03:41:22,439 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:41:22,439 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:41:22,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:41:22,439 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 03:41:22,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:41:22,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:41:22,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:41:22,624 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-01-14 03:41:28,530 WARN L181 SmtUtils]: Spent 5.87 s on a formula simplification. DAG size of input: 351 DAG size of output: 260 [2019-01-14 03:41:28,954 WARN L181 SmtUtils]: Spent 416.00 ms on a formula simplification that was a NOOP. DAG size: 140 [2019-01-14 03:41:28,957 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 03:41:28,958 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 03:41:28,958 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 03:41:28,958 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 03:41:28,958 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 03:41:28,958 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:41:28,958 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 03:41:28,958 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 03:41:28,958 INFO L131 ssoRankerPreferences]: Filename of dumped script: string_true-unreach-call_true-termination.i_Iteration18_Lasso [2019-01-14 03:41:28,958 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 03:41:28,958 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 03:41:28,964 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:28,971 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:28,973 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:28,975 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:28,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-01-14 03:41:28,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-01-14 03:41:28,980 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:29,924 WARN L181 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 86 [2019-01-14 03:41:30,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:30,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-01-14 03:41:30,068 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:30,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-01-14 03:41:30,072 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:30,074 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:30,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-01-14 03:41:30,077 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:30,079 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:30,080 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:41:30,748 WARN L181 SmtUtils]: Spent 276.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-01-14 03:41:30,901 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 03:41:30,901 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 03:41:30,902 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:41:30,902 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:41:30,902 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:41:30,902 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:41:30,902 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:41:30,903 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:41:30,903 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:41:30,903 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:41:30,903 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:41:30,904 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:41:30,904 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:41:30,904 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:41:30,904 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:41:30,904 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:41:30,904 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:41:30,905 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:41:30,905 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:41:30,905 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:41:30,905 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:41:30,906 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:41:30,906 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:41:30,906 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:41:30,906 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:41:30,906 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:41:30,906 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:41:30,907 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:41:30,907 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:41:30,907 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:41:30,907 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:41:30,908 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:41:30,908 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:41:30,908 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:41:30,908 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:41:30,908 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:41:30,908 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:41:30,909 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:41:30,909 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:41:30,909 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:41:30,909 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:41:30,909 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:41:30,910 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:41:30,910 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:41:30,910 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:41:30,910 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:41:30,910 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:41:30,911 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:41:30,911 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:41:30,911 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:41:30,911 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:41:30,911 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:41:30,911 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:41:30,912 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:41:30,912 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:41:30,912 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:41:30,913 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:41:30,913 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:41:30,913 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:41:30,913 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:41:30,913 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:41:30,915 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:41:30,915 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:41:30,927 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 03:41:30,940 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-14 03:41:30,940 INFO L444 ModelExtractionUtils]: 23 out of 28 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 03:41:30,941 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 03:41:30,941 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 03:41:30,941 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 03:41:30,942 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~nc_A~0) = -1*ULTIMATE.start_main_~i~0 + 1*ULTIMATE.start_main_~j~0 + 1*ULTIMATE.start_main_~nc_A~0 Supporting invariants [] [2019-01-14 03:41:31,535 INFO L297 tatePredicateManager]: 50 out of 50 supporting invariants were superfluous and have been removed [2019-01-14 03:41:31,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:41:31,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:41:31,586 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:41:31,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:41:31,594 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:41:31,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 03:41:31,608 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-14 03:41:31,608 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 53 states and 60 transitions. cyclomatic complexity: 12 Second operand 3 states. [2019-01-14 03:41:31,630 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 53 states and 60 transitions. cyclomatic complexity: 12. Second operand 3 states. Result 66 states and 77 transitions. Complement of second has 6 states. [2019-01-14 03:41:31,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-14 03:41:31,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 03:41:31,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2019-01-14 03:41:31,635 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 49 letters. Loop has 2 letters. [2019-01-14 03:41:31,635 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:41:31,635 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 51 letters. Loop has 2 letters. [2019-01-14 03:41:31,635 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:41:31,635 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 49 letters. Loop has 4 letters. [2019-01-14 03:41:31,636 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:41:31,636 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 66 states and 77 transitions. [2019-01-14 03:41:31,637 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 03:41:31,640 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 66 states to 0 states and 0 transitions. [2019-01-14 03:41:31,640 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 03:41:31,640 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 03:41:31,640 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 03:41:31,640 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 03:41:31,640 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 03:41:31,640 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 03:41:31,641 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 03:41:31,641 INFO L442 BuchiCegarLoop]: ======== Iteration 19============ [2019-01-14 03:41:31,641 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 03:41:31,641 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 03:41:31,641 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 03:41:31,655 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 03:41:31 BoogieIcfgContainer [2019-01-14 03:41:31,655 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 03:41:31,659 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 03:41:31,659 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 03:41:31,659 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 03:41:31,660 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 03:40:32" (3/4) ... [2019-01-14 03:41:31,670 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 03:41:31,671 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 03:41:31,671 INFO L168 Benchmark]: Toolchain (without parser) took 60646.34 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 453.0 MB). Free memory was 948.7 MB in the beginning and 942.8 MB in the end (delta: 5.9 MB). Peak memory consumption was 458.8 MB. Max. memory is 11.5 GB. [2019-01-14 03:41:31,676 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 03:41:31,676 INFO L168 Benchmark]: CACSL2BoogieTranslator took 385.43 ms. Allocated memory is still 1.0 GB. Free memory was 948.7 MB in the beginning and 937.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-14 03:41:31,677 INFO L168 Benchmark]: Boogie Procedure Inliner took 53.71 ms. Allocated memory is still 1.0 GB. Free memory was 937.9 MB in the beginning and 932.5 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-01-14 03:41:31,681 INFO L168 Benchmark]: Boogie Preprocessor took 93.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.3 MB). Free memory was 932.5 MB in the beginning and 1.1 GB in the end (delta: -188.0 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. [2019-01-14 03:41:31,682 INFO L168 Benchmark]: RCFGBuilder took 574.05 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: 26.1 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. [2019-01-14 03:41:31,682 INFO L168 Benchmark]: BuchiAutomizer took 59516.46 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 327.7 MB). Free memory was 1.1 GB in the beginning and 942.8 MB in the end (delta: 151.6 MB). Peak memory consumption was 479.3 MB. Max. memory is 11.5 GB. [2019-01-14 03:41:31,683 INFO L168 Benchmark]: Witness Printer took 11.87 ms. Allocated memory is still 1.5 GB. Free memory is still 942.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 03:41:31,694 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 385.43 ms. Allocated memory is still 1.0 GB. Free memory was 948.7 MB in the beginning and 937.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 53.71 ms. Allocated memory is still 1.0 GB. Free memory was 937.9 MB in the beginning and 932.5 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 93.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.3 MB). Free memory was 932.5 MB in the beginning and 1.1 GB in the end (delta: -188.0 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 574.05 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: 26.1 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 59516.46 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 327.7 MB). Free memory was 1.1 GB in the beginning and 942.8 MB in the end (delta: 151.6 MB). Peak memory consumption was 479.3 MB. Max. memory is 11.5 GB. * Witness Printer took 11.87 ms. Allocated memory is still 1.5 GB. Free memory is still 942.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 18 terminating modules (10 trivial, 7 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -2 * i + 9 and consists of 5 locations. One deterministic module has affine ranking function unknown-#length-unknown[string_A] + -1 * string_A + -1 * nc_A and consists of 3 locations. One deterministic module has affine ranking function -1 * string_B + -1 * nc_B + unknown-#length-unknown[string_B] and consists of 3 locations. One deterministic module has affine ranking function -1 * j + nc_B and consists of 3 locations. One deterministic module has affine ranking function -1 * j + nc_B and consists of 3 locations. One deterministic module has affine ranking function nc_A + -1 * i and consists of 4 locations. One deterministic module has affine ranking function -1 * i + j + nc_A and consists of 4 locations. One nondeterministic module has affine ranking function nc_B + -1 * j and consists of 3 locations. 10 modules have a trivial ranking function, the largest among these consists of 14 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 59.4s and 19 iterations. TraceHistogramMax:5. Analysis of lassos took 55.8s. Construction of modules took 1.2s. Büchi inclusion checks took 1.9s. Highest rank in rank-based complementation 3. Minimization of det autom 8. Minimization of nondet autom 10. Automata minimization 0.0s AutomataMinimizationTime, 17 MinimizatonAttempts, 58 StatesRemovedByMinimization, 12 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 56 states and ocurred in iteration 15. Nontrivial modules had stage [7, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 354 SDtfs, 399 SDslu, 392 SDs, 0 SdLazy, 593 SolverSat, 137 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc4 concLT0 SILN0 SILU6 SILI0 SILT0 lasso8 LassoPreprocessingBenchmarks: Lassos: inital312 mio100 ax100 hnf99 lsp96 ukn46 mio100 lsp54 div100 bol100 ite100 ukn100 eq171 hnf84 smp93 dnf320 smp85 tf100 neg92 sie129 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 89ms VariablesStem: 5 VariablesLoop: 2 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...