./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/cstrcspn-alloca-2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- 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_7a4f0af4-4638-4d11-bc42-ec94020a8ba0/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_7a4f0af4-4638-4d11-bc42-ec94020a8ba0/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_7a4f0af4-4638-4d11-bc42-ec94020a8ba0/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_7a4f0af4-4638-4d11-bc42-ec94020a8ba0/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/cstrcspn-alloca-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_7a4f0af4-4638-4d11-bc42-ec94020a8ba0/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_7a4f0af4-4638-4d11-bc42-ec94020a8ba0/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 64bit --witnessprinter.graph.data.programhash 54ff0e2671f1fbdd267f9aba90cfe8fb60d3ccde .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 23:04:00,867 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 23:04:00,868 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 23:04:00,879 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 23:04:00,879 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 23:04:00,880 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 23:04:00,881 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 23:04:00,883 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 23:04:00,885 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 23:04:00,886 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 23:04:00,887 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 23:04:00,889 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 23:04:00,889 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 23:04:00,890 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 23:04:00,891 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 23:04:00,893 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 23:04:00,894 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 23:04:00,895 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 23:04:00,897 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 23:04:00,900 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 23:04:00,902 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 23:04:00,903 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 23:04:00,905 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 23:04:00,906 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 23:04:00,909 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 23:04:00,909 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 23:04:00,910 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 23:04:00,911 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 23:04:00,912 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 23:04:00,913 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 23:04:00,913 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 23:04:00,914 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 23:04:00,915 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 23:04:00,916 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 23:04:00,918 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 23:04:00,918 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 23:04:00,919 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 23:04:00,919 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 23:04:00,920 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 23:04:00,921 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 23:04:00,921 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 23:04:00,922 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_7a4f0af4-4638-4d11-bc42-ec94020a8ba0/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-15 23:04:00,939 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 23:04:00,940 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 23:04:00,941 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 23:04:00,941 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 23:04:00,942 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 23:04:00,942 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-15 23:04:00,942 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-15 23:04:00,942 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-15 23:04:00,943 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-15 23:04:00,943 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-15 23:04:00,943 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-15 23:04:00,943 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 23:04:00,944 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 23:04:00,944 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 23:04:00,944 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 23:04:00,944 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-15 23:04:00,945 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-15 23:04:00,945 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-15 23:04:00,945 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 23:04:00,945 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-15 23:04:00,946 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 23:04:00,946 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-15 23:04:00,946 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 23:04:00,946 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 23:04:00,947 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-15 23:04:00,947 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 23:04:00,947 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 23:04:00,947 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-15 23:04:00,948 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-15 23:04:00,948 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_7a4f0af4-4638-4d11-bc42-ec94020a8ba0/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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 54ff0e2671f1fbdd267f9aba90cfe8fb60d3ccde [2019-11-15 23:04:00,991 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 23:04:01,008 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 23:04:01,010 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 23:04:01,011 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 23:04:01,012 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 23:04:01,012 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_7a4f0af4-4638-4d11-bc42-ec94020a8ba0/bin/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/cstrcspn-alloca-2.i [2019-11-15 23:04:01,088 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7a4f0af4-4638-4d11-bc42-ec94020a8ba0/bin/uautomizer/data/3ae40c004/d387413634d74cf6a5255ebd0158f753/FLAG625c81623 [2019-11-15 23:04:01,468 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 23:04:01,469 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_7a4f0af4-4638-4d11-bc42-ec94020a8ba0/sv-benchmarks/c/termination-memory-alloca/cstrcspn-alloca-2.i [2019-11-15 23:04:01,484 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7a4f0af4-4638-4d11-bc42-ec94020a8ba0/bin/uautomizer/data/3ae40c004/d387413634d74cf6a5255ebd0158f753/FLAG625c81623 [2019-11-15 23:04:01,800 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_7a4f0af4-4638-4d11-bc42-ec94020a8ba0/bin/uautomizer/data/3ae40c004/d387413634d74cf6a5255ebd0158f753 [2019-11-15 23:04:01,803 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 23:04:01,805 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 23:04:01,807 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 23:04:01,807 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 23:04:01,810 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 23:04:01,811 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:04:01" (1/1) ... [2019-11-15 23:04:01,814 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@735485d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:04:01, skipping insertion in model container [2019-11-15 23:04:01,815 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:04:01" (1/1) ... [2019-11-15 23:04:01,824 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 23:04:01,870 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 23:04:02,216 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:04:02,226 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 23:04:02,271 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:04:02,330 INFO L192 MainTranslator]: Completed translation [2019-11-15 23:04:02,332 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:04:02 WrapperNode [2019-11-15 23:04:02,332 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 23:04:02,333 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 23:04:02,333 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 23:04:02,333 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 23:04:02,342 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:04:02" (1/1) ... [2019-11-15 23:04:02,358 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:04:02" (1/1) ... [2019-11-15 23:04:02,385 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 23:04:02,385 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 23:04:02,386 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 23:04:02,386 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 23:04:02,393 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:04:02" (1/1) ... [2019-11-15 23:04:02,394 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:04:02" (1/1) ... [2019-11-15 23:04:02,398 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:04:02" (1/1) ... [2019-11-15 23:04:02,398 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:04:02" (1/1) ... [2019-11-15 23:04:02,407 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:04:02" (1/1) ... [2019-11-15 23:04:02,412 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:04:02" (1/1) ... [2019-11-15 23:04:02,413 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:04:02" (1/1) ... [2019-11-15 23:04:02,416 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 23:04:02,417 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 23:04:02,417 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 23:04:02,417 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 23:04:02,418 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:04:02" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7a4f0af4-4638-4d11-bc42-ec94020a8ba0/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 23:04:02,490 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 23:04:02,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 23:04:02,491 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 23:04:02,491 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 23:04:02,493 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 23:04:02,493 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 23:04:02,894 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 23:04:02,894 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-15 23:04:02,896 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:04:02 BoogieIcfgContainer [2019-11-15 23:04:02,896 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 23:04:02,897 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-15 23:04:02,897 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-15 23:04:02,900 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-15 23:04:02,901 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 23:04:02,901 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.11 11:04:01" (1/3) ... [2019-11-15 23:04:02,902 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@bbd9c26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 11:04:02, skipping insertion in model container [2019-11-15 23:04:02,903 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 23:04:02,903 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:04:02" (2/3) ... [2019-11-15 23:04:02,903 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@bbd9c26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 11:04:02, skipping insertion in model container [2019-11-15 23:04:02,903 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 23:04:02,903 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:04:02" (3/3) ... [2019-11-15 23:04:02,905 INFO L371 chiAutomizerObserver]: Analyzing ICFG cstrcspn-alloca-2.i [2019-11-15 23:04:02,963 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-15 23:04:02,963 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-15 23:04:02,964 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-15 23:04:02,964 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 23:04:02,965 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 23:04:02,965 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-15 23:04:02,965 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 23:04:02,965 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-15 23:04:02,987 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-11-15 23:04:03,011 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-15 23:04:03,011 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:04:03,011 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:04:03,018 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-15 23:04:03,018 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-11-15 23:04:03,018 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-15 23:04:03,018 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-11-15 23:04:03,020 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-15 23:04:03,020 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:04:03,021 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:04:03,021 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-15 23:04:03,021 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-11-15 23:04:03,030 INFO L791 eck$LassoCheckResult]: Stem: 11#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10#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~ret14, 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; 7#L565true assume !(main_~length1~0 < 1); 12#L565-2true assume !(main_~length2~0 < 1); 6#L568-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;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);cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem4, cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset, cstrcspn_#t~mem5, cstrcspn_#t~mem6, cstrcspn_#t~short7, cstrcspn_#t~mem9, cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset, cstrcspn_#t~mem3, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 3#L552-4true [2019-11-15 23:04:03,030 INFO L793 eck$LassoCheckResult]: Loop: 3#L552-4true call cstrcspn_#t~mem3 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 14#L552-1true assume !!(0 != cstrcspn_#t~mem3);havoc cstrcspn_#t~mem3;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem4 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem4;havoc cstrcspn_#t~mem4; 16#L555-5true assume !true; 19#L555-6true call cstrcspn_#t~mem9 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 5#L557true assume !(cstrcspn_#t~mem9 == cstrcspn_~c~0);havoc cstrcspn_#t~mem9; 20#L552-3true cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post2.base, 1 + cstrcspn_#t~post2.offset;havoc cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset; 3#L552-4true [2019-11-15 23:04:03,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:04:03,037 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2019-11-15 23:04:03,046 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:04:03,046 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225190267] [2019-11-15 23:04:03,047 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:04:03,047 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:04:03,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:04:03,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:04:03,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:04:03,203 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:04:03,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:04:03,205 INFO L82 PathProgramCache]: Analyzing trace with hash 1454917130, now seen corresponding path program 1 times [2019-11-15 23:04:03,205 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:04:03,205 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457062469] [2019-11-15 23:04:03,205 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:04:03,205 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:04:03,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:04:03,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:04:03,243 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 23:04:03,243 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457062469] [2019-11-15 23:04:03,244 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:04:03,244 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:04:03,244 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127646868] [2019-11-15 23:04:03,249 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 23:04:03,250 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:04:03,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-15 23:04:03,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-15 23:04:03,268 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2019-11-15 23:04:03,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:04:03,276 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2019-11-15 23:04:03,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-15 23:04:03,278 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 23 transitions. [2019-11-15 23:04:03,279 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-15 23:04:03,284 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 13 states and 17 transitions. [2019-11-15 23:04:03,285 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-11-15 23:04:03,285 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-11-15 23:04:03,286 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 17 transitions. [2019-11-15 23:04:03,286 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:04:03,287 INFO L688 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2019-11-15 23:04:03,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 17 transitions. [2019-11-15 23:04:03,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-11-15 23:04:03,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-11-15 23:04:03,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2019-11-15 23:04:03,317 INFO L711 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2019-11-15 23:04:03,317 INFO L591 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2019-11-15 23:04:03,317 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-15 23:04:03,318 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2019-11-15 23:04:03,318 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-15 23:04:03,319 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:04:03,319 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:04:03,320 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-15 23:04:03,320 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:04:03,320 INFO L791 eck$LassoCheckResult]: Stem: 54#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 53#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~ret14, 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; 49#L565 assume !(main_~length1~0 < 1); 50#L565-2 assume !(main_~length2~0 < 1); 48#L568-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;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);cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem4, cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset, cstrcspn_#t~mem5, cstrcspn_#t~mem6, cstrcspn_#t~short7, cstrcspn_#t~mem9, cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset, cstrcspn_#t~mem3, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 44#L552-4 [2019-11-15 23:04:03,321 INFO L793 eck$LassoCheckResult]: Loop: 44#L552-4 call cstrcspn_#t~mem3 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 45#L552-1 assume !!(0 != cstrcspn_#t~mem3);havoc cstrcspn_#t~mem3;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem4 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem4;havoc cstrcspn_#t~mem4; 56#L555-5 call cstrcspn_#t~mem5 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := 0 != cstrcspn_#t~mem5; 51#L555-1 assume cstrcspn_#t~short7;call cstrcspn_#t~mem6 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := cstrcspn_#t~mem6 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 52#L555-3 assume !cstrcspn_#t~short7;havoc cstrcspn_#t~mem5;havoc cstrcspn_#t~short7;havoc cstrcspn_#t~mem6; 55#L555-6 call cstrcspn_#t~mem9 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 46#L557 assume !(cstrcspn_#t~mem9 == cstrcspn_~c~0);havoc cstrcspn_#t~mem9; 47#L552-3 cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post2.base, 1 + cstrcspn_#t~post2.offset;havoc cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset; 44#L552-4 [2019-11-15 23:04:03,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:04:03,321 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 2 times [2019-11-15 23:04:03,322 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:04:03,323 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360823993] [2019-11-15 23:04:03,323 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:04:03,323 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:04:03,323 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:04:03,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:04:03,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:04:03,383 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:04:03,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:04:03,384 INFO L82 PathProgramCache]: Analyzing trace with hash 1927396657, now seen corresponding path program 1 times [2019-11-15 23:04:03,384 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:04:03,385 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361317441] [2019-11-15 23:04:03,385 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:04:03,385 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:04:03,385 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:04:03,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:04:03,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:04:03,418 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:04:03,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:04:03,419 INFO L82 PathProgramCache]: Analyzing trace with hash -102988426, now seen corresponding path program 1 times [2019-11-15 23:04:03,420 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:04:03,420 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297027332] [2019-11-15 23:04:03,420 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:04:03,420 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:04:03,421 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:04:03,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:04:03,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:04:03,528 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:04:03,809 WARN L191 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2019-11-15 23:04:04,142 WARN L191 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 50 [2019-11-15 23:04:04,629 WARN L191 SmtUtils]: Spent 484.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 87 [2019-11-15 23:04:04,802 WARN L191 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-11-15 23:04:04,816 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:04:04,817 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:04:04,817 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:04:04,818 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:04:04,825 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 23:04:04,825 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:04:04,826 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:04:04,826 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:04:04,826 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcspn-alloca-2.i_Iteration2_Lasso [2019-11-15 23:04:04,826 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:04:04,826 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:04:04,881 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:04:04,887 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:04:04,891 INFO 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 23:04:04,899 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:04:04,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 23:04:05,402 WARN L191 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 67 [2019-11-15 23:04:05,705 WARN L191 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 57 [2019-11-15 23:04:05,706 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:04:05,708 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:04:05,712 INFO 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 23:04:05,717 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:04:05,720 INFO 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 23:04:05,725 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:04:05,727 INFO 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 23:04:05,730 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:04:05,734 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:04:05,738 INFO 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 23:04:05,743 INFO 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 23:04:05,751 INFO 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 23:04:05,754 INFO 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 23:04:05,757 INFO 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 23:04:05,760 INFO 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 23:04:05,762 INFO 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 23:04:06,709 WARN L191 SmtUtils]: Spent 552.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 40 [2019-11-15 23:04:07,083 WARN L191 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 34 [2019-11-15 23:04:07,273 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:04:07,278 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 23:04:07,280 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 23:04:07,285 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:04:07,285 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:04:07,286 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:04:07,286 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:04:07,286 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:04:07,288 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:04:07,288 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:04:07,291 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:04:07,292 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 23:04:07,293 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:04:07,293 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:04:07,293 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:04:07,294 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:04:07,294 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:04:07,294 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:04:07,294 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:04:07,304 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:04:07,305 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 23:04:07,307 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:04:07,307 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:04:07,307 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:04:07,307 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:04:07,313 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:04:07,313 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:04:07,321 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:04:07,321 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:04:07,322 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:04:07,322 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:04:07,322 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:04:07,322 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:04:07,323 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:04:07,323 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:04:07,323 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:04:07,324 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:04:07,325 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:04:07,326 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:04:07,326 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-11-15 23:04:07,326 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:04:07,326 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:04:07,338 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-11-15 23:04:07,338 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:04:07,451 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:04:07,452 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 23:04:07,453 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:04:07,453 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:04:07,454 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:04:07,454 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:04:07,455 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:04:07,455 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:04:07,458 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:04:07,458 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 23:04:07,459 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:04:07,459 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:04:07,460 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:04:07,460 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:04:07,462 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:04:07,462 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:04:07,472 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:04:07,480 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 23:04:07,481 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:04:07,481 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:04:07,481 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:04:07,482 INFO L203 nArgumentSynthesizer]: 4 loop disjuncts [2019-11-15 23:04:07,482 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:04:07,484 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-15 23:04:07,488 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:04:07,508 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:04:07,509 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:04:07,510 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:04:07,510 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:04:07,510 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:04:07,510 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:04:07,513 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:04:07,513 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:04:07,527 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:04:07,527 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:04:07,528 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:04:07,528 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:04:07,528 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:04:07,528 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:04:07,530 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:04:07,530 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:04:07,533 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:04:07,533 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:04:07,534 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:04:07,534 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:04:07,534 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:04:07,535 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:04:07,535 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:04:07,535 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:04:07,535 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:04:07,537 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:04:07,537 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:04:07,538 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:04:07,538 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:04:07,539 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:04:07,539 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:04:07,540 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:04:07,540 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:04:07,542 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:04:07,542 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 23:04:07,543 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:04:07,543 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:04:07,543 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:04:07,544 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:04:07,547 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:04:07,547 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:04:07,568 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 23:04:07,609 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2019-11-15 23:04:07,609 INFO L444 ModelExtractionUtils]: 22 out of 28 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-11-15 23:04:07,612 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 23:04:07,613 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 23:04:07,613 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 23:04:07,614 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrcspn_~sc1~0.offset, v_rep(select #length ULTIMATE.start_cstrcspn_~sc1~0.base)_1) = -1*ULTIMATE.start_cstrcspn_~sc1~0.offset + 1*v_rep(select #length ULTIMATE.start_cstrcspn_~sc1~0.base)_1 Supporting invariants [] [2019-11-15 23:04:07,665 INFO L297 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2019-11-15 23:04:07,674 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-15 23:04:07,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:04:07,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:04:07,715 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:04:07,716 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:04:07,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:04:07,733 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 23:04:07,734 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:04:07,751 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 23:04:07,754 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 23:04:07,755 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-11-15 23:04:07,804 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 21 states and 28 transitions. Complement of second has 4 states. [2019-11-15 23:04:07,805 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 23:04:07,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 23:04:07,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2019-11-15 23:04:07,807 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 8 letters. [2019-11-15 23:04:07,809 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:04:07,809 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 13 letters. Loop has 8 letters. [2019-11-15 23:04:07,809 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:04:07,809 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 16 letters. [2019-11-15 23:04:07,810 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:04:07,810 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 28 transitions. [2019-11-15 23:04:07,811 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 23:04:07,812 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 18 states and 25 transitions. [2019-11-15 23:04:07,812 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-11-15 23:04:07,812 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-11-15 23:04:07,812 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 25 transitions. [2019-11-15 23:04:07,813 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:04:07,813 INFO L688 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-11-15 23:04:07,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 25 transitions. [2019-11-15 23:04:07,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-11-15 23:04:07,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-11-15 23:04:07,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2019-11-15 23:04:07,815 INFO L711 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-11-15 23:04:07,816 INFO L591 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-11-15 23:04:07,816 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-15 23:04:07,816 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 25 transitions. [2019-11-15 23:04:07,817 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 23:04:07,817 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:04:07,817 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:04:07,818 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:04:07,818 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 23:04:07,818 INFO L791 eck$LassoCheckResult]: Stem: 187#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 186#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~ret14, 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; 180#L565 assume !(main_~length1~0 < 1); 181#L565-2 assume !(main_~length2~0 < 1); 179#L568-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;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);cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem4, cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset, cstrcspn_#t~mem5, cstrcspn_#t~mem6, cstrcspn_#t~short7, cstrcspn_#t~mem9, cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset, cstrcspn_#t~mem3, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 173#L552-4 call cstrcspn_#t~mem3 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 175#L552-1 assume !!(0 != cstrcspn_#t~mem3);havoc cstrcspn_#t~mem3;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem4 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem4;havoc cstrcspn_#t~mem4; 188#L555-5 [2019-11-15 23:04:07,818 INFO L793 eck$LassoCheckResult]: Loop: 188#L555-5 call cstrcspn_#t~mem5 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := 0 != cstrcspn_#t~mem5; 182#L555-1 assume cstrcspn_#t~short7;call cstrcspn_#t~mem6 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := cstrcspn_#t~mem6 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 183#L555-3 assume !!cstrcspn_#t~short7;havoc cstrcspn_#t~mem5;havoc cstrcspn_#t~short7;havoc cstrcspn_#t~mem6;cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset := cstrcspn_~s~0.base, cstrcspn_~s~0.offset;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_#t~post8.base, 1 + cstrcspn_#t~post8.offset;havoc cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset; 188#L555-5 [2019-11-15 23:04:07,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:04:07,819 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935595, now seen corresponding path program 1 times [2019-11-15 23:04:07,819 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:04:07,819 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560558335] [2019-11-15 23:04:07,819 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:04:07,819 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:04:07,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:04:07,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:04:07,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:04:07,881 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:04:07,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:04:07,884 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 1 times [2019-11-15 23:04:07,910 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:04:07,910 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986317366] [2019-11-15 23:04:07,910 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:04:07,911 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:04:07,911 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:04:07,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:04:07,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:04:07,923 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:04:07,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:04:07,923 INFO L82 PathProgramCache]: Analyzing trace with hash 1593218778, now seen corresponding path program 1 times [2019-11-15 23:04:07,923 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:04:07,924 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940865875] [2019-11-15 23:04:07,924 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:04:07,924 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:04:07,924 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:04:07,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:04:07,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:04:07,997 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:04:08,105 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 38 [2019-11-15 23:04:08,243 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2019-11-15 23:04:08,679 WARN L191 SmtUtils]: Spent 434.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 100 [2019-11-15 23:04:08,800 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2019-11-15 23:04:08,802 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:04:08,802 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:04:08,802 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:04:08,802 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:04:08,802 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 23:04:08,802 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:04:08,802 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:04:08,802 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:04:08,802 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcspn-alloca-2.i_Iteration3_Lasso [2019-11-15 23:04:08,802 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:04:08,803 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:04:08,807 INFO 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 23:04:08,811 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:04:08,813 INFO 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 23:04:08,815 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:04:08,816 INFO 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 23:04:08,822 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:04:08,824 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:04:08,826 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:04:08,829 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:04:08,832 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:04:08,834 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:04:08,839 INFO 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 23:04:08,841 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:04:08,843 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:04:09,207 WARN L191 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 78 [2019-11-15 23:04:09,321 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-11-15 23:04:09,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 23:04:09,333 INFO 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 23:04:09,335 INFO 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 23:04:09,337 INFO 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 23:04:09,339 INFO 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 23:04:09,341 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:04:09,343 INFO 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 23:04:09,935 WARN L191 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2019-11-15 23:04:10,432 WARN L191 SmtUtils]: Spent 434.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-11-15 23:04:10,466 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:04:10,473 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 23:04:10,473 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:04:10,473 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:04:10,474 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:04:10,474 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:04:10,474 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:04:10,474 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:04:10,474 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:04:10,474 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:04:10,475 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:04:10,475 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 23:04:10,475 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:04:10,475 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:04:10,475 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:04:10,475 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:04:10,475 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:04:10,476 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:04:10,476 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:04:10,476 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:04:10,476 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 23:04:10,476 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:04:10,477 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:04:10,477 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:04:10,477 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:04:10,477 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:04:10,477 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:04:10,477 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:04:10,478 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:04:10,478 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 23:04:10,478 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:04:10,479 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:04:10,479 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:04:10,479 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:04:10,479 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:04:10,479 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:04:10,479 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:04:10,480 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:04:10,480 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 23:04:10,481 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:04:10,481 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:04:10,481 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:04:10,481 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:04:10,481 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:04:10,481 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:04:10,482 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:04:10,482 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:04:10,482 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 23:04:10,483 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:04:10,483 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:04:10,483 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:04:10,483 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:04:10,484 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:04:10,484 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:04:10,486 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:04:10,486 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 23:04:10,486 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:04:10,487 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:04:10,487 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:04:10,487 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:04:10,488 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:04:10,488 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:04:10,490 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:04:10,490 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 23:04:10,490 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:04:10,491 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:04:10,491 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:04:10,491 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:04:10,491 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:04:10,491 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:04:10,491 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:04:10,492 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:04:10,492 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 23:04:10,493 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:04:10,493 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:04:10,493 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:04:10,493 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:04:10,494 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:04:10,494 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:04:10,496 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:04:10,496 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 23:04:10,496 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:04:10,497 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:04:10,497 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:04:10,497 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:04:10,497 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:04:10,497 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:04:10,497 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:04:10,498 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:04:10,498 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 23:04:10,499 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:04:10,499 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:04:10,499 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:04:10,499 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:04:10,499 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:04:10,500 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:04:10,500 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:04:10,500 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:04:10,501 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 23:04:10,501 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:04:10,501 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:04:10,502 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:04:10,502 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:04:10,502 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:04:10,502 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:04:10,502 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:04:10,503 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:04:10,503 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 23:04:10,504 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:04:10,504 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:04:10,504 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:04:10,504 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:04:10,504 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:04:10,505 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:04:10,505 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:04:10,505 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:04:10,506 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:04:10,506 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:04:10,506 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:04:10,507 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:04:10,507 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:04:10,508 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:04:10,508 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:04:10,513 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:04:10,513 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:04:10,514 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:04:10,514 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:04:10,514 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:04:10,514 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:04:10,516 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:04:10,516 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:04:10,518 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:04:10,518 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:04:10,519 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:04:10,519 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:04:10,519 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:04:10,519 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:04:10,520 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:04:10,520 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:04:10,521 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:04:10,522 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:04:10,522 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:04:10,522 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:04:10,522 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:04:10,522 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:04:10,523 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:04:10,523 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:04:10,525 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:04:10,526 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 23:04:10,526 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:04:10,526 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:04:10,526 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:04:10,527 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:04:10,527 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:04:10,527 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:04:10,529 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:04:10,529 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:04:10,529 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:04:10,530 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-15 23:04:10,530 INFO L203 nArgumentSynthesizer]: 6 loop disjuncts [2019-11-15 23:04:10,530 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:04:10,552 INFO L400 nArgumentSynthesizer]: We have 108 Motzkin's Theorem applications. [2019-11-15 23:04:10,553 INFO L401 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2019-11-15 23:04:10,666 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:04:10,666 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 23:04:10,667 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:04:10,667 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:04:10,667 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:04:10,667 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:04:10,670 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:04:10,670 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:04:10,694 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 23:04:10,713 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 23:04:10,713 INFO L444 ModelExtractionUtils]: 36 out of 40 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 23:04:10,714 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 23:04:10,714 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 23:04:10,715 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 23:04:10,715 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_cstrcspn_~s~0.base)_2, ULTIMATE.start_cstrcspn_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_cstrcspn_~s~0.base)_2 - 1*ULTIMATE.start_cstrcspn_~s~0.offset Supporting invariants [] [2019-11-15 23:04:10,780 INFO L297 tatePredicateManager]: 15 out of 15 supporting invariants were superfluous and have been removed [2019-11-15 23:04:10,782 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-15 23:04:10,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:04:10,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:04:10,822 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:04:10,823 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:04:10,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:04:10,834 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 23:04:10,834 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:04:10,852 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 23:04:10,853 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 23:04:10,853 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9 Second operand 3 states. [2019-11-15 23:04:10,892 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 43 states and 57 transitions. Complement of second has 5 states. [2019-11-15 23:04:10,893 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 23:04:10,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 23:04:10,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2019-11-15 23:04:10,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 7 letters. Loop has 3 letters. [2019-11-15 23:04:10,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:04:10,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 10 letters. Loop has 3 letters. [2019-11-15 23:04:10,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:04:10,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 7 letters. Loop has 6 letters. [2019-11-15 23:04:10,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:04:10,895 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 57 transitions. [2019-11-15 23:04:10,897 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 23:04:10,898 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 30 states and 40 transitions. [2019-11-15 23:04:10,898 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-15 23:04:10,898 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-15 23:04:10,898 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 40 transitions. [2019-11-15 23:04:10,899 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:04:10,899 INFO L688 BuchiCegarLoop]: Abstraction has 30 states and 40 transitions. [2019-11-15 23:04:10,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 40 transitions. [2019-11-15 23:04:10,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2019-11-15 23:04:10,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-11-15 23:04:10,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2019-11-15 23:04:10,905 INFO L711 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2019-11-15 23:04:10,906 INFO L591 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2019-11-15 23:04:10,906 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-15 23:04:10,906 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 33 transitions. [2019-11-15 23:04:10,908 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 23:04:10,908 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:04:10,908 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:04:10,909 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:04:10,909 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 23:04:10,910 INFO L791 eck$LassoCheckResult]: Stem: 360#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 359#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~ret14, 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; 353#L565 assume !(main_~length1~0 < 1); 354#L565-2 assume !(main_~length2~0 < 1); 352#L568-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;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);cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem4, cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset, cstrcspn_#t~mem5, cstrcspn_#t~mem6, cstrcspn_#t~short7, cstrcspn_#t~mem9, cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset, cstrcspn_#t~mem3, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 345#L552-4 call cstrcspn_#t~mem3 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 346#L552-1 assume !!(0 != cstrcspn_#t~mem3);havoc cstrcspn_#t~mem3;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem4 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem4;havoc cstrcspn_#t~mem4; 362#L555-5 call cstrcspn_#t~mem5 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := 0 != cstrcspn_#t~mem5; 367#L555-1 assume !cstrcspn_#t~short7; 366#L555-3 assume !cstrcspn_#t~short7;havoc cstrcspn_#t~mem5;havoc cstrcspn_#t~short7;havoc cstrcspn_#t~mem6; 365#L555-6 call cstrcspn_#t~mem9 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 350#L557 assume !(cstrcspn_#t~mem9 == cstrcspn_~c~0);havoc cstrcspn_#t~mem9; 351#L552-3 cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post2.base, 1 + cstrcspn_#t~post2.offset;havoc cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset; 347#L552-4 call cstrcspn_#t~mem3 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 349#L552-1 assume !!(0 != cstrcspn_#t~mem3);havoc cstrcspn_#t~mem3;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem4 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem4;havoc cstrcspn_#t~mem4; 361#L555-5 [2019-11-15 23:04:10,910 INFO L793 eck$LassoCheckResult]: Loop: 361#L555-5 call cstrcspn_#t~mem5 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := 0 != cstrcspn_#t~mem5; 355#L555-1 assume cstrcspn_#t~short7;call cstrcspn_#t~mem6 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := cstrcspn_#t~mem6 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 356#L555-3 assume !!cstrcspn_#t~short7;havoc cstrcspn_#t~mem5;havoc cstrcspn_#t~short7;havoc cstrcspn_#t~mem6;cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset := cstrcspn_~s~0.base, cstrcspn_~s~0.offset;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_#t~post8.base, 1 + cstrcspn_#t~post8.offset;havoc cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset; 361#L555-5 [2019-11-15 23:04:10,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:04:10,910 INFO L82 PathProgramCache]: Analyzing trace with hash 1587378397, now seen corresponding path program 1 times [2019-11-15 23:04:10,911 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:04:10,911 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171855839] [2019-11-15 23:04:10,911 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:04:10,911 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:04:10,911 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:04:10,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:04:10,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:04:10,945 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:04:10,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:04:10,946 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 2 times [2019-11-15 23:04:10,947 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:04:10,947 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493883460] [2019-11-15 23:04:10,947 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:04:10,947 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:04:10,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:04:10,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:04:10,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:04:10,966 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:04:10,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:04:10,966 INFO L82 PathProgramCache]: Analyzing trace with hash 1999924968, now seen corresponding path program 1 times [2019-11-15 23:04:10,966 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:04:10,967 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130549505] [2019-11-15 23:04:10,967 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:04:10,967 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:04:10,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:04:10,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:04:11,092 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:04:11,093 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130549505] [2019-11-15 23:04:11,093 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [398597456] [2019-11-15 23:04:11,093 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7a4f0af4-4638-4d11-bc42-ec94020a8ba0/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 23:04:11,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:04:11,189 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-15 23:04:11,191 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:04:11,243 INFO L341 Elim1Store]: treesize reduction 40, result has 20.0 percent of original size [2019-11-15 23:04:11,243 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 21 [2019-11-15 23:04:11,244 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:04:11,250 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:04:11,252 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-11-15 23:04:11,252 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:36, output treesize:21 [2019-11-15 23:04:49,245 WARN L191 SmtUtils]: Spent 1.86 s on a formula simplification that was a NOOP. DAG size: 20 [2019-11-15 23:05:14,982 WARN L191 SmtUtils]: Spent 1.69 s on a formula simplification that was a NOOP. DAG size: 15 [2019-11-15 23:05:29,469 WARN L191 SmtUtils]: Spent 866.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-11-15 23:05:29,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:05:29,483 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:05:29,483 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:05:29,483 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2019-11-15 23:05:29,484 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682595501] [2019-11-15 23:05:29,724 WARN L191 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2019-11-15 23:05:29,724 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:05:29,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-15 23:05:29,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=116, Unknown=7, NotChecked=0, Total=156 [2019-11-15 23:05:29,725 INFO L87 Difference]: Start difference. First operand 24 states and 33 transitions. cyclomatic complexity: 12 Second operand 13 states. [2019-11-15 23:05:31,963 WARN L191 SmtUtils]: Spent 2.18 s on a formula simplification. DAG size of input: 30 DAG size of output: 25 [2019-11-15 23:05:35,636 WARN L191 SmtUtils]: Spent 3.66 s on a formula simplification. DAG size of input: 31 DAG size of output: 21 [2019-11-15 23:05:40,176 WARN L191 SmtUtils]: Spent 4.50 s on a formula simplification. DAG size of input: 25 DAG size of output: 19 [2019-11-15 23:05:40,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:05:40,247 INFO L93 Difference]: Finished difference Result 59 states and 72 transitions. [2019-11-15 23:05:40,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:05:40,248 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 72 transitions. [2019-11-15 23:05:40,251 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 23:05:40,254 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 43 states and 53 transitions. [2019-11-15 23:05:40,254 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-11-15 23:05:40,254 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-11-15 23:05:40,254 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 53 transitions. [2019-11-15 23:05:40,254 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:05:40,254 INFO L688 BuchiCegarLoop]: Abstraction has 43 states and 53 transitions. [2019-11-15 23:05:40,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 53 transitions. [2019-11-15 23:05:40,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 28. [2019-11-15 23:05:40,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-15 23:05:40,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2019-11-15 23:05:40,259 INFO L711 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2019-11-15 23:05:40,259 INFO L591 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2019-11-15 23:05:40,259 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-15 23:05:40,259 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 36 transitions. [2019-11-15 23:05:40,260 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 23:05:40,260 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:05:40,260 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:05:40,261 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:05:40,261 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 23:05:40,262 INFO L791 eck$LassoCheckResult]: Stem: 521#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 520#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~ret14, 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; 514#L565 assume !(main_~length1~0 < 1); 515#L565-2 assume !(main_~length2~0 < 1); 513#L568-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;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);cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem4, cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset, cstrcspn_#t~mem5, cstrcspn_#t~mem6, cstrcspn_#t~short7, cstrcspn_#t~mem9, cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset, cstrcspn_#t~mem3, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 506#L552-4 call cstrcspn_#t~mem3 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 507#L552-1 assume !!(0 != cstrcspn_#t~mem3);havoc cstrcspn_#t~mem3;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem4 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem4;havoc cstrcspn_#t~mem4; 525#L555-5 call cstrcspn_#t~mem5 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := 0 != cstrcspn_#t~mem5; 518#L555-1 assume cstrcspn_#t~short7;call cstrcspn_#t~mem6 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := cstrcspn_#t~mem6 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 519#L555-3 assume !cstrcspn_#t~short7;havoc cstrcspn_#t~mem5;havoc cstrcspn_#t~short7;havoc cstrcspn_#t~mem6; 528#L555-6 call cstrcspn_#t~mem9 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 511#L557 assume !(cstrcspn_#t~mem9 == cstrcspn_~c~0);havoc cstrcspn_#t~mem9; 512#L552-3 cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post2.base, 1 + cstrcspn_#t~post2.offset;havoc cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset; 508#L552-4 call cstrcspn_#t~mem3 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 510#L552-1 assume !!(0 != cstrcspn_#t~mem3);havoc cstrcspn_#t~mem3;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem4 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem4;havoc cstrcspn_#t~mem4; 522#L555-5 [2019-11-15 23:05:40,262 INFO L793 eck$LassoCheckResult]: Loop: 522#L555-5 call cstrcspn_#t~mem5 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := 0 != cstrcspn_#t~mem5; 516#L555-1 assume cstrcspn_#t~short7;call cstrcspn_#t~mem6 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := cstrcspn_#t~mem6 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 517#L555-3 assume !!cstrcspn_#t~short7;havoc cstrcspn_#t~mem5;havoc cstrcspn_#t~short7;havoc cstrcspn_#t~mem6;cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset := cstrcspn_~s~0.base, cstrcspn_~s~0.offset;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_#t~post8.base, 1 + cstrcspn_#t~post8.offset;havoc cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset; 522#L555-5 [2019-11-15 23:05:40,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:05:40,262 INFO L82 PathProgramCache]: Analyzing trace with hash -187628965, now seen corresponding path program 2 times [2019-11-15 23:05:40,262 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:05:40,263 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507931224] [2019-11-15 23:05:40,263 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:05:40,263 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:05:40,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:05:40,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:05:40,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:05:40,290 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:05:40,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:05:40,290 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 3 times [2019-11-15 23:05:40,290 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:05:40,291 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750531273] [2019-11-15 23:05:40,291 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:05:40,291 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:05:40,291 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:05:40,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:05:40,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:05:40,299 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:05:40,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:05:40,299 INFO L82 PathProgramCache]: Analyzing trace with hash -1902015318, now seen corresponding path program 1 times [2019-11-15 23:05:40,300 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:05:40,300 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112830155] [2019-11-15 23:05:40,300 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:05:40,300 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:05:40,300 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:05:40,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:05:40,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:05:40,327 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:05:40,464 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 38 [2019-11-15 23:05:40,588 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2019-11-15 23:05:41,396 WARN L191 SmtUtils]: Spent 805.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 137 [2019-11-15 23:05:42,316 WARN L191 SmtUtils]: Spent 904.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 109 [2019-11-15 23:05:42,318 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:05:42,318 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:05:42,319 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:05:42,319 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:05:42,319 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 23:05:42,319 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:05:42,319 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:05:42,319 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:05:42,319 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcspn-alloca-2.i_Iteration5_Lasso [2019-11-15 23:05:42,319 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:05:42,319 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:05:42,327 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:05:42,333 INFO 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 23:05:42,338 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:05:42,341 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:05:42,343 INFO 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 23:05:42,345 INFO 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 23:05:42,350 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:05:42,353 INFO 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 23:05:42,355 INFO 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 23:05:42,607 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-15 23:05:43,366 WARN L191 SmtUtils]: Spent 755.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 96 [2019-11-15 23:05:43,495 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-11-15 23:05:43,495 INFO 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 23:05:43,505 INFO 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 23:05:43,506 INFO 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 23:05:43,508 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:05:43,510 INFO 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 23:05:43,517 INFO 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 23:05:43,519 INFO 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 23:05:43,522 INFO 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 23:05:43,526 INFO 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 23:05:43,528 INFO 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 23:05:43,530 INFO 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 23:05:43,536 INFO 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 23:05:44,350 WARN L191 SmtUtils]: Spent 360.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-11-15 23:05:44,947 WARN L191 SmtUtils]: Spent 561.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 46 [2019-11-15 23:05:45,124 WARN L191 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2019-11-15 23:05:45,150 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:05:45,151 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 23:05:45,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 23:05:45,152 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:05:45,152 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:05:45,152 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:05:45,152 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:05:45,153 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:05:45,153 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:05:45,153 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:05:45,154 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:05:45,155 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 23:05:45,155 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:05:45,155 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:05:45,156 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:05:45,156 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:05:45,156 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:05:45,156 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:05:45,156 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:05:45,157 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:05:45,157 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:05:45,158 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:05:45,158 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:05:45,158 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:05:45,158 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:05:45,159 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:05:45,159 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:05:45,160 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:05:45,161 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 23:05:45,161 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:05:45,161 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:05:45,162 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:05:45,162 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:05:45,162 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:05:45,162 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:05:45,162 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:05:45,163 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:05:45,163 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:05:45,164 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:05:45,164 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:05:45,164 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:05:45,164 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:05:45,164 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:05:45,165 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:05:45,165 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:05:45,165 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:05:45,166 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 23:05:45,166 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:05:45,166 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:05:45,167 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:05:45,167 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:05:45,167 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:05:45,167 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:05:45,167 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:05:45,168 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:05:45,168 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 23:05:45,169 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:05:45,169 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:05:45,169 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:05:45,169 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:05:45,170 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:05:45,170 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:05:45,171 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:05:45,172 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 23:05:45,172 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:05:45,173 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:05:45,173 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:05:45,173 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:05:45,173 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:05:45,173 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:05:45,174 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:05:45,174 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:05:45,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 23:05:45,175 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:05:45,175 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:05:45,175 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:05:45,176 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:05:45,178 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:05:45,178 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:05:45,204 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 23:05:45,215 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 23:05:45,215 INFO L444 ModelExtractionUtils]: 41 out of 46 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-11-15 23:05:45,216 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 23:05:45,216 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 23:05:45,217 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 23:05:45,217 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_cstrcspn_~s~0.base)_3, ULTIMATE.start_cstrcspn_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_cstrcspn_~s~0.base)_3 - 1*ULTIMATE.start_cstrcspn_~s~0.offset Supporting invariants [] [2019-11-15 23:05:45,339 INFO L297 tatePredicateManager]: 26 out of 26 supporting invariants were superfluous and have been removed [2019-11-15 23:05:45,340 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-15 23:05:45,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:05:45,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:05:45,390 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:05:45,390 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:05:45,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:05:45,398 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 23:05:45,399 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:05:45,408 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 23:05:45,408 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 23:05:45,408 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11 Second operand 3 states. [2019-11-15 23:05:45,432 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11. Second operand 3 states. Result 46 states and 58 transitions. Complement of second has 5 states. [2019-11-15 23:05:45,434 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 23:05:45,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 23:05:45,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2019-11-15 23:05:45,434 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2019-11-15 23:05:45,435 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:05:45,435 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 23:05:45,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:05:45,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:05:45,466 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:05:45,467 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:05:45,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:05:45,474 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 23:05:45,474 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:05:45,484 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 23:05:45,484 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 23:05:45,484 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11 Second operand 3 states. [2019-11-15 23:05:45,506 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11. Second operand 3 states. Result 46 states and 58 transitions. Complement of second has 5 states. [2019-11-15 23:05:45,508 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 23:05:45,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 23:05:45,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2019-11-15 23:05:45,510 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2019-11-15 23:05:45,510 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:05:45,510 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 23:05:45,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:05:45,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:05:45,544 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:05:45,545 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:05:45,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:05:45,557 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 23:05:45,558 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:05:45,569 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 23:05:45,569 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 23:05:45,569 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11 Second operand 3 states. [2019-11-15 23:05:45,591 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11. Second operand 3 states. Result 45 states and 60 transitions. Complement of second has 4 states. [2019-11-15 23:05:45,594 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 23:05:45,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 23:05:45,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 27 transitions. [2019-11-15 23:05:45,595 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 15 letters. Loop has 3 letters. [2019-11-15 23:05:45,595 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:05:45,595 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 18 letters. Loop has 3 letters. [2019-11-15 23:05:45,595 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:05:45,595 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 15 letters. Loop has 6 letters. [2019-11-15 23:05:45,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:05:45,596 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 60 transitions. [2019-11-15 23:05:45,598 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 23:05:45,598 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 0 states and 0 transitions. [2019-11-15 23:05:45,598 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-15 23:05:45,598 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-15 23:05:45,598 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-15 23:05:45,599 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:05:45,599 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:05:45,599 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:05:45,599 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:05:45,599 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-15 23:05:45,599 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-15 23:05:45,599 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 23:05:45,599 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-15 23:05:45,605 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.11 11:05:45 BoogieIcfgContainer [2019-11-15 23:05:45,605 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-15 23:05:45,606 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 23:05:45,606 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 23:05:45,606 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 23:05:45,606 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:04:02" (3/4) ... [2019-11-15 23:05:45,610 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-15 23:05:45,610 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 23:05:45,612 INFO L168 Benchmark]: Toolchain (without parser) took 103807.12 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 261.1 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -117.5 MB). Peak memory consumption was 143.6 MB. Max. memory is 11.5 GB. [2019-11-15 23:05:45,612 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:05:45,613 INFO L168 Benchmark]: CACSL2BoogieTranslator took 525.74 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -178.5 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2019-11-15 23:05:45,613 INFO L168 Benchmark]: Boogie Procedure Inliner took 52.04 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 23:05:45,614 INFO L168 Benchmark]: Boogie Preprocessor took 31.14 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 23:05:45,615 INFO L168 Benchmark]: RCFGBuilder took 479.23 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: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. [2019-11-15 23:05:45,615 INFO L168 Benchmark]: BuchiAutomizer took 102708.60 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 125.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 33.2 MB). Peak memory consumption was 159.0 MB. Max. memory is 11.5 GB. [2019-11-15 23:05:45,616 INFO L168 Benchmark]: Witness Printer took 4.48 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:05:45,620 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 525.74 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -178.5 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 52.04 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 31.14 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 479.23 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: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 102708.60 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 125.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 33.2 MB). Peak memory consumption was 159.0 MB. Max. memory is 11.5 GB. * Witness Printer took 4.48 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (2 trivial, 2 deterministic, 1 nondeterministic). 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 unknown-#length-unknown[s] + -1 * s and consists of 3 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[s] + -1 * s and consists of 3 locations. 2 modules have a trivial ranking function, the largest among these consists of 13 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 102.6s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 91.4s. Construction of modules took 0.2s. Büchi inclusion checks took 10.8s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 21 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 28 states and ocurred in iteration 4. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 106 SDtfs, 149 SDslu, 90 SDs, 0 SdLazy, 146 SolverSat, 26 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital374 mio100 ax105 hnf99 lsp87 ukn72 mio100 lsp30 div131 bol100 ite100 ukn100 eq161 hnf81 smp91 dnf1042 smp33 tf100 neg96 sie112 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 136ms VariablesStem: 2 VariablesLoop: 4 DisjunctsStem: 2 DisjunctsLoop: 6 SupportingInvariants: 12 MotzkinApplications: 108 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...