./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/cstrpbrk-alloca-1.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_28882d14-d12b-49cf-b91d-77286f008a64/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_28882d14-d12b-49cf-b91d-77286f008a64/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_28882d14-d12b-49cf-b91d-77286f008a64/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_28882d14-d12b-49cf-b91d-77286f008a64/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/cstrpbrk-alloca-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_28882d14-d12b-49cf-b91d-77286f008a64/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_28882d14-d12b-49cf-b91d-77286f008a64/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 61869dea11c33643d44719730b54f6ea8fd7faa2 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-16 00:12:42,078 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:12:42,080 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:12:42,091 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:12:42,091 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:12:42,092 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:12:42,093 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:12:42,095 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:12:42,101 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:12:42,102 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:12:42,103 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:12:42,104 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:12:42,104 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:12:42,105 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:12:42,106 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:12:42,107 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:12:42,108 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:12:42,109 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:12:42,113 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:12:42,116 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:12:42,117 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:12:42,118 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:12:42,120 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:12:42,120 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:12:42,123 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:12:42,123 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:12:42,124 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:12:42,124 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:12:42,125 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:12:42,126 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:12:42,126 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:12:42,127 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:12:42,127 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:12:42,128 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:12:42,129 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:12:42,129 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:12:42,130 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:12:42,130 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:12:42,130 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:12:42,131 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:12:42,132 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:12:42,136 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_28882d14-d12b-49cf-b91d-77286f008a64/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-16 00:12:42,153 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:12:42,153 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:12:42,155 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:12:42,155 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:12:42,155 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:12:42,156 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-16 00:12:42,156 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-16 00:12:42,156 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-16 00:12:42,156 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-16 00:12:42,156 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-16 00:12:42,157 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-16 00:12:42,158 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:12:42,158 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-16 00:12:42,158 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:12:42,158 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:12:42,158 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-16 00:12:42,159 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-16 00:12:42,159 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-16 00:12:42,159 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-16 00:12:42,159 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-16 00:12:42,159 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:12:42,160 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-16 00:12:42,160 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:12:42,160 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:12:42,161 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-16 00:12:42,161 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:12:42,161 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-16 00:12:42,161 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-16 00:12:42,162 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-16 00:12:42,163 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_28882d14-d12b-49cf-b91d-77286f008a64/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 -> 61869dea11c33643d44719730b54f6ea8fd7faa2 [2019-11-16 00:12:42,205 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:12:42,215 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:12:42,218 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:12:42,219 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:12:42,219 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:12:42,220 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_28882d14-d12b-49cf-b91d-77286f008a64/bin/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/cstrpbrk-alloca-1.i [2019-11-16 00:12:42,270 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_28882d14-d12b-49cf-b91d-77286f008a64/bin/uautomizer/data/531cac61c/f9837a775514471ab519acbbfbf848ac/FLAG713db899c [2019-11-16 00:12:42,769 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:12:42,770 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_28882d14-d12b-49cf-b91d-77286f008a64/sv-benchmarks/c/termination-memory-alloca/cstrpbrk-alloca-1.i [2019-11-16 00:12:42,796 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_28882d14-d12b-49cf-b91d-77286f008a64/bin/uautomizer/data/531cac61c/f9837a775514471ab519acbbfbf848ac/FLAG713db899c [2019-11-16 00:12:43,291 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_28882d14-d12b-49cf-b91d-77286f008a64/bin/uautomizer/data/531cac61c/f9837a775514471ab519acbbfbf848ac [2019-11-16 00:12:43,294 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:12:43,295 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-16 00:12:43,298 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:12:43,299 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:12:43,304 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:12:43,305 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:12:43" (1/1) ... [2019-11-16 00:12:43,308 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9b3d066 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:12:43, skipping insertion in model container [2019-11-16 00:12:43,308 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:12:43" (1/1) ... [2019-11-16 00:12:43,315 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:12:43,369 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:12:43,715 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:12:43,728 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:12:43,798 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:12:43,847 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:12:43,848 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:12:43 WrapperNode [2019-11-16 00:12:43,848 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:12:43,849 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-16 00:12:43,849 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-16 00:12:43,849 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-16 00:12:43,857 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:12:43" (1/1) ... [2019-11-16 00:12:43,873 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:12:43" (1/1) ... [2019-11-16 00:12:43,894 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-16 00:12:43,894 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:12:43,894 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:12:43,895 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:12:43,901 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:12:43" (1/1) ... [2019-11-16 00:12:43,902 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:12:43" (1/1) ... [2019-11-16 00:12:43,904 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:12:43" (1/1) ... [2019-11-16 00:12:43,905 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:12:43" (1/1) ... [2019-11-16 00:12:43,913 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:12:43" (1/1) ... [2019-11-16 00:12:43,917 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:12:43" (1/1) ... [2019-11-16 00:12:43,918 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:12:43" (1/1) ... [2019-11-16 00:12:43,928 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:12:43,929 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:12:43,929 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:12:43,929 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:12:43,930 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:12:43" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_28882d14-d12b-49cf-b91d-77286f008a64/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:12:44,000 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-16 00:12:44,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-16 00:12:44,001 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-16 00:12:44,002 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-16 00:12:44,002 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:12:44,003 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:12:44,297 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:12:44,298 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-16 00:12:44,299 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:12:44 BoogieIcfgContainer [2019-11-16 00:12:44,299 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:12:44,300 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-16 00:12:44,300 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-16 00:12:44,303 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-16 00:12:44,304 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:12:44,304 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 16.11 12:12:43" (1/3) ... [2019-11-16 00:12:44,305 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@75ff372b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.11 12:12:44, skipping insertion in model container [2019-11-16 00:12:44,305 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:12:44,305 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:12:43" (2/3) ... [2019-11-16 00:12:44,306 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@75ff372b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.11 12:12:44, skipping insertion in model container [2019-11-16 00:12:44,306 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:12:44,306 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:12:44" (3/3) ... [2019-11-16 00:12:44,308 INFO L371 chiAutomizerObserver]: Analyzing ICFG cstrpbrk-alloca-1.i [2019-11-16 00:12:44,345 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-16 00:12:44,345 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-16 00:12:44,346 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-16 00:12:44,346 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:12:44,346 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:12:44,346 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-16 00:12:44,346 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:12:44,346 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-16 00:12:44,360 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-11-16 00:12:44,382 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-16 00:12:44,383 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:12:44,383 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:12:44,388 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-16 00:12:44,388 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-11-16 00:12:44,389 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-16 00:12:44,389 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-11-16 00:12:44,391 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-16 00:12:44,391 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:12:44,391 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:12:44,392 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-16 00:12:44,392 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-11-16 00:12:44,400 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.base, main_#t~ret14.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 8#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);cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem4, cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~mem6, cstrpbrk_#t~short7, cstrpbrk_#t~mem9, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 3#L552-4true [2019-11-16 00:12:44,400 INFO L793 eck$LassoCheckResult]: Loop: 3#L552-4true call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 14#L552-1true assume !!(0 != cstrpbrk_#t~mem3);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; 16#L555-5true assume !true; 19#L555-6true call cstrpbrk_#t~mem9 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); 5#L557true assume !(cstrpbrk_#t~mem9 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem9; 20#L552-3true cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset; 3#L552-4true [2019-11-16 00:12:44,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:12:44,407 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2019-11-16 00:12:44,415 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:12:44,416 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574913870] [2019-11-16 00:12:44,416 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:44,416 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:44,416 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:12:44,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:12:44,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:12:44,576 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:12:44,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:12:44,577 INFO L82 PathProgramCache]: Analyzing trace with hash 1454917130, now seen corresponding path program 1 times [2019-11-16 00:12:44,577 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:12:44,578 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328458192] [2019-11-16 00:12:44,578 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:44,578 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:44,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:12:44,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:44,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:12:44,615 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328458192] [2019-11-16 00:12:44,616 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:12:44,616 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:12:44,616 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29391936] [2019-11-16 00:12:44,621 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-16 00:12:44,622 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:12:44,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-16 00:12:44,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-16 00:12:44,637 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2019-11-16 00:12:44,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:12:44,643 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2019-11-16 00:12:44,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-16 00:12:44,645 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 23 transitions. [2019-11-16 00:12:44,646 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-16 00:12:44,650 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 13 states and 17 transitions. [2019-11-16 00:12:44,651 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-11-16 00:12:44,651 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-11-16 00:12:44,652 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 17 transitions. [2019-11-16 00:12:44,652 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:12:44,652 INFO L688 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2019-11-16 00:12:44,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 17 transitions. [2019-11-16 00:12:44,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-11-16 00:12:44,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-11-16 00:12:44,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2019-11-16 00:12:44,680 INFO L711 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2019-11-16 00:12:44,681 INFO L591 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2019-11-16 00:12:44,681 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-16 00:12:44,681 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2019-11-16 00:12:44,682 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-16 00:12:44,682 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:12:44,682 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:12:44,683 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-16 00:12:44,683 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:12:44,683 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.base, main_#t~ret14.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 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);cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem4, cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~mem6, cstrpbrk_#t~short7, cstrpbrk_#t~mem9, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 44#L552-4 [2019-11-16 00:12:44,683 INFO L793 eck$LassoCheckResult]: Loop: 44#L552-4 call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 45#L552-1 assume !!(0 != cstrpbrk_#t~mem3);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; 56#L555-5 call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := 0 != cstrpbrk_#t~mem5; 51#L555-1 assume cstrpbrk_#t~short7;call cstrpbrk_#t~mem6 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := cstrpbrk_#t~mem6 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 52#L555-3 assume !cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem6; 55#L555-6 call cstrpbrk_#t~mem9 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); 46#L557 assume !(cstrpbrk_#t~mem9 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem9; 47#L552-3 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset; 44#L552-4 [2019-11-16 00:12:44,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:12:44,684 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 2 times [2019-11-16 00:12:44,684 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:12:44,684 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768067376] [2019-11-16 00:12:44,684 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:44,685 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:44,685 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:12:44,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:12:44,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:12:44,727 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:12:44,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:12:44,727 INFO L82 PathProgramCache]: Analyzing trace with hash 1927396657, now seen corresponding path program 1 times [2019-11-16 00:12:44,728 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:12:44,728 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674724663] [2019-11-16 00:12:44,728 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:44,728 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:44,728 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:12:44,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:12:44,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:12:44,760 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:12:44,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:12:44,761 INFO L82 PathProgramCache]: Analyzing trace with hash -102988426, now seen corresponding path program 1 times [2019-11-16 00:12:44,761 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:12:44,761 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071682926] [2019-11-16 00:12:44,761 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:44,761 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:44,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:12:44,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:12:44,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:12:44,842 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:12:45,061 WARN L191 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2019-11-16 00:12:45,358 WARN L191 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2019-11-16 00:12:45,759 WARN L191 SmtUtils]: Spent 398.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 87 [2019-11-16 00:12:45,938 WARN L191 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-11-16 00:12:45,952 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:12:45,953 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:12:45,953 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:12:45,953 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:12:45,961 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:12:45,961 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:12:45,962 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:12:45,963 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:12:45,963 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrpbrk-alloca-1.i_Iteration2_Lasso [2019-11-16 00:12:45,963 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:12:45,963 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:12:46,008 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:12:46,014 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:12:46,017 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:12:46,020 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:12:46,023 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:12:46,025 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:12:46,030 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:12:46,032 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:12:46,035 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:12:46,039 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:12:46,042 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:12:46,046 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:12:46,048 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:12:46,051 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:12:46,053 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:12:46,056 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:12:46,059 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:12:46,062 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:12:46,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:12:46,068 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:12:46,468 WARN L191 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 67 [2019-11-16 00:12:46,710 WARN L191 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-11-16 00:12:46,711 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:12:46,714 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:12:46,717 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:12:47,315 WARN L191 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 28 [2019-11-16 00:12:47,845 WARN L191 SmtUtils]: Spent 495.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 40 [2019-11-16 00:12:47,919 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:12:47,924 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:12:47,927 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:12:47,929 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:12:47,929 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:12:47,930 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:12:47,930 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:12:47,930 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:12:47,932 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:12:47,933 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:12:47,935 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:12:47,936 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:12:47,937 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:12:47,937 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:12:47,937 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:12:47,937 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:12:47,938 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:12:47,938 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:12:47,938 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:12:47,940 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:12:47,940 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:12:47,941 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:12:47,941 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:12:47,941 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:12:47,942 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:12:47,942 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:12:47,942 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:12:47,943 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:12:47,943 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:12:47,944 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:12:47,945 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:12:47,945 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:12:47,945 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:12:47,945 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:12:47,946 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:12:47,946 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:12:47,946 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:12:47,948 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:12:47,948 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:12:47,949 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:12:47,949 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:12:47,949 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:12:47,950 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:12:47,950 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:12:47,950 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:12:47,951 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:12:47,952 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:12:47,952 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:12:47,953 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:12:47,953 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:12:47,953 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:12:47,953 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:12:47,956 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:12:47,956 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:12:47,963 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:12:47,966 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:12:47,973 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:12:47,974 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:12:47,974 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:12:47,974 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:12:47,974 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:12:47,975 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:12:47,975 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:12:47,976 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:12:47,976 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:12:47,977 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:12:47,977 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:12:47,977 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:12:47,978 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:12:47,978 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:12:47,978 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:12:47,979 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:12:47,979 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:12:47,980 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:12:47,981 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:12:47,982 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:12:47,982 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:12:47,983 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:12:47,985 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:12:47,985 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:12:47,989 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:12:47,992 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:12:47,995 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:12:47,996 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:12:47,996 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:12:47,997 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:12:47,997 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:12:47,997 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:12:47,998 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:12:47,999 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:12:48,012 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:12:48,013 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:12:48,013 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:12:48,013 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:12:48,013 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:12:48,015 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:12:48,015 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:12:48,018 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:12:48,019 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:12:48,019 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:12:48,020 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:12:48,020 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:12:48,021 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:12:48,021 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:12:48,022 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:12:48,031 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:12:48,032 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:12:48,032 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:12:48,033 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:12:48,033 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:12:48,033 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:12:48,033 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:12:48,033 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:12:48,034 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:12:48,034 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:12:48,034 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:12:48,035 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:12:48,035 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:12:48,035 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:12:48,047 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:12:48,048 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:12:48,048 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:12:48,049 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:12:48,049 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:12:48,050 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:12:48,050 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:12:48,051 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:12:48,053 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:12:48,053 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:12:48,053 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:12:48,053 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:12:48,054 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:12:48,056 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:12:48,057 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:12:48,058 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:12:48,061 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:12:48,062 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:12:48,062 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:12:48,063 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:12:48,063 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:12:48,063 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:12:48,064 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:12:48,064 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:12:48,065 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:12:48,066 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:12:48,066 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:12:48,066 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:12:48,067 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:12:48,067 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:12:48,067 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:12:48,068 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:12:48,069 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:12:48,069 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:12:48,070 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:12:48,071 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:12:48,072 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:12:48,072 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:12:48,072 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:12:48,074 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:12:48,074 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:12:48,078 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:12:48,079 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:12:48,085 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:12:48,086 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:12:48,086 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:12:48,086 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:12:48,087 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:12:48,087 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:12:48,089 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:12:48,089 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:12:48,089 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:12:48,090 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:12:48,090 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:12:48,090 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:12:48,094 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:12:48,095 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:12:48,146 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:12:48,174 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-11-16 00:12:48,174 INFO L444 ModelExtractionUtils]: 21 out of 28 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-11-16 00:12:48,176 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:12:48,178 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-16 00:12:48,178 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:12:48,179 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_cstrpbrk_~sc1~0.base)_1, ULTIMATE.start_cstrpbrk_~sc1~0.offset) = 1*v_rep(select #length ULTIMATE.start_cstrpbrk_~sc1~0.base)_1 - 1*ULTIMATE.start_cstrpbrk_~sc1~0.offset Supporting invariants [] [2019-11-16 00:12:48,211 INFO L297 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2019-11-16 00:12:48,218 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-16 00:12:48,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:12:48,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:48,265 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:12:48,266 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:12:48,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:48,292 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-16 00:12:48,293 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:12:48,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:12:48,325 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-16 00:12:48,325 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-11-16 00:12:48,365 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-16 00:12:48,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-16 00:12:48,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-16 00:12:48,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2019-11-16 00:12:48,368 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 8 letters. [2019-11-16 00:12:48,369 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:12:48,369 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 13 letters. Loop has 8 letters. [2019-11-16 00:12:48,370 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:12:48,370 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 16 letters. [2019-11-16 00:12:48,370 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:12:48,370 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 28 transitions. [2019-11-16 00:12:48,371 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-16 00:12:48,372 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 18 states and 25 transitions. [2019-11-16 00:12:48,372 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-11-16 00:12:48,373 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-11-16 00:12:48,373 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 25 transitions. [2019-11-16 00:12:48,373 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:12:48,373 INFO L688 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-11-16 00:12:48,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 25 transitions. [2019-11-16 00:12:48,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-11-16 00:12:48,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-11-16 00:12:48,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2019-11-16 00:12:48,375 INFO L711 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-11-16 00:12:48,375 INFO L591 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-11-16 00:12:48,376 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-16 00:12:48,376 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 25 transitions. [2019-11-16 00:12:48,376 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-16 00:12:48,377 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:12:48,377 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:12:48,377 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:12:48,377 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-16 00:12:48,378 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.base, main_#t~ret14.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 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);cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem4, cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~mem6, cstrpbrk_#t~short7, cstrpbrk_#t~mem9, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 173#L552-4 call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 175#L552-1 assume !!(0 != cstrpbrk_#t~mem3);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; 188#L555-5 [2019-11-16 00:12:48,378 INFO L793 eck$LassoCheckResult]: Loop: 188#L555-5 call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := 0 != cstrpbrk_#t~mem5; 182#L555-1 assume cstrpbrk_#t~short7;call cstrpbrk_#t~mem6 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := cstrpbrk_#t~mem6 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 183#L555-3 assume !!cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem6;cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset := cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_#t~post8.base, 1 + cstrpbrk_#t~post8.offset;havoc cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset; 188#L555-5 [2019-11-16 00:12:48,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:12:48,378 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935595, now seen corresponding path program 1 times [2019-11-16 00:12:48,378 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:12:48,378 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373765248] [2019-11-16 00:12:48,379 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:48,379 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:48,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:12:48,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:12:48,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:12:48,417 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:12:48,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:12:48,417 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 1 times [2019-11-16 00:12:48,418 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:12:48,418 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925992781] [2019-11-16 00:12:48,418 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:48,418 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:48,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:12:48,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:12:48,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:12:48,436 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:12:48,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:12:48,442 INFO L82 PathProgramCache]: Analyzing trace with hash 1593218778, now seen corresponding path program 1 times [2019-11-16 00:12:48,442 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:12:48,442 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092197065] [2019-11-16 00:12:48,442 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:48,442 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:48,443 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:12:48,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:12:48,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:12:48,493 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:12:48,737 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2019-11-16 00:12:49,074 WARN L191 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 100 [2019-11-16 00:12:49,187 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2019-11-16 00:12:49,189 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:12:49,189 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:12:49,189 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:12:49,189 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:12:49,189 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:12:49,189 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:12:49,189 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:12:49,189 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:12:49,190 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrpbrk-alloca-1.i_Iteration3_Lasso [2019-11-16 00:12:49,190 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:12:49,190 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:12:49,195 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:12:49,205 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:12:49,207 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:12:49,208 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:12:49,210 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:12:49,212 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:12:49,214 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:12:49,216 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:12:49,218 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:12:49,220 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:12:49,222 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:12:49,223 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:12:49,225 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:12:49,227 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:12:49,228 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:12:49,230 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:12:49,231 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:12:49,233 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:12:49,235 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:12:49,236 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:12:49,239 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:12:49,537 WARN L191 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 78 [2019-11-16 00:12:49,648 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:12:49,650 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:12:50,394 WARN L191 SmtUtils]: Spent 391.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-11-16 00:12:50,710 WARN L191 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2019-11-16 00:12:50,723 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:12:50,723 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:12:50,724 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:12:50,726 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:12:50,727 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:12:50,727 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:12:50,727 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:12:50,727 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:12:50,728 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:12:50,728 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:12:50,729 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:12:50,729 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:12:50,730 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:12:50,730 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:12:50,730 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:12:50,730 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:12:50,730 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:12:50,730 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:12:50,730 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:12:50,731 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:12:50,731 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:12:50,732 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:12:50,732 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:12:50,732 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:12:50,732 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:12:50,732 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:12:50,732 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:12:50,733 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:12:50,733 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:12:50,733 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:12:50,734 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:12:50,734 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:12:50,734 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:12:50,734 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:12:50,734 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:12:50,735 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:12:50,735 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:12:50,735 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:12:50,736 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:12:50,736 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:12:50,736 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:12:50,737 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:12:50,737 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:12:50,737 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:12:50,737 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:12:50,737 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:12:50,738 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:12:50,738 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:12:50,738 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:12:50,739 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:12:50,739 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:12:50,739 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:12:50,740 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:12:50,740 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:12:50,742 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:12:50,742 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:12:50,743 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:12:50,743 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:12:50,743 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:12:50,743 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:12:50,743 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:12:50,744 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:12:50,744 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:12:50,744 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:12:50,745 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:12:50,745 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:12:50,745 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:12:50,745 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:12:50,745 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:12:50,746 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:12:50,747 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:12:50,749 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:12:50,750 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:12:50,750 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:12:50,750 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:12:50,750 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:12:50,751 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:12:50,751 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:12:50,751 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:12:50,751 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:12:50,752 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:12:50,752 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:12:50,753 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:12:50,753 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:12:50,753 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:12:50,753 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:12:50,753 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:12:50,754 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:12:50,754 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:12:50,754 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:12:50,755 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:12:50,755 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:12:50,755 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:12:50,755 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:12:50,756 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:12:50,756 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:12:50,756 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:12:50,756 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:12:50,757 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:12:50,757 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:12:50,758 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:12:50,758 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:12:50,758 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:12:50,758 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:12:50,759 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:12:50,759 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:12:50,767 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:12:50,768 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:12:50,768 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:12:50,768 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:12:50,768 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:12:50,769 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:12:50,769 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:12:50,769 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:12:50,769 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:12:50,770 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:12:50,770 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:12:50,771 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:12:50,771 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:12:50,771 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:12:50,771 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:12:50,771 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:12:50,771 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:12:50,772 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:12:50,772 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:12:50,773 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:12:50,773 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:12:50,773 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:12:50,773 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:12:50,773 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:12:50,774 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:12:50,774 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:12:50,774 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:12:50,775 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:12:50,775 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:12:50,775 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:12:50,776 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:12:50,776 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:12:50,776 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:12:50,776 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:12:50,776 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:12:50,776 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:12:50,777 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:12:50,777 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:12:50,778 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:12:50,778 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:12:50,778 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:12:50,778 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:12:50,778 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:12:50,779 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:12:50,783 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:12:50,784 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:12:50,784 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:12:50,785 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:12:50,785 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:12:50,785 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:12:50,786 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:12:50,786 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:12:50,787 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:12:50,787 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:12:50,788 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:12:50,788 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:12:50,789 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:12:50,789 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:12:50,789 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:12:50,790 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:12:50,790 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:12:50,790 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:12:50,790 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:12:50,793 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:12:50,793 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:12:50,794 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:12:50,794 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:12:50,794 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:12:50,794 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:12:50,795 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:12:50,795 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:12:50,799 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:12:50,799 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:12:50,800 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:12:50,800 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-11-16 00:12:50,800 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:12:50,800 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:12:50,807 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-11-16 00:12:50,807 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:12:50,836 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:12:50,837 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:12:50,837 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:12:50,837 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:12:50,837 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:12:50,838 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:12:50,839 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:12:50,839 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:12:50,841 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:12:50,841 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:12:50,842 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:12:50,842 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:12:50,842 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:12:50,842 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:12:50,845 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:12:50,845 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:12:50,867 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:12:50,892 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-16 00:12:50,892 INFO L444 ModelExtractionUtils]: 39 out of 43 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-16 00:12:50,892 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:12:50,893 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-16 00:12:50,893 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:12:50,893 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrpbrk_~s~0.offset, v_rep(select #length ULTIMATE.start_cstrpbrk_~s~0.base)_2) = -1*ULTIMATE.start_cstrpbrk_~s~0.offset + 1*v_rep(select #length ULTIMATE.start_cstrpbrk_~s~0.base)_2 Supporting invariants [] [2019-11-16 00:12:50,946 INFO L297 tatePredicateManager]: 15 out of 15 supporting invariants were superfluous and have been removed [2019-11-16 00:12:50,947 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-16 00:12:50,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:12:50,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:50,982 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:12:50,983 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:12:50,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:50,991 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-16 00:12:50,991 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:12:51,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:12:51,005 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-16 00:12:51,005 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9 Second operand 3 states. [2019-11-16 00:12:51,030 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-16 00:12:51,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-16 00:12:51,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-16 00:12:51,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2019-11-16 00:12:51,032 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 7 letters. Loop has 3 letters. [2019-11-16 00:12:51,032 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:12:51,032 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 10 letters. Loop has 3 letters. [2019-11-16 00:12:51,032 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:12:51,033 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 7 letters. Loop has 6 letters. [2019-11-16 00:12:51,033 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:12:51,033 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 57 transitions. [2019-11-16 00:12:51,035 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-16 00:12:51,036 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 30 states and 40 transitions. [2019-11-16 00:12:51,036 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-16 00:12:51,036 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-16 00:12:51,036 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 40 transitions. [2019-11-16 00:12:51,036 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:12:51,036 INFO L688 BuchiCegarLoop]: Abstraction has 30 states and 40 transitions. [2019-11-16 00:12:51,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 40 transitions. [2019-11-16 00:12:51,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2019-11-16 00:12:51,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-11-16 00:12:51,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2019-11-16 00:12:51,039 INFO L711 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2019-11-16 00:12:51,039 INFO L591 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2019-11-16 00:12:51,039 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-16 00:12:51,039 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 33 transitions. [2019-11-16 00:12:51,040 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-16 00:12:51,040 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:12:51,040 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:12:51,041 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:12:51,041 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-16 00:12:51,041 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.base, main_#t~ret14.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 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);cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem4, cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~mem6, cstrpbrk_#t~short7, cstrpbrk_#t~mem9, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 345#L552-4 call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 346#L552-1 assume !!(0 != cstrpbrk_#t~mem3);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; 362#L555-5 call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := 0 != cstrpbrk_#t~mem5; 367#L555-1 assume !cstrpbrk_#t~short7; 366#L555-3 assume !cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem6; 365#L555-6 call cstrpbrk_#t~mem9 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); 350#L557 assume !(cstrpbrk_#t~mem9 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem9; 351#L552-3 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset; 347#L552-4 call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 349#L552-1 assume !!(0 != cstrpbrk_#t~mem3);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; 361#L555-5 [2019-11-16 00:12:51,041 INFO L793 eck$LassoCheckResult]: Loop: 361#L555-5 call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := 0 != cstrpbrk_#t~mem5; 355#L555-1 assume cstrpbrk_#t~short7;call cstrpbrk_#t~mem6 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := cstrpbrk_#t~mem6 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 356#L555-3 assume !!cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem6;cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset := cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_#t~post8.base, 1 + cstrpbrk_#t~post8.offset;havoc cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset; 361#L555-5 [2019-11-16 00:12:51,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:12:51,041 INFO L82 PathProgramCache]: Analyzing trace with hash 1587378397, now seen corresponding path program 1 times [2019-11-16 00:12:51,041 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:12:51,042 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190889904] [2019-11-16 00:12:51,042 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:51,042 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:51,042 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:12:51,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:51,132 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:12:51,132 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190889904] [2019-11-16 00:12:51,133 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:12:51,133 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:12:51,133 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101266014] [2019-11-16 00:12:51,133 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-16 00:12:51,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:12:51,134 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 2 times [2019-11-16 00:12:51,134 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:12:51,134 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819976259] [2019-11-16 00:12:51,134 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:51,134 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:51,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:12:51,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:12:51,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:12:51,146 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:12:51,338 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2019-11-16 00:12:51,338 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:12:51,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:12:51,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:12:51,339 INFO L87 Difference]: Start difference. First operand 24 states and 33 transitions. cyclomatic complexity: 12 Second operand 7 states. [2019-11-16 00:12:51,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:12:51,457 INFO L93 Difference]: Finished difference Result 30 states and 39 transitions. [2019-11-16 00:12:51,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:12:51,458 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 39 transitions. [2019-11-16 00:12:51,459 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-16 00:12:51,460 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 27 states and 35 transitions. [2019-11-16 00:12:51,460 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-16 00:12:51,460 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-16 00:12:51,460 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 35 transitions. [2019-11-16 00:12:51,461 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:12:51,461 INFO L688 BuchiCegarLoop]: Abstraction has 27 states and 35 transitions. [2019-11-16 00:12:51,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 35 transitions. [2019-11-16 00:12:51,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2019-11-16 00:12:51,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-11-16 00:12:51,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2019-11-16 00:12:51,464 INFO L711 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2019-11-16 00:12:51,464 INFO L591 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2019-11-16 00:12:51,464 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-16 00:12:51,464 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 33 transitions. [2019-11-16 00:12:51,465 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-16 00:12:51,465 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:12:51,465 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:12:51,466 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:12:51,466 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-16 00:12:51,466 INFO L791 eck$LassoCheckResult]: Stem: 432#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 431#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.base, main_#t~ret14.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 425#L565 assume !(main_~length1~0 < 1); 426#L565-2 assume !(main_~length2~0 < 1); 424#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);cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem4, cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~mem6, cstrpbrk_#t~short7, cstrpbrk_#t~mem9, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 417#L552-4 call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 418#L552-1 assume !!(0 != cstrpbrk_#t~mem3);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; 434#L555-5 call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := 0 != cstrpbrk_#t~mem5; 435#L555-1 assume cstrpbrk_#t~short7;call cstrpbrk_#t~mem6 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := cstrpbrk_#t~mem6 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 437#L555-3 assume !cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem6; 436#L555-6 call cstrpbrk_#t~mem9 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); 422#L557 assume !(cstrpbrk_#t~mem9 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem9; 423#L552-3 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset; 419#L552-4 call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 421#L552-1 assume !!(0 != cstrpbrk_#t~mem3);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; 433#L555-5 [2019-11-16 00:12:51,466 INFO L793 eck$LassoCheckResult]: Loop: 433#L555-5 call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := 0 != cstrpbrk_#t~mem5; 427#L555-1 assume cstrpbrk_#t~short7;call cstrpbrk_#t~mem6 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := cstrpbrk_#t~mem6 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 428#L555-3 assume !!cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem6;cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset := cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_#t~post8.base, 1 + cstrpbrk_#t~post8.offset;havoc cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset; 433#L555-5 [2019-11-16 00:12:51,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:12:51,467 INFO L82 PathProgramCache]: Analyzing trace with hash -187628965, now seen corresponding path program 2 times [2019-11-16 00:12:51,467 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:12:51,467 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64020269] [2019-11-16 00:12:51,467 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:51,467 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:51,467 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:12:51,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:12:51,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:12:51,500 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:12:51,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:12:51,500 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 3 times [2019-11-16 00:12:51,500 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:12:51,501 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103497268] [2019-11-16 00:12:51,501 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:51,501 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:51,501 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:12:51,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:12:51,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:12:51,509 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:12:51,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:12:51,510 INFO L82 PathProgramCache]: Analyzing trace with hash -1902015318, now seen corresponding path program 1 times [2019-11-16 00:12:51,510 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:12:51,510 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209756579] [2019-11-16 00:12:51,510 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:51,510 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:51,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:12:51,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:12:51,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:12:51,583 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:12:51,792 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2019-11-16 00:12:52,382 WARN L191 SmtUtils]: Spent 587.00 ms on a formula simplification. DAG size of input: 175 DAG size of output: 137 [2019-11-16 00:12:53,311 WARN L191 SmtUtils]: Spent 912.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 109 [2019-11-16 00:12:53,313 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:12:53,313 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:12:53,313 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:12:53,313 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:12:53,313 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:12:53,314 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:12:53,314 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:12:53,314 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:12:53,314 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrpbrk-alloca-1.i_Iteration5_Lasso [2019-11-16 00:12:53,314 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:12:53,314 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:12:53,326 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:12:53,332 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:12:53,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-16 00:12:53,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-16 00:12:53,348 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:12:53,350 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:12:53,357 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:12:53,359 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:12:53,552 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-16 00:12:54,345 WARN L191 SmtUtils]: Spent 788.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 96 [2019-11-16 00:12:54,482 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-11-16 00:12:54,482 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:12:54,484 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:12:54,497 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:12:54,499 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:12:54,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-16 00:12:54,521 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:12:54,523 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:12:54,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-16 00:12:54,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-16 00:12:54,532 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:12:54,539 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:12:54,543 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:12:54,547 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:12:54,549 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:12:54,555 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:12:54,944 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2019-11-16 00:12:55,374 WARN L191 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-11-16 00:12:55,804 WARN L191 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 38 [2019-11-16 00:12:56,000 WARN L191 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2019-11-16 00:12:56,027 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:12:56,027 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:12:56,028 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:12:56,028 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:12:56,029 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:12:56,029 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:12:56,029 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:12:56,029 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:12:56,030 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:12:56,030 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:12:56,031 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:12:56,031 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:12:56,032 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:12:56,032 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:12:56,032 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:12:56,032 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:12:56,032 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:12:56,033 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:12:56,033 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:12:56,033 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:12:56,034 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:12:56,034 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:12:56,035 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:12:56,035 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:12:56,035 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:12:56,035 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:12:56,035 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:12:56,036 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:12:56,036 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:12:56,037 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:12:56,037 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:12:56,037 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:12:56,037 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:12:56,038 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:12:56,038 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:12:56,038 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:12:56,038 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:12:56,039 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:12:56,039 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:12:56,040 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:12:56,040 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:12:56,040 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:12:56,040 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:12:56,040 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:12:56,041 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:12:56,041 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:12:56,041 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:12:56,042 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:12:56,042 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:12:56,042 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:12:56,043 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:12:56,043 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:12:56,044 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:12:56,044 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:12:56,045 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:12:56,046 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:12:56,046 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:12:56,047 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:12:56,047 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:12:56,047 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:12:56,047 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:12:56,048 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:12:56,048 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:12:56,048 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:12:56,049 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:12:56,049 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:12:56,049 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:12:56,050 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:12:56,050 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:12:56,051 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:12:56,051 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:12:56,056 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:12:56,057 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:12:56,057 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:12:56,058 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:12:56,058 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:12:56,058 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:12:56,059 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:12:56,059 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:12:56,060 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:12:56,061 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:12:56,061 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:12:56,061 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:12:56,062 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:12:56,062 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:12:56,063 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:12:56,063 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:12:56,064 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:12:56,065 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:12:56,065 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:12:56,065 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:12:56,066 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:12:56,066 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:12:56,067 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:12:56,067 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:12:56,068 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:12:56,068 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:12:56,069 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:12:56,069 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:12:56,069 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:12:56,070 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:12:56,070 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:12:56,071 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:12:56,072 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:12:56,073 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:12:56,074 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:12:56,074 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-11-16 00:12:56,074 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:12:56,074 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:12:56,078 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-11-16 00:12:56,079 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:12:56,099 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:12:56,100 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:12:56,101 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:12:56,101 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:12:56,101 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:12:56,101 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:12:56,104 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:12:56,105 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:12:56,133 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:12:56,149 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-16 00:12:56,149 INFO L444 ModelExtractionUtils]: 45 out of 49 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-16 00:12:56,150 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:12:56,151 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-16 00:12:56,151 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:12:56,151 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_cstrpbrk_~s~0.base)_3, ULTIMATE.start_cstrpbrk_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_cstrpbrk_~s~0.base)_3 - 1*ULTIMATE.start_cstrpbrk_~s~0.offset Supporting invariants [] [2019-11-16 00:12:56,287 INFO L297 tatePredicateManager]: 26 out of 26 supporting invariants were superfluous and have been removed [2019-11-16 00:12:56,288 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-16 00:12:56,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:12:56,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:56,332 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:12:56,333 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:12:56,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:56,340 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-16 00:12:56,340 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:12:56,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:12:56,356 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-16 00:12:56,356 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11 Second operand 3 states. [2019-11-16 00:12:56,388 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11. Second operand 3 states. Result 41 states and 51 transitions. Complement of second has 5 states. [2019-11-16 00:12:56,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-16 00:12:56,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-16 00:12:56,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2019-11-16 00:12:56,389 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2019-11-16 00:12:56,390 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:12:56,390 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-16 00:12:56,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:12:56,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:56,431 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:12:56,432 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:12:56,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:56,441 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-16 00:12:56,441 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:12:56,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:12:56,456 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-16 00:12:56,456 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11 Second operand 3 states. [2019-11-16 00:12:56,478 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11. Second operand 3 states. Result 41 states and 51 transitions. Complement of second has 5 states. [2019-11-16 00:12:56,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-16 00:12:56,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-16 00:12:56,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2019-11-16 00:12:56,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2019-11-16 00:12:56,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:12:56,480 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-16 00:12:56,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:12:56,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:56,538 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:12:56,539 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:12:56,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:56,549 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-16 00:12:56,550 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:12:56,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:12:56,571 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-16 00:12:56,571 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11 Second operand 3 states. [2019-11-16 00:12:56,605 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11. Second operand 3 states. Result 41 states and 53 transitions. Complement of second has 4 states. [2019-11-16 00:12:56,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-16 00:12:56,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-16 00:12:56,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 27 transitions. [2019-11-16 00:12:56,606 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 15 letters. Loop has 3 letters. [2019-11-16 00:12:56,606 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:12:56,607 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 18 letters. Loop has 3 letters. [2019-11-16 00:12:56,607 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:12:56,607 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 15 letters. Loop has 6 letters. [2019-11-16 00:12:56,608 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:12:56,608 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 53 transitions. [2019-11-16 00:12:56,610 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-16 00:12:56,610 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 0 states and 0 transitions. [2019-11-16 00:12:56,610 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-16 00:12:56,610 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-16 00:12:56,611 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-16 00:12:56,611 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:12:56,611 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:12:56,613 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:12:56,613 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:12:56,613 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-16 00:12:56,613 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-16 00:12:56,613 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-16 00:12:56,613 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-16 00:12:56,621 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 16.11 12:12:56 BoogieIcfgContainer [2019-11-16 00:12:56,621 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-16 00:12:56,622 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-16 00:12:56,622 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-16 00:12:56,622 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-16 00:12:56,623 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:12:44" (3/4) ... [2019-11-16 00:12:56,626 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-16 00:12:56,627 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-16 00:12:56,629 INFO L168 Benchmark]: Toolchain (without parser) took 13333.05 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 242.2 MB). Free memory was 939.4 MB in the beginning and 859.2 MB in the end (delta: 80.2 MB). Peak memory consumption was 322.4 MB. Max. memory is 11.5 GB. [2019-11-16 00:12:56,629 INFO L168 Benchmark]: CDTParser took 0.21 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-16 00:12:56,631 INFO L168 Benchmark]: CACSL2BoogieTranslator took 550.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -185.8 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2019-11-16 00:12:56,632 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.17 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:12:56,637 INFO L168 Benchmark]: Boogie Preprocessor took 34.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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-16 00:12:56,638 INFO L168 Benchmark]: RCFGBuilder took 370.55 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-16 00:12:56,638 INFO L168 Benchmark]: BuchiAutomizer took 12321.57 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 99.6 MB). Free memory was 1.1 GB in the beginning and 859.2 MB in the end (delta: 238.2 MB). Peak memory consumption was 337.8 MB. Max. memory is 11.5 GB. [2019-11-16 00:12:56,639 INFO L168 Benchmark]: Witness Printer took 4.86 ms. Allocated memory is still 1.3 GB. Free memory is still 859.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:12:56,646 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.21 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 550.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -185.8 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 45.17 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 34.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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 370.55 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 12321.57 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 99.6 MB). Free memory was 1.1 GB in the beginning and 859.2 MB in the end (delta: 238.2 MB). Peak memory consumption was 337.8 MB. Max. memory is 11.5 GB. * Witness Printer took 4.86 ms. Allocated memory is still 1.3 GB. Free memory is still 859.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - 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 unknown-#length-unknown[sc1] + -1 * sc1 and consists of 3 locations. One deterministic module has affine ranking function -1 * s + unknown-#length-unknown[s] and consists of 3 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[s] + -1 * s and consists of 3 locations. 2 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 12.2s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 11.4s. Construction of modules took 0.1s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 8 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 25 states and ocurred in iteration 4. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 109 SDtfs, 120 SDslu, 52 SDs, 0 SdLazy, 95 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital373 mio100 ax105 hnf99 lsp87 ukn72 mio100 lsp30 div129 bol100 ite100 ukn100 eq165 hnf81 smp91 dnf701 smp43 tf100 neg96 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 36ms VariablesStem: 11 VariablesLoop: 7 DisjunctsStem: 4 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 12 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...