./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/array-memsafety/openbsd_cmemchr-alloca-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_a6ce6d4b-0b3c-469a-9f10-dd5681994dee/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_a6ce6d4b-0b3c-469a-9f10-dd5681994dee/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_a6ce6d4b-0b3c-469a-9f10-dd5681994dee/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_a6ce6d4b-0b3c-469a-9f10-dd5681994dee/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/openbsd_cmemchr-alloca-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_a6ce6d4b-0b3c-469a-9f10-dd5681994dee/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_a6ce6d4b-0b3c-469a-9f10-dd5681994dee/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f10d5178d15d886f7ae857469faf20c98bafd5fa .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 20:39:41,189 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 20:39:41,190 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 20:39:41,200 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 20:39:41,201 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 20:39:41,201 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 20:39:41,203 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 20:39:41,204 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 20:39:41,206 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 20:39:41,207 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 20:39:41,208 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 20:39:41,209 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 20:39:41,209 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 20:39:41,210 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 20:39:41,211 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 20:39:41,212 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 20:39:41,212 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 20:39:41,213 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 20:39:41,215 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 20:39:41,216 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 20:39:41,218 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 20:39:41,218 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 20:39:41,219 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 20:39:41,220 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 20:39:41,222 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 20:39:41,226 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 20:39:41,226 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 20:39:41,227 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 20:39:41,228 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 20:39:41,230 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 20:39:41,230 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 20:39:41,230 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 20:39:41,231 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 20:39:41,232 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 20:39:41,232 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 20:39:41,234 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 20:39:41,235 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 20:39:41,235 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 20:39:41,235 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 20:39:41,236 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 20:39:41,237 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 20:39:41,240 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_a6ce6d4b-0b3c-469a-9f10-dd5681994dee/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-15 20:39:41,257 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 20:39:41,257 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 20:39:41,259 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 20:39:41,259 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 20:39:41,259 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 20:39:41,259 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-15 20:39:41,260 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-15 20:39:41,260 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-15 20:39:41,260 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-15 20:39:41,260 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-15 20:39:41,261 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-15 20:39:41,262 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 20:39:41,262 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 20:39:41,262 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 20:39:41,262 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 20:39:41,263 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 20:39:41,263 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 20:39:41,263 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-15 20:39:41,263 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-15 20:39:41,264 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-15 20:39:41,264 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 20:39:41,264 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 20:39:41,264 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-15 20:39:41,265 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 20:39:41,265 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-15 20:39:41,265 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 20:39:41,265 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 20:39:41,266 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-15 20:39:41,266 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 20:39:41,266 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 20:39:41,266 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-15 20:39:41,267 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-15 20:39:41,267 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_a6ce6d4b-0b3c-469a-9f10-dd5681994dee/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f10d5178d15d886f7ae857469faf20c98bafd5fa [2019-11-15 20:39:41,298 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 20:39:41,307 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 20:39:41,310 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 20:39:41,311 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 20:39:41,312 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 20:39:41,312 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_a6ce6d4b-0b3c-469a-9f10-dd5681994dee/bin/uautomizer/../../sv-benchmarks/c/array-memsafety/openbsd_cmemchr-alloca-2.i [2019-11-15 20:39:41,362 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a6ce6d4b-0b3c-469a-9f10-dd5681994dee/bin/uautomizer/data/94e3e3402/df4d1beca37c4d888a056bf42e3dba4f/FLAGcd2d2c308 [2019-11-15 20:39:41,833 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 20:39:41,833 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_a6ce6d4b-0b3c-469a-9f10-dd5681994dee/sv-benchmarks/c/array-memsafety/openbsd_cmemchr-alloca-2.i [2019-11-15 20:39:41,848 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a6ce6d4b-0b3c-469a-9f10-dd5681994dee/bin/uautomizer/data/94e3e3402/df4d1beca37c4d888a056bf42e3dba4f/FLAGcd2d2c308 [2019-11-15 20:39:41,860 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_a6ce6d4b-0b3c-469a-9f10-dd5681994dee/bin/uautomizer/data/94e3e3402/df4d1beca37c4d888a056bf42e3dba4f [2019-11-15 20:39:41,863 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 20:39:41,864 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 20:39:41,866 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 20:39:41,866 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 20:39:41,871 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 20:39:41,871 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:39:41" (1/1) ... [2019-11-15 20:39:41,874 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@544e8593 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:39:41, skipping insertion in model container [2019-11-15 20:39:41,874 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:39:41" (1/1) ... [2019-11-15 20:39:41,881 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 20:39:41,934 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 20:39:42,354 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:39:42,365 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 20:39:42,405 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:39:42,452 INFO L192 MainTranslator]: Completed translation [2019-11-15 20:39:42,453 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:39:42 WrapperNode [2019-11-15 20:39:42,454 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 20:39:42,454 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 20:39:42,454 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 20:39:42,454 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 20:39:42,460 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:39:42" (1/1) ... [2019-11-15 20:39:42,472 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:39:42" (1/1) ... [2019-11-15 20:39:42,488 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 20:39:42,488 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 20:39:42,488 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 20:39:42,488 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 20:39:42,496 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:39:42" (1/1) ... [2019-11-15 20:39:42,496 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:39:42" (1/1) ... [2019-11-15 20:39:42,499 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:39:42" (1/1) ... [2019-11-15 20:39:42,500 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:39:42" (1/1) ... [2019-11-15 20:39:42,506 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:39:42" (1/1) ... [2019-11-15 20:39:42,510 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:39:42" (1/1) ... [2019-11-15 20:39:42,512 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:39:42" (1/1) ... [2019-11-15 20:39:42,514 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 20:39:42,515 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 20:39:42,515 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 20:39:42,515 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 20:39:42,516 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:39:42" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a6ce6d4b-0b3c-469a-9f10-dd5681994dee/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:39:42,581 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 20:39:42,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 20:39:42,582 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 20:39:42,582 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 20:39:42,582 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 20:39:42,582 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 20:39:42,815 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 20:39:42,815 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-15 20:39:42,816 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:39:42 BoogieIcfgContainer [2019-11-15 20:39:42,816 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 20:39:42,817 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-15 20:39:42,817 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-15 20:39:42,820 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-15 20:39:42,821 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 20:39:42,821 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.11 08:39:41" (1/3) ... [2019-11-15 20:39:42,822 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@e55a5cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 08:39:42, skipping insertion in model container [2019-11-15 20:39:42,822 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 20:39:42,822 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:39:42" (2/3) ... [2019-11-15 20:39:42,823 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@e55a5cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 08:39:42, skipping insertion in model container [2019-11-15 20:39:42,823 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 20:39:42,823 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:39:42" (3/3) ... [2019-11-15 20:39:42,824 INFO L371 chiAutomizerObserver]: Analyzing ICFG openbsd_cmemchr-alloca-2.i [2019-11-15 20:39:42,884 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-15 20:39:42,884 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-15 20:39:42,884 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-15 20:39:42,884 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 20:39:42,884 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 20:39:42,885 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-15 20:39:42,885 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 20:39:42,885 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-15 20:39:42,897 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-11-15 20:39:42,912 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-11-15 20:39:42,913 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:39:42,913 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:39:42,917 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-15 20:39:42,917 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 20:39:42,917 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-15 20:39:42,918 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-11-15 20:39:42,919 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-11-15 20:39:42,919 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:39:42,919 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:39:42,920 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-15 20:39:42,920 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 20:39:42,925 INFO L791 eck$LassoCheckResult]: Stem: 13#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 12#L-1true havoc main_#res;havoc main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~i~0, main_#t~ret11.base, main_#t~ret11.offset, main_~length~0, main_~n~0, main_~c~0, main_~nondetArea~0.base, main_~nondetArea~0.offset;main_~length~0 := main_#t~nondet5;havoc main_#t~nondet5;main_~n~0 := main_#t~nondet6;havoc main_#t~nondet6;main_~c~0 := main_#t~nondet7;havoc main_#t~nondet7; 17#L529true assume !(main_~length~0 < 1); 20#L529-2true assume !(main_~n~0 < 1); 14#L532-1true call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(main_~n~0);main_~nondetArea~0.base, main_~nondetArea~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~0 := 0; 8#L537-3true [2019-11-15 20:39:42,925 INFO L793 eck$LassoCheckResult]: Loop: 8#L537-3true assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet10, main_~nondetArea~0.base, main_~nondetArea~0.offset + main_~i~0, 1);havoc main_#t~nondet10; 7#L537-2true main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 8#L537-3true [2019-11-15 20:39:42,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:39:42,929 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2019-11-15 20:39:42,934 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:39:42,935 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962285712] [2019-11-15 20:39:42,935 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:39:42,935 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:39:42,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:39:43,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:39:43,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:39:43,036 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:39:43,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:39:43,037 INFO L82 PathProgramCache]: Analyzing trace with hash 1699, now seen corresponding path program 1 times [2019-11-15 20:39:43,038 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:39:43,038 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606129675] [2019-11-15 20:39:43,038 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:39:43,038 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:39:43,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:39:43,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:39:43,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:39:43,057 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:39:43,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:39:43,059 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935720, now seen corresponding path program 1 times [2019-11-15 20:39:43,059 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:39:43,059 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262770056] [2019-11-15 20:39:43,059 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:39:43,059 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:39:43,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:39:43,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:39:43,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:39:43,096 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:39:43,301 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 20:39:43,302 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 20:39:43,302 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 20:39:43,302 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 20:39:43,302 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 20:39:43,303 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:39:43,303 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 20:39:43,303 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 20:39:43,303 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cmemchr-alloca-2.i_Iteration1_Lasso [2019-11-15 20:39:43,303 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 20:39:43,303 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 20:39:43,336 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:39:43,344 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:39:43,347 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:39:43,349 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:39:43,351 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:39:43,356 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:39:43,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-15 20:39:43,363 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:39:43,366 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:39:43,371 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:39:43,376 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:39:43,381 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:39:43,384 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:39:43,387 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:39:43,514 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:39:43,796 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 20:39:43,800 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 20:39:43,802 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:39:43,803 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:43,804 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:43,804 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:43,804 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:39:43,808 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:39:43,808 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:39:43,817 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:43,818 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:39:43,818 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:43,819 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:43,819 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:43,819 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:43,819 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:39:43,820 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:39:43,820 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:43,821 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:43,821 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:39:43,822 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:43,822 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:43,822 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:43,822 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:43,822 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:39:43,823 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:39:43,823 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:43,824 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:43,824 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:39:43,825 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:43,825 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:43,825 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:43,825 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:43,825 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:39:43,826 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:39:43,826 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:43,827 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:43,827 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:39:43,827 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:43,828 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:43,828 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:43,828 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:43,828 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:39:43,829 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:39:43,829 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:43,829 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:43,830 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:39:43,830 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:43,831 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:43,831 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:43,831 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:43,831 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:39:43,831 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:39:43,832 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:43,832 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:43,833 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:39:43,834 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:43,834 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:43,834 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:43,834 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:39:43,836 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:39:43,836 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:39:43,840 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:43,840 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:39:43,841 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:43,841 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:43,841 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:43,842 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:43,842 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:39:43,842 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:39:43,842 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:43,843 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:43,844 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:39:43,844 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:43,844 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:43,844 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:43,845 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:39:43,846 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:39:43,847 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:39:43,850 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:43,851 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:39:43,851 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:43,852 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:43,852 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:43,852 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:39:43,854 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:39:43,854 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:39:43,860 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:43,860 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:39:43,861 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:43,861 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:43,861 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:43,861 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:39:43,863 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:39:43,863 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:39:43,867 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:43,867 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:39:43,868 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:43,868 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:43,868 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:43,868 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:43,868 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:39:43,869 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:39:43,869 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:43,870 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:43,870 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:39:43,871 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:43,871 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:43,871 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:43,871 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:39:43,873 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:39:43,873 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:39:43,879 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:43,880 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:39:43,880 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:43,880 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:43,881 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:43,881 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:43,881 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:39:43,881 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:39:43,881 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:43,883 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:43,883 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:39:43,883 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:43,884 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-15 20:39:43,884 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:43,884 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:39:43,887 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-15 20:39:43,888 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:39:43,905 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:43,906 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:39:43,907 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:43,907 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:43,907 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:43,907 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:39:43,910 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:39:43,910 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:39:43,924 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:43,924 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:39:43,925 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:43,925 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:43,925 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:43,925 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:43,926 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:39:43,926 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:39:43,926 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:43,927 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:43,928 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:39:43,928 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:43,928 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:43,928 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:43,929 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:39:43,930 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:39:43,930 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:39:43,933 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:43,933 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:39:43,934 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:43,934 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:43,934 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:43,934 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:39:43,937 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:39:43,937 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:39:44,015 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 20:39:44,058 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-15 20:39:44,059 INFO L444 ModelExtractionUtils]: 18 out of 22 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 20:39:44,061 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 20:39:44,062 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 20:39:44,062 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 20:39:44,063 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~n~0 - 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2019-11-15 20:39:44,080 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-11-15 20:39:44,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:39:44,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:39:44,123 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 20:39:44,125 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:39:44,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:39:44,139 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 20:39:44,139 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:39:44,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:39:44,166 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-15 20:39:44,168 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states. Second operand 3 states. [2019-11-15 20:39:44,221 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states.. Second operand 3 states. Result 42 states and 59 transitions. Complement of second has 7 states. [2019-11-15 20:39:44,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-15 20:39:44,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 20:39:44,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 39 transitions. [2019-11-15 20:39:44,228 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 39 transitions. Stem has 5 letters. Loop has 2 letters. [2019-11-15 20:39:44,229 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:39:44,229 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 39 transitions. Stem has 7 letters. Loop has 2 letters. [2019-11-15 20:39:44,230 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:39:44,230 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 39 transitions. Stem has 5 letters. Loop has 4 letters. [2019-11-15 20:39:44,230 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:39:44,231 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 59 transitions. [2019-11-15 20:39:44,241 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-15 20:39:44,247 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 14 states and 18 transitions. [2019-11-15 20:39:44,248 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-15 20:39:44,248 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-11-15 20:39:44,249 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 18 transitions. [2019-11-15 20:39:44,249 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 20:39:44,249 INFO L688 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2019-11-15 20:39:44,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 18 transitions. [2019-11-15 20:39:44,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-11-15 20:39:44,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-11-15 20:39:44,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 18 transitions. [2019-11-15 20:39:44,276 INFO L711 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2019-11-15 20:39:44,276 INFO L591 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2019-11-15 20:39:44,276 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-15 20:39:44,276 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 18 transitions. [2019-11-15 20:39:44,278 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-15 20:39:44,278 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:39:44,278 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:39:44,279 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:39:44,279 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-15 20:39:44,279 INFO L791 eck$LassoCheckResult]: Stem: 130#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 128#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~i~0, main_#t~ret11.base, main_#t~ret11.offset, main_~length~0, main_~n~0, main_~c~0, main_~nondetArea~0.base, main_~nondetArea~0.offset;main_~length~0 := main_#t~nondet5;havoc main_#t~nondet5;main_~n~0 := main_#t~nondet6;havoc main_#t~nondet6;main_~c~0 := main_#t~nondet7;havoc main_#t~nondet7; 129#L529 assume !(main_~length~0 < 1); 133#L529-2 assume !(main_~n~0 < 1); 131#L532-1 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(main_~n~0);main_~nondetArea~0.base, main_~nondetArea~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~0 := 0; 126#L537-3 assume !(main_~i~0 < main_~n~0); 127#L537-4 cmemchr_#in~s.base, cmemchr_#in~s.offset, cmemchr_#in~c, cmemchr_#in~n := main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~c~0, main_~n~0;havoc cmemchr_#res.base, cmemchr_#res.offset;havoc cmemchr_#t~post3.base, cmemchr_#t~post3.offset, cmemchr_#t~mem4, cmemchr_#t~pre2, cmemchr_~p~0.base, cmemchr_~p~0.offset, cmemchr_~s.base, cmemchr_~s.offset, cmemchr_~c, cmemchr_~n;cmemchr_~s.base, cmemchr_~s.offset := cmemchr_#in~s.base, cmemchr_#in~s.offset;cmemchr_~c := cmemchr_#in~c;cmemchr_~n := cmemchr_#in~n; 122#L516 assume 0 != cmemchr_~n % 4294967296;cmemchr_~p~0.base, cmemchr_~p~0.offset := cmemchr_~s.base, cmemchr_~s.offset; 121#L518-4 [2019-11-15 20:39:44,280 INFO L793 eck$LassoCheckResult]: Loop: 121#L518-4 cmemchr_#t~post3.base, cmemchr_#t~post3.offset := cmemchr_~p~0.base, cmemchr_~p~0.offset;cmemchr_~p~0.base, cmemchr_~p~0.offset := cmemchr_#t~post3.base, 1 + cmemchr_#t~post3.offset;call cmemchr_#t~mem4 := read~int(cmemchr_#t~post3.base, cmemchr_#t~post3.offset, 1); 123#L519 assume !(cmemchr_#t~mem4 % 256 == cmemchr_~c % 256);havoc cmemchr_#t~mem4;havoc cmemchr_#t~post3.base, cmemchr_#t~post3.offset; 132#L518-1 cmemchr_#t~pre2 := cmemchr_~n - 1;cmemchr_~n := cmemchr_~n - 1; 120#L518-2 assume !!(0 != cmemchr_#t~pre2 % 4294967296);havoc cmemchr_#t~pre2; 121#L518-4 [2019-11-15 20:39:44,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:39:44,280 INFO L82 PathProgramCache]: Analyzing trace with hash 180430706, now seen corresponding path program 1 times [2019-11-15 20:39:44,280 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:39:44,281 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22110115] [2019-11-15 20:39:44,281 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:39:44,281 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:39:44,281 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:39:44,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:39:44,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:39:44,346 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22110115] [2019-11-15 20:39:44,347 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:39:44,347 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:39:44,347 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604134555] [2019-11-15 20:39:44,349 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 20:39:44,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:39:44,350 INFO L82 PathProgramCache]: Analyzing trace with hash 2036779, now seen corresponding path program 1 times [2019-11-15 20:39:44,350 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:39:44,350 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533610473] [2019-11-15 20:39:44,350 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:39:44,351 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:39:44,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:39:44,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:39:44,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:39:44,372 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:39:44,442 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:39:44,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:39:44,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:39:44,446 INFO L87 Difference]: Start difference. First operand 14 states and 18 transitions. cyclomatic complexity: 6 Second operand 4 states. [2019-11-15 20:39:44,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:39:44,472 INFO L93 Difference]: Finished difference Result 15 states and 18 transitions. [2019-11-15 20:39:44,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:39:44,473 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 18 transitions. [2019-11-15 20:39:44,474 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-15 20:39:44,475 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 18 transitions. [2019-11-15 20:39:44,475 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-11-15 20:39:44,475 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-11-15 20:39:44,475 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 18 transitions. [2019-11-15 20:39:44,475 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 20:39:44,475 INFO L688 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2019-11-15 20:39:44,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 18 transitions. [2019-11-15 20:39:44,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2019-11-15 20:39:44,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-11-15 20:39:44,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 17 transitions. [2019-11-15 20:39:44,478 INFO L711 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2019-11-15 20:39:44,478 INFO L591 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2019-11-15 20:39:44,478 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-15 20:39:44,478 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 17 transitions. [2019-11-15 20:39:44,479 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-15 20:39:44,479 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:39:44,479 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:39:44,480 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:39:44,480 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-15 20:39:44,480 INFO L791 eck$LassoCheckResult]: Stem: 166#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 164#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~i~0, main_#t~ret11.base, main_#t~ret11.offset, main_~length~0, main_~n~0, main_~c~0, main_~nondetArea~0.base, main_~nondetArea~0.offset;main_~length~0 := main_#t~nondet5;havoc main_#t~nondet5;main_~n~0 := main_#t~nondet6;havoc main_#t~nondet6;main_~c~0 := main_#t~nondet7;havoc main_#t~nondet7; 165#L529 assume !(main_~length~0 < 1); 169#L529-2 assume !(main_~n~0 < 1); 167#L532-1 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(main_~n~0);main_~nondetArea~0.base, main_~nondetArea~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~0 := 0; 162#L537-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet10, main_~nondetArea~0.base, main_~nondetArea~0.offset + main_~i~0, 1);havoc main_#t~nondet10; 160#L537-2 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 161#L537-3 assume !(main_~i~0 < main_~n~0); 163#L537-4 cmemchr_#in~s.base, cmemchr_#in~s.offset, cmemchr_#in~c, cmemchr_#in~n := main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~c~0, main_~n~0;havoc cmemchr_#res.base, cmemchr_#res.offset;havoc cmemchr_#t~post3.base, cmemchr_#t~post3.offset, cmemchr_#t~mem4, cmemchr_#t~pre2, cmemchr_~p~0.base, cmemchr_~p~0.offset, cmemchr_~s.base, cmemchr_~s.offset, cmemchr_~c, cmemchr_~n;cmemchr_~s.base, cmemchr_~s.offset := cmemchr_#in~s.base, cmemchr_#in~s.offset;cmemchr_~c := cmemchr_#in~c;cmemchr_~n := cmemchr_#in~n; 156#L516 assume 0 != cmemchr_~n % 4294967296;cmemchr_~p~0.base, cmemchr_~p~0.offset := cmemchr_~s.base, cmemchr_~s.offset; 157#L518-4 [2019-11-15 20:39:44,480 INFO L793 eck$LassoCheckResult]: Loop: 157#L518-4 cmemchr_#t~post3.base, cmemchr_#t~post3.offset := cmemchr_~p~0.base, cmemchr_~p~0.offset;cmemchr_~p~0.base, cmemchr_~p~0.offset := cmemchr_#t~post3.base, 1 + cmemchr_#t~post3.offset;call cmemchr_#t~mem4 := read~int(cmemchr_#t~post3.base, cmemchr_#t~post3.offset, 1); 159#L519 assume !(cmemchr_#t~mem4 % 256 == cmemchr_~c % 256);havoc cmemchr_#t~mem4;havoc cmemchr_#t~post3.base, cmemchr_#t~post3.offset; 168#L518-1 cmemchr_#t~pre2 := cmemchr_~n - 1;cmemchr_~n := cmemchr_~n - 1; 158#L518-2 assume !!(0 != cmemchr_#t~pre2 % 4294967296);havoc cmemchr_#t~pre2; 157#L518-4 [2019-11-15 20:39:44,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:39:44,481 INFO L82 PathProgramCache]: Analyzing trace with hash 1596934864, now seen corresponding path program 1 times [2019-11-15 20:39:44,481 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:39:44,481 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086727800] [2019-11-15 20:39:44,481 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:39:44,481 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:39:44,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:39:44,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:39:44,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:39:44,507 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:39:44,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:39:44,507 INFO L82 PathProgramCache]: Analyzing trace with hash 2036779, now seen corresponding path program 2 times [2019-11-15 20:39:44,507 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:39:44,508 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990324423] [2019-11-15 20:39:44,508 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:39:44,508 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:39:44,508 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:39:44,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:39:44,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:39:44,522 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:39:44,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:39:44,523 INFO L82 PathProgramCache]: Analyzing trace with hash 1308516218, now seen corresponding path program 1 times [2019-11-15 20:39:44,523 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:39:44,523 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485707318] [2019-11-15 20:39:44,524 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:39:44,524 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:39:44,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:39:44,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:39:44,634 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:39:44,635 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485707318] [2019-11-15 20:39:44,635 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2071414938] [2019-11-15 20:39:44,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a6ce6d4b-0b3c-469a-9f10-dd5681994dee/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:39:44,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:39:44,710 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 28 conjunts are in the unsatisfiable core [2019-11-15 20:39:44,711 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:39:44,745 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-15 20:39:44,745 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:39:44,753 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:39:44,754 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:39:44,754 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-15 20:39:44,858 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-11-15 20:39:44,859 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:39:44,872 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:39:44,873 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:39:44,873 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:7 [2019-11-15 20:39:44,895 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:39:44,896 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:39:44,896 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2019-11-15 20:39:44,896 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213688868] [2019-11-15 20:39:44,970 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:39:44,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-15 20:39:44,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-11-15 20:39:44,971 INFO L87 Difference]: Start difference. First operand 14 states and 17 transitions. cyclomatic complexity: 5 Second operand 14 states. [2019-11-15 20:39:45,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:39:45,369 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2019-11-15 20:39:45,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-15 20:39:45,369 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 32 transitions. [2019-11-15 20:39:45,370 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-15 20:39:45,371 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 17 states and 19 transitions. [2019-11-15 20:39:45,371 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-11-15 20:39:45,371 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-11-15 20:39:45,372 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 19 transitions. [2019-11-15 20:39:45,372 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 20:39:45,372 INFO L688 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2019-11-15 20:39:45,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 19 transitions. [2019-11-15 20:39:45,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2019-11-15 20:39:45,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-11-15 20:39:45,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2019-11-15 20:39:45,373 INFO L711 BuchiCegarLoop]: Abstraction has 16 states and 18 transitions. [2019-11-15 20:39:45,373 INFO L591 BuchiCegarLoop]: Abstraction has 16 states and 18 transitions. [2019-11-15 20:39:45,374 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-15 20:39:45,374 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 18 transitions. [2019-11-15 20:39:45,374 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-15 20:39:45,374 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:39:45,374 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:39:45,375 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:39:45,375 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-15 20:39:45,375 INFO L791 eck$LassoCheckResult]: Stem: 283#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 281#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~i~0, main_#t~ret11.base, main_#t~ret11.offset, main_~length~0, main_~n~0, main_~c~0, main_~nondetArea~0.base, main_~nondetArea~0.offset;main_~length~0 := main_#t~nondet5;havoc main_#t~nondet5;main_~n~0 := main_#t~nondet6;havoc main_#t~nondet6;main_~c~0 := main_#t~nondet7;havoc main_#t~nondet7; 282#L529 assume !(main_~length~0 < 1); 286#L529-2 assume !(main_~n~0 < 1); 284#L532-1 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(main_~n~0);main_~nondetArea~0.base, main_~nondetArea~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~0 := 0; 278#L537-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet10, main_~nondetArea~0.base, main_~nondetArea~0.offset + main_~i~0, 1);havoc main_#t~nondet10; 276#L537-2 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 277#L537-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet10, main_~nondetArea~0.base, main_~nondetArea~0.offset + main_~i~0, 1);havoc main_#t~nondet10; 279#L537-2 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 287#L537-3 assume !(main_~i~0 < main_~n~0); 280#L537-4 cmemchr_#in~s.base, cmemchr_#in~s.offset, cmemchr_#in~c, cmemchr_#in~n := main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~c~0, main_~n~0;havoc cmemchr_#res.base, cmemchr_#res.offset;havoc cmemchr_#t~post3.base, cmemchr_#t~post3.offset, cmemchr_#t~mem4, cmemchr_#t~pre2, cmemchr_~p~0.base, cmemchr_~p~0.offset, cmemchr_~s.base, cmemchr_~s.offset, cmemchr_~c, cmemchr_~n;cmemchr_~s.base, cmemchr_~s.offset := cmemchr_#in~s.base, cmemchr_#in~s.offset;cmemchr_~c := cmemchr_#in~c;cmemchr_~n := cmemchr_#in~n; 272#L516 assume 0 != cmemchr_~n % 4294967296;cmemchr_~p~0.base, cmemchr_~p~0.offset := cmemchr_~s.base, cmemchr_~s.offset; 273#L518-4 [2019-11-15 20:39:45,375 INFO L793 eck$LassoCheckResult]: Loop: 273#L518-4 cmemchr_#t~post3.base, cmemchr_#t~post3.offset := cmemchr_~p~0.base, cmemchr_~p~0.offset;cmemchr_~p~0.base, cmemchr_~p~0.offset := cmemchr_#t~post3.base, 1 + cmemchr_#t~post3.offset;call cmemchr_#t~mem4 := read~int(cmemchr_#t~post3.base, cmemchr_#t~post3.offset, 1); 275#L519 assume !(cmemchr_#t~mem4 % 256 == cmemchr_~c % 256);havoc cmemchr_#t~mem4;havoc cmemchr_#t~post3.base, cmemchr_#t~post3.offset; 285#L518-1 cmemchr_#t~pre2 := cmemchr_~n - 1;cmemchr_~n := cmemchr_~n - 1; 274#L518-2 assume !!(0 != cmemchr_#t~pre2 % 4294967296);havoc cmemchr_#t~pre2; 273#L518-4 [2019-11-15 20:39:45,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:39:45,376 INFO L82 PathProgramCache]: Analyzing trace with hash 1352797870, now seen corresponding path program 2 times [2019-11-15 20:39:45,376 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:39:45,376 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197570410] [2019-11-15 20:39:45,376 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:39:45,376 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:39:45,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:39:45,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:39:45,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:39:45,402 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:39:45,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:39:45,403 INFO L82 PathProgramCache]: Analyzing trace with hash 2036779, now seen corresponding path program 3 times [2019-11-15 20:39:45,403 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:39:45,403 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187438408] [2019-11-15 20:39:45,404 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:39:45,404 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:39:45,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:39:45,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:39:45,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:39:45,440 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:39:45,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:39:45,441 INFO L82 PathProgramCache]: Analyzing trace with hash -24116136, now seen corresponding path program 2 times [2019-11-15 20:39:45,441 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:39:45,441 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266734824] [2019-11-15 20:39:45,441 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:39:45,441 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:39:45,441 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:39:45,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:39:45,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:39:45,474 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:39:45,770 WARN L191 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 88 [2019-11-15 20:39:45,835 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 20:39:45,835 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 20:39:45,836 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 20:39:45,836 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 20:39:45,836 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 20:39:45,836 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:39:45,836 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 20:39:45,836 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 20:39:45,836 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cmemchr-alloca-2.i_Iteration4_Lasso [2019-11-15 20:39:45,836 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 20:39:45,836 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 20:39:45,841 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:39:45,850 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:39:45,854 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:39:45,856 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:39:45,858 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:39:45,860 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:39:45,865 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:39:45,867 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:39:45,868 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:39:45,870 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:39:45,871 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:39:45,873 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:39:45,880 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:39:45,881 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:39:45,893 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:39:45,895 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:39:45,897 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:39:46,028 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 52 [2019-11-15 20:39:46,082 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:39:46,084 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:39:46,086 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:39:46,089 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:39:46,625 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 20:39:46,625 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 20:39:46,625 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:39:46,626 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:46,626 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:46,626 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:46,627 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:46,627 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:39:46,627 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:39:46,627 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:46,628 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:46,628 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:39:46,628 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:46,629 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:46,629 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:46,629 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:46,629 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:39:46,629 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:39:46,634 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:46,635 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:46,636 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:39:46,636 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:46,637 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:46,637 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:46,637 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:39:46,638 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:39:46,638 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:39:46,642 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:46,643 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:39:46,643 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:46,643 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:46,644 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:46,644 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:46,644 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:39:46,645 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:39:46,645 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:46,646 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:46,646 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:39:46,647 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:46,647 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:46,647 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:46,647 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:46,647 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:39:46,648 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:39:46,648 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:46,649 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:46,650 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:39:46,651 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:46,651 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:46,651 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:46,652 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:39:46,652 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:39:46,653 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:39:46,659 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:46,659 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:39:46,660 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:46,660 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:46,660 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:46,660 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:46,660 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:39:46,660 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:39:46,661 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:46,661 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:46,661 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:39:46,664 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:46,664 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:46,665 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:46,665 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:46,665 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:39:46,665 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:39:46,665 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:46,666 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:46,667 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:39:46,667 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:46,667 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:46,667 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:46,667 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:46,667 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:39:46,669 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:39:46,669 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:46,670 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:46,670 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:39:46,670 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:46,670 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:46,671 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:46,671 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:46,671 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:39:46,671 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:39:46,671 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:46,672 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:46,674 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:39:46,675 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:46,675 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:46,675 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:46,675 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:39:46,677 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:39:46,678 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:39:46,681 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:46,688 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:39:46,689 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:46,689 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:46,689 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:46,689 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:46,689 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:39:46,690 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:39:46,690 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:46,690 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:46,690 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:39:46,691 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:46,691 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:46,691 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:46,691 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:46,691 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:39:46,692 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:39:46,692 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:46,692 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:46,692 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:39:46,693 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:46,693 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:46,693 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:46,693 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:46,693 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:39:46,694 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:39:46,694 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:46,694 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:46,694 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:39:46,695 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:46,695 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:46,695 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:46,695 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:39:46,696 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:39:46,696 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:39:46,700 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:46,701 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:39:46,701 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:46,708 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:46,708 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:46,708 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:46,709 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:39:46,709 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:39:46,709 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:46,710 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:46,710 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:39:46,710 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:46,711 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:46,711 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:46,711 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:39:46,715 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:39:46,715 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:39:46,845 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 20:39:46,867 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-15 20:39:46,867 INFO L444 ModelExtractionUtils]: 33 out of 37 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 20:39:46,868 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 20:39:46,869 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 20:39:46,869 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 20:39:46,870 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_cmemchr_~p~0.base)_1, ULTIMATE.start_cmemchr_~p~0.offset) = 1*v_rep(select #length ULTIMATE.start_cmemchr_~p~0.base)_1 - 1*ULTIMATE.start_cmemchr_~p~0.offset Supporting invariants [] [2019-11-15 20:39:46,877 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-11-15 20:39:46,878 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-15 20:39:46,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:39:46,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:39:46,908 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 20:39:46,909 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:39:46,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:39:46,919 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-15 20:39:46,919 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:39:46,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:39:46,933 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-15 20:39:46,933 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 18 transitions. cyclomatic complexity: 4 Second operand 3 states. [2019-11-15 20:39:46,939 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 18 transitions. cyclomatic complexity: 4. Second operand 3 states. Result 20 states and 22 transitions. Complement of second has 4 states. [2019-11-15 20:39:46,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-15 20:39:46,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 20:39:46,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2019-11-15 20:39:46,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 12 letters. Loop has 4 letters. [2019-11-15 20:39:46,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:39:46,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 16 letters. Loop has 4 letters. [2019-11-15 20:39:46,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:39:46,943 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 12 letters. Loop has 8 letters. [2019-11-15 20:39:46,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:39:46,943 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 22 transitions. [2019-11-15 20:39:46,944 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 20:39:46,944 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 0 states and 0 transitions. [2019-11-15 20:39:46,944 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-15 20:39:46,944 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-15 20:39:46,944 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-15 20:39:46,944 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 20:39:46,944 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 20:39:46,944 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 20:39:46,945 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 20:39:46,945 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-15 20:39:46,945 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-15 20:39:46,945 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 20:39:46,945 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-15 20:39:46,950 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.11 08:39:46 BoogieIcfgContainer [2019-11-15 20:39:46,950 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-15 20:39:46,951 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 20:39:46,951 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 20:39:46,951 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 20:39:46,951 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:39:42" (3/4) ... [2019-11-15 20:39:46,954 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-15 20:39:46,954 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 20:39:46,956 INFO L168 Benchmark]: Toolchain (without parser) took 5091.11 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 233.8 MB). Free memory was 935.7 MB in the beginning and 958.7 MB in the end (delta: -23.0 MB). Peak memory consumption was 210.8 MB. Max. memory is 11.5 GB. [2019-11-15 20:39:46,956 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:39:46,957 INFO L168 Benchmark]: CACSL2BoogieTranslator took 588.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 169.3 MB). Free memory was 935.7 MB in the beginning and 1.1 GB in the end (delta: -210.6 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. [2019-11-15 20:39:46,957 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.75 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:39:46,957 INFO L168 Benchmark]: Boogie Preprocessor took 26.43 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:39:46,958 INFO L168 Benchmark]: RCFGBuilder took 301.63 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: 27.4 MB). Peak memory consumption was 27.4 MB. Max. memory is 11.5 GB. [2019-11-15 20:39:46,959 INFO L168 Benchmark]: BuchiAutomizer took 4133.42 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 64.5 MB). Free memory was 1.1 GB in the beginning and 958.7 MB in the end (delta: 160.3 MB). Peak memory consumption was 224.8 MB. Max. memory is 11.5 GB. [2019-11-15 20:39:46,959 INFO L168 Benchmark]: Witness Printer took 3.56 ms. Allocated memory is still 1.3 GB. Free memory is still 958.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:39:46,962 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.22 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 588.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 169.3 MB). Free memory was 935.7 MB in the beginning and 1.1 GB in the end (delta: -210.6 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 33.75 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 26.43 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 301.63 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: 27.4 MB). Peak memory consumption was 27.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4133.42 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 64.5 MB). Free memory was 1.1 GB in the beginning and 958.7 MB in the end (delta: 160.3 MB). Peak memory consumption was 224.8 MB. Max. memory is 11.5 GB. * Witness Printer took 3.56 ms. Allocated memory is still 1.3 GB. Free memory is still 958.7 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 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (2 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function n + -1 * i and consists of 5 locations. One deterministic module has affine ranking function unknown-#length-unknown[p] + -1 * p and consists of 3 locations. 2 modules have a trivial ranking function, the largest among these consists of 14 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.0s and 5 iterations. TraceHistogramMax:2. Analysis of lassos took 3.3s. Construction of modules took 0.1s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 2 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 16 states and ocurred in iteration 3. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 52 SDtfs, 96 SDslu, 108 SDs, 0 SdLazy, 120 SolverSat, 34 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU1 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital127 mio100 ax114 hnf98 lsp80 ukn84 mio100 lsp57 div127 bol100 ite100 ukn100 eq173 hnf81 smp97 dnf100 smp100 tf100 neg99 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 22ms VariablesStem: 3 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 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...