./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/array-memsafety/cstrpbrk-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_b51a17f2-ca6f-445b-a410-259c192bf248/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_b51a17f2-ca6f-445b-a410-259c192bf248/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_b51a17f2-ca6f-445b-a410-259c192bf248/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_b51a17f2-ca6f-445b-a410-259c192bf248/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/cstrpbrk-alloca-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_b51a17f2-ca6f-445b-a410-259c192bf248/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_b51a17f2-ca6f-445b-a410-259c192bf248/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 5cff20f2f9db1407772cc4ac909fa32770d83e71 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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 20:26:54,842 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 20:26:54,844 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 20:26:54,854 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 20:26:54,855 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 20:26:54,856 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 20:26:54,857 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 20:26:54,859 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 20:26:54,861 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 20:26:54,862 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 20:26:54,863 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 20:26:54,864 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 20:26:54,864 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 20:26:54,865 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 20:26:54,866 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 20:26:54,867 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 20:26:54,868 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 20:26:54,868 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 20:26:54,870 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 20:26:54,872 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 20:26:54,873 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 20:26:54,874 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 20:26:54,875 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 20:26:54,876 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 20:26:54,878 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 20:26:54,878 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 20:26:54,879 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 20:26:54,879 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 20:26:54,880 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 20:26:54,881 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 20:26:54,881 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 20:26:54,882 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 20:26:54,882 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 20:26:54,883 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 20:26:54,884 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 20:26:54,884 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 20:26:54,885 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 20:26:54,885 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 20:26:54,885 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 20:26:54,886 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 20:26:54,887 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 20:26:54,887 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_b51a17f2-ca6f-445b-a410-259c192bf248/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-15 20:26:54,903 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 20:26:54,903 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 20:26:54,904 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 20:26:54,904 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 20:26:54,904 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 20:26:54,905 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-15 20:26:54,905 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-15 20:26:54,905 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-15 20:26:54,905 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-15 20:26:54,906 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-15 20:26:54,906 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-15 20:26:54,906 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 20:26:54,906 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 20:26:54,907 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 20:26:54,907 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 20:26:54,907 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 20:26:54,907 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 20:26:54,907 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-15 20:26:54,908 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-15 20:26:54,908 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-15 20:26:54,908 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 20:26:54,908 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 20:26:54,909 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-15 20:26:54,909 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 20:26:54,909 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-15 20:26:54,909 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 20:26:54,910 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 20:26:54,910 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-15 20:26:54,910 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 20:26:54,910 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 20:26:54,911 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-15 20:26:54,911 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-15 20:26:54,912 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_b51a17f2-ca6f-445b-a410-259c192bf248/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 -> 5cff20f2f9db1407772cc4ac909fa32770d83e71 [2019-11-15 20:26:54,936 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 20:26:54,946 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 20:26:54,949 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 20:26:54,951 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 20:26:54,951 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 20:26:54,952 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_b51a17f2-ca6f-445b-a410-259c192bf248/bin/uautomizer/../../sv-benchmarks/c/array-memsafety/cstrpbrk-alloca-2.i [2019-11-15 20:26:55,001 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_b51a17f2-ca6f-445b-a410-259c192bf248/bin/uautomizer/data/92e5b134f/dd41dceb377344dc90b39e6dae42bd5c/FLAG40bc72ec5 [2019-11-15 20:26:55,493 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 20:26:55,493 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_b51a17f2-ca6f-445b-a410-259c192bf248/sv-benchmarks/c/array-memsafety/cstrpbrk-alloca-2.i [2019-11-15 20:26:55,513 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_b51a17f2-ca6f-445b-a410-259c192bf248/bin/uautomizer/data/92e5b134f/dd41dceb377344dc90b39e6dae42bd5c/FLAG40bc72ec5 [2019-11-15 20:26:55,790 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_b51a17f2-ca6f-445b-a410-259c192bf248/bin/uautomizer/data/92e5b134f/dd41dceb377344dc90b39e6dae42bd5c [2019-11-15 20:26:55,792 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 20:26:55,793 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 20:26:55,794 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 20:26:55,794 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 20:26:55,802 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 20:26:55,802 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:26:55" (1/1) ... [2019-11-15 20:26:55,805 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23a016cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:26:55, skipping insertion in model container [2019-11-15 20:26:55,805 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:26:55" (1/1) ... [2019-11-15 20:26:55,811 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 20:26:55,849 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 20:26:56,226 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:26:56,236 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 20:26:56,296 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:26:56,349 INFO L192 MainTranslator]: Completed translation [2019-11-15 20:26:56,350 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:26:56 WrapperNode [2019-11-15 20:26:56,350 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 20:26:56,351 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 20:26:56,351 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 20:26:56,351 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 20:26:56,358 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:26:56" (1/1) ... [2019-11-15 20:26:56,376 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:26:56" (1/1) ... [2019-11-15 20:26:56,399 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 20:26:56,399 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 20:26:56,399 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 20:26:56,399 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 20:26:56,407 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:26:56" (1/1) ... [2019-11-15 20:26:56,408 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:26:56" (1/1) ... [2019-11-15 20:26:56,411 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:26:56" (1/1) ... [2019-11-15 20:26:56,411 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:26:56" (1/1) ... [2019-11-15 20:26:56,419 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:26:56" (1/1) ... [2019-11-15 20:26:56,423 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:26:56" (1/1) ... [2019-11-15 20:26:56,425 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:26:56" (1/1) ... [2019-11-15 20:26:56,429 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 20:26:56,429 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 20:26:56,429 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 20:26:56,429 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 20:26:56,430 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:26:56" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b51a17f2-ca6f-445b-a410-259c192bf248/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 20:26:56,492 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 20:26:56,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 20:26:56,493 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 20:26:56,493 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 20:26:56,493 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 20:26:56,493 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 20:26:56,820 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 20:26:56,820 INFO L284 CfgBuilder]: Removed 10 assume(true) statements. [2019-11-15 20:26:56,821 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:26:56 BoogieIcfgContainer [2019-11-15 20:26:56,821 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 20:26:56,822 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-15 20:26:56,822 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-15 20:26:56,825 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-15 20:26:56,826 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 20:26:56,826 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.11 08:26:55" (1/3) ... [2019-11-15 20:26:56,827 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@297bfdd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 08:26:56, skipping insertion in model container [2019-11-15 20:26:56,827 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 20:26:56,827 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:26:56" (2/3) ... [2019-11-15 20:26:56,828 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@297bfdd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 08:26:56, skipping insertion in model container [2019-11-15 20:26:56,828 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 20:26:56,828 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:26:56" (3/3) ... [2019-11-15 20:26:56,829 INFO L371 chiAutomizerObserver]: Analyzing ICFG cstrpbrk-alloca-2.i [2019-11-15 20:26:56,869 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-15 20:26:56,869 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-15 20:26:56,869 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-15 20:26:56,870 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 20:26:56,870 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 20:26:56,870 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-15 20:26:56,870 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 20:26:56,870 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-15 20:26:56,883 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states. [2019-11-15 20:26:56,903 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2019-11-15 20:26:56,903 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:26:56,903 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:26:56,909 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-15 20:26:56,909 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 20:26:56,909 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-15 20:26:56,909 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states. [2019-11-15 20:26:56,911 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2019-11-15 20:26:56,911 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:26:56,911 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:26:56,912 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-15 20:26:56,912 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 20:26:56,919 INFO L791 eck$LassoCheckResult]: Stem: 17#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 13#L-1true havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~nondet15, main_#t~post14, main_~i~0, main_#t~nondet17, main_#t~post16, main_~i~1, main_#t~ret18.base, main_#t~ret18.offset, 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~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 14#L532true assume !(main_~length1~0 < 1); 18#L532-2true assume !(main_~length2~0 < 1); 9#L535-1true call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;main_~i~0 := 0; 25#L541-3true [2019-11-15 20:26:56,919 INFO L793 eck$LassoCheckResult]: Loop: 25#L541-3true assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet15; 22#L541-2true main_#t~post14 := main_~i~0;main_~i~0 := 1 + main_#t~post14;havoc main_#t~post14; 25#L541-3true [2019-11-15 20:26:56,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:26:56,925 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2019-11-15 20:26:56,931 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:26:56,932 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21201539] [2019-11-15 20:26:56,932 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:26:56,932 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:26:56,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:26:57,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:26:57,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:26:57,035 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:26:57,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:26:57,036 INFO L82 PathProgramCache]: Analyzing trace with hash 1699, now seen corresponding path program 1 times [2019-11-15 20:26:57,036 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:26:57,037 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247067369] [2019-11-15 20:26:57,037 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:26:57,037 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:26:57,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:26:57,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:26:57,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:26:57,055 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:26:57,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:26:57,056 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935720, now seen corresponding path program 1 times [2019-11-15 20:26:57,057 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:26:57,057 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930715910] [2019-11-15 20:26:57,057 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:26:57,057 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:26:57,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:26:57,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:26:57,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:26:57,103 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:26:57,349 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 20:26:57,349 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 20:26:57,349 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 20:26:57,350 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 20:26:57,350 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 20:26:57,350 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:26:57,351 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 20:26:57,351 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 20:26:57,352 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrpbrk-alloca-2.i_Iteration1_Lasso [2019-11-15 20:26:57,352 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 20:26:57,352 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 20:26:57,391 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:26:57,399 INFO 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 20:26:57,401 INFO 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 20:26:57,403 INFO 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 20:26:57,409 INFO 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 20:26:57,414 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:26:57,417 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:26:57,590 INFO 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 20:26:57,592 INFO 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 20:26:57,595 INFO 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 20:26:57,605 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:26:57,607 INFO 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 20:26:57,609 INFO 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 20:26:57,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 20:26:57,619 INFO 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 20:26:57,623 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:26:58,010 WARN L191 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 25 [2019-11-15 20:26:58,110 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 20:26:58,115 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 20:26:58,117 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 20:26:58,118 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:26:58,119 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:26:58,119 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:26:58,119 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:26:58,120 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:26:58,121 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:26:58,122 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:26:58,124 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:26:58,125 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 20:26:58,126 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:26:58,126 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:26:58,126 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:26:58,127 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:26:58,127 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:26:58,127 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:26:58,127 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:26:58,128 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:26:58,129 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 20:26:58,130 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:26:58,130 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:26:58,130 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:26:58,130 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:26:58,131 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:26:58,131 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:26:58,131 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:26:58,132 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:26:58,133 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 20:26:58,133 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:26:58,134 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:26:58,134 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:26:58,134 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:26:58,134 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:26:58,135 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:26:58,135 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:26:58,136 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:26:58,136 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 20:26:58,137 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:26:58,138 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:26:58,138 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:26:58,138 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:26:58,140 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:26:58,141 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:26:58,144 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:26:58,145 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 20:26:58,146 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:26:58,146 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:26:58,146 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:26:58,146 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:26:58,148 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:26:58,149 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:26:58,152 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:26:58,153 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 20:26:58,154 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:26:58,154 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:26:58,154 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:26:58,155 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:26:58,157 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:26:58,157 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:26:58,174 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:26:58,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 20:26:58,175 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:26:58,175 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:26:58,175 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:26:58,175 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:26:58,177 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:26:58,189 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:26:58,194 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:26:58,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 20:26:58,195 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:26:58,196 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:26:58,196 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:26:58,196 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:26:58,196 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:26:58,197 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:26:58,197 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:26:58,198 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:26:58,198 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:26:58,199 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:26:58,199 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-11-15 20:26:58,199 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:26:58,199 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:26:58,218 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-11-15 20:26:58,219 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:26:58,281 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:26:58,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 20:26:58,286 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:26:58,286 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:26:58,286 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:26:58,286 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:26:58,289 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:26:58,289 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:26:58,344 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 20:26:58,402 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-11-15 20:26:58,403 INFO L444 ModelExtractionUtils]: 16 out of 22 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-11-15 20:26:58,406 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 20:26:58,409 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 20:26:58,409 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 20:26:58,410 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_~i~0, v_rep(select #length ULTIMATE.start_main_#t~malloc12.base)_1) = -1*ULTIMATE.start_main_~nondetString1~0.offset - 1*ULTIMATE.start_main_~i~0 + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc12.base)_1 Supporting invariants [] [2019-11-15 20:26:58,427 INFO L297 tatePredicateManager]: 5 out of 6 supporting invariants were superfluous and have been removed [2019-11-15 20:26:58,436 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-15 20:26:58,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:26:58,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:26:58,505 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 20:26:58,507 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:26:58,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:26:58,523 WARN L254 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 20:26:58,524 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:26:58,541 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 20:26:58,557 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 20:26:58,558 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states. Second operand 3 states. [2019-11-15 20:26:58,674 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states.. Second operand 3 states. Result 57 states and 84 transitions. Complement of second has 8 states. [2019-11-15 20:26:58,674 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 20:26:58,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 20:26:58,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 56 transitions. [2019-11-15 20:26:58,678 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 56 transitions. Stem has 5 letters. Loop has 2 letters. [2019-11-15 20:26:58,679 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:26:58,679 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 56 transitions. Stem has 7 letters. Loop has 2 letters. [2019-11-15 20:26:58,679 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:26:58,680 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 56 transitions. Stem has 5 letters. Loop has 4 letters. [2019-11-15 20:26:58,680 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:26:58,681 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 84 transitions. [2019-11-15 20:26:58,685 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-11-15 20:26:58,689 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 20 states and 27 transitions. [2019-11-15 20:26:58,690 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2019-11-15 20:26:58,690 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2019-11-15 20:26:58,691 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 27 transitions. [2019-11-15 20:26:58,691 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 20:26:58,691 INFO L688 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2019-11-15 20:26:58,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 27 transitions. [2019-11-15 20:26:58,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-11-15 20:26:58,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-11-15 20:26:58,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 27 transitions. [2019-11-15 20:26:58,719 INFO L711 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2019-11-15 20:26:58,719 INFO L591 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2019-11-15 20:26:58,719 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-15 20:26:58,719 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 27 transitions. [2019-11-15 20:26:58,723 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-11-15 20:26:58,723 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:26:58,723 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:26:58,724 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:26:58,724 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 20:26:58,725 INFO L791 eck$LassoCheckResult]: Stem: 175#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 170#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~nondet15, main_#t~post14, main_~i~0, main_#t~nondet17, main_#t~post16, main_~i~1, main_#t~ret18.base, main_#t~ret18.offset, 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~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 171#L532 assume !(main_~length1~0 < 1); 172#L532-2 assume !(main_~length2~0 < 1); 166#L535-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;main_~i~0 := 0; 167#L541-3 assume !(main_~i~0 < main_~length1~0 - 1); 163#L541-4 main_~i~1 := 0; 164#L546-3 [2019-11-15 20:26:58,725 INFO L793 eck$LassoCheckResult]: Loop: 164#L546-3 assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet17, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet17; 168#L546-2 main_#t~post16 := main_~i~1;main_~i~1 := 1 + main_#t~post16;havoc main_#t~post16; 164#L546-3 [2019-11-15 20:26:58,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:26:58,729 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935662, now seen corresponding path program 1 times [2019-11-15 20:26:58,729 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:26:58,729 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113542368] [2019-11-15 20:26:58,729 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:26:58,730 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:26:58,730 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:26:58,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:26:58,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:26:58,775 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:26:58,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:26:58,780 INFO L82 PathProgramCache]: Analyzing trace with hash 2147, now seen corresponding path program 1 times [2019-11-15 20:26:58,780 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:26:58,782 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503749297] [2019-11-15 20:26:58,788 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:26:58,788 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:26:58,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:26:58,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:26:58,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:26:58,798 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:26:58,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:26:58,798 INFO L82 PathProgramCache]: Analyzing trace with hash 1298384784, now seen corresponding path program 1 times [2019-11-15 20:26:58,798 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:26:58,799 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460878949] [2019-11-15 20:26:58,799 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:26:58,799 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:26:58,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:26:58,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:26:58,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:26:58,834 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:26:58,982 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2019-11-15 20:26:59,077 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 20:26:59,077 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 20:26:59,077 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 20:26:59,078 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 20:26:59,078 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 20:26:59,078 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:26:59,078 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 20:26:59,078 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 20:26:59,078 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrpbrk-alloca-2.i_Iteration2_Lasso [2019-11-15 20:26:59,078 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 20:26:59,079 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 20:26:59,082 INFO 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 20:26:59,087 INFO 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 20:26:59,089 INFO 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 20:26:59,091 INFO 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 20:26:59,093 INFO 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 20:26:59,095 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:26:59,098 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:26:59,103 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:26:59,106 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:26:59,109 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:26:59,111 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:26:59,248 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2019-11-15 20:26:59,276 INFO 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 20:26:59,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 20:26:59,282 INFO 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 20:26:59,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 20:26:59,666 WARN L191 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 25 [2019-11-15 20:26:59,705 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 20:26:59,705 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 20:26:59,706 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 20:26:59,707 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:26:59,707 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:26:59,707 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:26:59,707 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:26:59,707 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:26:59,708 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:26:59,708 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:26:59,708 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:26:59,709 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 20:26:59,709 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:26:59,709 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:26:59,709 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:26:59,709 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:26:59,710 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:26:59,710 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:26:59,710 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:26:59,710 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:26:59,711 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 20:26:59,711 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:26:59,711 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:26:59,711 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:26:59,712 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:26:59,712 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:26:59,712 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:26:59,712 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:26:59,713 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:26:59,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 20:26:59,713 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:26:59,713 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:26:59,714 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:26:59,714 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:26:59,714 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:26:59,714 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:26:59,714 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:26:59,715 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:26:59,715 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 20:26:59,715 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:26:59,716 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:26:59,716 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:26:59,716 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:26:59,717 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:26:59,717 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:26:59,725 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:26:59,725 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 20:26:59,726 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:26:59,726 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:26:59,726 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:26:59,726 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:26:59,727 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:26:59,728 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:26:59,728 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:26:59,728 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:26:59,729 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 20:26:59,729 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:26:59,729 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:26:59,729 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:26:59,730 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:26:59,731 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:26:59,731 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:26:59,733 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:26:59,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 20:26:59,734 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:26:59,734 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:26:59,734 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:26:59,734 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:26:59,735 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:26:59,735 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:26:59,737 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:26:59,737 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 20:26:59,737 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:26:59,737 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:26:59,738 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:26:59,738 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:26:59,739 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:26:59,739 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:26:59,747 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:26:59,748 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:26:59,748 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:26:59,748 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:26:59,750 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:26:59,751 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:26:59,751 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:26:59,751 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:26:59,751 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:26:59,752 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:26:59,752 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:26:59,752 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:26:59,753 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:26:59,753 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:26:59,753 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:26:59,754 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:26:59,754 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:26:59,758 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:26:59,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 20:26:59,758 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:26:59,759 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:26:59,759 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:26:59,759 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:26:59,761 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:26:59,761 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:26:59,785 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 20:26:59,794 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-15 20:26:59,794 INFO L444 ModelExtractionUtils]: 18 out of 22 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 20:26:59,795 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 20:26:59,796 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 20:26:59,796 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 20:26:59,796 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 20:26:59,810 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2019-11-15 20:26:59,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:26:59,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:26:59,838 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 20:26:59,838 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:26:59,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:26:59,843 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 20:26:59,844 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:26:59,862 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 20:26:59,862 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 20:26:59,862 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 27 transitions. cyclomatic complexity: 10 Second operand 3 states. [2019-11-15 20:26:59,884 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 27 transitions. cyclomatic complexity: 10. Second operand 3 states. Result 31 states and 44 transitions. Complement of second has 6 states. [2019-11-15 20:26:59,886 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 20:26:59,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 20:26:59,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 25 transitions. [2019-11-15 20:26:59,887 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 7 letters. Loop has 2 letters. [2019-11-15 20:26:59,888 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:26:59,888 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 9 letters. Loop has 2 letters. [2019-11-15 20:26:59,888 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:26:59,888 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 7 letters. Loop has 4 letters. [2019-11-15 20:26:59,888 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:26:59,888 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 44 transitions. [2019-11-15 20:26:59,889 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-15 20:26:59,890 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 21 states and 29 transitions. [2019-11-15 20:26:59,890 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-11-15 20:26:59,890 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-11-15 20:26:59,891 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 29 transitions. [2019-11-15 20:26:59,891 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 20:26:59,891 INFO L688 BuchiCegarLoop]: Abstraction has 21 states and 29 transitions. [2019-11-15 20:26:59,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 29 transitions. [2019-11-15 20:26:59,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-11-15 20:26:59,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-11-15 20:26:59,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 29 transitions. [2019-11-15 20:26:59,893 INFO L711 BuchiCegarLoop]: Abstraction has 21 states and 29 transitions. [2019-11-15 20:26:59,893 INFO L591 BuchiCegarLoop]: Abstraction has 21 states and 29 transitions. [2019-11-15 20:26:59,893 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-15 20:26:59,893 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 29 transitions. [2019-11-15 20:26:59,896 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-15 20:26:59,896 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:26:59,896 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:26:59,897 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:26:59,897 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:26:59,898 INFO L791 eck$LassoCheckResult]: Stem: 301#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 296#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~nondet15, main_#t~post14, main_~i~0, main_#t~nondet17, main_#t~post16, main_~i~1, main_#t~ret18.base, main_#t~ret18.offset, 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~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 297#L532 assume !(main_~length1~0 < 1); 298#L532-2 assume !(main_~length2~0 < 1); 291#L535-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;main_~i~0 := 0; 292#L541-3 assume !(main_~i~0 < main_~length1~0 - 1); 288#L541-4 main_~i~1 := 0; 289#L546-3 assume !(main_~i~1 < main_~length2~0 - 1); 295#L546-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);cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem4, cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~mem6, cstrpbrk_#t~short7, cstrpbrk_#t~mem9, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 287#L519-4 [2019-11-15 20:26:59,898 INFO L793 eck$LassoCheckResult]: Loop: 287#L519-4 call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 290#L519-1 assume !!(0 != cstrpbrk_#t~mem3);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; 302#L522-5 call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := 0 != cstrpbrk_#t~mem5; 299#L522-1 assume cstrpbrk_#t~short7;call cstrpbrk_#t~mem6 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := cstrpbrk_#t~mem6 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 300#L522-3 assume !cstrpbrk_#t~short7;havoc cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~mem6; 284#L522-6 call cstrpbrk_#t~mem9 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); 285#L524 assume !(cstrpbrk_#t~mem9 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem9; 286#L519-3 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset; 287#L519-4 [2019-11-15 20:26:59,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:26:59,898 INFO L82 PathProgramCache]: Analyzing trace with hash 1298384726, now seen corresponding path program 1 times [2019-11-15 20:26:59,899 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:26:59,899 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474548315] [2019-11-15 20:26:59,899 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:26:59,899 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:26:59,899 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:26:59,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:26:59,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:26:59,951 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:26:59,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:26:59,952 INFO L82 PathProgramCache]: Analyzing trace with hash -904885455, now seen corresponding path program 1 times [2019-11-15 20:26:59,952 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:26:59,952 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356167651] [2019-11-15 20:26:59,952 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:26:59,953 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:26:59,953 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:26:59,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:26:59,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:26:59,977 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:26:59,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:26:59,978 INFO L82 PathProgramCache]: Analyzing trace with hash 1903570310, now seen corresponding path program 1 times [2019-11-15 20:26:59,978 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:26:59,978 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390006139] [2019-11-15 20:26:59,978 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:26:59,979 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:26:59,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:27:00,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:27:00,208 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 20:27:00,208 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390006139] [2019-11-15 20:27:00,209 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:27:00,209 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-15 20:27:00,209 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863214627] [2019-11-15 20:27:00,385 WARN L191 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2019-11-15 20:27:00,618 WARN L191 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2019-11-15 20:27:00,619 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:27:00,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 20:27:00,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-15 20:27:00,621 INFO L87 Difference]: Start difference. First operand 21 states and 29 transitions. cyclomatic complexity: 11 Second operand 10 states. [2019-11-15 20:27:00,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:27:00,953 INFO L93 Difference]: Finished difference Result 50 states and 66 transitions. [2019-11-15 20:27:00,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-15 20:27:00,954 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 66 transitions. [2019-11-15 20:27:00,955 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2019-11-15 20:27:00,957 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 48 states and 64 transitions. [2019-11-15 20:27:00,957 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2019-11-15 20:27:00,958 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2019-11-15 20:27:00,958 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 64 transitions. [2019-11-15 20:27:00,958 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 20:27:00,958 INFO L688 BuchiCegarLoop]: Abstraction has 48 states and 64 transitions. [2019-11-15 20:27:00,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states and 64 transitions. [2019-11-15 20:27:00,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 32. [2019-11-15 20:27:00,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-15 20:27:00,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 44 transitions. [2019-11-15 20:27:00,962 INFO L711 BuchiCegarLoop]: Abstraction has 32 states and 44 transitions. [2019-11-15 20:27:00,962 INFO L591 BuchiCegarLoop]: Abstraction has 32 states and 44 transitions. [2019-11-15 20:27:00,963 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-15 20:27:00,963 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 44 transitions. [2019-11-15 20:27:00,964 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2019-11-15 20:27:00,964 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:27:00,964 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:27:00,964 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:27:00,964 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 20:27:00,965 INFO L791 eck$LassoCheckResult]: Stem: 406#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 400#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~nondet15, main_#t~post14, main_~i~0, main_#t~nondet17, main_#t~post16, main_~i~1, main_#t~ret18.base, main_#t~ret18.offset, 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~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 401#L532 assume !(main_~length1~0 < 1); 402#L532-2 assume !(main_~length2~0 < 1); 393#L535-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;main_~i~0 := 0; 394#L541-3 assume !(main_~i~0 < main_~length1~0 - 1); 390#L541-4 main_~i~1 := 0; 391#L546-3 assume !(main_~i~1 < main_~length2~0 - 1); 397#L546-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);cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem4, cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~mem6, cstrpbrk_#t~short7, cstrpbrk_#t~mem9, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 416#L519-4 call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 415#L519-1 assume !!(0 != cstrpbrk_#t~mem3);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; 408#L522-5 [2019-11-15 20:27:00,965 INFO L793 eck$LassoCheckResult]: Loop: 408#L522-5 call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := 0 != cstrpbrk_#t~mem5; 413#L522-1 assume cstrpbrk_#t~short7;call cstrpbrk_#t~mem6 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := cstrpbrk_#t~mem6 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 407#L522-3 assume !!cstrpbrk_#t~short7;havoc cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~mem6;cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset := cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_#t~post8.base, 1 + cstrpbrk_#t~post8.offset;havoc cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset; 408#L522-5 [2019-11-15 20:27:00,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:27:00,965 INFO L82 PathProgramCache]: Analyzing trace with hash -2087759941, now seen corresponding path program 1 times [2019-11-15 20:27:00,965 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:27:00,965 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618967807] [2019-11-15 20:27:00,965 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:27:00,966 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:27:00,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:27:00,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:27:01,083 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 20:27:01,084 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618967807] [2019-11-15 20:27:01,084 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:27:01,084 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 20:27:01,084 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042758258] [2019-11-15 20:27:01,084 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 20:27:01,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:27:01,085 INFO L82 PathProgramCache]: Analyzing trace with hash 86496, now seen corresponding path program 1 times [2019-11-15 20:27:01,085 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:27:01,085 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846133968] [2019-11-15 20:27:01,085 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:27:01,085 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:27:01,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:27:01,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:27:01,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:27:01,093 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:27:01,254 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:27:01,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 20:27:01,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:27:01,254 INFO L87 Difference]: Start difference. First operand 32 states and 44 transitions. cyclomatic complexity: 17 Second operand 7 states. [2019-11-15 20:27:01,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:27:01,326 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2019-11-15 20:27:01,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 20:27:01,327 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 38 transitions. [2019-11-15 20:27:01,328 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-15 20:27:01,328 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 22 states and 29 transitions. [2019-11-15 20:27:01,328 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2019-11-15 20:27:01,329 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-11-15 20:27:01,329 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 29 transitions. [2019-11-15 20:27:01,329 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 20:27:01,329 INFO L688 BuchiCegarLoop]: Abstraction has 22 states and 29 transitions. [2019-11-15 20:27:01,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 29 transitions. [2019-11-15 20:27:01,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2019-11-15 20:27:01,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-11-15 20:27:01,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 28 transitions. [2019-11-15 20:27:01,331 INFO L711 BuchiCegarLoop]: Abstraction has 21 states and 28 transitions. [2019-11-15 20:27:01,331 INFO L591 BuchiCegarLoop]: Abstraction has 21 states and 28 transitions. [2019-11-15 20:27:01,331 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-15 20:27:01,331 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 28 transitions. [2019-11-15 20:27:01,332 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-15 20:27:01,332 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:27:01,332 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:27:01,333 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:27:01,333 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:27:01,333 INFO L791 eck$LassoCheckResult]: Stem: 478#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 473#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~nondet15, main_#t~post14, main_~i~0, main_#t~nondet17, main_#t~post16, main_~i~1, main_#t~ret18.base, main_#t~ret18.offset, 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~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 474#L532 assume !(main_~length1~0 < 1); 475#L532-2 assume !(main_~length2~0 < 1); 468#L535-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;main_~i~0 := 0; 469#L541-3 assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet15; 480#L541-2 main_#t~post14 := main_~i~0;main_~i~0 := 1 + main_#t~post14;havoc main_#t~post14; 481#L541-3 assume !(main_~i~0 < main_~length1~0 - 1); 465#L541-4 main_~i~1 := 0; 466#L546-3 assume !(main_~i~1 < main_~length2~0 - 1); 472#L546-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);cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem4, cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~mem6, cstrpbrk_#t~short7, cstrpbrk_#t~mem9, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 464#L519-4 [2019-11-15 20:27:01,333 INFO L793 eck$LassoCheckResult]: Loop: 464#L519-4 call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 467#L519-1 assume !!(0 != cstrpbrk_#t~mem3);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; 479#L522-5 call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := 0 != cstrpbrk_#t~mem5; 476#L522-1 assume cstrpbrk_#t~short7;call cstrpbrk_#t~mem6 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := cstrpbrk_#t~mem6 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 477#L522-3 assume !cstrpbrk_#t~short7;havoc cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~mem6; 461#L522-6 call cstrpbrk_#t~mem9 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); 462#L524 assume !(cstrpbrk_#t~mem9 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem9; 463#L519-3 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset; 464#L519-4 [2019-11-15 20:27:01,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:27:01,333 INFO L82 PathProgramCache]: Analyzing trace with hash -2034626632, now seen corresponding path program 1 times [2019-11-15 20:27:01,333 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:27:01,334 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30179933] [2019-11-15 20:27:01,334 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:27:01,334 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:27:01,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:27:01,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:27:01,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:27:01,364 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:27:01,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:27:01,365 INFO L82 PathProgramCache]: Analyzing trace with hash -904885455, now seen corresponding path program 2 times [2019-11-15 20:27:01,365 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:27:01,365 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279831015] [2019-11-15 20:27:01,366 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:27:01,366 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:27:01,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:27:01,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:27:01,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:27:01,385 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:27:01,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:27:01,385 INFO L82 PathProgramCache]: Analyzing trace with hash -164170776, now seen corresponding path program 1 times [2019-11-15 20:27:01,385 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:27:01,386 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71758591] [2019-11-15 20:27:01,386 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:27:01,386 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:27:01,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:27:01,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:27:01,545 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 20:27:01,545 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71758591] [2019-11-15 20:27:01,545 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:27:01,545 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-15 20:27:01,545 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958718012] [2019-11-15 20:27:01,648 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2019-11-15 20:27:01,804 WARN L191 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2019-11-15 20:27:01,804 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:27:01,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 20:27:01,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-11-15 20:27:01,804 INFO L87 Difference]: Start difference. First operand 21 states and 28 transitions. cyclomatic complexity: 10 Second operand 10 states. [2019-11-15 20:27:01,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:27:01,959 INFO L93 Difference]: Finished difference Result 36 states and 46 transitions. [2019-11-15 20:27:01,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 20:27:01,960 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 46 transitions. [2019-11-15 20:27:01,961 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 [2019-11-15 20:27:01,961 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 34 states and 44 transitions. [2019-11-15 20:27:01,961 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2019-11-15 20:27:01,962 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2019-11-15 20:27:01,962 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 44 transitions. [2019-11-15 20:27:01,962 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 20:27:01,962 INFO L688 BuchiCegarLoop]: Abstraction has 34 states and 44 transitions. [2019-11-15 20:27:01,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 44 transitions. [2019-11-15 20:27:01,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2019-11-15 20:27:01,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-15 20:27:01,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 43 transitions. [2019-11-15 20:27:01,965 INFO L711 BuchiCegarLoop]: Abstraction has 33 states and 43 transitions. [2019-11-15 20:27:01,965 INFO L591 BuchiCegarLoop]: Abstraction has 33 states and 43 transitions. [2019-11-15 20:27:01,965 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-15 20:27:01,966 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 43 transitions. [2019-11-15 20:27:01,966 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 [2019-11-15 20:27:01,967 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:27:01,967 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:27:01,967 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:27:01,967 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:27:01,968 INFO L791 eck$LassoCheckResult]: Stem: 563#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 558#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~nondet15, main_#t~post14, main_~i~0, main_#t~nondet17, main_#t~post16, main_~i~1, main_#t~ret18.base, main_#t~ret18.offset, 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~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 559#L532 assume !(main_~length1~0 < 1); 560#L532-2 assume !(main_~length2~0 < 1); 552#L535-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;main_~i~0 := 0; 553#L541-3 assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet15; 568#L541-2 main_#t~post14 := main_~i~0;main_~i~0 := 1 + main_#t~post14;havoc main_#t~post14; 569#L541-3 assume !(main_~i~0 < main_~length1~0 - 1); 547#L541-4 main_~i~1 := 0; 548#L546-3 assume !(main_~i~1 < main_~length2~0 - 1); 556#L546-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);cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem4, cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~mem6, cstrpbrk_#t~short7, cstrpbrk_#t~mem9, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 549#L519-4 [2019-11-15 20:27:01,968 INFO L793 eck$LassoCheckResult]: Loop: 549#L519-4 call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 550#L519-1 assume !!(0 != cstrpbrk_#t~mem3);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; 571#L522-5 call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := 0 != cstrpbrk_#t~mem5; 570#L522-1 assume cstrpbrk_#t~short7;call cstrpbrk_#t~mem6 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := cstrpbrk_#t~mem6 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 564#L522-3 assume !!cstrpbrk_#t~short7;havoc cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~mem6;cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset := cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_#t~post8.base, 1 + cstrpbrk_#t~post8.offset;havoc cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset; 565#L522-5 call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := 0 != cstrpbrk_#t~mem5; 561#L522-1 assume cstrpbrk_#t~short7;call cstrpbrk_#t~mem6 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := cstrpbrk_#t~mem6 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 562#L522-3 assume !cstrpbrk_#t~short7;havoc cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~mem6; 543#L522-6 call cstrpbrk_#t~mem9 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); 544#L524 assume !(cstrpbrk_#t~mem9 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem9; 551#L519-3 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset; 549#L519-4 [2019-11-15 20:27:01,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:27:01,968 INFO L82 PathProgramCache]: Analyzing trace with hash -2034626632, now seen corresponding path program 2 times [2019-11-15 20:27:01,968 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:27:01,969 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596857739] [2019-11-15 20:27:01,969 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:27:01,969 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:27:01,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:27:01,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:27:01,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:27:01,984 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:27:01,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:27:01,984 INFO L82 PathProgramCache]: Analyzing trace with hash -898285594, now seen corresponding path program 1 times [2019-11-15 20:27:01,984 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:27:01,985 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052529802] [2019-11-15 20:27:01,985 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:27:01,985 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:27:01,985 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:27:01,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:27:01,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:27:01,995 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:27:01,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:27:01,996 INFO L82 PathProgramCache]: Analyzing trace with hash -1809250353, now seen corresponding path program 1 times [2019-11-15 20:27:01,996 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:27:01,996 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422039951] [2019-11-15 20:27:01,996 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:27:01,997 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:27:01,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:27:02,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:27:02,174 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 20:27:02,174 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422039951] [2019-11-15 20:27:02,175 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:27:02,175 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-15 20:27:02,175 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645598836] [2019-11-15 20:27:02,390 WARN L191 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 75 [2019-11-15 20:27:02,616 WARN L191 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2019-11-15 20:27:02,617 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:27:02,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 20:27:02,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-15 20:27:02,617 INFO L87 Difference]: Start difference. First operand 33 states and 43 transitions. cyclomatic complexity: 14 Second operand 9 states. [2019-11-15 20:27:02,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:27:02,719 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2019-11-15 20:27:02,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 20:27:02,720 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 35 transitions. [2019-11-15 20:27:02,721 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2019-11-15 20:27:02,721 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 23 states and 29 transitions. [2019-11-15 20:27:02,721 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2019-11-15 20:27:02,722 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2019-11-15 20:27:02,722 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 29 transitions. [2019-11-15 20:27:02,722 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 20:27:02,722 INFO L688 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2019-11-15 20:27:02,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 29 transitions. [2019-11-15 20:27:02,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2019-11-15 20:27:02,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-11-15 20:27:02,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2019-11-15 20:27:02,724 INFO L711 BuchiCegarLoop]: Abstraction has 22 states and 28 transitions. [2019-11-15 20:27:02,724 INFO L591 BuchiCegarLoop]: Abstraction has 22 states and 28 transitions. [2019-11-15 20:27:02,724 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-15 20:27:02,724 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 28 transitions. [2019-11-15 20:27:02,725 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2019-11-15 20:27:02,725 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:27:02,725 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:27:02,726 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:27:02,726 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:27:02,726 INFO L791 eck$LassoCheckResult]: Stem: 645#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 639#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~nondet15, main_#t~post14, main_~i~0, main_#t~nondet17, main_#t~post16, main_~i~1, main_#t~ret18.base, main_#t~ret18.offset, 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~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 640#L532 assume !(main_~length1~0 < 1); 641#L532-2 assume !(main_~length2~0 < 1); 634#L535-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;main_~i~0 := 0; 635#L541-3 assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet15; 647#L541-2 main_#t~post14 := main_~i~0;main_~i~0 := 1 + main_#t~post14;havoc main_#t~post14; 648#L541-3 assume !(main_~i~0 < main_~length1~0 - 1); 631#L541-4 main_~i~1 := 0; 632#L546-3 assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet17, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet17; 636#L546-2 main_#t~post16 := main_~i~1;main_~i~1 := 1 + main_#t~post16;havoc main_#t~post16; 637#L546-3 assume !(main_~i~1 < main_~length2~0 - 1); 638#L546-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);cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem4, cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~mem6, cstrpbrk_#t~short7, cstrpbrk_#t~mem9, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 630#L519-4 [2019-11-15 20:27:02,726 INFO L793 eck$LassoCheckResult]: Loop: 630#L519-4 call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 633#L519-1 assume !!(0 != cstrpbrk_#t~mem3);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; 646#L522-5 call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := 0 != cstrpbrk_#t~mem5; 642#L522-1 assume cstrpbrk_#t~short7;call cstrpbrk_#t~mem6 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := cstrpbrk_#t~mem6 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 643#L522-3 assume !cstrpbrk_#t~short7;havoc cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~mem6; 627#L522-6 call cstrpbrk_#t~mem9 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); 628#L524 assume !(cstrpbrk_#t~mem9 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem9; 629#L519-3 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset; 630#L519-4 [2019-11-15 20:27:02,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:27:02,727 INFO L82 PathProgramCache]: Analyzing trace with hash -1066016806, now seen corresponding path program 1 times [2019-11-15 20:27:02,727 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:27:02,727 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48592944] [2019-11-15 20:27:02,727 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:27:02,727 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:27:02,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:27:02,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:27:02,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:27:02,747 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:27:02,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:27:02,748 INFO L82 PathProgramCache]: Analyzing trace with hash -904885455, now seen corresponding path program 3 times [2019-11-15 20:27:02,748 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:27:02,749 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043740642] [2019-11-15 20:27:02,749 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:27:02,749 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:27:02,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:27:02,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:27:02,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:27:02,758 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:27:02,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:27:02,759 INFO L82 PathProgramCache]: Analyzing trace with hash -1875279350, now seen corresponding path program 1 times [2019-11-15 20:27:02,759 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:27:02,759 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719307716] [2019-11-15 20:27:02,759 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:27:02,760 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:27:02,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:27:02,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:27:02,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:27:02,786 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:27:02,946 WARN L191 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2019-11-15 20:27:03,094 WARN L191 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2019-11-15 20:27:03,486 WARN L191 SmtUtils]: Spent 390.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 115 [2019-11-15 20:27:03,628 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2019-11-15 20:27:03,630 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 20:27:03,630 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 20:27:03,630 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 20:27:03,630 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 20:27:03,630 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 20:27:03,630 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:27:03,631 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 20:27:03,631 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 20:27:03,631 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrpbrk-alloca-2.i_Iteration7_Lasso [2019-11-15 20:27:03,631 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 20:27:03,631 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 20:27:03,636 INFO 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 20:27:03,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 20:27:03,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 20:27:03,648 INFO 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 20:27:03,650 INFO 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 20:27:03,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 20:27:03,655 INFO 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 20:27:03,657 INFO 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 20:27:03,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 20:27:03,661 INFO 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 20:27:03,663 INFO 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 20:27:03,665 INFO 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 20:27:03,668 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:27:03,669 INFO 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 20:27:03,672 INFO 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 20:27:03,674 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:27:03,676 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:27:03,677 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:27:03,679 INFO 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 20:27:03,682 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:27:03,684 INFO 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 20:27:03,686 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:27:03,688 INFO 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 20:27:03,690 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:27:04,028 WARN L191 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 84 [2019-11-15 20:27:04,202 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 67 [2019-11-15 20:27:04,203 INFO 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 20:27:04,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 20:27:04,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 20:27:04,835 WARN L191 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 40 [2019-11-15 20:27:05,097 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 20:27:05,098 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 20:27:05,098 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 20:27:05,099 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:27:05,099 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:27:05,099 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:27:05,099 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:27:05,099 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:27:05,100 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:27:05,100 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:27:05,101 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:27:05,101 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 20:27:05,101 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:27:05,102 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:27:05,102 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:27:05,102 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:27:05,102 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:27:05,102 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:27:05,103 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:27:05,103 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:27:05,103 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 20:27:05,104 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:27:05,104 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:27:05,104 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:27:05,104 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:27:05,104 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:27:05,105 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:27:05,105 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:27:05,105 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:27:05,105 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 20:27:05,106 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:27:05,106 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:27:05,106 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:27:05,106 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:27:05,106 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:27:05,107 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:27:05,107 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:27:05,107 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:27:05,108 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 20:27:05,108 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:27:05,108 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:27:05,108 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:27:05,108 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:27:05,109 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:27:05,109 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:27:05,109 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:27:05,109 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:27:05,110 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 20:27:05,110 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:27:05,110 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:27:05,110 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:27:05,111 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:27:05,111 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:27:05,111 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:27:05,111 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:27:05,112 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:27:05,112 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 20:27:05,112 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:27:05,112 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:27:05,113 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:27:05,113 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:27:05,113 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:27:05,113 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:27:05,113 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:27:05,114 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:27:05,114 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 20:27:05,114 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:27:05,115 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:27:05,115 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:27:05,115 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:27:05,115 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:27:05,115 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:27:05,116 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:27:05,116 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:27:05,116 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 20:27:05,117 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:27:05,117 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:27:05,117 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:27:05,117 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:27:05,118 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:27:05,118 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:27:05,119 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:27:05,119 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 20:27:05,120 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:27:05,120 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:27:05,120 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:27:05,120 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:27:05,121 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:27:05,121 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:27:05,122 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:27:05,122 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 20:27:05,123 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:27:05,123 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:27:05,123 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:27:05,123 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:27:05,123 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:27:05,124 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:27:05,124 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:27:05,124 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:27:05,124 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 20:27:05,125 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:27:05,125 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:27:05,125 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:27:05,125 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:27:05,125 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:27:05,126 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:27:05,126 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:27:05,126 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:27:05,127 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 20:27:05,127 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:27:05,127 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:27:05,127 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:27:05,127 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:27:05,128 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:27:05,128 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:27:05,128 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:27:05,128 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:27:05,129 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 20:27:05,129 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:27:05,129 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:27:05,129 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:27:05,130 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:27:05,130 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:27:05,130 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:27:05,131 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:27:05,132 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 20:27:05,132 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:27:05,132 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:27:05,133 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:27:05,133 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:27:05,133 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:27:05,133 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:27:05,133 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:27:05,134 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:27:05,134 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 20:27:05,134 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:27:05,135 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:27:05,135 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:27:05,135 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:27:05,135 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:27:05,135 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:27:05,135 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:27:05,136 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:27:05,136 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 20:27:05,136 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:27:05,137 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:27:05,137 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:27:05,137 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:27:05,137 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:27:05,137 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:27:05,138 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:27:05,138 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:27:05,138 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 20:27:05,139 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:27:05,139 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:27:05,139 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:27:05,139 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:27:05,139 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:27:05,140 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:27:05,140 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:27:05,140 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:27:05,140 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 20:27:05,141 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:27:05,141 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:27:05,141 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:27:05,141 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:27:05,141 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:27:05,142 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:27:05,142 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:27:05,142 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:27:05,143 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 20:27:05,143 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:27:05,143 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:27:05,143 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:27:05,144 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:27:05,144 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:27:05,144 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:27:05,146 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:27:05,146 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 20:27:05,147 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:27:05,147 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:27:05,147 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:27:05,147 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:27:05,147 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:27:05,148 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:27:05,148 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:27:05,148 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:27:05,149 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 20:27:05,149 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:27:05,149 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:27:05,149 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:27:05,149 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:27:05,150 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:27:05,150 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:27:05,150 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:27:05,150 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:27:05,151 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 20:27:05,151 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:27:05,151 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:27:05,151 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:27:05,152 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:27:05,152 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:27:05,152 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:27:05,152 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:27:05,153 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:27:05,153 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 20:27:05,153 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:27:05,154 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-11-15 20:27:05,154 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:27:05,154 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:27:05,157 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-11-15 20:27:05,157 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:27:05,171 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:27:05,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 20:27:05,172 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:27:05,172 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:27:05,172 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 20:27:05,172 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:27:05,176 INFO L400 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2019-11-15 20:27:05,176 INFO L401 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-11-15 20:27:05,192 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:27:05,192 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:27:05,193 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:27:05,193 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:27:05,193 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:27:05,193 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:27:05,194 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:27:05,194 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:27:05,196 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:27:05,196 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 20:27:05,196 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:27:05,197 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:27:05,197 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:27:05,197 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:27:05,198 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:27:05,198 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:27:05,199 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:27:05,199 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 20:27:05,199 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:27:05,200 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:27:05,200 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:27:05,200 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:27:05,200 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:27:05,200 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:27:05,200 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:27:05,201 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:27:05,202 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 20:27:05,202 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:27:05,202 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:27:05,202 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:27:05,203 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:27:05,203 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:27:05,203 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:27:05,204 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:27:05,205 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:27:05,205 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:27:05,205 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:27:05,205 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:27:05,206 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:27:05,206 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:27:05,206 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:27:05,208 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:27:05,208 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:27:05,209 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:27:05,209 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:27:05,209 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:27:05,209 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:27:05,212 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:27:05,212 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:27:05,237 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 20:27:05,258 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-15 20:27:05,258 INFO L444 ModelExtractionUtils]: 51 out of 55 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 20:27:05,258 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 20:27:05,259 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 20:27:05,259 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 20:27:05,259 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrpbrk_~sc1~0.offset, v_rep(select #length ULTIMATE.start_cstrpbrk_~sc1~0.base)_1) = -1*ULTIMATE.start_cstrpbrk_~sc1~0.offset + 1*v_rep(select #length ULTIMATE.start_cstrpbrk_~sc1~0.base)_1 Supporting invariants [] [2019-11-15 20:27:05,309 INFO L297 tatePredicateManager]: 15 out of 15 supporting invariants were superfluous and have been removed [2019-11-15 20:27:05,311 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-15 20:27:05,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:27:05,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:27:05,354 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 20:27:05,355 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:27:05,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:27:05,367 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 20:27:05,368 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:27:05,377 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 20:27:05,377 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 20:27:05,377 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 28 transitions. cyclomatic complexity: 9 Second operand 3 states. [2019-11-15 20:27:05,400 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 28 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 31 states and 40 transitions. Complement of second has 4 states. [2019-11-15 20:27:05,401 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 20:27:05,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 20:27:05,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 25 transitions. [2019-11-15 20:27:05,402 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 25 transitions. Stem has 13 letters. Loop has 8 letters. [2019-11-15 20:27:05,402 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:27:05,402 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 25 transitions. Stem has 21 letters. Loop has 8 letters. [2019-11-15 20:27:05,402 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:27:05,402 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 25 transitions. Stem has 13 letters. Loop has 16 letters. [2019-11-15 20:27:05,403 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:27:05,403 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 40 transitions. [2019-11-15 20:27:05,403 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 20:27:05,404 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 27 states and 35 transitions. [2019-11-15 20:27:05,404 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-11-15 20:27:05,404 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-11-15 20:27:05,404 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 35 transitions. [2019-11-15 20:27:05,404 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 20:27:05,404 INFO L688 BuchiCegarLoop]: Abstraction has 27 states and 35 transitions. [2019-11-15 20:27:05,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 35 transitions. [2019-11-15 20:27:05,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-11-15 20:27:05,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-15 20:27:05,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2019-11-15 20:27:05,405 INFO L711 BuchiCegarLoop]: Abstraction has 27 states and 35 transitions. [2019-11-15 20:27:05,405 INFO L591 BuchiCegarLoop]: Abstraction has 27 states and 35 transitions. [2019-11-15 20:27:05,406 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-15 20:27:05,406 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 35 transitions. [2019-11-15 20:27:05,406 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 20:27:05,406 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:27:05,406 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:27:05,406 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:27:05,406 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 20:27:05,407 INFO L791 eck$LassoCheckResult]: Stem: 845#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 837#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~nondet15, main_#t~post14, main_~i~0, main_#t~nondet17, main_#t~post16, main_~i~1, main_#t~ret18.base, main_#t~ret18.offset, 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~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 838#L532 assume !(main_~length1~0 < 1); 839#L532-2 assume !(main_~length2~0 < 1); 832#L535-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;main_~i~0 := 0; 833#L541-3 assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet15; 848#L541-2 main_#t~post14 := main_~i~0;main_~i~0 := 1 + main_#t~post14;havoc main_#t~post14; 849#L541-3 assume !(main_~i~0 < main_~length1~0 - 1); 827#L541-4 main_~i~1 := 0; 828#L546-3 assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet17, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet17; 834#L546-2 main_#t~post16 := main_~i~1;main_~i~1 := 1 + main_#t~post16;havoc main_#t~post16; 835#L546-3 assume !(main_~i~1 < main_~length2~0 - 1); 836#L546-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);cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem4, cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~mem6, cstrpbrk_#t~short7, cstrpbrk_#t~mem9, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 829#L519-4 call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 831#L519-1 assume !!(0 != cstrpbrk_#t~mem3);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; 846#L522-5 [2019-11-15 20:27:05,407 INFO L793 eck$LassoCheckResult]: Loop: 846#L522-5 call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := 0 != cstrpbrk_#t~mem5; 840#L522-1 assume cstrpbrk_#t~short7;call cstrpbrk_#t~mem6 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := cstrpbrk_#t~mem6 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 841#L522-3 assume !!cstrpbrk_#t~short7;havoc cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~mem6;cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset := cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_#t~post8.base, 1 + cstrpbrk_#t~post8.offset;havoc cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset; 846#L522-5 [2019-11-15 20:27:05,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:27:05,407 INFO L82 PathProgramCache]: Analyzing trace with hash 2055034687, now seen corresponding path program 1 times [2019-11-15 20:27:05,407 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:27:05,407 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320435195] [2019-11-15 20:27:05,407 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:27:05,407 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:27:05,407 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:27:05,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:27:05,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:27:05,425 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:27:05,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:27:05,425 INFO L82 PathProgramCache]: Analyzing trace with hash 86496, now seen corresponding path program 2 times [2019-11-15 20:27:05,425 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:27:05,425 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951891910] [2019-11-15 20:27:05,426 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:27:05,426 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:27:05,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:27:05,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:27:05,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:27:05,431 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:27:05,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:27:05,432 INFO L82 PathProgramCache]: Analyzing trace with hash 1074579938, now seen corresponding path program 1 times [2019-11-15 20:27:05,432 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:27:05,432 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165199242] [2019-11-15 20:27:05,432 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:27:05,432 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:27:05,433 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:27:05,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:27:05,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:27:05,453 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:27:06,079 WARN L191 SmtUtils]: Spent 475.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 129 [2019-11-15 20:27:06,282 WARN L191 SmtUtils]: Spent 200.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2019-11-15 20:27:06,284 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 20:27:06,284 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 20:27:06,284 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 20:27:06,284 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 20:27:06,284 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 20:27:06,285 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:27:06,285 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 20:27:06,285 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 20:27:06,285 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrpbrk-alloca-2.i_Iteration8_Lasso [2019-11-15 20:27:06,285 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 20:27:06,285 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 20:27:06,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 20:27:06,294 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:27:06,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 20:27:06,301 INFO 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 20:27:06,309 INFO 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 20:27:06,313 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:27:06,315 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:27:06,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 20:27:06,320 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:27:06,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 20:27:06,325 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:27:06,331 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:27:06,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 20:27:06,768 WARN L191 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 96 [2019-11-15 20:27:06,903 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 67 [2019-11-15 20:27:06,903 INFO 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 20:27:06,905 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:27:06,906 INFO 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 20:27:06,908 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:27:06,909 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:27:06,910 INFO 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 20:27:06,912 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:27:06,914 INFO 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 20:27:06,915 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:27:06,916 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:27:06,917 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:27:06,919 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:27:06,920 INFO 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 20:27:06,922 INFO 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 20:27:07,178 WARN L191 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-11-15 20:27:07,648 WARN L191 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-11-15 20:27:07,998 WARN L191 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 40 [2019-11-15 20:27:08,036 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 20:27:08,037 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 20:27:08,037 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 20:27:08,037 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:27:08,037 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:27:08,037 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:27:08,038 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:27:08,038 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:27:08,038 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:27:08,038 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:27:08,038 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:27:08,039 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 20:27:08,039 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:27:08,039 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:27:08,039 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:27:08,039 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:27:08,039 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:27:08,040 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:27:08,040 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:27:08,040 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:27:08,040 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 20:27:08,040 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:27:08,040 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:27:08,041 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:27:08,041 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:27:08,041 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:27:08,041 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:27:08,041 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:27:08,041 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:27:08,042 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 20:27:08,042 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:27:08,042 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:27:08,042 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:27:08,042 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:27:08,042 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:27:08,043 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:27:08,043 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:27:08,043 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:27:08,043 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 20:27:08,044 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:27:08,044 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:27:08,044 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:27:08,044 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:27:08,044 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:27:08,045 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:27:08,045 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:27:08,045 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:27:08,045 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 20:27:08,046 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:27:08,046 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:27:08,046 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:27:08,046 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:27:08,046 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:27:08,047 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:27:08,047 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:27:08,047 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:27:08,047 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 20:27:08,048 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:27:08,048 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:27:08,048 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:27:08,048 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:27:08,049 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:27:08,049 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:27:08,050 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:27:08,050 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 20:27:08,050 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:27:08,050 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:27:08,051 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:27:08,051 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:27:08,051 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:27:08,051 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:27:08,051 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:27:08,051 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:27:08,052 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 20:27:08,052 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:27:08,052 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:27:08,052 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:27:08,053 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:27:08,053 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:27:08,065 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:27:08,065 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:27:08,066 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:27:08,066 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 20:27:08,066 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:27:08,067 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:27:08,067 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:27:08,067 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:27:08,067 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:27:08,067 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:27:08,068 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:27:08,068 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:27:08,068 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 20:27:08,069 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:27:08,069 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:27:08,069 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:27:08,069 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:27:08,070 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:27:08,070 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:27:08,070 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:27:08,071 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 20:27:08,071 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:27:08,071 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:27:08,071 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:27:08,072 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:27:08,072 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:27:08,072 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:27:08,072 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:27:08,073 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:27:08,073 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 20:27:08,073 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:27:08,073 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:27:08,073 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:27:08,074 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:27:08,074 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:27:08,074 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:27:08,074 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:27:08,075 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 20:27:08,075 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:27:08,075 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:27:08,075 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:27:08,076 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:27:08,076 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:27:08,076 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:27:08,077 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:27:08,077 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 20:27:08,078 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:27:08,078 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-11-15 20:27:08,078 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:27:08,078 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:27:08,081 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-11-15 20:27:08,081 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:27:08,095 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:27:08,095 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 20:27:08,096 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:27:08,096 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:27:08,096 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:27:08,096 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:27:08,097 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:27:08,097 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:27:08,098 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:27:08,098 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 20:27:08,099 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:27:08,099 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:27:08,099 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:27:08,099 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:27:08,102 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:27:08,102 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:27:08,128 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 20:27:08,175 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2019-11-15 20:27:08,175 INFO L444 ModelExtractionUtils]: 49 out of 58 variables were initially zero. Simplification set additionally 6 variables to zero. [2019-11-15 20:27:08,176 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 20:27:08,176 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 20:27:08,177 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 20:27:08,177 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrpbrk_~s~0.offset, v_rep(select #length ULTIMATE.start_cstrpbrk_~s~0.base)_2) = -1*ULTIMATE.start_cstrpbrk_~s~0.offset + 1*v_rep(select #length ULTIMATE.start_cstrpbrk_~s~0.base)_2 Supporting invariants [] [2019-11-15 20:27:08,276 INFO L297 tatePredicateManager]: 24 out of 24 supporting invariants were superfluous and have been removed [2019-11-15 20:27:08,277 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-15 20:27:08,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:27:08,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:27:08,318 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 20:27:08,321 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:27:08,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:27:08,328 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 20:27:08,329 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:27:08,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:27:08,339 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 20:27:08,339 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 35 transitions. cyclomatic complexity: 12 Second operand 3 states. [2019-11-15 20:27:08,361 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 35 transitions. cyclomatic complexity: 12. Second operand 3 states. Result 54 states and 67 transitions. Complement of second has 5 states. [2019-11-15 20:27:08,363 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 20:27:08,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 20:27:08,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2019-11-15 20:27:08,363 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 26 transitions. Stem has 15 letters. Loop has 3 letters. [2019-11-15 20:27:08,364 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:27:08,364 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 26 transitions. Stem has 18 letters. Loop has 3 letters. [2019-11-15 20:27:08,364 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:27:08,364 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 26 transitions. Stem has 15 letters. Loop has 6 letters. [2019-11-15 20:27:08,364 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:27:08,364 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 67 transitions. [2019-11-15 20:27:08,365 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 20:27:08,366 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 40 states and 50 transitions. [2019-11-15 20:27:08,366 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2019-11-15 20:27:08,366 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2019-11-15 20:27:08,366 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 50 transitions. [2019-11-15 20:27:08,366 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 20:27:08,366 INFO L688 BuchiCegarLoop]: Abstraction has 40 states and 50 transitions. [2019-11-15 20:27:08,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 50 transitions. [2019-11-15 20:27:08,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 32. [2019-11-15 20:27:08,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-15 20:27:08,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2019-11-15 20:27:08,369 INFO L711 BuchiCegarLoop]: Abstraction has 32 states and 41 transitions. [2019-11-15 20:27:08,369 INFO L591 BuchiCegarLoop]: Abstraction has 32 states and 41 transitions. [2019-11-15 20:27:08,369 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-15 20:27:08,369 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 41 transitions. [2019-11-15 20:27:08,370 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 20:27:08,370 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:27:08,370 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:27:08,370 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, 1] [2019-11-15 20:27:08,371 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 20:27:08,371 INFO L791 eck$LassoCheckResult]: Stem: 1097#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1090#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~nondet15, main_#t~post14, main_~i~0, main_#t~nondet17, main_#t~post16, main_~i~1, main_#t~ret18.base, main_#t~ret18.offset, 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~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 1091#L532 assume !(main_~length1~0 < 1); 1092#L532-2 assume !(main_~length2~0 < 1); 1085#L535-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;main_~i~0 := 0; 1086#L541-3 assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet15; 1100#L541-2 main_#t~post14 := main_~i~0;main_~i~0 := 1 + main_#t~post14;havoc main_#t~post14; 1101#L541-3 assume !(main_~i~0 < main_~length1~0 - 1); 1079#L541-4 main_~i~1 := 0; 1080#L546-3 assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet17, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet17; 1087#L546-2 main_#t~post16 := main_~i~1;main_~i~1 := 1 + main_#t~post16;havoc main_#t~post16; 1088#L546-3 assume !(main_~i~1 < main_~length2~0 - 1); 1089#L546-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);cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem4, cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~mem6, cstrpbrk_#t~short7, cstrpbrk_#t~mem9, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 1081#L519-4 call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 1082#L519-1 assume !!(0 != cstrpbrk_#t~mem3);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; 1099#L522-5 call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := 0 != cstrpbrk_#t~mem5; 1095#L522-1 assume !cstrpbrk_#t~short7; 1096#L522-3 assume !cstrpbrk_#t~short7;havoc cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~mem6; 1075#L522-6 call cstrpbrk_#t~mem9 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); 1076#L524 assume !(cstrpbrk_#t~mem9 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem9; 1077#L519-3 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset; 1078#L519-4 call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 1084#L519-1 assume !!(0 != cstrpbrk_#t~mem3);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; 1098#L522-5 [2019-11-15 20:27:08,371 INFO L793 eck$LassoCheckResult]: Loop: 1098#L522-5 call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := 0 != cstrpbrk_#t~mem5; 1093#L522-1 assume cstrpbrk_#t~short7;call cstrpbrk_#t~mem6 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := cstrpbrk_#t~mem6 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 1094#L522-3 assume !!cstrpbrk_#t~short7;havoc cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~mem6;cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset := cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_#t~post8.base, 1 + cstrpbrk_#t~post8.offset;havoc cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset; 1098#L522-5 [2019-11-15 20:27:08,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:27:08,371 INFO L82 PathProgramCache]: Analyzing trace with hash -777149455, now seen corresponding path program 1 times [2019-11-15 20:27:08,371 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:27:08,371 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214243579] [2019-11-15 20:27:08,372 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:27:08,372 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:27:08,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:27:08,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:27:08,443 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 20:27:08,443 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214243579] [2019-11-15 20:27:08,443 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:27:08,443 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 20:27:08,444 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120334853] [2019-11-15 20:27:08,444 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 20:27:08,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:27:08,444 INFO L82 PathProgramCache]: Analyzing trace with hash 86496, now seen corresponding path program 3 times [2019-11-15 20:27:08,444 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:27:08,444 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498402537] [2019-11-15 20:27:08,445 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:27:08,445 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:27:08,445 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:27:08,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:27:08,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:27:08,451 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:27:08,640 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2019-11-15 20:27:08,641 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:27:08,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 20:27:08,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:27:08,641 INFO L87 Difference]: Start difference. First operand 32 states and 41 transitions. cyclomatic complexity: 14 Second operand 7 states. [2019-11-15 20:27:08,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:27:08,736 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2019-11-15 20:27:08,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 20:27:08,736 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 43 transitions. [2019-11-15 20:27:08,737 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 20:27:08,737 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 32 states and 39 transitions. [2019-11-15 20:27:08,738 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-11-15 20:27:08,738 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-11-15 20:27:08,738 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 39 transitions. [2019-11-15 20:27:08,738 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 20:27:08,738 INFO L688 BuchiCegarLoop]: Abstraction has 32 states and 39 transitions. [2019-11-15 20:27:08,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 39 transitions. [2019-11-15 20:27:08,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-11-15 20:27:08,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-15 20:27:08,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2019-11-15 20:27:08,740 INFO L711 BuchiCegarLoop]: Abstraction has 32 states and 39 transitions. [2019-11-15 20:27:08,740 INFO L591 BuchiCegarLoop]: Abstraction has 32 states and 39 transitions. [2019-11-15 20:27:08,740 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-11-15 20:27:08,741 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 39 transitions. [2019-11-15 20:27:08,741 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 20:27:08,741 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:27:08,741 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:27:08,742 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, 1] [2019-11-15 20:27:08,742 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 20:27:08,742 INFO L791 eck$LassoCheckResult]: Stem: 1182#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1175#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~nondet15, main_#t~post14, main_~i~0, main_#t~nondet17, main_#t~post16, main_~i~1, main_#t~ret18.base, main_#t~ret18.offset, 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~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 1176#L532 assume !(main_~length1~0 < 1); 1177#L532-2 assume !(main_~length2~0 < 1); 1170#L535-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;main_~i~0 := 0; 1171#L541-3 assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet15; 1187#L541-2 main_#t~post14 := main_~i~0;main_~i~0 := 1 + main_#t~post14;havoc main_#t~post14; 1188#L541-3 assume !(main_~i~0 < main_~length1~0 - 1); 1164#L541-4 main_~i~1 := 0; 1165#L546-3 assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet17, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet17; 1172#L546-2 main_#t~post16 := main_~i~1;main_~i~1 := 1 + main_#t~post16;havoc main_#t~post16; 1173#L546-3 assume !(main_~i~1 < main_~length2~0 - 1); 1174#L546-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);cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem4, cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~mem6, cstrpbrk_#t~short7, cstrpbrk_#t~mem9, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 1166#L519-4 call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 1167#L519-1 assume !!(0 != cstrpbrk_#t~mem3);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; 1185#L522-5 call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := 0 != cstrpbrk_#t~mem5; 1191#L522-1 assume cstrpbrk_#t~short7;call cstrpbrk_#t~mem6 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := cstrpbrk_#t~mem6 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 1189#L522-3 assume !cstrpbrk_#t~short7;havoc cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~mem6; 1160#L522-6 call cstrpbrk_#t~mem9 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); 1161#L524 assume !(cstrpbrk_#t~mem9 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem9; 1162#L519-3 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset; 1163#L519-4 call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 1169#L519-1 assume !!(0 != cstrpbrk_#t~mem3);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; 1183#L522-5 [2019-11-15 20:27:08,742 INFO L793 eck$LassoCheckResult]: Loop: 1183#L522-5 call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := 0 != cstrpbrk_#t~mem5; 1178#L522-1 assume cstrpbrk_#t~short7;call cstrpbrk_#t~mem6 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := cstrpbrk_#t~mem6 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 1179#L522-3 assume !!cstrpbrk_#t~short7;havoc cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~mem6;cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset := cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_#t~post8.base, 1 + cstrpbrk_#t~post8.offset;havoc cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset; 1183#L522-5 [2019-11-15 20:27:08,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:27:08,743 INFO L82 PathProgramCache]: Analyzing trace with hash 1742810479, now seen corresponding path program 2 times [2019-11-15 20:27:08,743 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:27:08,743 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426718220] [2019-11-15 20:27:08,743 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:27:08,743 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:27:08,743 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:27:08,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:27:09,047 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 20:27:09,047 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426718220] [2019-11-15 20:27:09,048 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [538169138] [2019-11-15 20:27:09,048 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b51a17f2-ca6f-445b-a410-259c192bf248/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 20:27:09,165 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 20:27:09,166 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 20:27:09,167 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 31 conjunts are in the unsatisfiable core [2019-11-15 20:27:09,169 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:27:09,202 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 20:27:09,203 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:27:09,211 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:27:09,212 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:27:09,212 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2019-11-15 20:27:09,301 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 20:27:09,301 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:27:09,312 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:27:09,313 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 20:27:09,314 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:47, output treesize:31 [2019-11-15 20:27:09,422 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:27:09,422 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 20:27:09,423 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-15 20:27:09,439 INFO L567 ElimStorePlain]: treesize reduction 8, result has 63.6 percent of original size [2019-11-15 20:27:09,439 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 20:27:09,440 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:38, output treesize:3 [2019-11-15 20:27:09,467 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 20:27:09,469 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:27:09,469 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2019-11-15 20:27:09,469 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859468779] [2019-11-15 20:27:09,472 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 20:27:09,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:27:09,473 INFO L82 PathProgramCache]: Analyzing trace with hash 86496, now seen corresponding path program 4 times [2019-11-15 20:27:09,473 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:27:09,474 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509667740] [2019-11-15 20:27:09,474 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:27:09,474 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:27:09,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:27:09,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:27:09,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:27:09,481 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:27:09,687 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2019-11-15 20:27:09,687 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:27:09,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-15 20:27:09,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2019-11-15 20:27:09,688 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. cyclomatic complexity: 12 Second operand 16 states. [2019-11-15 20:27:10,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:27:10,096 INFO L93 Difference]: Finished difference Result 53 states and 62 transitions. [2019-11-15 20:27:10,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 20:27:10,098 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 62 transitions. [2019-11-15 20:27:10,099 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 20:27:10,099 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 35 states and 42 transitions. [2019-11-15 20:27:10,099 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-11-15 20:27:10,099 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-11-15 20:27:10,099 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 42 transitions. [2019-11-15 20:27:10,100 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 20:27:10,100 INFO L688 BuchiCegarLoop]: Abstraction has 35 states and 42 transitions. [2019-11-15 20:27:10,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 42 transitions. [2019-11-15 20:27:10,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2019-11-15 20:27:10,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-11-15 20:27:10,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2019-11-15 20:27:10,102 INFO L711 BuchiCegarLoop]: Abstraction has 34 states and 41 transitions. [2019-11-15 20:27:10,102 INFO L591 BuchiCegarLoop]: Abstraction has 34 states and 41 transitions. [2019-11-15 20:27:10,102 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-11-15 20:27:10,102 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 41 transitions. [2019-11-15 20:27:10,103 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 20:27:10,103 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:27:10,103 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:27:10,107 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, 1] [2019-11-15 20:27:10,108 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 20:27:10,108 INFO L791 eck$LassoCheckResult]: Stem: 1366#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1359#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~nondet15, main_#t~post14, main_~i~0, main_#t~nondet17, main_#t~post16, main_~i~1, main_#t~ret18.base, main_#t~ret18.offset, 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~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 1360#L532 assume !(main_~length1~0 < 1); 1361#L532-2 assume !(main_~length2~0 < 1); 1354#L535-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;main_~i~0 := 0; 1355#L541-3 assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet15; 1371#L541-2 main_#t~post14 := main_~i~0;main_~i~0 := 1 + main_#t~post14;havoc main_#t~post14; 1372#L541-3 assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet15; 1374#L541-2 main_#t~post14 := main_~i~0;main_~i~0 := 1 + main_#t~post14;havoc main_#t~post14; 1376#L541-3 assume !(main_~i~0 < main_~length1~0 - 1); 1348#L541-4 main_~i~1 := 0; 1349#L546-3 assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet17, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet17; 1356#L546-2 main_#t~post16 := main_~i~1;main_~i~1 := 1 + main_#t~post16;havoc main_#t~post16; 1357#L546-3 assume !(main_~i~1 < main_~length2~0 - 1); 1358#L546-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);cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem4, cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~mem6, cstrpbrk_#t~short7, cstrpbrk_#t~mem9, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 1350#L519-4 call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 1351#L519-1 assume !!(0 != cstrpbrk_#t~mem3);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; 1369#L522-5 call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := 0 != cstrpbrk_#t~mem5; 1364#L522-1 assume cstrpbrk_#t~short7;call cstrpbrk_#t~mem6 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := cstrpbrk_#t~mem6 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 1365#L522-3 assume !cstrpbrk_#t~short7;havoc cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~mem6; 1344#L522-6 call cstrpbrk_#t~mem9 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); 1345#L524 assume !(cstrpbrk_#t~mem9 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem9; 1346#L519-3 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset; 1347#L519-4 call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 1353#L519-1 assume !!(0 != cstrpbrk_#t~mem3);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; 1367#L522-5 [2019-11-15 20:27:10,108 INFO L793 eck$LassoCheckResult]: Loop: 1367#L522-5 call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := 0 != cstrpbrk_#t~mem5; 1362#L522-1 assume cstrpbrk_#t~short7;call cstrpbrk_#t~mem6 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := cstrpbrk_#t~mem6 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 1363#L522-3 assume !!cstrpbrk_#t~short7;havoc cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~mem6;cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset := cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_#t~post8.base, 1 + cstrpbrk_#t~post8.offset;havoc cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset; 1367#L522-5 [2019-11-15 20:27:10,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:27:10,109 INFO L82 PathProgramCache]: Analyzing trace with hash -1365761455, now seen corresponding path program 3 times [2019-11-15 20:27:10,109 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:27:10,109 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871787574] [2019-11-15 20:27:10,109 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:27:10,109 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:27:10,109 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:27:10,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:27:10,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:27:10,165 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:27:10,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:27:10,166 INFO L82 PathProgramCache]: Analyzing trace with hash 86496, now seen corresponding path program 5 times [2019-11-15 20:27:10,166 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:27:10,170 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776148889] [2019-11-15 20:27:10,171 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:27:10,171 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:27:10,171 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:27:10,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:27:10,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:27:10,178 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:27:10,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:27:10,180 INFO L82 PathProgramCache]: Analyzing trace with hash -1174254192, now seen corresponding path program 1 times [2019-11-15 20:27:10,180 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:27:10,180 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825262101] [2019-11-15 20:27:10,180 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:27:10,181 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:27:10,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:27:10,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:27:10,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:27:10,238 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:27:10,425 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2019-11-15 20:27:11,876 WARN L191 SmtUtils]: Spent 1.45 s on a formula simplification. DAG size of input: 227 DAG size of output: 181 [2019-11-15 20:27:15,753 WARN L191 SmtUtils]: Spent 3.85 s on a formula simplification. DAG size of input: 140 DAG size of output: 140 [2019-11-15 20:27:15,755 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 20:27:15,756 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 20:27:15,756 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 20:27:15,756 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 20:27:15,756 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 20:27:15,756 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:27:15,756 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 20:27:15,756 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 20:27:15,756 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrpbrk-alloca-2.i_Iteration11_Lasso [2019-11-15 20:27:15,756 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 20:27:15,756 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 20:27:15,763 INFO 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 20:27:15,769 INFO 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 20:27:15,771 INFO 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 20:27:15,773 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:27:15,775 INFO 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 20:27:15,777 INFO 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 20:27:15,779 INFO 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 20:27:15,781 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:27:15,783 INFO 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 20:27:15,786 INFO 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 20:27:15,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 20:27:15,790 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:27:15,792 INFO 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 20:27:16,124 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-15 20:27:17,237 WARN L191 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 137 DAG size of output: 118 [2019-11-15 20:27:17,418 WARN L191 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 74 [2019-11-15 20:27:17,419 INFO 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 20:27:17,420 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:27:17,422 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:27:17,423 INFO 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 20:27:17,424 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:27:17,426 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:27:17,427 INFO 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 20:27:17,429 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:27:17,430 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:27:17,431 INFO 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 20:27:17,433 INFO 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 20:27:17,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 20:27:17,436 INFO 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 20:27:17,438 INFO 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 20:27:17,439 INFO 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 20:27:17,587 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-11-15 20:27:17,808 WARN L191 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 66 [2019-11-15 20:27:18,311 WARN L191 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 45 [2019-11-15 20:27:18,509 WARN L191 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 40 [2019-11-15 20:27:19,017 WARN L191 SmtUtils]: Spent 362.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-11-15 20:27:19,066 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 20:27:19,066 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 20:27:19,067 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 20:27:19,067 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:27:19,068 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:27:19,068 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:27:19,068 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:27:19,068 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:27:19,068 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:27:19,068 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:27:19,069 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:27:19,069 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 20:27:19,069 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:27:19,069 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:27:19,069 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:27:19,070 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:27:19,070 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:27:19,070 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:27:19,070 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:27:19,071 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:27:19,071 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 20:27:19,071 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:27:19,072 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:27:19,072 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:27:19,072 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:27:19,072 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:27:19,072 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:27:19,073 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:27:19,073 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:27:19,073 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 20:27:19,074 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:27:19,074 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:27:19,074 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:27:19,074 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:27:19,074 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:27:19,075 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:27:19,075 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:27:19,075 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:27:19,076 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 20:27:19,076 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:27:19,076 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:27:19,076 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:27:19,077 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:27:19,077 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:27:19,077 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:27:19,077 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:27:19,078 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:27:19,078 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 20:27:19,078 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:27:19,078 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:27:19,079 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:27:19,079 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:27:19,079 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:27:19,080 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:27:19,081 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:27:19,081 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:27:19,082 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:27:19,082 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:27:19,082 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:27:19,082 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:27:19,082 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:27:19,083 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:27:19,083 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:27:19,083 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:27:19,083 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 20:27:19,084 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:27:19,084 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:27:19,084 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:27:19,084 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:27:19,084 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:27:19,085 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:27:19,085 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:27:19,085 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:27:19,086 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:27:19,086 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:27:19,086 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:27:19,086 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:27:19,087 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:27:19,087 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:27:19,087 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:27:19,088 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:27:19,089 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 20:27:19,089 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:27:19,090 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:27:19,090 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:27:19,090 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:27:19,090 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:27:19,091 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:27:19,092 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:27:19,093 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 20:27:19,093 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:27:19,093 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:27:19,093 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:27:19,094 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:27:19,094 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:27:19,094 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:27:19,094 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:27:19,095 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:27:19,095 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 20:27:19,095 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:27:19,096 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:27:19,096 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:27:19,096 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:27:19,096 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:27:19,096 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:27:19,097 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:27:19,097 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:27:19,097 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 20:27:19,098 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:27:19,098 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-11-15 20:27:19,098 INFO L203 nArgumentSynthesizer]: 6 loop disjuncts [2019-11-15 20:27:19,098 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:27:19,147 INFO L400 nArgumentSynthesizer]: We have 132 Motzkin's Theorem applications. [2019-11-15 20:27:19,147 INFO L401 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2019-11-15 20:27:19,423 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:27:19,424 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:27:19,425 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:27:19,425 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:27:19,425 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:27:19,425 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:27:19,426 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:27:19,426 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:27:19,429 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:27:19,429 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 20:27:19,430 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:27:19,430 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:27:19,430 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:27:19,430 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:27:19,433 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:27:19,433 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:27:19,466 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 20:27:19,521 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2019-11-15 20:27:19,521 INFO L444 ModelExtractionUtils]: 52 out of 61 variables were initially zero. Simplification set additionally 6 variables to zero. [2019-11-15 20:27:19,522 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 20:27:19,522 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 20:27:19,523 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 20:27:19,523 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_cstrpbrk_~s~0.base)_3, ULTIMATE.start_cstrpbrk_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_cstrpbrk_~s~0.base)_3 - 1*ULTIMATE.start_cstrpbrk_~s~0.offset Supporting invariants [] [2019-11-15 20:27:19,782 INFO L297 tatePredicateManager]: 42 out of 42 supporting invariants were superfluous and have been removed [2019-11-15 20:27:19,783 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-15 20:27:19,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:27:19,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:27:19,834 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 20:27:19,836 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:27:19,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:27:19,844 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 20:27:19,844 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:27:19,859 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 20:27:19,860 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 20:27:19,860 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 34 states and 41 transitions. cyclomatic complexity: 12 Second operand 3 states. [2019-11-15 20:27:19,884 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 34 states and 41 transitions. cyclomatic complexity: 12. Second operand 3 states. Result 50 states and 58 transitions. Complement of second has 5 states. [2019-11-15 20:27:19,884 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 20:27:19,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 20:27:19,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 25 transitions. [2019-11-15 20:27:19,885 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 25 transitions. Stem has 25 letters. Loop has 3 letters. [2019-11-15 20:27:19,885 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:27:19,885 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 20:27:19,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:27:19,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:27:19,926 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 20:27:19,927 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:27:19,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:27:19,935 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 20:27:19,935 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:27:19,950 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 20:27:19,950 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 20:27:19,950 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 34 states and 41 transitions. cyclomatic complexity: 12 Second operand 3 states. [2019-11-15 20:27:19,965 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 34 states and 41 transitions. cyclomatic complexity: 12. Second operand 3 states. Result 50 states and 58 transitions. Complement of second has 5 states. [2019-11-15 20:27:19,966 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 20:27:19,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 20:27:19,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 25 transitions. [2019-11-15 20:27:19,966 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 25 transitions. Stem has 25 letters. Loop has 3 letters. [2019-11-15 20:27:19,967 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:27:19,967 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 20:27:19,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:27:20,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:27:20,014 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 20:27:20,016 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:27:20,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:27:20,024 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 20:27:20,024 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:27:20,039 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 20:27:20,040 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 20:27:20,040 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 34 states and 41 transitions. cyclomatic complexity: 12 Second operand 3 states. [2019-11-15 20:27:20,060 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 34 states and 41 transitions. cyclomatic complexity: 12. Second operand 3 states. Result 49 states and 58 transitions. Complement of second has 4 states. [2019-11-15 20:27:20,061 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 20:27:20,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 20:27:20,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 33 transitions. [2019-11-15 20:27:20,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 33 transitions. Stem has 25 letters. Loop has 3 letters. [2019-11-15 20:27:20,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:27:20,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 33 transitions. Stem has 28 letters. Loop has 3 letters. [2019-11-15 20:27:20,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:27:20,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 33 transitions. Stem has 25 letters. Loop has 6 letters. [2019-11-15 20:27:20,063 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:27:20,063 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 58 transitions. [2019-11-15 20:27:20,064 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 20:27:20,064 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 0 states and 0 transitions. [2019-11-15 20:27:20,064 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-15 20:27:20,064 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-15 20:27:20,064 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-15 20:27:20,064 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 20:27:20,064 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 20:27:20,065 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 20:27:20,065 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 20:27:20,065 INFO L424 BuchiCegarLoop]: ======== Iteration 12============ [2019-11-15 20:27:20,065 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-15 20:27:20,065 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 20:27:20,065 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-15 20:27:20,074 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.11 08:27:20 BoogieIcfgContainer [2019-11-15 20:27:20,074 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-15 20:27:20,075 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 20:27:20,075 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 20:27:20,075 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 20:27:20,076 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:26:56" (3/4) ... [2019-11-15 20:27:20,086 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-15 20:27:20,092 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 20:27:20,094 INFO L168 Benchmark]: Toolchain (without parser) took 24300.87 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 392.2 MB). Free memory was 937.0 MB in the beginning and 1.2 GB in the end (delta: -250.7 MB). Peak memory consumption was 141.5 MB. Max. memory is 11.5 GB. [2019-11-15 20:27:20,095 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 963.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:27:20,096 INFO L168 Benchmark]: CACSL2BoogieTranslator took 556.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 937.0 MB in the beginning and 1.1 GB in the end (delta: -187.9 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2019-11-15 20:27:20,096 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.21 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-15 20:27:20,096 INFO L168 Benchmark]: Boogie Preprocessor took 29.64 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:27:20,097 INFO L168 Benchmark]: RCFGBuilder took 392.34 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 23.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. [2019-11-15 20:27:20,098 INFO L168 Benchmark]: BuchiAutomizer took 23252.85 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 251.1 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -91.9 MB). Peak memory consumption was 159.3 MB. Max. memory is 11.5 GB. [2019-11-15 20:27:20,103 INFO L168 Benchmark]: Witness Printer took 17.77 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. [2019-11-15 20:27:20,106 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.24 ms. Allocated memory is still 1.0 GB. Free memory is still 963.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 556.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 937.0 MB in the beginning and 1.1 GB in the end (delta: -187.9 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 48.21 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 29.64 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 392.34 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 23.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 23252.85 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 251.1 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -91.9 MB). Peak memory consumption was 159.3 MB. Max. memory is 11.5 GB. * Witness Printer took 17.77 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 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 - 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 -1 * nondetString1 + -1 * i + unknown-#length-unknown[__builtin_alloca (length1 * sizeof(char))] 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 * sc1 + unknown-#length-unknown[sc1] and consists of 3 locations. One deterministic module has affine ranking function -1 * s + unknown-#length-unknown[s] and consists of 3 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[s] + -1 * s 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 23.2s and 12 iterations. TraceHistogramMax:2. Analysis of lassos took 21.0s. Construction of modules took 0.5s. Büchi inclusion checks took 1.3s. Highest rank in rank-based complementation 3. Minimization of det autom 7. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 28 StatesRemovedByMinimization, 6 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 34 states and ocurred in iteration 10. Nontrivial modules had stage [4, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 244 SDtfs, 584 SDslu, 522 SDs, 0 SdLazy, 541 SolverSat, 75 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc3 concLT0 SILN0 SILU3 SILI0 SILT0 lasso5 LassoPreprocessingBenchmarks: Lassos: inital414 mio100 ax107 hnf98 lsp83 ukn68 mio100 lsp42 div105 bol100 ite100 ukn100 eq179 hnf87 smp96 dnf373 smp62 tf100 neg95 sie116 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 325ms VariablesStem: 9 VariablesLoop: 6 DisjunctsStem: 4 DisjunctsLoop: 6 SupportingInvariants: 12 MotzkinApplications: 132 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...