./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/array-memsafety/substring-alloca-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_fa964f72-924d-426f-ad50-fd38e68a0fb5/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_fa964f72-924d-426f-ad50-fd38e68a0fb5/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_fa964f72-924d-426f-ad50-fd38e68a0fb5/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_fa964f72-924d-426f-ad50-fd38e68a0fb5/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/substring-alloca-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_fa964f72-924d-426f-ad50-fd38e68a0fb5/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_fa964f72-924d-426f-ad50-fd38e68a0fb5/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6e748b563bb7a11726b28f7957ce1a00b7c8807b .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 22:30:12,865 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 22:30:12,866 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 22:30:12,877 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 22:30:12,877 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 22:30:12,878 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 22:30:12,880 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 22:30:12,882 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 22:30:12,884 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 22:30:12,885 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 22:30:12,886 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 22:30:12,887 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 22:30:12,887 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 22:30:12,888 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 22:30:12,889 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 22:30:12,890 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 22:30:12,891 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 22:30:12,892 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 22:30:12,894 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 22:30:12,896 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 22:30:12,897 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 22:30:12,898 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 22:30:12,900 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 22:30:12,901 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 22:30:12,903 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 22:30:12,903 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 22:30:12,904 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 22:30:12,905 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 22:30:12,905 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 22:30:12,906 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 22:30:12,907 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 22:30:12,907 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 22:30:12,908 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 22:30:12,909 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 22:30:12,910 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 22:30:12,910 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 22:30:12,911 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 22:30:12,911 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 22:30:12,912 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 22:30:12,913 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 22:30:12,913 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 22:30:12,914 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_fa964f72-924d-426f-ad50-fd38e68a0fb5/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-15 22:30:12,929 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 22:30:12,929 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 22:30:12,930 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 22:30:12,931 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 22:30:12,931 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 22:30:12,931 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-15 22:30:12,931 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-15 22:30:12,932 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-15 22:30:12,932 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-15 22:30:12,932 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-15 22:30:12,932 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-15 22:30:12,933 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 22:30:12,933 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 22:30:12,933 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 22:30:12,933 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 22:30:12,934 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 22:30:12,934 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 22:30:12,934 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-15 22:30:12,934 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-15 22:30:12,935 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-15 22:30:12,935 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 22:30:12,935 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 22:30:12,935 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-15 22:30:12,935 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 22:30:12,936 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-15 22:30:12,936 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 22:30:12,936 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 22:30:12,936 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-15 22:30:12,937 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 22:30:12,937 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 22:30:12,937 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-15 22:30:12,938 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-15 22:30:12,938 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_fa964f72-924d-426f-ad50-fd38e68a0fb5/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6e748b563bb7a11726b28f7957ce1a00b7c8807b [2019-11-15 22:30:12,963 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 22:30:12,973 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 22:30:12,977 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 22:30:12,978 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 22:30:12,978 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 22:30:12,979 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_fa964f72-924d-426f-ad50-fd38e68a0fb5/bin/uautomizer/../../sv-benchmarks/c/array-memsafety/substring-alloca-2.i [2019-11-15 22:30:13,032 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_fa964f72-924d-426f-ad50-fd38e68a0fb5/bin/uautomizer/data/2a58f5951/ac236a7a4c8a4dc2bb20a3a7d0fdfb56/FLAG9f1fc3c84 [2019-11-15 22:30:13,537 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 22:30:13,538 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_fa964f72-924d-426f-ad50-fd38e68a0fb5/sv-benchmarks/c/array-memsafety/substring-alloca-2.i [2019-11-15 22:30:13,561 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_fa964f72-924d-426f-ad50-fd38e68a0fb5/bin/uautomizer/data/2a58f5951/ac236a7a4c8a4dc2bb20a3a7d0fdfb56/FLAG9f1fc3c84 [2019-11-15 22:30:13,998 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_fa964f72-924d-426f-ad50-fd38e68a0fb5/bin/uautomizer/data/2a58f5951/ac236a7a4c8a4dc2bb20a3a7d0fdfb56 [2019-11-15 22:30:14,009 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 22:30:14,010 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 22:30:14,011 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 22:30:14,011 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 22:30:14,015 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 22:30:14,016 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:30:14" (1/1) ... [2019-11-15 22:30:14,018 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2edad3d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:30:14, skipping insertion in model container [2019-11-15 22:30:14,019 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:30:14" (1/1) ... [2019-11-15 22:30:14,025 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 22:30:14,067 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 22:30:14,410 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:30:14,422 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 22:30:14,491 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:30:14,554 INFO L192 MainTranslator]: Completed translation [2019-11-15 22:30:14,555 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:30:14 WrapperNode [2019-11-15 22:30:14,555 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 22:30:14,557 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 22:30:14,557 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 22:30:14,557 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 22:30:14,565 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:30:14" (1/1) ... [2019-11-15 22:30:14,588 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:30:14" (1/1) ... [2019-11-15 22:30:14,610 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 22:30:14,610 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 22:30:14,610 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 22:30:14,611 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 22:30:14,620 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:30:14" (1/1) ... [2019-11-15 22:30:14,620 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:30:14" (1/1) ... [2019-11-15 22:30:14,623 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:30:14" (1/1) ... [2019-11-15 22:30:14,624 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:30:14" (1/1) ... [2019-11-15 22:30:14,630 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:30:14" (1/1) ... [2019-11-15 22:30:14,635 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:30:14" (1/1) ... [2019-11-15 22:30:14,637 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:30:14" (1/1) ... [2019-11-15 22:30:14,640 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 22:30:14,640 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 22:30:14,641 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 22:30:14,641 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 22:30:14,642 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:30:14" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fa964f72-924d-426f-ad50-fd38e68a0fb5/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:30:14,715 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 22:30:14,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 22:30:14,716 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 22:30:14,716 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 22:30:14,716 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 22:30:14,716 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 22:30:15,150 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 22:30:15,150 INFO L284 CfgBuilder]: Removed 10 assume(true) statements. [2019-11-15 22:30:15,151 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:30:15 BoogieIcfgContainer [2019-11-15 22:30:15,152 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 22:30:15,152 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-15 22:30:15,152 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-15 22:30:15,155 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-15 22:30:15,156 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 22:30:15,156 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.11 10:30:14" (1/3) ... [2019-11-15 22:30:15,157 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7ef156f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 10:30:15, skipping insertion in model container [2019-11-15 22:30:15,157 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 22:30:15,158 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:30:14" (2/3) ... [2019-11-15 22:30:15,158 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7ef156f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 10:30:15, skipping insertion in model container [2019-11-15 22:30:15,158 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 22:30:15,158 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:30:15" (3/3) ... [2019-11-15 22:30:15,160 INFO L371 chiAutomizerObserver]: Analyzing ICFG substring-alloca-2.i [2019-11-15 22:30:15,202 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-15 22:30:15,202 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-15 22:30:15,202 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-15 22:30:15,203 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 22:30:15,203 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 22:30:15,203 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-15 22:30:15,203 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 22:30:15,203 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-15 22:30:15,217 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states. [2019-11-15 22:30:15,239 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2019-11-15 22:30:15,239 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:30:15,240 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:30:15,246 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-15 22:30:15,247 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 22:30:15,247 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-15 22:30:15,247 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states. [2019-11-15 22:30:15,249 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2019-11-15 22:30:15,249 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:30:15,250 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:30:15,250 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-15 22:30:15,250 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 22:30:15,258 INFO L791 eck$LassoCheckResult]: Stem: 17#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 15#L-1true havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~nondet16, main_#t~post15, main_~i~0, main_#t~nondet18, main_#t~post17, main_~i~1, main_#t~ret19, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet11;havoc main_#t~nondet11;main_~length2~0 := main_#t~nondet12;havoc main_#t~nondet12; 16#L532true assume !(main_~length1~0 < 1); 18#L532-2true assume !(main_~length2~0 < 1); 11#L535-1true call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;main_~i~0 := 0; 24#L541-3true [2019-11-15 22:30:15,258 INFO L793 eck$LassoCheckResult]: Loop: 24#L541-3true assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet16, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet16; 21#L541-2true main_#t~post15 := main_~i~0;main_~i~0 := 1 + main_#t~post15;havoc main_#t~post15; 24#L541-3true [2019-11-15 22:30:15,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:30:15,263 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2019-11-15 22:30:15,270 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:30:15,270 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398701340] [2019-11-15 22:30:15,270 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:30:15,271 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:30:15,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:30:15,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:30:15,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:30:15,392 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:30:15,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:30:15,393 INFO L82 PathProgramCache]: Analyzing trace with hash 1699, now seen corresponding path program 1 times [2019-11-15 22:30:15,393 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:30:15,393 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996523142] [2019-11-15 22:30:15,393 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:30:15,393 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:30:15,393 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:30:15,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:30:15,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:30:15,411 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:30:15,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:30:15,413 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935720, now seen corresponding path program 1 times [2019-11-15 22:30:15,413 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:30:15,413 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724215349] [2019-11-15 22:30:15,414 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:30:15,414 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:30:15,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:30:15,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:30:15,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:30:15,463 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:30:15,653 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2019-11-15 22:30:15,765 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 22:30:15,769 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 22:30:15,769 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 22:30:15,769 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 22:30:15,769 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 22:30:15,769 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:30:15,769 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 22:30:15,770 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 22:30:15,770 INFO L131 ssoRankerPreferences]: Filename of dumped script: substring-alloca-2.i_Iteration1_Lasso [2019-11-15 22:30:15,770 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 22:30:15,770 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 22:30:15,793 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:30:15,803 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:30:15,805 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:30:15,808 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:30:15,811 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:30:15,815 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:30:15,820 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:30:15,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-11-15 22:30:15,828 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:30:15,831 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:30:15,835 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:30:15,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-11-15 22:30:16,025 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2019-11-15 22:30:16,051 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:30:16,054 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:30:16,067 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:30:16,556 WARN L191 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 25 [2019-11-15 22:30:16,647 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 22:30:16,653 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 22:30:16,655 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:30:16,657 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:30:16,658 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:30:16,659 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:30:16,659 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:30:16,659 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:30:16,661 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:30:16,661 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:30:16,664 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:30:16,667 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:30:16,669 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:30:16,669 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:30:16,669 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:30:16,670 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:30:16,670 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:30:16,671 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:30:16,675 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:30:16,678 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:30:16,678 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:30:16,684 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:30:16,685 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:30:16,685 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:30:16,685 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:30:16,685 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:30:16,686 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:30:16,686 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:30:16,687 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:30:16,687 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:30:16,688 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:30:16,688 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:30:16,689 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:30:16,689 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:30:16,689 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:30:16,689 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:30:16,690 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:30:16,690 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:30:16,691 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:30:16,692 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:30:16,692 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:30:16,692 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:30:16,692 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:30:16,695 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:30:16,702 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:30:16,713 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:30:16,713 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:30:16,714 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:30:16,714 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:30:16,714 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:30:16,714 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:30:16,717 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:30:16,717 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:30:16,720 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:30:16,721 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:30:16,721 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:30:16,721 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:30:16,722 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:30:16,722 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:30:16,722 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:30:16,723 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:30:16,723 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:30:16,733 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:30:16,733 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:30:16,737 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:30:16,738 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:30:16,738 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:30:16,738 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:30:16,744 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:30:16,744 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:30:16,754 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:30:16,754 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:30:16,755 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:30:16,755 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:30:16,755 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:30:16,756 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:30:16,756 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:30:16,756 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:30:16,756 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:30:16,757 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:30:16,758 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:30:16,758 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:30:16,758 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:30:16,759 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:30:16,759 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:30:16,761 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:30:16,761 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:30:16,777 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:30:16,777 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:30:16,778 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:30:16,778 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:30:16,778 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:30:16,779 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:30:16,779 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:30:16,779 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:30:16,779 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:30:16,781 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:30:16,781 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:30:16,782 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:30:16,782 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:30:16,782 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:30:16,782 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:30:16,784 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:30:16,784 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:30:16,795 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:30:16,795 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:30:16,796 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:30:16,796 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:30:16,797 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:30:16,797 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:30:16,800 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:30:16,800 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:30:16,812 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:30:16,813 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:30:16,813 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:30:16,814 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-11-15 22:30:16,814 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:30:16,814 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:30:16,818 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-11-15 22:30:16,818 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:30:16,845 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:30:16,846 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:30:16,847 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:30:16,847 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:30:16,847 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:30:16,847 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:30:16,847 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:30:16,848 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:30:16,848 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:30:16,849 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:30:16,850 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:30:16,850 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:30:16,850 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:30:16,851 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:30:16,851 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:30:16,852 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:30:16,852 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:30:16,869 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:30:16,870 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:30:16,870 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:30:16,870 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:30:16,871 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:30:16,871 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:30:16,877 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:30:16,878 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:30:16,883 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:30:16,883 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:30:16,884 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:30:16,884 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:30:16,884 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:30:16,891 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:30:16,891 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:30:16,892 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:30:16,892 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:30:16,893 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:30:16,893 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:30:16,894 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:30:16,894 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:30:16,894 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:30:16,895 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:30:16,897 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:30:16,897 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:30:17,001 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 22:30:17,037 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-11-15 22:30:17,037 INFO L444 ModelExtractionUtils]: 14 out of 22 variables were initially zero. Simplification set additionally 5 variables to zero. [2019-11-15 22:30:17,039 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 22:30:17,041 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 22:30:17,042 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 22:30:17,042 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~length1~0, ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~length1~0 - 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2019-11-15 22:30:17,060 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2019-11-15 22:30:17,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:30:17,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:30:17,109 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:30:17,110 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:30:17,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:30:17,123 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 22:30:17,124 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:30:17,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:30:17,156 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-15 22:30:17,158 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states. Second operand 3 states. [2019-11-15 22:30:17,224 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states.. Second operand 3 states. Result 57 states and 84 transitions. Complement of second has 7 states. [2019-11-15 22:30:17,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-15 22:30:17,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 22:30:17,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 57 transitions. [2019-11-15 22:30:17,230 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 57 transitions. Stem has 5 letters. Loop has 2 letters. [2019-11-15 22:30:17,231 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:30:17,231 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 57 transitions. Stem has 7 letters. Loop has 2 letters. [2019-11-15 22:30:17,232 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:30:17,232 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 57 transitions. Stem has 5 letters. Loop has 4 letters. [2019-11-15 22:30:17,232 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:30:17,233 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 84 transitions. [2019-11-15 22:30:17,238 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-11-15 22:30:17,242 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 19 states and 26 transitions. [2019-11-15 22:30:17,243 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-11-15 22:30:17,243 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-11-15 22:30:17,244 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 26 transitions. [2019-11-15 22:30:17,244 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 22:30:17,244 INFO L688 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2019-11-15 22:30:17,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 26 transitions. [2019-11-15 22:30:17,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-11-15 22:30:17,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-11-15 22:30:17,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 26 transitions. [2019-11-15 22:30:17,270 INFO L711 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2019-11-15 22:30:17,270 INFO L591 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2019-11-15 22:30:17,270 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-15 22:30:17,270 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 26 transitions. [2019-11-15 22:30:17,272 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-11-15 22:30:17,273 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:30:17,273 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:30:17,273 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:30:17,273 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 22:30:17,274 INFO L791 eck$LassoCheckResult]: Stem: 167#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 164#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~nondet16, main_#t~post15, main_~i~0, main_#t~nondet18, main_#t~post17, main_~i~1, main_#t~ret19, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet11;havoc main_#t~nondet11;main_~length2~0 := main_#t~nondet12;havoc main_#t~nondet12; 165#L532 assume !(main_~length1~0 < 1); 166#L532-2 assume !(main_~length2~0 < 1); 161#L535-1 call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;main_~i~0 := 0; 162#L541-3 assume !(main_~i~0 < main_~length1~0 - 1); 154#L541-4 main_~i~1 := 0; 155#L547-3 [2019-11-15 22:30:17,274 INFO L793 eck$LassoCheckResult]: Loop: 155#L547-3 assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet18, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet18; 160#L547-2 main_#t~post17 := main_~i~1;main_~i~1 := 1 + main_#t~post17;havoc main_#t~post17; 155#L547-3 [2019-11-15 22:30:17,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:30:17,274 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935662, now seen corresponding path program 1 times [2019-11-15 22:30:17,274 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:30:17,275 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050250905] [2019-11-15 22:30:17,275 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:30:17,275 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:30:17,275 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:30:17,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:30:17,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:30:17,298 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:30:17,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:30:17,299 INFO L82 PathProgramCache]: Analyzing trace with hash 2147, now seen corresponding path program 1 times [2019-11-15 22:30:17,299 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:30:17,299 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872761132] [2019-11-15 22:30:17,299 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:30:17,299 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:30:17,300 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:30:17,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:30:17,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:30:17,310 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:30:17,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:30:17,310 INFO L82 PathProgramCache]: Analyzing trace with hash 1298384784, now seen corresponding path program 1 times [2019-11-15 22:30:17,311 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:30:17,311 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149453068] [2019-11-15 22:30:17,311 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:30:17,311 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:30:17,311 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:30:17,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:30:17,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:30:17,340 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:30:17,592 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2019-11-15 22:30:17,594 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 22:30:17,594 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 22:30:17,594 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 22:30:17,594 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 22:30:17,594 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 22:30:17,595 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:30:17,595 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 22:30:17,595 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 22:30:17,595 INFO L131 ssoRankerPreferences]: Filename of dumped script: substring-alloca-2.i_Iteration2_Lasso [2019-11-15 22:30:17,595 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 22:30:17,595 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 22:30:17,600 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:30:17,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-11-15 22:30:17,761 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2019-11-15 22:30:17,788 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:30:17,791 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:30:17,797 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:30:17,799 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:30:17,801 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:30:17,804 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:30:17,805 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:30:17,809 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:30:17,812 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:30:17,814 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:30:17,817 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:30:17,821 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:30:18,190 WARN L191 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 25 [2019-11-15 22:30:18,277 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 22:30:18,278 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 22:30:18,278 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:30:18,279 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:30:18,279 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:30:18,279 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:30:18,279 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:30:18,279 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:30:18,280 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:30:18,280 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:30:18,280 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:30:18,281 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:30:18,281 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:30:18,281 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:30:18,281 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:30:18,282 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:30:18,282 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:30:18,282 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:30:18,285 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:30:18,285 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:30:18,286 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:30:18,286 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-11-15 22:30:18,286 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:30:18,286 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:30:18,290 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-11-15 22:30:18,290 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:30:18,304 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:30:18,304 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:30:18,305 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:30:18,305 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:30:18,306 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:30:18,306 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:30:18,307 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:30:18,307 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:30:18,312 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:30:18,313 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:30:18,314 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:30:18,314 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:30:18,314 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:30:18,314 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:30:18,315 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:30:18,315 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:30:18,315 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:30:18,316 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:30:18,316 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:30:18,317 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:30:18,317 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:30:18,318 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:30:18,318 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:30:18,319 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:30:18,319 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:30:18,321 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:30:18,321 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:30:18,322 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:30:18,322 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:30:18,322 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:30:18,323 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:30:18,323 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:30:18,323 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:30:18,323 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:30:18,324 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:30:18,325 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:30:18,325 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:30:18,326 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:30:18,326 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:30:18,326 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:30:18,329 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:30:18,329 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:30:18,349 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 22:30:18,387 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-11-15 22:30:18,388 INFO L444 ModelExtractionUtils]: 15 out of 22 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-11-15 22:30:18,388 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 22:30:18,389 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 22:30:18,390 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 22:30:18,390 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1, ULTIMATE.start_main_~length2~0) = -1*ULTIMATE.start_main_~i~1 + 1*ULTIMATE.start_main_~length2~0 Supporting invariants [] [2019-11-15 22:30:18,411 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2019-11-15 22:30:18,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:30:18,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:30:18,440 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:30:18,441 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:30:18,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:30:18,450 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 22:30:18,450 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:30:18,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:30:18,469 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-15 22:30:18,470 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 26 transitions. cyclomatic complexity: 10 Second operand 3 states. [2019-11-15 22:30:18,502 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 26 transitions. cyclomatic complexity: 10. Second operand 3 states. Result 29 states and 42 transitions. Complement of second has 6 states. [2019-11-15 22:30:18,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-15 22:30:18,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 22:30:18,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 24 transitions. [2019-11-15 22:30:18,505 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 7 letters. Loop has 2 letters. [2019-11-15 22:30:18,505 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:30:18,506 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 9 letters. Loop has 2 letters. [2019-11-15 22:30:18,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:30:18,506 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 7 letters. Loop has 4 letters. [2019-11-15 22:30:18,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:30:18,506 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 42 transitions. [2019-11-15 22:30:18,508 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-15 22:30:18,509 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 20 states and 28 transitions. [2019-11-15 22:30:18,509 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2019-11-15 22:30:18,509 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2019-11-15 22:30:18,510 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 28 transitions. [2019-11-15 22:30:18,510 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 22:30:18,510 INFO L688 BuchiCegarLoop]: Abstraction has 20 states and 28 transitions. [2019-11-15 22:30:18,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 28 transitions. [2019-11-15 22:30:18,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-11-15 22:30:18,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-11-15 22:30:18,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 28 transitions. [2019-11-15 22:30:18,513 INFO L711 BuchiCegarLoop]: Abstraction has 20 states and 28 transitions. [2019-11-15 22:30:18,513 INFO L591 BuchiCegarLoop]: Abstraction has 20 states and 28 transitions. [2019-11-15 22:30:18,513 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-15 22:30:18,513 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 28 transitions. [2019-11-15 22:30:18,514 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-15 22:30:18,514 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:30:18,514 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:30:18,515 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:30:18,515 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:30:18,515 INFO L791 eck$LassoCheckResult]: Stem: 290#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 287#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~nondet16, main_#t~post15, main_~i~0, main_#t~nondet18, main_#t~post17, main_~i~1, main_#t~ret19, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet11;havoc main_#t~nondet11;main_~length2~0 := main_#t~nondet12;havoc main_#t~nondet12; 288#L532 assume !(main_~length1~0 < 1); 289#L532-2 assume !(main_~length2~0 < 1); 284#L535-1 call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;main_~i~0 := 0; 285#L541-3 assume !(main_~i~0 < main_~length1~0 - 1); 276#L541-4 main_~i~1 := 0; 277#L547-3 assume !(main_~i~1 < main_~length2~0 - 1); 286#L547-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);substring_#in~s.base, substring_#in~s.offset, substring_#in~t.base, substring_#in~t.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc substring_#res;havoc substring_#t~post7.base, substring_#t~post7.offset, substring_#t~post8.base, substring_#t~post8.offset, substring_#t~mem3, substring_#t~mem4, substring_#t~mem5, substring_#t~short6, substring_#t~mem9, substring_#t~post10.base, substring_#t~post10.offset, substring_~ps2~0.base, substring_~ps2~0.offset, substring_~pt~0.base, substring_~pt~0.offset, substring_#t~mem2, substring_~s.base, substring_~s.offset, substring_~t.base, substring_~t.offset, substring_~ps~0.base, substring_~ps~0.offset;substring_~s.base, substring_~s.offset := substring_#in~s.base, substring_#in~s.offset;substring_~t.base, substring_~t.offset := substring_#in~t.base, substring_#in~t.offset;substring_~ps~0.base, substring_~ps~0.offset := substring_~s.base, substring_~s.offset; 279#L517-3 [2019-11-15 22:30:18,516 INFO L793 eck$LassoCheckResult]: Loop: 279#L517-3 call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); 274#L517-1 assume !!(0 != substring_#t~mem2);havoc substring_#t~mem2;substring_~ps2~0.base, substring_~ps2~0.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_~t.base, substring_~t.offset; 275#L520-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 278#L520-1 assume substring_#t~short6;call substring_#t~mem4 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);call substring_#t~mem5 := read~int(substring_~ps2~0.base, substring_~ps2~0.offset, 1);substring_#t~short6 := substring_#t~mem4 == substring_#t~mem5; 291#L520-3 assume !substring_#t~short6;havoc substring_#t~mem5;havoc substring_#t~mem4;havoc substring_#t~short6;havoc substring_#t~mem3; 280#L520-6 call substring_#t~mem9 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1); 281#L524 assume !(0 == substring_#t~mem9);havoc substring_#t~mem9;substring_#t~post10.base, substring_#t~post10.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~ps~0.base, substring_~ps~0.offset := substring_#t~post10.base, 1 + substring_#t~post10.offset;havoc substring_#t~post10.base, substring_#t~post10.offset; 279#L517-3 [2019-11-15 22:30:18,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:30:18,516 INFO L82 PathProgramCache]: Analyzing trace with hash 1298384726, now seen corresponding path program 1 times [2019-11-15 22:30:18,516 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:30:18,517 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256762630] [2019-11-15 22:30:18,517 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:30:18,517 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:30:18,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:30:18,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:30:18,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:30:18,546 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:30:18,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:30:18,546 INFO L82 PathProgramCache]: Analyzing trace with hash -1328860033, now seen corresponding path program 1 times [2019-11-15 22:30:18,546 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:30:18,547 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463487552] [2019-11-15 22:30:18,547 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:30:18,547 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:30:18,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:30:18,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:30:18,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:30:18,565 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:30:18,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:30:18,569 INFO L82 PathProgramCache]: Analyzing trace with hash -1515359350, now seen corresponding path program 1 times [2019-11-15 22:30:18,569 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:30:18,569 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382721294] [2019-11-15 22:30:18,572 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:30:18,572 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:30:18,573 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:30:18,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:30:18,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:30:18,803 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382721294] [2019-11-15 22:30:18,803 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:30:18,804 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 22:30:18,804 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044566075] [2019-11-15 22:30:18,980 WARN L191 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 59 [2019-11-15 22:30:19,027 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:30:19,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 22:30:19,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:30:19,031 INFO L87 Difference]: Start difference. First operand 20 states and 28 transitions. cyclomatic complexity: 11 Second operand 7 states. [2019-11-15 22:30:19,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:30:19,123 INFO L93 Difference]: Finished difference Result 28 states and 37 transitions. [2019-11-15 22:30:19,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 22:30:19,124 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 37 transitions. [2019-11-15 22:30:19,125 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-15 22:30:19,126 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 21 states and 28 transitions. [2019-11-15 22:30:19,126 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-11-15 22:30:19,126 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2019-11-15 22:30:19,126 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 28 transitions. [2019-11-15 22:30:19,126 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 22:30:19,126 INFO L688 BuchiCegarLoop]: Abstraction has 21 states and 28 transitions. [2019-11-15 22:30:19,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 28 transitions. [2019-11-15 22:30:19,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2019-11-15 22:30:19,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-11-15 22:30:19,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 27 transitions. [2019-11-15 22:30:19,128 INFO L711 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2019-11-15 22:30:19,128 INFO L591 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2019-11-15 22:30:19,128 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-15 22:30:19,129 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 27 transitions. [2019-11-15 22:30:19,129 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-15 22:30:19,129 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:30:19,129 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:30:19,130 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:30:19,130 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:30:19,130 INFO L791 eck$LassoCheckResult]: Stem: 354#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 351#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~nondet16, main_#t~post15, main_~i~0, main_#t~nondet18, main_#t~post17, main_~i~1, main_#t~ret19, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet11;havoc main_#t~nondet11;main_~length2~0 := main_#t~nondet12;havoc main_#t~nondet12; 352#L532 assume !(main_~length1~0 < 1); 353#L532-2 assume !(main_~length2~0 < 1); 348#L535-1 call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;main_~i~0 := 0; 349#L541-3 assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet16, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet16; 356#L541-2 main_#t~post15 := main_~i~0;main_~i~0 := 1 + main_#t~post15;havoc main_#t~post15; 357#L541-3 assume !(main_~i~0 < main_~length1~0 - 1); 340#L541-4 main_~i~1 := 0; 341#L547-3 assume !(main_~i~1 < main_~length2~0 - 1); 350#L547-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);substring_#in~s.base, substring_#in~s.offset, substring_#in~t.base, substring_#in~t.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc substring_#res;havoc substring_#t~post7.base, substring_#t~post7.offset, substring_#t~post8.base, substring_#t~post8.offset, substring_#t~mem3, substring_#t~mem4, substring_#t~mem5, substring_#t~short6, substring_#t~mem9, substring_#t~post10.base, substring_#t~post10.offset, substring_~ps2~0.base, substring_~ps2~0.offset, substring_~pt~0.base, substring_~pt~0.offset, substring_#t~mem2, substring_~s.base, substring_~s.offset, substring_~t.base, substring_~t.offset, substring_~ps~0.base, substring_~ps~0.offset;substring_~s.base, substring_~s.offset := substring_#in~s.base, substring_#in~s.offset;substring_~t.base, substring_~t.offset := substring_#in~t.base, substring_#in~t.offset;substring_~ps~0.base, substring_~ps~0.offset := substring_~s.base, substring_~s.offset; 343#L517-3 [2019-11-15 22:30:19,130 INFO L793 eck$LassoCheckResult]: Loop: 343#L517-3 call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); 338#L517-1 assume !!(0 != substring_#t~mem2);havoc substring_#t~mem2;substring_~ps2~0.base, substring_~ps2~0.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_~t.base, substring_~t.offset; 339#L520-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 342#L520-1 assume substring_#t~short6;call substring_#t~mem4 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);call substring_#t~mem5 := read~int(substring_~ps2~0.base, substring_~ps2~0.offset, 1);substring_#t~short6 := substring_#t~mem4 == substring_#t~mem5; 355#L520-3 assume !substring_#t~short6;havoc substring_#t~mem5;havoc substring_#t~mem4;havoc substring_#t~short6;havoc substring_#t~mem3; 344#L520-6 call substring_#t~mem9 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1); 345#L524 assume !(0 == substring_#t~mem9);havoc substring_#t~mem9;substring_#t~post10.base, substring_#t~post10.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~ps~0.base, substring_~ps~0.offset := substring_#t~post10.base, 1 + substring_#t~post10.offset;havoc substring_#t~post10.base, substring_#t~post10.offset; 343#L517-3 [2019-11-15 22:30:19,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:30:19,130 INFO L82 PathProgramCache]: Analyzing trace with hash -2034626632, now seen corresponding path program 1 times [2019-11-15 22:30:19,131 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:30:19,131 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973655662] [2019-11-15 22:30:19,131 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:30:19,131 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:30:19,131 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:30:19,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:30:19,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:30:19,160 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:30:19,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:30:19,161 INFO L82 PathProgramCache]: Analyzing trace with hash -1328860033, now seen corresponding path program 2 times [2019-11-15 22:30:19,161 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:30:19,161 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184823477] [2019-11-15 22:30:19,161 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:30:19,161 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:30:19,161 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:30:19,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:30:19,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:30:19,180 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:30:19,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:30:19,181 INFO L82 PathProgramCache]: Analyzing trace with hash 2020169960, now seen corresponding path program 1 times [2019-11-15 22:30:19,181 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:30:19,181 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431838917] [2019-11-15 22:30:19,181 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:30:19,181 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:30:19,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:30:19,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:30:19,334 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 22:30:19,335 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431838917] [2019-11-15 22:30:19,335 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:30:19,335 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-15 22:30:19,335 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915651360] [2019-11-15 22:30:19,521 WARN L191 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 60 [2019-11-15 22:30:19,565 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:30:19,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 22:30:19,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-11-15 22:30:19,566 INFO L87 Difference]: Start difference. First operand 20 states and 27 transitions. cyclomatic complexity: 10 Second operand 9 states. [2019-11-15 22:30:19,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:30:19,737 INFO L93 Difference]: Finished difference Result 34 states and 44 transitions. [2019-11-15 22:30:19,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 22:30:19,737 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 44 transitions. [2019-11-15 22:30:19,738 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2019-11-15 22:30:19,739 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 32 states and 42 transitions. [2019-11-15 22:30:19,739 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2019-11-15 22:30:19,739 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2019-11-15 22:30:19,740 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 42 transitions. [2019-11-15 22:30:19,740 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 22:30:19,740 INFO L688 BuchiCegarLoop]: Abstraction has 32 states and 42 transitions. [2019-11-15 22:30:19,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 42 transitions. [2019-11-15 22:30:19,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2019-11-15 22:30:19,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-15 22:30:19,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 41 transitions. [2019-11-15 22:30:19,743 INFO L711 BuchiCegarLoop]: Abstraction has 31 states and 41 transitions. [2019-11-15 22:30:19,743 INFO L591 BuchiCegarLoop]: Abstraction has 31 states and 41 transitions. [2019-11-15 22:30:19,743 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-15 22:30:19,743 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 41 transitions. [2019-11-15 22:30:19,744 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2019-11-15 22:30:19,744 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:30:19,744 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:30:19,745 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:30:19,745 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1] [2019-11-15 22:30:19,745 INFO L791 eck$LassoCheckResult]: Stem: 433#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 430#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~nondet16, main_#t~post15, main_~i~0, main_#t~nondet18, main_#t~post17, main_~i~1, main_#t~ret19, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet11;havoc main_#t~nondet11;main_~length2~0 := main_#t~nondet12;havoc main_#t~nondet12; 431#L532 assume !(main_~length1~0 < 1); 432#L532-2 assume !(main_~length2~0 < 1); 426#L535-1 call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;main_~i~0 := 0; 427#L541-3 assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet16, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet16; 436#L541-2 main_#t~post15 := main_~i~0;main_~i~0 := 1 + main_#t~post15;havoc main_#t~post15; 437#L541-3 assume !(main_~i~0 < main_~length1~0 - 1); 416#L541-4 main_~i~1 := 0; 417#L547-3 assume !(main_~i~1 < main_~length2~0 - 1); 428#L547-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);substring_#in~s.base, substring_#in~s.offset, substring_#in~t.base, substring_#in~t.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc substring_#res;havoc substring_#t~post7.base, substring_#t~post7.offset, substring_#t~post8.base, substring_#t~post8.offset, substring_#t~mem3, substring_#t~mem4, substring_#t~mem5, substring_#t~short6, substring_#t~mem9, substring_#t~post10.base, substring_#t~post10.offset, substring_~ps2~0.base, substring_~ps2~0.offset, substring_~pt~0.base, substring_~pt~0.offset, substring_#t~mem2, substring_~s.base, substring_~s.offset, substring_~t.base, substring_~t.offset, substring_~ps~0.base, substring_~ps~0.offset;substring_~s.base, substring_~s.offset := substring_#in~s.base, substring_#in~s.offset;substring_~t.base, substring_~t.offset := substring_#in~t.base, substring_#in~t.offset;substring_~ps~0.base, substring_~ps~0.offset := substring_~s.base, substring_~s.offset; 419#L517-3 [2019-11-15 22:30:19,745 INFO L793 eck$LassoCheckResult]: Loop: 419#L517-3 call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); 420#L517-1 assume !!(0 != substring_#t~mem2);havoc substring_#t~mem2;substring_~ps2~0.base, substring_~ps2~0.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_~t.base, substring_~t.offset; 440#L520-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 434#L520-1 assume substring_#t~short6;call substring_#t~mem4 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);call substring_#t~mem5 := read~int(substring_~ps2~0.base, substring_~ps2~0.offset, 1);substring_#t~short6 := substring_#t~mem4 == substring_#t~mem5; 435#L520-3 assume !!substring_#t~short6;havoc substring_#t~mem5;havoc substring_#t~mem4;havoc substring_#t~short6;havoc substring_#t~mem3;substring_#t~post7.base, substring_#t~post7.offset := substring_~pt~0.base, substring_~pt~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_#t~post7.base, 1 + substring_#t~post7.offset;havoc substring_#t~post7.base, substring_#t~post7.offset;substring_#t~post8.base, substring_#t~post8.offset := substring_~ps2~0.base, substring_~ps2~0.offset;substring_~ps2~0.base, substring_~ps2~0.offset := substring_#t~post8.base, 1 + substring_#t~post8.offset;havoc substring_#t~post8.base, substring_#t~post8.offset; 438#L520-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 444#L520-1 assume substring_#t~short6;call substring_#t~mem4 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);call substring_#t~mem5 := read~int(substring_~ps2~0.base, substring_~ps2~0.offset, 1);substring_#t~short6 := substring_#t~mem4 == substring_#t~mem5; 443#L520-3 assume !substring_#t~short6;havoc substring_#t~mem5;havoc substring_#t~mem4;havoc substring_#t~short6;havoc substring_#t~mem3; 442#L520-6 call substring_#t~mem9 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1); 441#L524 assume !(0 == substring_#t~mem9);havoc substring_#t~mem9;substring_#t~post10.base, substring_#t~post10.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~ps~0.base, substring_~ps~0.offset := substring_#t~post10.base, 1 + substring_#t~post10.offset;havoc substring_#t~post10.base, substring_#t~post10.offset; 419#L517-3 [2019-11-15 22:30:19,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:30:19,745 INFO L82 PathProgramCache]: Analyzing trace with hash -2034626632, now seen corresponding path program 2 times [2019-11-15 22:30:19,745 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:30:19,746 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967712608] [2019-11-15 22:30:19,746 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:30:19,746 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:30:19,746 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:30:19,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:30:19,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:30:19,777 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:30:19,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:30:19,777 INFO L82 PathProgramCache]: Analyzing trace with hash -1312710103, now seen corresponding path program 1 times [2019-11-15 22:30:19,777 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:30:19,778 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100981376] [2019-11-15 22:30:19,778 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:30:19,778 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:30:19,778 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:30:19,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:30:19,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:30:19,793 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:30:19,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:30:19,794 INFO L82 PathProgramCache]: Analyzing trace with hash 1844492576, now seen corresponding path program 1 times [2019-11-15 22:30:19,794 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:30:19,794 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063599466] [2019-11-15 22:30:19,794 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:30:19,794 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:30:19,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:30:19,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:30:19,873 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 22:30:19,873 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063599466] [2019-11-15 22:30:19,873 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [509085454] [2019-11-15 22:30:19,873 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fa964f72-924d-426f-ad50-fd38e68a0fb5/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:30:19,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:30:19,949 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-15 22:30:19,950 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:30:19,998 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:30:19,998 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2019-11-15 22:30:19,999 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:30:20,016 INFO L567 ElimStorePlain]: treesize reduction 10, result has 60.0 percent of original size [2019-11-15 22:30:20,016 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:30:20,017 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:9, output treesize:5 [2019-11-15 22:30:20,124 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 22:30:20,124 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 22:30:20,124 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [8] total 15 [2019-11-15 22:30:20,124 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86200693] [2019-11-15 22:30:20,379 WARN L191 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 83 [2019-11-15 22:30:20,435 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:30:20,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 22:30:20,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2019-11-15 22:30:20,436 INFO L87 Difference]: Start difference. First operand 31 states and 41 transitions. cyclomatic complexity: 14 Second operand 9 states. [2019-11-15 22:30:20,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:30:20,577 INFO L93 Difference]: Finished difference Result 28 states and 35 transitions. [2019-11-15 22:30:20,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 22:30:20,578 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 35 transitions. [2019-11-15 22:30:20,580 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-15 22:30:20,580 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 21 states and 27 transitions. [2019-11-15 22:30:20,580 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-11-15 22:30:20,580 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2019-11-15 22:30:20,580 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 27 transitions. [2019-11-15 22:30:20,581 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 22:30:20,581 INFO L688 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2019-11-15 22:30:20,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 27 transitions. [2019-11-15 22:30:20,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2019-11-15 22:30:20,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-11-15 22:30:20,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2019-11-15 22:30:20,584 INFO L711 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2019-11-15 22:30:20,584 INFO L591 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2019-11-15 22:30:20,584 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-15 22:30:20,584 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 26 transitions. [2019-11-15 22:30:20,584 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-15 22:30:20,584 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:30:20,585 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:30:20,585 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:30:20,585 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:30:20,585 INFO L791 eck$LassoCheckResult]: Stem: 579#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 576#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~nondet16, main_#t~post15, main_~i~0, main_#t~nondet18, main_#t~post17, main_~i~1, main_#t~ret19, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet11;havoc main_#t~nondet11;main_~length2~0 := main_#t~nondet12;havoc main_#t~nondet12; 577#L532 assume !(main_~length1~0 < 1); 578#L532-2 assume !(main_~length2~0 < 1); 573#L535-1 call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;main_~i~0 := 0; 574#L541-3 assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet16, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet16; 581#L541-2 main_#t~post15 := main_~i~0;main_~i~0 := 1 + main_#t~post15;havoc main_#t~post15; 582#L541-3 assume !(main_~i~0 < main_~length1~0 - 1); 565#L541-4 main_~i~1 := 0; 566#L547-3 assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet18, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet18; 571#L547-2 main_#t~post17 := main_~i~1;main_~i~1 := 1 + main_#t~post17;havoc main_#t~post17; 572#L547-3 assume !(main_~i~1 < main_~length2~0 - 1); 575#L547-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);substring_#in~s.base, substring_#in~s.offset, substring_#in~t.base, substring_#in~t.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc substring_#res;havoc substring_#t~post7.base, substring_#t~post7.offset, substring_#t~post8.base, substring_#t~post8.offset, substring_#t~mem3, substring_#t~mem4, substring_#t~mem5, substring_#t~short6, substring_#t~mem9, substring_#t~post10.base, substring_#t~post10.offset, substring_~ps2~0.base, substring_~ps2~0.offset, substring_~pt~0.base, substring_~pt~0.offset, substring_#t~mem2, substring_~s.base, substring_~s.offset, substring_~t.base, substring_~t.offset, substring_~ps~0.base, substring_~ps~0.offset;substring_~s.base, substring_~s.offset := substring_#in~s.base, substring_#in~s.offset;substring_~t.base, substring_~t.offset := substring_#in~t.base, substring_#in~t.offset;substring_~ps~0.base, substring_~ps~0.offset := substring_~s.base, substring_~s.offset; 568#L517-3 [2019-11-15 22:30:20,585 INFO L793 eck$LassoCheckResult]: Loop: 568#L517-3 call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); 563#L517-1 assume !!(0 != substring_#t~mem2);havoc substring_#t~mem2;substring_~ps2~0.base, substring_~ps2~0.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_~t.base, substring_~t.offset; 564#L520-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 567#L520-1 assume substring_#t~short6;call substring_#t~mem4 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);call substring_#t~mem5 := read~int(substring_~ps2~0.base, substring_~ps2~0.offset, 1);substring_#t~short6 := substring_#t~mem4 == substring_#t~mem5; 580#L520-3 assume !substring_#t~short6;havoc substring_#t~mem5;havoc substring_#t~mem4;havoc substring_#t~short6;havoc substring_#t~mem3; 569#L520-6 call substring_#t~mem9 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1); 570#L524 assume !(0 == substring_#t~mem9);havoc substring_#t~mem9;substring_#t~post10.base, substring_#t~post10.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~ps~0.base, substring_~ps~0.offset := substring_#t~post10.base, 1 + substring_#t~post10.offset;havoc substring_#t~post10.base, substring_#t~post10.offset; 568#L517-3 [2019-11-15 22:30:20,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:30:20,586 INFO L82 PathProgramCache]: Analyzing trace with hash -1066016806, now seen corresponding path program 1 times [2019-11-15 22:30:20,586 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:30:20,586 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621323247] [2019-11-15 22:30:20,586 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:30:20,586 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:30:20,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:30:20,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:30:20,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:30:20,609 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:30:20,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:30:20,610 INFO L82 PathProgramCache]: Analyzing trace with hash -1328860033, now seen corresponding path program 3 times [2019-11-15 22:30:20,610 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:30:20,610 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728610332] [2019-11-15 22:30:20,610 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:30:20,611 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:30:20,611 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:30:20,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:30:20,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:30:20,620 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:30:20,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:30:20,621 INFO L82 PathProgramCache]: Analyzing trace with hash -1498710394, now seen corresponding path program 1 times [2019-11-15 22:30:20,621 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:30:20,621 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647597973] [2019-11-15 22:30:20,621 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:30:20,622 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:30:20,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:30:20,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:30:20,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:30:20,655 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:30:20,810 WARN L191 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 60 [2019-11-15 22:30:21,262 WARN L191 SmtUtils]: Spent 409.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 115 [2019-11-15 22:30:21,424 WARN L191 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2019-11-15 22:30:21,426 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 22:30:21,426 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 22:30:21,426 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 22:30:21,427 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 22:30:21,427 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 22:30:21,427 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:30:21,427 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 22:30:21,427 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 22:30:21,427 INFO L131 ssoRankerPreferences]: Filename of dumped script: substring-alloca-2.i_Iteration6_Lasso [2019-11-15 22:30:21,427 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 22:30:21,427 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 22:30:21,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:30:21,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:30:21,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-11-15 22:30:21,451 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:30:21,456 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:30:21,458 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:30:21,460 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:30:21,462 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:30:21,464 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:30:21,466 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:30:21,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-11-15 22:30:22,010 WARN L191 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 82 [2019-11-15 22:30:22,190 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 63 [2019-11-15 22:30:22,191 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:30:22,192 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:30:22,194 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:30:22,196 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:30:22,198 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:30:22,201 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:30:22,204 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:30:22,206 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:30:22,208 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:30:22,209 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:30:22,211 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:30:22,213 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:30:22,215 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:30:22,217 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:30:22,220 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:30:22,222 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:30:22,654 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 25 [2019-11-15 22:30:23,009 WARN L191 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 40 [2019-11-15 22:30:23,163 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 22:30:23,163 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 22:30:23,164 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:30:23,165 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:30:23,165 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:30:23,165 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:30:23,165 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:30:23,165 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:30:23,166 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:30:23,166 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:30:23,167 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:30:23,167 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:30:23,168 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:30:23,168 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:30:23,168 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:30:23,168 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:30:23,169 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:30:23,169 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:30:23,170 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:30:23,171 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:30:23,172 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:30:23,172 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:30:23,172 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:30:23,172 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:30:23,172 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:30:23,173 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:30:23,173 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:30:23,173 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:30:23,174 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:30:23,174 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:30:23,175 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:30:23,175 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:30:23,175 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:30:23,175 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:30:23,175 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:30:23,176 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:30:23,176 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:30:23,176 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:30:23,177 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:30:23,177 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:30:23,178 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:30:23,178 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:30:23,178 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:30:23,178 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:30:23,178 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:30:23,179 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:30:23,179 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:30:23,180 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:30:23,180 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:30:23,180 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:30:23,180 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:30:23,181 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:30:23,181 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:30:23,181 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:30:23,182 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:30:23,182 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:30:23,183 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:30:23,183 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:30:23,183 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:30:23,183 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:30:23,183 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:30:23,184 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:30:23,184 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:30:23,184 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:30:23,185 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:30:23,185 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:30:23,186 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:30:23,186 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:30:23,186 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:30:23,186 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:30:23,187 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:30:23,187 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:30:23,187 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:30:23,188 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:30:23,189 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:30:23,189 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:30:23,189 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:30:23,189 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:30:23,189 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:30:23,190 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:30:23,190 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:30:23,190 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:30:23,191 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:30:23,192 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:30:23,192 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:30:23,192 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:30:23,192 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:30:23,193 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:30:23,193 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:30:23,195 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:30:23,195 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:30:23,196 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:30:23,196 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:30:23,197 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:30:23,197 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:30:23,197 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:30:23,198 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:30:23,199 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:30:23,200 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:30:23,200 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:30:23,200 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:30:23,201 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:30:23,201 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:30:23,202 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:30:23,202 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:30:23,203 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:30:23,204 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:30:23,205 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:30:23,205 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:30:23,205 INFO L203 nArgumentSynthesizer]: 6 loop disjuncts [2019-11-15 22:30:23,205 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:30:23,225 INFO L400 nArgumentSynthesizer]: We have 96 Motzkin's Theorem applications. [2019-11-15 22:30:23,225 INFO L401 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2019-11-15 22:30:23,348 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:30:23,349 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:30:23,350 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:30:23,350 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:30:23,350 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:30:23,351 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:30:23,351 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:30:23,351 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:30:23,352 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:30:23,353 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:30:23,356 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:30:23,356 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:30:23,356 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:30:23,356 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:30:23,356 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:30:23,357 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:30:23,357 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:30:23,358 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:30:23,359 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:30:23,360 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:30:23,360 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:30:23,361 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:30:23,361 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:30:23,361 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:30:23,362 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:30:23,363 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:30:23,364 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:30:23,365 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:30:23,365 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:30:23,365 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:30:23,365 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:30:23,366 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:30:23,366 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:30:23,367 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:30:23,368 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:30:23,368 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:30:23,369 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-11-15 22:30:23,369 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:30:23,369 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:30:23,377 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-11-15 22:30:23,378 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:30:23,393 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:30:23,394 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:30:23,394 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:30:23,395 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:30:23,395 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:30:23,395 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:30:23,396 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:30:23,396 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:30:23,400 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:30:23,400 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:30:23,401 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:30:23,401 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:30:23,401 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:30:23,401 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:30:23,402 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:30:23,402 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:30:23,403 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:30:23,404 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:30:23,405 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:30:23,406 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:30:23,406 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:30:23,406 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:30:23,409 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:30:23,409 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:30:23,435 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 22:30:23,505 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2019-11-15 22:30:23,505 INFO L444 ModelExtractionUtils]: 48 out of 58 variables were initially zero. Simplification set additionally 7 variables to zero. [2019-11-15 22:30:23,507 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 22:30:23,508 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 22:30:23,508 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 22:30:23,508 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_substring_~ps~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_3) = -1*ULTIMATE.start_substring_~ps~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_3 Supporting invariants [] [2019-11-15 22:30:23,579 INFO L297 tatePredicateManager]: 14 out of 15 supporting invariants were superfluous and have been removed [2019-11-15 22:30:23,585 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-15 22:30:23,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:30:23,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:30:23,641 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-15 22:30:23,642 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:30:23,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:30:23,670 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 22:30:23,671 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:30:23,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:30:23,696 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2019-11-15 22:30:23,696 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 26 transitions. cyclomatic complexity: 9 Second operand 4 states. [2019-11-15 22:30:23,757 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 26 transitions. cyclomatic complexity: 9. Second operand 4 states. Result 27 states and 36 transitions. Complement of second has 5 states. [2019-11-15 22:30:23,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-15 22:30:23,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-15 22:30:23,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 24 transitions. [2019-11-15 22:30:23,758 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 13 letters. Loop has 7 letters. [2019-11-15 22:30:23,759 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:30:23,759 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 20 letters. Loop has 7 letters. [2019-11-15 22:30:23,759 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:30:23,759 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 13 letters. Loop has 14 letters. [2019-11-15 22:30:23,760 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:30:23,760 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 36 transitions. [2019-11-15 22:30:23,761 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 22:30:23,761 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 25 states and 34 transitions. [2019-11-15 22:30:23,762 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-11-15 22:30:23,762 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-11-15 22:30:23,762 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 34 transitions. [2019-11-15 22:30:23,762 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 22:30:23,762 INFO L688 BuchiCegarLoop]: Abstraction has 25 states and 34 transitions. [2019-11-15 22:30:23,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 34 transitions. [2019-11-15 22:30:23,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-11-15 22:30:23,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-11-15 22:30:23,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 34 transitions. [2019-11-15 22:30:23,765 INFO L711 BuchiCegarLoop]: Abstraction has 25 states and 34 transitions. [2019-11-15 22:30:23,765 INFO L591 BuchiCegarLoop]: Abstraction has 25 states and 34 transitions. [2019-11-15 22:30:23,765 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-15 22:30:23,765 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 34 transitions. [2019-11-15 22:30:23,766 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 22:30:23,766 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:30:23,767 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:30:23,767 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:30:23,767 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 22:30:23,768 INFO L791 eck$LassoCheckResult]: Stem: 778#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 775#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~nondet16, main_#t~post15, main_~i~0, main_#t~nondet18, main_#t~post17, main_~i~1, main_#t~ret19, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet11;havoc main_#t~nondet11;main_~length2~0 := main_#t~nondet12;havoc main_#t~nondet12; 776#L532 assume !(main_~length1~0 < 1); 777#L532-2 assume !(main_~length2~0 < 1); 772#L535-1 call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;main_~i~0 := 0; 773#L541-3 assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet16, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet16; 781#L541-2 main_#t~post15 := main_~i~0;main_~i~0 := 1 + main_#t~post15;havoc main_#t~post15; 782#L541-3 assume !(main_~i~0 < main_~length1~0 - 1); 762#L541-4 main_~i~1 := 0; 763#L547-3 assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet18, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet18; 770#L547-2 main_#t~post17 := main_~i~1;main_~i~1 := 1 + main_#t~post17;havoc main_#t~post17; 771#L547-3 assume !(main_~i~1 < main_~length2~0 - 1); 774#L547-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);substring_#in~s.base, substring_#in~s.offset, substring_#in~t.base, substring_#in~t.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc substring_#res;havoc substring_#t~post7.base, substring_#t~post7.offset, substring_#t~post8.base, substring_#t~post8.offset, substring_#t~mem3, substring_#t~mem4, substring_#t~mem5, substring_#t~short6, substring_#t~mem9, substring_#t~post10.base, substring_#t~post10.offset, substring_~ps2~0.base, substring_~ps2~0.offset, substring_~pt~0.base, substring_~pt~0.offset, substring_#t~mem2, substring_~s.base, substring_~s.offset, substring_~t.base, substring_~t.offset, substring_~ps~0.base, substring_~ps~0.offset;substring_~s.base, substring_~s.offset := substring_#in~s.base, substring_#in~s.offset;substring_~t.base, substring_~t.offset := substring_#in~t.base, substring_#in~t.offset;substring_~ps~0.base, substring_~ps~0.offset := substring_~s.base, substring_~s.offset; 766#L517-3 call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); 758#L517-1 assume !!(0 != substring_#t~mem2);havoc substring_#t~mem2;substring_~ps2~0.base, substring_~ps2~0.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_~t.base, substring_~t.offset; 759#L520-5 [2019-11-15 22:30:23,768 INFO L793 eck$LassoCheckResult]: Loop: 759#L520-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 764#L520-1 assume substring_#t~short6;call substring_#t~mem4 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);call substring_#t~mem5 := read~int(substring_~ps2~0.base, substring_~ps2~0.offset, 1);substring_#t~short6 := substring_#t~mem4 == substring_#t~mem5; 779#L520-3 assume !!substring_#t~short6;havoc substring_#t~mem5;havoc substring_#t~mem4;havoc substring_#t~short6;havoc substring_#t~mem3;substring_#t~post7.base, substring_#t~post7.offset := substring_~pt~0.base, substring_~pt~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_#t~post7.base, 1 + substring_#t~post7.offset;havoc substring_#t~post7.base, substring_#t~post7.offset;substring_#t~post8.base, substring_#t~post8.offset := substring_~ps2~0.base, substring_~ps2~0.offset;substring_~ps2~0.base, substring_~ps2~0.offset := substring_#t~post8.base, 1 + substring_#t~post8.offset;havoc substring_#t~post8.base, substring_#t~post8.offset; 759#L520-5 [2019-11-15 22:30:23,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:30:23,768 INFO L82 PathProgramCache]: Analyzing trace with hash 2055034719, now seen corresponding path program 1 times [2019-11-15 22:30:23,769 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:30:23,769 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882809540] [2019-11-15 22:30:23,769 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:30:23,769 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:30:23,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:30:23,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:30:23,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:30:23,797 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:30:23,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:30:23,798 INFO L82 PathProgramCache]: Analyzing trace with hash 87489, now seen corresponding path program 1 times [2019-11-15 22:30:23,798 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:30:23,799 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140961254] [2019-11-15 22:30:23,799 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:30:23,799 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:30:23,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:30:23,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:30:23,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:30:23,807 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:30:23,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:30:23,813 INFO L82 PathProgramCache]: Analyzing trace with hash 1075534243, now seen corresponding path program 1 times [2019-11-15 22:30:23,813 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:30:23,813 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399797672] [2019-11-15 22:30:23,813 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:30:23,814 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:30:23,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:30:23,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:30:23,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:30:23,844 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:30:24,974 WARN L191 SmtUtils]: Spent 996.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 134 [2019-11-15 22:30:25,312 WARN L191 SmtUtils]: Spent 333.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2019-11-15 22:30:25,314 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 22:30:25,314 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 22:30:25,314 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 22:30:25,315 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 22:30:25,315 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 22:30:25,315 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:30:25,315 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 22:30:25,315 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 22:30:25,315 INFO L131 ssoRankerPreferences]: Filename of dumped script: substring-alloca-2.i_Iteration7_Lasso [2019-11-15 22:30:25,315 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 22:30:25,315 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 22:30:25,319 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:30:25,321 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:30:25,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-11-15 22:30:25,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-11-15 22:30:25,327 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:30:25,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-11-15 22:30:25,332 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:30:25,334 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:30:26,026 WARN L191 SmtUtils]: Spent 388.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 104 [2019-11-15 22:30:26,238 WARN L191 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 78 [2019-11-15 22:30:26,238 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:30:26,241 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:30:26,242 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:30:26,244 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:30:26,246 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:30:26,247 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:30:26,249 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:30:26,279 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:30:26,284 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:30:26,286 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:30:26,288 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:30:26,290 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:30:26,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-11-15 22:30:26,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-11-15 22:30:26,295 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:30:26,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-11-15 22:30:26,298 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:30:26,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-11-15 22:30:26,302 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:30:26,304 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:30:26,663 WARN L191 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 63 [2019-11-15 22:30:27,266 WARN L191 SmtUtils]: Spent 415.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 46 [2019-11-15 22:30:27,400 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2019-11-15 22:30:27,593 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 22:30:27,593 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 22:30:27,594 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:30:27,594 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:30:27,594 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:30:27,594 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:30:27,595 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:30:27,595 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:30:27,595 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:30:27,595 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:30:27,596 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:30:27,596 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:30:27,597 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:30:27,597 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:30:27,597 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:30:27,597 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:30:27,597 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:30:27,598 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:30:27,599 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:30:27,599 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:30:27,599 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:30:27,599 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:30:27,600 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:30:27,600 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:30:27,600 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:30:27,600 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:30:27,600 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:30:27,600 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:30:27,601 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:30:27,601 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:30:27,601 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:30:27,601 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:30:27,601 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:30:27,601 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:30:27,602 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:30:27,602 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:30:27,602 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:30:27,602 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:30:27,603 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:30:27,604 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:30:27,604 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:30:27,605 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:30:27,605 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:30:27,605 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:30:27,606 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:30:27,607 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:30:27,607 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:30:27,607 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:30:27,608 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:30:27,608 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:30:27,608 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:30:27,608 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:30:27,608 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:30:27,609 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:30:27,609 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:30:27,610 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:30:27,610 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:30:27,610 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:30:27,610 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:30:27,610 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:30:27,610 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:30:27,611 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:30:27,611 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:30:27,611 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:30:27,612 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:30:27,612 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:30:27,612 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:30:27,612 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:30:27,613 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:30:27,613 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:30:27,614 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:30:27,614 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:30:27,615 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:30:27,615 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:30:27,615 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:30:27,615 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:30:27,616 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:30:27,616 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:30:27,617 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:30:27,617 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:30:27,618 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:30:27,618 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-11-15 22:30:27,618 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:30:27,618 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:30:27,621 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-11-15 22:30:27,621 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:30:27,640 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:30:27,640 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:30:27,641 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:30:27,641 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:30:27,641 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:30:27,641 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:30:27,642 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:30:27,642 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:30:27,643 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:30:27,643 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:30:27,644 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:30:27,644 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:30:27,644 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:30:27,644 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:30:27,647 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:30:27,648 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:30:27,699 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 22:30:27,796 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2019-11-15 22:30:27,797 INFO L444 ModelExtractionUtils]: 53 out of 64 variables were initially zero. Simplification set additionally 8 variables to zero. [2019-11-15 22:30:27,797 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 22:30:27,798 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 22:30:27,798 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 22:30:27,798 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_substring_~ps2~0.base)_2, ULTIMATE.start_substring_~pt~0.offset) = 1*v_rep(select #length ULTIMATE.start_substring_~ps2~0.base)_2 - 1*ULTIMATE.start_substring_~pt~0.offset Supporting invariants [] [2019-11-15 22:30:27,956 INFO L297 tatePredicateManager]: 33 out of 34 supporting invariants were superfluous and have been removed [2019-11-15 22:30:27,958 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-15 22:30:28,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:30:28,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:30:28,025 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-15 22:30:28,027 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:30:28,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:30:28,082 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-15 22:30:28,083 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:30:28,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:30:28,110 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2019-11-15 22:30:28,110 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 34 transitions. cyclomatic complexity: 13 Second operand 6 states. [2019-11-15 22:30:28,232 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 34 transitions. cyclomatic complexity: 13. Second operand 6 states. Result 67 states and 86 transitions. Complement of second has 9 states. [2019-11-15 22:30:28,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-15 22:30:28,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-11-15 22:30:28,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 31 transitions. [2019-11-15 22:30:28,236 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 31 transitions. Stem has 15 letters. Loop has 3 letters. [2019-11-15 22:30:28,236 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:30:28,236 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 31 transitions. Stem has 18 letters. Loop has 3 letters. [2019-11-15 22:30:28,237 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:30:28,237 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 31 transitions. Stem has 15 letters. Loop has 6 letters. [2019-11-15 22:30:28,237 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:30:28,237 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 67 states and 86 transitions. [2019-11-15 22:30:28,239 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-11-15 22:30:28,241 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 67 states to 56 states and 74 transitions. [2019-11-15 22:30:28,242 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2019-11-15 22:30:28,242 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2019-11-15 22:30:28,242 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 74 transitions. [2019-11-15 22:30:28,242 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 22:30:28,242 INFO L688 BuchiCegarLoop]: Abstraction has 56 states and 74 transitions. [2019-11-15 22:30:28,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 74 transitions. [2019-11-15 22:30:28,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 45. [2019-11-15 22:30:28,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-11-15 22:30:28,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 61 transitions. [2019-11-15 22:30:28,254 INFO L711 BuchiCegarLoop]: Abstraction has 45 states and 61 transitions. [2019-11-15 22:30:28,254 INFO L591 BuchiCegarLoop]: Abstraction has 45 states and 61 transitions. [2019-11-15 22:30:28,254 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-15 22:30:28,254 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 61 transitions. [2019-11-15 22:30:28,255 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-11-15 22:30:28,255 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:30:28,255 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:30:28,257 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:30:28,257 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 22:30:28,258 INFO L791 eck$LassoCheckResult]: Stem: 1100#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1097#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~nondet16, main_#t~post15, main_~i~0, main_#t~nondet18, main_#t~post17, main_~i~1, main_#t~ret19, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet11;havoc main_#t~nondet11;main_~length2~0 := main_#t~nondet12;havoc main_#t~nondet12; 1098#L532 assume !(main_~length1~0 < 1); 1099#L532-2 assume !(main_~length2~0 < 1); 1094#L535-1 call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;main_~i~0 := 0; 1095#L541-3 assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet16, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet16; 1105#L541-2 main_#t~post15 := main_~i~0;main_~i~0 := 1 + main_#t~post15;havoc main_#t~post15; 1106#L541-3 assume !(main_~i~0 < main_~length1~0 - 1); 1080#L541-4 main_~i~1 := 0; 1081#L547-3 assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet18, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet18; 1092#L547-2 main_#t~post17 := main_~i~1;main_~i~1 := 1 + main_#t~post17;havoc main_#t~post17; 1093#L547-3 assume !(main_~i~1 < main_~length2~0 - 1); 1096#L547-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);substring_#in~s.base, substring_#in~s.offset, substring_#in~t.base, substring_#in~t.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc substring_#res;havoc substring_#t~post7.base, substring_#t~post7.offset, substring_#t~post8.base, substring_#t~post8.offset, substring_#t~mem3, substring_#t~mem4, substring_#t~mem5, substring_#t~short6, substring_#t~mem9, substring_#t~post10.base, substring_#t~post10.offset, substring_~ps2~0.base, substring_~ps2~0.offset, substring_~pt~0.base, substring_~pt~0.offset, substring_#t~mem2, substring_~s.base, substring_~s.offset, substring_~t.base, substring_~t.offset, substring_~ps~0.base, substring_~ps~0.offset;substring_~s.base, substring_~s.offset := substring_#in~s.base, substring_#in~s.offset;substring_~t.base, substring_~t.offset := substring_#in~t.base, substring_#in~t.offset;substring_~ps~0.base, substring_~ps~0.offset := substring_~s.base, substring_~s.offset; 1088#L517-3 call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); 1076#L517-1 assume !!(0 != substring_#t~mem2);havoc substring_#t~mem2;substring_~ps2~0.base, substring_~ps2~0.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_~t.base, substring_~t.offset; 1077#L520-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 1083#L520-1 [2019-11-15 22:30:28,258 INFO L793 eck$LassoCheckResult]: Loop: 1083#L520-1 assume !substring_#t~short6; 1101#L520-3 assume !!substring_#t~short6;havoc substring_#t~mem5;havoc substring_#t~mem4;havoc substring_#t~short6;havoc substring_#t~mem3;substring_#t~post7.base, substring_#t~post7.offset := substring_~pt~0.base, substring_~pt~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_#t~post7.base, 1 + substring_#t~post7.offset;havoc substring_#t~post7.base, substring_#t~post7.offset;substring_#t~post8.base, substring_#t~post8.offset := substring_~ps2~0.base, substring_~ps2~0.offset;substring_~ps2~0.base, substring_~ps2~0.offset := substring_#t~post8.base, 1 + substring_#t~post8.offset;havoc substring_#t~post8.base, substring_#t~post8.offset; 1082#L520-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 1083#L520-1 [2019-11-15 22:30:28,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:30:28,258 INFO L82 PathProgramCache]: Analyzing trace with hash -718433093, now seen corresponding path program 1 times [2019-11-15 22:30:28,258 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:30:28,259 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315240277] [2019-11-15 22:30:28,259 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:30:28,260 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:30:28,260 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:30:28,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:30:28,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:30:28,294 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:30:28,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:30:28,294 INFO L82 PathProgramCache]: Analyzing trace with hash 92531, now seen corresponding path program 1 times [2019-11-15 22:30:28,295 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:30:28,295 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757113612] [2019-11-15 22:30:28,295 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:30:28,295 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:30:28,295 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:30:28,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:30:28,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:30:28,307 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757113612] [2019-11-15 22:30:28,307 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:30:28,307 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 22:30:28,307 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580319360] [2019-11-15 22:30:28,308 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 22:30:28,308 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:30:28,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:30:28,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:30:28,308 INFO L87 Difference]: Start difference. First operand 45 states and 61 transitions. cyclomatic complexity: 24 Second operand 3 states. [2019-11-15 22:30:28,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:30:28,321 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2019-11-15 22:30:28,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:30:28,322 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 54 transitions. [2019-11-15 22:30:28,323 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 22:30:28,323 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 33 states and 42 transitions. [2019-11-15 22:30:28,323 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-11-15 22:30:28,324 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-11-15 22:30:28,324 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 42 transitions. [2019-11-15 22:30:28,324 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 22:30:28,324 INFO L688 BuchiCegarLoop]: Abstraction has 33 states and 42 transitions. [2019-11-15 22:30:28,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 42 transitions. [2019-11-15 22:30:28,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2019-11-15 22:30:28,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-15 22:30:28,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 40 transitions. [2019-11-15 22:30:28,326 INFO L711 BuchiCegarLoop]: Abstraction has 31 states and 40 transitions. [2019-11-15 22:30:28,326 INFO L591 BuchiCegarLoop]: Abstraction has 31 states and 40 transitions. [2019-11-15 22:30:28,326 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-15 22:30:28,326 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 40 transitions. [2019-11-15 22:30:28,327 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 22:30:28,327 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:30:28,327 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:30:28,328 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:30:28,328 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 22:30:28,328 INFO L791 eck$LassoCheckResult]: Stem: 1192#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1189#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~nondet16, main_#t~post15, main_~i~0, main_#t~nondet18, main_#t~post17, main_~i~1, main_#t~ret19, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet11;havoc main_#t~nondet11;main_~length2~0 := main_#t~nondet12;havoc main_#t~nondet12; 1190#L532 assume !(main_~length1~0 < 1); 1191#L532-2 assume !(main_~length2~0 < 1); 1186#L535-1 call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;main_~i~0 := 0; 1187#L541-3 assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet16, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet16; 1195#L541-2 main_#t~post15 := main_~i~0;main_~i~0 := 1 + main_#t~post15;havoc main_#t~post15; 1196#L541-3 assume !(main_~i~0 < main_~length1~0 - 1); 1174#L541-4 main_~i~1 := 0; 1175#L547-3 assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet18, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet18; 1184#L547-2 main_#t~post17 := main_~i~1;main_~i~1 := 1 + main_#t~post17;havoc main_#t~post17; 1185#L547-3 assume !(main_~i~1 < main_~length2~0 - 1); 1188#L547-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);substring_#in~s.base, substring_#in~s.offset, substring_#in~t.base, substring_#in~t.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc substring_#res;havoc substring_#t~post7.base, substring_#t~post7.offset, substring_#t~post8.base, substring_#t~post8.offset, substring_#t~mem3, substring_#t~mem4, substring_#t~mem5, substring_#t~short6, substring_#t~mem9, substring_#t~post10.base, substring_#t~post10.offset, substring_~ps2~0.base, substring_~ps2~0.offset, substring_~pt~0.base, substring_~pt~0.offset, substring_#t~mem2, substring_~s.base, substring_~s.offset, substring_~t.base, substring_~t.offset, substring_~ps~0.base, substring_~ps~0.offset;substring_~s.base, substring_~s.offset := substring_#in~s.base, substring_#in~s.offset;substring_~t.base, substring_~t.offset := substring_#in~t.base, substring_#in~t.offset;substring_~ps~0.base, substring_~ps~0.offset := substring_~s.base, substring_~s.offset; 1181#L517-3 call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); 1172#L517-1 assume !!(0 != substring_#t~mem2);havoc substring_#t~mem2;substring_~ps2~0.base, substring_~ps2~0.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_~t.base, substring_~t.offset; 1173#L520-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 1177#L520-1 assume !substring_#t~short6; 1194#L520-3 assume !substring_#t~short6;havoc substring_#t~mem5;havoc substring_#t~mem4;havoc substring_#t~short6;havoc substring_#t~mem3; 1179#L520-6 call substring_#t~mem9 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1); 1180#L524 assume !(0 == substring_#t~mem9);havoc substring_#t~mem9;substring_#t~post10.base, substring_#t~post10.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~ps~0.base, substring_~ps~0.offset := substring_#t~post10.base, 1 + substring_#t~post10.offset;havoc substring_#t~post10.base, substring_#t~post10.offset; 1182#L517-3 call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); 1170#L517-1 assume !!(0 != substring_#t~mem2);havoc substring_#t~mem2;substring_~ps2~0.base, substring_~ps2~0.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_~t.base, substring_~t.offset; 1171#L520-5 [2019-11-15 22:30:28,328 INFO L793 eck$LassoCheckResult]: Loop: 1171#L520-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 1176#L520-1 assume substring_#t~short6;call substring_#t~mem4 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);call substring_#t~mem5 := read~int(substring_~ps2~0.base, substring_~ps2~0.offset, 1);substring_#t~short6 := substring_#t~mem4 == substring_#t~mem5; 1193#L520-3 assume !!substring_#t~short6;havoc substring_#t~mem5;havoc substring_#t~mem4;havoc substring_#t~short6;havoc substring_#t~mem3;substring_#t~post7.base, substring_#t~post7.offset := substring_~pt~0.base, substring_~pt~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_#t~post7.base, 1 + substring_#t~post7.offset;havoc substring_#t~post7.base, substring_#t~post7.offset;substring_#t~post8.base, substring_#t~post8.offset := substring_~ps2~0.base, substring_~ps2~0.offset;substring_~ps2~0.base, substring_~ps2~0.offset := substring_#t~post8.base, 1 + substring_#t~post8.offset;havoc substring_#t~post8.base, substring_#t~post8.offset; 1171#L520-5 [2019-11-15 22:30:28,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:30:28,331 INFO L82 PathProgramCache]: Analyzing trace with hash -1389384631, now seen corresponding path program 1 times [2019-11-15 22:30:28,332 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:30:28,332 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355844909] [2019-11-15 22:30:28,332 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:30:28,332 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:30:28,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:30:28,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:30:28,369 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-15 22:30:28,369 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355844909] [2019-11-15 22:30:28,370 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:30:28,370 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 22:30:28,370 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533205318] [2019-11-15 22:30:28,370 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 22:30:28,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:30:28,371 INFO L82 PathProgramCache]: Analyzing trace with hash 87489, now seen corresponding path program 2 times [2019-11-15 22:30:28,371 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:30:28,371 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630752621] [2019-11-15 22:30:28,371 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:30:28,371 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:30:28,371 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:30:28,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:30:28,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:30:28,383 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:30:28,497 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2019-11-15 22:30:28,534 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:30:28,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 22:30:28,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:30:28,534 INFO L87 Difference]: Start difference. First operand 31 states and 40 transitions. cyclomatic complexity: 14 Second operand 5 states. [2019-11-15 22:30:28,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:30:28,599 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2019-11-15 22:30:28,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 22:30:28,600 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 42 transitions. [2019-11-15 22:30:28,601 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 22:30:28,601 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 31 states and 38 transitions. [2019-11-15 22:30:28,601 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-11-15 22:30:28,601 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-11-15 22:30:28,601 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 38 transitions. [2019-11-15 22:30:28,601 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 22:30:28,602 INFO L688 BuchiCegarLoop]: Abstraction has 31 states and 38 transitions. [2019-11-15 22:30:28,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 38 transitions. [2019-11-15 22:30:28,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-11-15 22:30:28,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-15 22:30:28,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2019-11-15 22:30:28,604 INFO L711 BuchiCegarLoop]: Abstraction has 31 states and 38 transitions. [2019-11-15 22:30:28,604 INFO L591 BuchiCegarLoop]: Abstraction has 31 states and 38 transitions. [2019-11-15 22:30:28,604 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-11-15 22:30:28,604 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 38 transitions. [2019-11-15 22:30:28,604 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 22:30:28,604 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:30:28,604 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:30:28,605 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:30:28,605 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 22:30:28,605 INFO L791 eck$LassoCheckResult]: Stem: 1266#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1263#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~nondet16, main_#t~post15, main_~i~0, main_#t~nondet18, main_#t~post17, main_~i~1, main_#t~ret19, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet11;havoc main_#t~nondet11;main_~length2~0 := main_#t~nondet12;havoc main_#t~nondet12; 1264#L532 assume !(main_~length1~0 < 1); 1265#L532-2 assume !(main_~length2~0 < 1); 1260#L535-1 call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;main_~i~0 := 0; 1261#L541-3 assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet16, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet16; 1270#L541-2 main_#t~post15 := main_~i~0;main_~i~0 := 1 + main_#t~post15;havoc main_#t~post15; 1271#L541-3 assume !(main_~i~0 < main_~length1~0 - 1); 1249#L541-4 main_~i~1 := 0; 1250#L547-3 assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet18, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet18; 1258#L547-2 main_#t~post17 := main_~i~1;main_~i~1 := 1 + main_#t~post17;havoc main_#t~post17; 1259#L547-3 assume !(main_~i~1 < main_~length2~0 - 1); 1262#L547-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);substring_#in~s.base, substring_#in~s.offset, substring_#in~t.base, substring_#in~t.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc substring_#res;havoc substring_#t~post7.base, substring_#t~post7.offset, substring_#t~post8.base, substring_#t~post8.offset, substring_#t~mem3, substring_#t~mem4, substring_#t~mem5, substring_#t~short6, substring_#t~mem9, substring_#t~post10.base, substring_#t~post10.offset, substring_~ps2~0.base, substring_~ps2~0.offset, substring_~pt~0.base, substring_~pt~0.offset, substring_#t~mem2, substring_~s.base, substring_~s.offset, substring_~t.base, substring_~t.offset, substring_~ps~0.base, substring_~ps~0.offset;substring_~s.base, substring_~s.offset := substring_#in~s.base, substring_#in~s.offset;substring_~t.base, substring_~t.offset := substring_#in~t.base, substring_#in~t.offset;substring_~ps~0.base, substring_~ps~0.offset := substring_~s.base, substring_~s.offset; 1253#L517-3 call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); 1254#L517-1 assume !!(0 != substring_#t~mem2);havoc substring_#t~mem2;substring_~ps2~0.base, substring_~ps2~0.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_~t.base, substring_~t.offset; 1273#L520-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 1268#L520-1 assume substring_#t~short6;call substring_#t~mem4 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);call substring_#t~mem5 := read~int(substring_~ps2~0.base, substring_~ps2~0.offset, 1);substring_#t~short6 := substring_#t~mem4 == substring_#t~mem5; 1269#L520-3 assume !substring_#t~short6;havoc substring_#t~mem5;havoc substring_#t~mem4;havoc substring_#t~short6;havoc substring_#t~mem3; 1256#L520-6 call substring_#t~mem9 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1); 1257#L524 assume !(0 == substring_#t~mem9);havoc substring_#t~mem9;substring_#t~post10.base, substring_#t~post10.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~ps~0.base, substring_~ps~0.offset := substring_#t~post10.base, 1 + substring_#t~post10.offset;havoc substring_#t~post10.base, substring_#t~post10.offset; 1255#L517-3 call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); 1245#L517-1 assume !!(0 != substring_#t~mem2);havoc substring_#t~mem2;substring_~ps2~0.base, substring_~ps2~0.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_~t.base, substring_~t.offset; 1246#L520-5 [2019-11-15 22:30:28,605 INFO L793 eck$LassoCheckResult]: Loop: 1246#L520-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 1251#L520-1 assume substring_#t~short6;call substring_#t~mem4 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);call substring_#t~mem5 := read~int(substring_~ps2~0.base, substring_~ps2~0.offset, 1);substring_#t~short6 := substring_#t~mem4 == substring_#t~mem5; 1267#L520-3 assume !!substring_#t~short6;havoc substring_#t~mem5;havoc substring_#t~mem4;havoc substring_#t~short6;havoc substring_#t~mem3;substring_#t~post7.base, substring_#t~post7.offset := substring_~pt~0.base, substring_~pt~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_#t~post7.base, 1 + substring_#t~post7.offset;havoc substring_#t~post7.base, substring_#t~post7.offset;substring_#t~post8.base, substring_#t~post8.offset := substring_~ps2~0.base, substring_~ps2~0.offset;substring_~ps2~0.base, substring_~ps2~0.offset := substring_#t~post8.base, 1 + substring_#t~post8.offset;havoc substring_#t~post8.base, substring_#t~post8.offset; 1246#L520-5 [2019-11-15 22:30:28,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:30:28,605 INFO L82 PathProgramCache]: Analyzing trace with hash -1446642933, now seen corresponding path program 2 times [2019-11-15 22:30:28,606 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:30:28,606 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49991580] [2019-11-15 22:30:28,606 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:30:28,606 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:30:28,606 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:30:28,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:30:28,892 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 22:30:28,892 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49991580] [2019-11-15 22:30:28,892 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1791674377] [2019-11-15 22:30:28,893 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fa964f72-924d-426f-ad50-fd38e68a0fb5/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:30:29,010 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 22:30:29,011 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:30:29,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 31 conjunts are in the unsatisfiable core [2019-11-15 22:30:29,014 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:30:29,032 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-15 22:30:29,033 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:30:29,037 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:30:29,037 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:30:29,038 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2019-11-15 22:30:29,136 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 21 [2019-11-15 22:30:29,136 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:30:29,152 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:30:29,153 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-15 22:30:29,153 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:47, output treesize:31 [2019-11-15 22:30:29,269 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:30:29,269 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 21 [2019-11-15 22:30:29,270 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-15 22:30:29,296 INFO L567 ElimStorePlain]: treesize reduction 8, result has 63.6 percent of original size [2019-11-15 22:30:29,297 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:30:29,297 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:38, output treesize:3 [2019-11-15 22:30:29,329 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 22:30:29,329 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:30:29,329 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2019-11-15 22:30:29,330 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296604213] [2019-11-15 22:30:29,333 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 22:30:29,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:30:29,335 INFO L82 PathProgramCache]: Analyzing trace with hash 87489, now seen corresponding path program 3 times [2019-11-15 22:30:29,335 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:30:29,336 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844149512] [2019-11-15 22:30:29,336 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:30:29,336 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:30:29,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:30:29,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:30:29,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:30:29,347 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:30:29,485 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2019-11-15 22:30:29,516 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:30:29,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-15 22:30:29,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2019-11-15 22:30:29,516 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. cyclomatic complexity: 12 Second operand 16 states. [2019-11-15 22:30:29,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:30:29,951 INFO L93 Difference]: Finished difference Result 51 states and 60 transitions. [2019-11-15 22:30:29,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 22:30:29,952 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 60 transitions. [2019-11-15 22:30:29,952 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 22:30:29,953 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 34 states and 41 transitions. [2019-11-15 22:30:29,953 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-11-15 22:30:29,953 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-11-15 22:30:29,953 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 41 transitions. [2019-11-15 22:30:29,953 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 22:30:29,954 INFO L688 BuchiCegarLoop]: Abstraction has 34 states and 41 transitions. [2019-11-15 22:30:29,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 41 transitions. [2019-11-15 22:30:29,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2019-11-15 22:30:29,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-15 22:30:29,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2019-11-15 22:30:29,957 INFO L711 BuchiCegarLoop]: Abstraction has 33 states and 40 transitions. [2019-11-15 22:30:29,957 INFO L591 BuchiCegarLoop]: Abstraction has 33 states and 40 transitions. [2019-11-15 22:30:29,957 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-11-15 22:30:29,957 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 40 transitions. [2019-11-15 22:30:29,958 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 22:30:29,958 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:30:29,958 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:30:29,959 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:30:29,959 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 22:30:29,960 INFO L791 eck$LassoCheckResult]: Stem: 1444#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1441#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~nondet16, main_#t~post15, main_~i~0, main_#t~nondet18, main_#t~post17, main_~i~1, main_#t~ret19, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet11;havoc main_#t~nondet11;main_~length2~0 := main_#t~nondet12;havoc main_#t~nondet12; 1442#L532 assume !(main_~length1~0 < 1); 1443#L532-2 assume !(main_~length2~0 < 1); 1438#L535-1 call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;main_~i~0 := 0; 1439#L541-3 assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet16, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet16; 1448#L541-2 main_#t~post15 := main_~i~0;main_~i~0 := 1 + main_#t~post15;havoc main_#t~post15; 1449#L541-3 assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet16, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet16; 1452#L541-2 main_#t~post15 := main_~i~0;main_~i~0 := 1 + main_#t~post15;havoc main_#t~post15; 1453#L541-3 assume !(main_~i~0 < main_~length1~0 - 1); 1427#L541-4 main_~i~1 := 0; 1428#L547-3 assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet18, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet18; 1436#L547-2 main_#t~post17 := main_~i~1;main_~i~1 := 1 + main_#t~post17;havoc main_#t~post17; 1437#L547-3 assume !(main_~i~1 < main_~length2~0 - 1); 1440#L547-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);substring_#in~s.base, substring_#in~s.offset, substring_#in~t.base, substring_#in~t.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc substring_#res;havoc substring_#t~post7.base, substring_#t~post7.offset, substring_#t~post8.base, substring_#t~post8.offset, substring_#t~mem3, substring_#t~mem4, substring_#t~mem5, substring_#t~short6, substring_#t~mem9, substring_#t~post10.base, substring_#t~post10.offset, substring_~ps2~0.base, substring_~ps2~0.offset, substring_~pt~0.base, substring_~pt~0.offset, substring_#t~mem2, substring_~s.base, substring_~s.offset, substring_~t.base, substring_~t.offset, substring_~ps~0.base, substring_~ps~0.offset;substring_~s.base, substring_~s.offset := substring_#in~s.base, substring_#in~s.offset;substring_~t.base, substring_~t.offset := substring_#in~t.base, substring_#in~t.offset;substring_~ps~0.base, substring_~ps~0.offset := substring_~s.base, substring_~s.offset; 1433#L517-3 call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); 1434#L517-1 assume !!(0 != substring_#t~mem2);havoc substring_#t~mem2;substring_~ps2~0.base, substring_~ps2~0.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_~t.base, substring_~t.offset; 1451#L520-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 1446#L520-1 assume substring_#t~short6;call substring_#t~mem4 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);call substring_#t~mem5 := read~int(substring_~ps2~0.base, substring_~ps2~0.offset, 1);substring_#t~short6 := substring_#t~mem4 == substring_#t~mem5; 1447#L520-3 assume !substring_#t~short6;havoc substring_#t~mem5;havoc substring_#t~mem4;havoc substring_#t~short6;havoc substring_#t~mem3; 1431#L520-6 call substring_#t~mem9 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1); 1432#L524 assume !(0 == substring_#t~mem9);havoc substring_#t~mem9;substring_#t~post10.base, substring_#t~post10.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~ps~0.base, substring_~ps~0.offset := substring_#t~post10.base, 1 + substring_#t~post10.offset;havoc substring_#t~post10.base, substring_#t~post10.offset; 1435#L517-3 call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); 1423#L517-1 assume !!(0 != substring_#t~mem2);havoc substring_#t~mem2;substring_~ps2~0.base, substring_~ps2~0.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_~t.base, substring_~t.offset; 1424#L520-5 [2019-11-15 22:30:29,960 INFO L793 eck$LassoCheckResult]: Loop: 1424#L520-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 1429#L520-1 assume substring_#t~short6;call substring_#t~mem4 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);call substring_#t~mem5 := read~int(substring_~ps2~0.base, substring_~ps2~0.offset, 1);substring_#t~short6 := substring_#t~mem4 == substring_#t~mem5; 1445#L520-3 assume !!substring_#t~short6;havoc substring_#t~mem5;havoc substring_#t~mem4;havoc substring_#t~short6;havoc substring_#t~mem3;substring_#t~post7.base, substring_#t~post7.offset := substring_~pt~0.base, substring_~pt~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_#t~post7.base, 1 + substring_#t~post7.offset;havoc substring_#t~post7.base, substring_#t~post7.offset;substring_#t~post8.base, substring_#t~post8.offset := substring_~ps2~0.base, substring_~ps2~0.offset;substring_~ps2~0.base, substring_~ps2~0.offset := substring_#t~post8.base, 1 + substring_#t~post8.offset;havoc substring_#t~post8.base, substring_#t~post8.offset; 1424#L520-5 [2019-11-15 22:30:29,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:30:29,960 INFO L82 PathProgramCache]: Analyzing trace with hash -1546919447, now seen corresponding path program 3 times [2019-11-15 22:30:29,961 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:30:29,961 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270632881] [2019-11-15 22:30:29,961 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:30:29,961 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:30:29,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:30:29,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:30:29,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:30:29,994 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:30:29,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:30:29,995 INFO L82 PathProgramCache]: Analyzing trace with hash 87489, now seen corresponding path program 4 times [2019-11-15 22:30:29,995 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:30:29,996 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858597675] [2019-11-15 22:30:29,996 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:30:29,996 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:30:29,996 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:30:29,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:30:30,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:30:30,002 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:30:30,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:30:30,003 INFO L82 PathProgramCache]: Analyzing trace with hash 721898201, now seen corresponding path program 1 times [2019-11-15 22:30:30,003 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:30:30,003 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558357878] [2019-11-15 22:30:30,004 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:30:30,004 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:30:30,004 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:30:30,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:30:30,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:30:30,068 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:30:30,182 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2019-11-15 22:30:31,367 WARN L191 SmtUtils]: Spent 1.15 s on a formula simplification. DAG size of input: 235 DAG size of output: 179 [2019-11-15 22:30:31,608 WARN L191 SmtUtils]: Spent 226.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2019-11-15 22:30:31,610 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 22:30:31,610 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 22:30:31,610 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 22:30:31,611 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 22:30:31,611 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 22:30:31,611 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:30:31,611 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 22:30:31,611 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 22:30:31,611 INFO L131 ssoRankerPreferences]: Filename of dumped script: substring-alloca-2.i_Iteration11_Lasso [2019-11-15 22:30:31,611 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 22:30:31,611 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 22:30:31,614 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:30:31,625 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:30:31,629 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:30:31,630 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:30:31,632 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:30:31,634 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:30:31,635 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:30:31,638 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:30:31,639 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:30:31,641 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:30:31,642 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:30:31,644 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:30:31,646 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:30:31,647 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:30:31,649 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:30:31,651 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:30:31,652 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:30:31,654 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:30:31,656 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:30:31,658 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:30:31,659 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:30:32,389 WARN L191 SmtUtils]: Spent 423.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 113 [2019-11-15 22:30:32,593 WARN L191 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 77 [2019-11-15 22:30:32,594 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:30:32,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-11-15 22:30:32,602 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:30:32,604 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:30:32,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-11-15 22:30:32,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-11-15 22:30:33,104 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2019-11-15 22:30:33,209 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-11-15 22:30:33,657 WARN L191 SmtUtils]: Spent 428.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 46 [2019-11-15 22:30:34,250 WARN L191 SmtUtils]: Spent 546.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 45 [2019-11-15 22:30:34,304 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 22:30:34,304 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 22:30:34,304 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:30:34,305 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:30:34,305 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:30:34,306 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:30:34,306 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:30:34,306 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:30:34,306 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:30:34,306 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:30:34,307 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:30:34,307 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:30:34,308 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:30:34,308 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:30:34,308 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:30:34,309 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:30:34,309 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:30:34,309 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:30:34,309 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:30:34,310 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:30:34,310 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:30:34,310 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:30:34,311 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:30:34,311 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:30:34,311 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:30:34,311 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:30:34,311 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:30:34,312 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:30:34,312 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:30:34,312 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:30:34,313 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:30:34,313 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:30:34,313 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:30:34,313 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:30:34,314 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:30:34,314 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:30:34,315 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:30:34,316 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:30:34,316 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:30:34,316 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:30:34,317 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:30:34,317 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:30:34,317 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:30:34,317 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:30:34,317 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:30:34,318 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:30:34,318 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:30:34,319 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:30:34,319 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:30:34,319 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:30:34,319 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:30:34,319 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:30:34,320 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:30:34,320 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:30:34,320 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:30:34,321 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:30:34,321 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:30:34,321 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:30:34,321 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:30:34,322 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:30:34,322 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:30:34,322 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:30:34,324 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:30:34,324 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:30:34,325 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:30:34,325 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:30:34,325 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:30:34,325 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:30:34,326 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:30:34,326 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:30:34,326 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:30:34,326 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:30:34,327 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:30:34,327 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:30:34,328 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:30:34,328 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:30:34,328 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:30:34,328 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:30:34,328 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:30:34,329 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:30:34,329 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:30:34,329 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:30:34,330 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:30:34,330 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:30:34,330 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:30:34,331 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:30:34,331 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:30:34,331 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:30:34,331 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:30:34,332 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:30:34,332 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:30:34,332 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:30:34,333 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:30:34,333 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:30:34,333 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:30:34,333 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:30:34,333 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:30:34,334 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:30:34,334 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:30:34,335 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:30:34,335 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:30:34,335 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:30:34,336 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:30:34,336 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:30:34,336 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:30:34,336 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:30:34,336 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:30:34,337 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:30:34,337 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:30:34,338 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:30:34,338 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:30:34,338 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:30:34,338 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:30:34,339 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:30:34,339 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:30:34,339 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:30:34,339 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:30:34,340 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:30:34,341 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:30:34,341 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:30:34,341 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:30:34,341 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:30:34,341 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:30:34,342 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:30:34,342 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:30:34,342 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:30:34,343 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:30:34,343 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:30:34,344 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:30:34,344 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:30:34,344 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:30:34,344 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:30:34,344 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:30:34,345 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:30:34,345 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:30:34,346 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:30:34,346 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:30:34,346 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:30:34,347 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:30:34,347 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:30:34,347 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:30:34,347 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:30:34,347 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:30:34,348 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:30:34,348 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:30:34,349 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:30:34,349 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:30:34,349 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:30:34,350 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:30:34,350 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:30:34,350 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:30:34,350 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:30:34,351 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:30:34,351 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:30:34,352 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:30:34,352 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:30:34,352 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:30:34,352 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:30:34,353 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:30:34,353 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:30:34,354 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:30:34,355 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:30:34,356 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:30:34,356 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:30:34,356 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:30:34,356 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:30:34,356 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:30:34,357 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:30:34,357 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:30:34,358 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:30:34,358 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:30:34,359 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:30:34,359 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:30:34,359 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:30:34,359 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:30:34,359 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:30:34,360 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:30:34,360 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:30:34,360 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:30:34,361 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:30:34,362 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:30:34,362 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:30:34,362 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:30:34,362 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:30:34,366 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:30:34,366 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:30:34,420 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 22:30:34,434 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-15 22:30:34,435 INFO L444 ModelExtractionUtils]: 48 out of 52 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 22:30:34,435 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 22:30:34,436 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 22:30:34,436 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 22:30:34,437 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_substring_~pt~0.base)_3, ULTIMATE.start_substring_~pt~0.offset) = 1*v_rep(select #length ULTIMATE.start_substring_~pt~0.base)_3 - 1*ULTIMATE.start_substring_~pt~0.offset Supporting invariants [] [2019-11-15 22:30:34,629 INFO L297 tatePredicateManager]: 42 out of 42 supporting invariants were superfluous and have been removed [2019-11-15 22:30:34,630 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-15 22:30:34,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:30:34,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:30:34,706 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:30:34,707 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:30:34,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:30:34,717 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 22:30:34,717 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:30:34,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:30:34,729 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-15 22:30:34,729 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 40 transitions. cyclomatic complexity: 12 Second operand 3 states. [2019-11-15 22:30:34,749 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states and 40 transitions. cyclomatic complexity: 12. Second operand 3 states. Result 47 states and 55 transitions. Complement of second has 5 states. [2019-11-15 22:30:34,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-15 22:30:34,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 22:30:34,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 24 transitions. [2019-11-15 22:30:34,749 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 24 transitions. Stem has 24 letters. Loop has 3 letters. [2019-11-15 22:30:34,750 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:30:34,750 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 22:30:34,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:30:34,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:30:34,789 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:30:34,790 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:30:34,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:30:34,802 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 22:30:34,803 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:30:34,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:30:34,811 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-11-15 22:30:34,811 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 40 transitions. cyclomatic complexity: 12 Second operand 3 states. [2019-11-15 22:30:34,827 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states and 40 transitions. cyclomatic complexity: 12. Second operand 3 states. Result 47 states and 55 transitions. Complement of second has 5 states. [2019-11-15 22:30:34,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-15 22:30:34,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 22:30:34,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 24 transitions. [2019-11-15 22:30:34,832 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 24 transitions. Stem has 24 letters. Loop has 3 letters. [2019-11-15 22:30:34,832 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:30:34,832 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 22:30:34,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:30:34,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:30:34,888 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:30:34,889 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:30:34,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:30:34,898 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 22:30:34,898 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:30:34,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:30:34,908 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-11-15 22:30:34,908 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 40 transitions. cyclomatic complexity: 12 Second operand 3 states. [2019-11-15 22:30:34,929 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states and 40 transitions. cyclomatic complexity: 12. Second operand 3 states. Result 47 states and 56 transitions. Complement of second has 4 states. [2019-11-15 22:30:34,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-15 22:30:34,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 22:30:34,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 31 transitions. [2019-11-15 22:30:34,930 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 31 transitions. Stem has 24 letters. Loop has 3 letters. [2019-11-15 22:30:34,930 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:30:34,931 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 31 transitions. Stem has 27 letters. Loop has 3 letters. [2019-11-15 22:30:34,931 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:30:34,931 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 31 transitions. Stem has 24 letters. Loop has 6 letters. [2019-11-15 22:30:34,931 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:30:34,932 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 56 transitions. [2019-11-15 22:30:34,933 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 22:30:34,933 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 0 states and 0 transitions. [2019-11-15 22:30:34,933 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-15 22:30:34,934 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-15 22:30:34,934 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-15 22:30:34,934 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 22:30:34,934 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 22:30:34,934 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 22:30:34,934 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 22:30:34,934 INFO L424 BuchiCegarLoop]: ======== Iteration 12============ [2019-11-15 22:30:34,934 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-15 22:30:34,934 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 22:30:34,934 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-15 22:30:34,940 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.11 10:30:34 BoogieIcfgContainer [2019-11-15 22:30:34,940 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-15 22:30:34,941 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 22:30:34,941 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 22:30:34,941 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 22:30:34,941 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:30:15" (3/4) ... [2019-11-15 22:30:34,945 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-15 22:30:34,945 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 22:30:34,946 INFO L168 Benchmark]: Toolchain (without parser) took 20935.85 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 449.8 MB). Free memory was 939.8 MB in the beginning and 1.4 GB in the end (delta: -457.3 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:30:34,947 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:30:34,947 INFO L168 Benchmark]: CACSL2BoogieTranslator took 545.41 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 106.4 MB). Free memory was 939.8 MB in the beginning and 1.1 GB in the end (delta: -149.3 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. [2019-11-15 22:30:34,948 INFO L168 Benchmark]: Boogie Procedure Inliner took 53.06 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-15 22:30:34,948 INFO L168 Benchmark]: Boogie Preprocessor took 29.79 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:30:34,948 INFO L168 Benchmark]: RCFGBuilder took 511.45 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. [2019-11-15 22:30:34,949 INFO L168 Benchmark]: BuchiAutomizer took 19788.10 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 343.4 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -335.7 MB). Peak memory consumption was 7.7 MB. Max. memory is 11.5 GB. [2019-11-15 22:30:34,949 INFO L168 Benchmark]: Witness Printer took 4.43 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. [2019-11-15 22:30:34,952 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 545.41 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 106.4 MB). Free memory was 939.8 MB in the beginning and 1.1 GB in the end (delta: -149.3 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 53.06 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 29.79 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 511.45 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 19788.10 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 343.4 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -335.7 MB). Peak memory consumption was 7.7 MB. Max. memory is 11.5 GB. * Witness Printer took 4.43 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 11 terminating modules (6 trivial, 4 deterministic, 1 nondeterministic). One deterministic module has affine ranking function length1 + -1 * i and consists of 5 locations. One deterministic module has affine ranking function -1 * i + length2 and consists of 4 locations. One deterministic module has affine ranking function -1 * ps + unknown-#length-unknown[__builtin_alloca (length1 * sizeof(char))] and consists of 4 locations. One deterministic module has affine ranking function unknown-#length-unknown[ps2] + -1 * pt and consists of 6 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[pt] + -1 * pt and consists of 3 locations. 6 modules have a trivial ranking function, the largest among these consists of 16 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 19.7s and 12 iterations. TraceHistogramMax:2. Analysis of lassos took 17.6s. Construction of modules took 0.4s. Büchi inclusion checks took 1.4s. Highest rank in rank-based complementation 3. Minimization of det autom 6. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 17 StatesRemovedByMinimization, 6 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 45 states and ocurred in iteration 7. Nontrivial modules had stage [4, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 247 SDtfs, 408 SDslu, 471 SDs, 0 SdLazy, 435 SolverSat, 43 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc3 concLT0 SILN0 SILU2 SILI0 SILT0 lasso5 LassoPreprocessingBenchmarks: Lassos: inital295 mio100 ax108 hnf99 lsp88 ukn70 mio100 lsp47 div100 bol100 ite100 ukn100 eq185 hnf89 smp98 dnf187 smp90 tf100 neg94 sie118 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 144ms VariablesStem: 3 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 6 SupportingInvariants: 12 MotzkinApplications: 96 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...