./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/array-memsafety/openbsd_cstrcpy-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_d96e8521-966e-4997-8566-2050a02a00c1/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_d96e8521-966e-4997-8566-2050a02a00c1/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_d96e8521-966e-4997-8566-2050a02a00c1/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_d96e8521-966e-4997-8566-2050a02a00c1/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/openbsd_cstrcpy-alloca-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_d96e8521-966e-4997-8566-2050a02a00c1/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_d96e8521-966e-4997-8566-2050a02a00c1/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 5731971c09a136eb079f9cbecfc34cb6e82f7a1b ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:28:42,349 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 20:28:42,351 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 20:28:42,366 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 20:28:42,366 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 20:28:42,368 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 20:28:42,370 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 20:28:42,380 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 20:28:42,385 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 20:28:42,389 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 20:28:42,391 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 20:28:42,393 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 20:28:42,394 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 20:28:42,397 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 20:28:42,398 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 20:28:42,399 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 20:28:42,400 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 20:28:42,401 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 20:28:42,404 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 20:28:42,408 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 20:28:42,411 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 20:28:42,414 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 20:28:42,417 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 20:28:42,418 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 20:28:42,421 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 20:28:42,421 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 20:28:42,421 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 20:28:42,423 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 20:28:42,424 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 20:28:42,424 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 20:28:42,425 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 20:28:42,425 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 20:28:42,426 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 20:28:42,427 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 20:28:42,429 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 20:28:42,429 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 20:28:42,430 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 20:28:42,430 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 20:28:42,430 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 20:28:42,431 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 20:28:42,432 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 20:28:42,433 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_d96e8521-966e-4997-8566-2050a02a00c1/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-15 20:28:42,463 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 20:28:42,464 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 20:28:42,465 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 20:28:42,465 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 20:28:42,465 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 20:28:42,466 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-15 20:28:42,466 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-15 20:28:42,466 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-15 20:28:42,466 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-15 20:28:42,467 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-15 20:28:42,467 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-15 20:28:42,467 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 20:28:42,467 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 20:28:42,468 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 20:28:42,468 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 20:28:42,468 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 20:28:42,468 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 20:28:42,469 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-15 20:28:42,469 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-15 20:28:42,469 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-15 20:28:42,469 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 20:28:42,469 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 20:28:42,470 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-15 20:28:42,470 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 20:28:42,470 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-15 20:28:42,470 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 20:28:42,471 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 20:28:42,471 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-15 20:28:42,471 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 20:28:42,471 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 20:28:42,472 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-15 20:28:42,473 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-15 20:28:42,473 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_d96e8521-966e-4997-8566-2050a02a00c1/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 -> 5731971c09a136eb079f9cbecfc34cb6e82f7a1b [2019-11-15 20:28:42,501 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 20:28:42,512 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 20:28:42,516 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 20:28:42,517 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 20:28:42,518 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 20:28:42,518 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_d96e8521-966e-4997-8566-2050a02a00c1/bin/uautomizer/../../sv-benchmarks/c/array-memsafety/openbsd_cstrcpy-alloca-2.i [2019-11-15 20:28:42,576 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_d96e8521-966e-4997-8566-2050a02a00c1/bin/uautomizer/data/213aecd82/d386e3a9161441dab2c878685658e0a2/FLAGbf9cdf57e [2019-11-15 20:28:43,061 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 20:28:43,061 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_d96e8521-966e-4997-8566-2050a02a00c1/sv-benchmarks/c/array-memsafety/openbsd_cstrcpy-alloca-2.i [2019-11-15 20:28:43,081 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_d96e8521-966e-4997-8566-2050a02a00c1/bin/uautomizer/data/213aecd82/d386e3a9161441dab2c878685658e0a2/FLAGbf9cdf57e [2019-11-15 20:28:43,396 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_d96e8521-966e-4997-8566-2050a02a00c1/bin/uautomizer/data/213aecd82/d386e3a9161441dab2c878685658e0a2 [2019-11-15 20:28:43,400 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 20:28:43,401 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 20:28:43,406 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 20:28:43,407 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 20:28:43,409 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 20:28:43,410 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:28:43" (1/1) ... [2019-11-15 20:28:43,412 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ca44468 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:28:43, skipping insertion in model container [2019-11-15 20:28:43,418 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:28:43" (1/1) ... [2019-11-15 20:28:43,426 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 20:28:43,477 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 20:28:43,821 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:28:43,831 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 20:28:43,873 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:28:43,926 INFO L192 MainTranslator]: Completed translation [2019-11-15 20:28:43,926 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:28:43 WrapperNode [2019-11-15 20:28:43,926 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 20:28:43,927 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 20:28:43,928 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 20:28:43,928 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 20:28:43,936 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:28:43" (1/1) ... [2019-11-15 20:28:43,950 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:28:43" (1/1) ... [2019-11-15 20:28:43,972 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 20:28:43,972 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 20:28:43,972 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 20:28:43,972 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 20:28:43,981 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:28:43" (1/1) ... [2019-11-15 20:28:43,982 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:28:43" (1/1) ... [2019-11-15 20:28:43,985 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:28:43" (1/1) ... [2019-11-15 20:28:43,985 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:28:43" (1/1) ... [2019-11-15 20:28:43,991 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:28:43" (1/1) ... [2019-11-15 20:28:43,996 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:28:43" (1/1) ... [2019-11-15 20:28:43,997 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:28:43" (1/1) ... [2019-11-15 20:28:44,000 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 20:28:44,000 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 20:28:44,000 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 20:28:44,001 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 20:28:44,002 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:28:43" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d96e8521-966e-4997-8566-2050a02a00c1/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:28:44,076 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 20:28:44,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 20:28:44,076 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 20:28:44,077 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 20:28:44,077 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 20:28:44,077 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 20:28:44,464 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 20:28:44,464 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-15 20:28:44,466 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:28:44 BoogieIcfgContainer [2019-11-15 20:28:44,466 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 20:28:44,466 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-15 20:28:44,466 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-15 20:28:44,470 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-15 20:28:44,470 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 20:28:44,471 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.11 08:28:43" (1/3) ... [2019-11-15 20:28:44,472 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5488d59e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 08:28:44, skipping insertion in model container [2019-11-15 20:28:44,472 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 20:28:44,472 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:28:43" (2/3) ... [2019-11-15 20:28:44,473 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5488d59e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 08:28:44, skipping insertion in model container [2019-11-15 20:28:44,473 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 20:28:44,474 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:28:44" (3/3) ... [2019-11-15 20:28:44,476 INFO L371 chiAutomizerObserver]: Analyzing ICFG openbsd_cstrcpy-alloca-2.i [2019-11-15 20:28:44,533 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-15 20:28:44,533 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-15 20:28:44,533 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-15 20:28:44,534 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 20:28:44,534 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 20:28:44,534 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-15 20:28:44,534 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 20:28:44,534 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-15 20:28:44,546 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2019-11-15 20:28:44,566 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-11-15 20:28:44,566 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:28:44,566 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:28:44,573 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-15 20:28:44,573 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 20:28:44,574 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-15 20:28:44,574 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2019-11-15 20:28:44,575 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-11-15 20:28:44,576 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:28:44,576 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:28:44,576 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-15 20:28:44,576 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 20:28:44,584 INFO L791 eck$LassoCheckResult]: Stem: 12#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 9#L-1true havoc main_#res;havoc main_#t~nondet5, main_#t~nondet6, main_#t~malloc7.base, main_#t~malloc7.offset, 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_~length1~0, main_~length2~0, main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset;main_~length1~0 := main_#t~nondet5;havoc main_#t~nondet5;main_~length2~0 := main_#t~nondet6;havoc main_#t~nondet6; 7#L523true assume !(main_~length1~0 < 1); 11#L523-2true assume !(main_~length2~0 < 1); 4#L526-1true assume !(main_~length1~0 < main_~length2~0);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetArea~0.base, main_~nondetArea~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString~0.base, main_~nondetString~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~0 := 0; 13#L534-3true [2019-11-15 20:28:44,584 INFO L793 eck$LassoCheckResult]: Loop: 13#L534-3true assume !!(main_~i~0 < main_~length2~0 - 1);call write~int(main_#t~nondet10, main_~nondetString~0.base, main_~nondetString~0.offset + main_~i~0, 1);havoc main_#t~nondet10; 10#L534-2true main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 13#L534-3true [2019-11-15 20:28:44,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:28:44,590 INFO L82 PathProgramCache]: Analyzing trace with hash 28695882, now seen corresponding path program 1 times [2019-11-15 20:28:44,598 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:28:44,598 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355999137] [2019-11-15 20:28:44,598 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:28:44,599 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:28:44,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:28:44,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:28:44,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:28:44,777 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:28:44,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:28:44,779 INFO L82 PathProgramCache]: Analyzing trace with hash 1827, now seen corresponding path program 1 times [2019-11-15 20:28:44,779 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:28:44,780 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958547988] [2019-11-15 20:28:44,781 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:28:44,781 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:28:44,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:28:44,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:28:44,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:28:44,824 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:28:44,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:28:44,827 INFO L82 PathProgramCache]: Analyzing trace with hash 1806939692, now seen corresponding path program 1 times [2019-11-15 20:28:44,827 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:28:44,828 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141060510] [2019-11-15 20:28:44,828 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:28:44,828 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:28:44,829 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:28:44,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:28:44,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:28:44,895 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:28:45,191 WARN L191 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2019-11-15 20:28:45,302 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 20:28:45,304 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 20:28:45,304 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 20:28:45,304 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 20:28:45,304 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 20:28:45,304 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:28:45,305 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 20:28:45,305 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 20:28:45,305 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrcpy-alloca-2.i_Iteration1_Lasso [2019-11-15 20:28:45,305 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 20:28:45,306 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 20:28:45,342 INFO L141 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:28:45,357 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:28:45,362 INFO L141 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:28:45,365 INFO L141 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:28:45,368 INFO L141 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:28:45,373 INFO L141 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:28:45,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:28:45,380 INFO L141 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:28:45,386 INFO L141 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:28:45,555 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2019-11-15 20:28:45,584 INFO L141 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:28:45,588 INFO L141 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:28:45,590 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:28:45,596 INFO L141 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:28:45,996 WARN L191 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 25 [2019-11-15 20:28:46,118 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 20:28:46,123 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 20:28:46,125 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:28:46,127 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:28:46,127 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:28:46,128 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:28:46,128 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:28:46,132 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:28:46,133 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:28:46,139 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:28:46,140 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:28:46,140 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:28:46,141 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:28:46,141 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:28:46,141 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:28:46,142 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:28:46,142 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:28:46,142 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:28:46,143 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:28:46,144 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:28:46,145 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:28:46,145 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:28:46,145 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:28:46,145 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:28:46,145 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:28:46,146 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:28:46,146 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:28:46,147 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:28:46,147 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:28:46,148 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:28:46,149 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:28:46,149 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:28:46,149 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:28:46,149 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:28:46,150 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:28:46,150 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:28:46,151 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:28:46,151 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:28:46,152 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:28:46,152 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:28:46,153 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:28:46,153 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:28:46,155 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:28:46,155 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:28:46,158 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:28:46,159 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:28:46,160 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:28:46,160 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:28:46,160 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:28:46,160 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:28:46,161 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:28:46,161 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:28:46,161 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:28:46,162 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:28:46,163 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:28:46,163 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:28:46,164 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:28:46,164 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:28:46,164 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:28:46,166 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:28:46,166 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:28:46,170 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:28:46,171 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:28:46,171 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:28:46,172 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:28:46,172 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:28:46,172 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:28:46,174 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:28:46,175 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:28:46,180 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:28:46,180 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:28:46,181 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:28:46,181 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:28:46,182 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:28:46,182 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:28:46,182 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:28:46,183 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:28:46,183 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:28:46,184 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:28:46,185 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:28:46,186 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:28:46,186 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-11-15 20:28:46,186 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:28:46,186 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:28:46,193 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-11-15 20:28:46,193 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:28:46,225 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:28:46,225 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:28:46,226 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:28:46,226 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:28:46,227 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:28:46,227 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:28:46,228 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:28:46,229 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:28:46,231 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:28:46,232 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:28:46,233 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:28:46,233 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:28:46,233 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:28:46,233 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:28:46,235 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:28:46,236 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:28:46,247 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:28:46,248 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:28:46,249 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:28:46,249 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:28:46,249 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:28:46,249 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:28:46,253 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:28:46,253 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:28:46,296 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 20:28:46,352 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-15 20:28:46,352 INFO L444 ModelExtractionUtils]: 22 out of 28 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-11-15 20:28:46,354 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 20:28:46,355 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 20:28:46,355 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 20:28:46,356 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~length2~0) = -1*ULTIMATE.start_main_~i~0 + 1*ULTIMATE.start_main_~length2~0 Supporting invariants [] [2019-11-15 20:28:46,372 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2019-11-15 20:28:46,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:28:46,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:28:46,422 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 20:28:46,424 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:28:46,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:28:46,440 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 20:28:46,441 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:28:46,454 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:28:46,472 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:28:46,473 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states. Second operand 3 states. [2019-11-15 20:28:46,529 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states.. Second operand 3 states. Result 39 states and 50 transitions. Complement of second has 7 states. [2019-11-15 20:28:46,529 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:28:46,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 20:28:46,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 34 transitions. [2019-11-15 20:28:46,533 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 5 letters. Loop has 2 letters. [2019-11-15 20:28:46,534 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:28:46,534 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 7 letters. Loop has 2 letters. [2019-11-15 20:28:46,534 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:28:46,535 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 5 letters. Loop has 4 letters. [2019-11-15 20:28:46,535 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:28:46,536 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 50 transitions. [2019-11-15 20:28:46,539 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 20:28:46,543 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 12 states and 16 transitions. [2019-11-15 20:28:46,545 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-11-15 20:28:46,545 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-11-15 20:28:46,546 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 16 transitions. [2019-11-15 20:28:46,546 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 20:28:46,546 INFO L688 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-11-15 20:28:46,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 16 transitions. [2019-11-15 20:28:46,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-11-15 20:28:46,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-11-15 20:28:46,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2019-11-15 20:28:46,575 INFO L711 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-11-15 20:28:46,575 INFO L591 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-11-15 20:28:46,575 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-15 20:28:46,575 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2019-11-15 20:28:46,576 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 20:28:46,576 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:28:46,576 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:28:46,577 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:28:46,577 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 20:28:46,577 INFO L791 eck$LassoCheckResult]: Stem: 137#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 131#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~nondet6, main_#t~malloc7.base, main_#t~malloc7.offset, 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_~length1~0, main_~length2~0, main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset;main_~length1~0 := main_#t~nondet5;havoc main_#t~nondet5;main_~length2~0 := main_#t~nondet6;havoc main_#t~nondet6; 132#L523 assume !(main_~length1~0 < 1); 133#L523-2 assume !(main_~length2~0 < 1); 134#L526-1 assume !(main_~length1~0 < main_~length2~0);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetArea~0.base, main_~nondetArea~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString~0.base, main_~nondetString~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~0 := 0; 135#L534-3 assume !(main_~i~0 < main_~length2~0 - 1); 136#L534-4 call write~int(0, main_~nondetString~0.base, main_~nondetString~0.offset + (main_~length2~0 - 1), 1);cstrcpy_#in~to.base, cstrcpy_#in~to.offset, cstrcpy_#in~from.base, cstrcpy_#in~from.offset := main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset;havoc cstrcpy_#res.base, cstrcpy_#res.offset;havoc cstrcpy_#t~pre2.base, cstrcpy_#t~pre2.offset, cstrcpy_#t~pre3.base, cstrcpy_#t~pre3.offset, cstrcpy_#t~mem4, cstrcpy_~to.base, cstrcpy_~to.offset, cstrcpy_~from.base, cstrcpy_~from.offset, cstrcpy_~save~0.base, cstrcpy_~save~0.offset;cstrcpy_~to.base, cstrcpy_~to.offset := cstrcpy_#in~to.base, cstrcpy_#in~to.offset;cstrcpy_~from.base, cstrcpy_~from.offset := cstrcpy_#in~from.base, cstrcpy_#in~from.offset;cstrcpy_~save~0.base, cstrcpy_~save~0.offset := cstrcpy_~to.base, cstrcpy_~to.offset; 138#L517-4 [2019-11-15 20:28:46,578 INFO L793 eck$LassoCheckResult]: Loop: 138#L517-4 call cstrcpy_#t~mem4 := read~int(cstrcpy_~from.base, cstrcpy_~from.offset, 1);call write~int(cstrcpy_#t~mem4, cstrcpy_~to.base, cstrcpy_~to.offset, 1); 129#L517-1 assume !!(0 != cstrcpy_#t~mem4);havoc cstrcpy_#t~mem4; 130#L517-3 cstrcpy_#t~pre2.base, cstrcpy_#t~pre2.offset := cstrcpy_~from.base, 1 + cstrcpy_~from.offset;cstrcpy_~from.base, cstrcpy_~from.offset := cstrcpy_~from.base, 1 + cstrcpy_~from.offset;havoc cstrcpy_#t~pre2.base, cstrcpy_#t~pre2.offset;cstrcpy_#t~pre3.base, cstrcpy_#t~pre3.offset := cstrcpy_~to.base, 1 + cstrcpy_~to.offset;cstrcpy_~to.base, cstrcpy_~to.offset := cstrcpy_~to.base, 1 + cstrcpy_~to.offset;havoc cstrcpy_#t~pre3.base, cstrcpy_#t~pre3.offset; 138#L517-4 [2019-11-15 20:28:46,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:28:46,578 INFO L82 PathProgramCache]: Analyzing trace with hash 1806939634, now seen corresponding path program 1 times [2019-11-15 20:28:46,578 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:28:46,578 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462947678] [2019-11-15 20:28:46,579 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:28:46,579 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:28:46,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:28:46,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:28:46,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:28:46,607 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:28:46,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:28:46,607 INFO L82 PathProgramCache]: Analyzing trace with hash 66694, now seen corresponding path program 1 times [2019-11-15 20:28:46,608 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:28:46,608 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653742330] [2019-11-15 20:28:46,608 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:28:46,608 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:28:46,608 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:28:46,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:28:46,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:28:46,620 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:28:46,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:28:46,621 INFO L82 PathProgramCache]: Analyzing trace with hash 1713552629, now seen corresponding path program 1 times [2019-11-15 20:28:46,621 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:28:46,621 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630457520] [2019-11-15 20:28:46,622 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:28:46,622 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:28:46,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:28:46,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:28:46,780 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:28:46,781 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630457520] [2019-11-15 20:28:46,782 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:28:46,782 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 20:28:46,782 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666804793] [2019-11-15 20:28:46,874 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:28:46,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 20:28:46,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:28:46,879 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. cyclomatic complexity: 6 Second operand 7 states. [2019-11-15 20:28:46,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:28:46,982 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2019-11-15 20:28:46,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 20:28:46,984 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 19 transitions. [2019-11-15 20:28:46,985 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 20:28:46,985 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 13 states and 16 transitions. [2019-11-15 20:28:46,986 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-11-15 20:28:46,986 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-11-15 20:28:46,986 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 16 transitions. [2019-11-15 20:28:46,986 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 20:28:46,986 INFO L688 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2019-11-15 20:28:46,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 16 transitions. [2019-11-15 20:28:46,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2019-11-15 20:28:46,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-11-15 20:28:46,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 15 transitions. [2019-11-15 20:28:46,988 INFO L711 BuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2019-11-15 20:28:46,988 INFO L591 BuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2019-11-15 20:28:46,988 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-15 20:28:46,988 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 15 transitions. [2019-11-15 20:28:46,989 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 20:28:46,989 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:28:46,989 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:28:46,990 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:28:46,990 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 20:28:46,990 INFO L791 eck$LassoCheckResult]: Stem: 181#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 175#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~nondet6, main_#t~malloc7.base, main_#t~malloc7.offset, 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_~length1~0, main_~length2~0, main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset;main_~length1~0 := main_#t~nondet5;havoc main_#t~nondet5;main_~length2~0 := main_#t~nondet6;havoc main_#t~nondet6; 176#L523 assume !(main_~length1~0 < 1); 177#L523-2 assume !(main_~length2~0 < 1); 178#L526-1 assume !(main_~length1~0 < main_~length2~0);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetArea~0.base, main_~nondetArea~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString~0.base, main_~nondetString~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~0 := 0; 179#L534-3 assume !!(main_~i~0 < main_~length2~0 - 1);call write~int(main_#t~nondet10, main_~nondetString~0.base, main_~nondetString~0.offset + main_~i~0, 1);havoc main_#t~nondet10; 171#L534-2 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 172#L534-3 assume !(main_~i~0 < main_~length2~0 - 1); 180#L534-4 call write~int(0, main_~nondetString~0.base, main_~nondetString~0.offset + (main_~length2~0 - 1), 1);cstrcpy_#in~to.base, cstrcpy_#in~to.offset, cstrcpy_#in~from.base, cstrcpy_#in~from.offset := main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset;havoc cstrcpy_#res.base, cstrcpy_#res.offset;havoc cstrcpy_#t~pre2.base, cstrcpy_#t~pre2.offset, cstrcpy_#t~pre3.base, cstrcpy_#t~pre3.offset, cstrcpy_#t~mem4, cstrcpy_~to.base, cstrcpy_~to.offset, cstrcpy_~from.base, cstrcpy_~from.offset, cstrcpy_~save~0.base, cstrcpy_~save~0.offset;cstrcpy_~to.base, cstrcpy_~to.offset := cstrcpy_#in~to.base, cstrcpy_#in~to.offset;cstrcpy_~from.base, cstrcpy_~from.offset := cstrcpy_#in~from.base, cstrcpy_#in~from.offset;cstrcpy_~save~0.base, cstrcpy_~save~0.offset := cstrcpy_~to.base, cstrcpy_~to.offset; 182#L517-4 [2019-11-15 20:28:46,990 INFO L793 eck$LassoCheckResult]: Loop: 182#L517-4 call cstrcpy_#t~mem4 := read~int(cstrcpy_~from.base, cstrcpy_~from.offset, 1);call write~int(cstrcpy_#t~mem4, cstrcpy_~to.base, cstrcpy_~to.offset, 1); 173#L517-1 assume !!(0 != cstrcpy_#t~mem4);havoc cstrcpy_#t~mem4; 174#L517-3 cstrcpy_#t~pre2.base, cstrcpy_#t~pre2.offset := cstrcpy_~from.base, 1 + cstrcpy_~from.offset;cstrcpy_~from.base, cstrcpy_~from.offset := cstrcpy_~from.base, 1 + cstrcpy_~from.offset;havoc cstrcpy_#t~pre2.base, cstrcpy_#t~pre2.offset;cstrcpy_#t~pre3.base, cstrcpy_#t~pre3.offset := cstrcpy_~to.base, 1 + cstrcpy_~to.offset;cstrcpy_~to.base, cstrcpy_~to.offset := cstrcpy_~to.base, 1 + cstrcpy_~to.offset;havoc cstrcpy_#t~pre3.base, cstrcpy_#t~pre3.offset; 182#L517-4 [2019-11-15 20:28:46,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:28:46,990 INFO L82 PathProgramCache]: Analyzing trace with hash 1302257236, now seen corresponding path program 1 times [2019-11-15 20:28:46,991 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:28:46,991 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268192668] [2019-11-15 20:28:46,991 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:28:46,991 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:28:46,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:28:47,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:28:47,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:28:47,051 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:28:47,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:28:47,051 INFO L82 PathProgramCache]: Analyzing trace with hash 66694, now seen corresponding path program 2 times [2019-11-15 20:28:47,051 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:28:47,052 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657316956] [2019-11-15 20:28:47,052 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:28:47,052 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:28:47,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:28:47,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:28:47,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:28:47,069 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:28:47,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:28:47,070 INFO L82 PathProgramCache]: Analyzing trace with hash -894230189, now seen corresponding path program 1 times [2019-11-15 20:28:47,070 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:28:47,071 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071414938] [2019-11-15 20:28:47,071 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:28:47,071 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:28:47,071 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:28:47,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:28:47,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:28:47,104 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:28:47,594 WARN L191 SmtUtils]: Spent 416.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 97 [2019-11-15 20:28:47,717 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-11-15 20:28:47,719 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 20:28:47,719 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 20:28:47,719 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 20:28:47,719 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 20:28:47,720 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 20:28:47,720 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:28:47,720 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 20:28:47,720 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 20:28:47,720 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrcpy-alloca-2.i_Iteration3_Lasso [2019-11-15 20:28:47,720 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 20:28:47,720 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 20:28:47,726 INFO L141 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:28:47,735 INFO L141 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:28:47,737 INFO L141 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:28:47,739 INFO L141 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:28:47,743 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:28:47,745 INFO L141 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:28:47,748 INFO L141 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:28:47,750 INFO L141 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:28:47,752 INFO L141 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:28:47,757 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:28:47,759 INFO L141 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:28:47,761 INFO L141 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:28:47,763 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:28:47,765 INFO L141 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:28:47,767 INFO L141 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:28:47,768 INFO L141 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:28:48,056 WARN L191 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 70 [2019-11-15 20:28:48,182 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2019-11-15 20:28:48,182 INFO L141 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:28:48,185 INFO L141 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:28:48,187 INFO L141 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:28:48,196 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:28:48,475 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 50 [2019-11-15 20:28:48,893 WARN L191 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 40 [2019-11-15 20:28:49,048 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 20:28:49,048 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 20:28:49,048 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:28:49,049 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:28:49,050 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:28:49,050 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:28:49,050 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:28:49,050 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:28:49,051 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:28:49,051 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:28:49,053 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:28:49,054 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:28:49,054 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:28:49,054 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:28:49,054 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:28:49,055 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:28:49,055 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:28:49,055 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:28:49,055 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:28:49,056 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:28:49,056 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:28:49,056 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:28:49,057 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:28:49,057 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:28:49,057 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:28:49,057 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:28:49,057 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:28:49,057 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:28:49,058 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:28:49,058 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:28:49,058 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:28:49,059 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:28:49,059 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:28:49,059 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:28:49,060 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:28:49,060 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:28:49,062 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:28:49,062 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:28:49,062 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:28:49,063 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:28:49,063 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:28:49,063 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:28:49,063 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:28:49,063 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:28:49,063 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:28:49,064 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:28:49,064 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:28:49,065 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:28:49,065 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:28:49,065 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:28:49,065 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:28:49,066 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:28:49,066 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:28:49,068 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:28:49,069 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:28:49,069 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:28:49,069 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:28:49,070 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:28:49,070 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:28:49,070 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:28:49,070 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:28:49,070 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:28:49,071 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:28:49,071 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:28:49,072 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:28:49,072 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:28:49,072 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:28:49,072 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:28:49,072 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:28:49,073 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:28:49,073 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:28:49,073 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:28:49,074 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:28:49,074 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:28:49,074 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:28:49,074 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:28:49,074 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:28:49,074 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:28:49,075 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:28:49,075 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:28:49,075 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:28:49,076 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:28:49,076 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:28:49,076 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:28:49,077 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:28:49,077 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:28:49,077 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:28:49,077 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:28:49,077 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:28:49,078 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:28:49,078 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:28:49,078 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:28:49,079 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:28:49,079 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:28:49,079 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:28:49,079 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:28:49,079 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:28:49,079 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:28:49,080 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:28:49,080 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:28:49,081 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:28:49,081 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:28:49,081 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:28:49,081 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:28:49,082 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:28:49,082 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:28:49,084 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:28:49,084 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:28:49,084 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:28:49,085 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:28:49,085 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:28:49,085 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:28:49,085 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:28:49,086 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:28:49,086 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:28:49,086 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:28:49,087 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:28:49,087 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:28:49,087 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:28:49,088 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:28:49,088 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:28:49,088 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:28:49,088 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:28:49,088 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:28:49,089 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:28:49,089 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:28:49,090 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:28:49,090 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:28:49,090 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:28:49,090 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:28:49,090 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:28:49,091 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:28:49,091 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:28:49,092 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:28:49,092 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:28:49,092 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:28:49,093 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:28:49,093 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:28:49,093 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:28:49,093 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:28:49,093 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:28:49,093 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:28:49,094 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:28:49,094 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:28:49,095 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:28:49,095 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:28:49,095 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:28:49,095 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:28:49,097 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:28:49,097 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:28:49,103 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:28:49,103 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:28:49,104 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:28:49,104 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:28:49,104 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:28:49,104 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:28:49,106 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:28:49,106 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:28:49,112 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:28:49,117 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:28:49,118 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:28:49,118 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:28:49,118 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:28:49,118 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 20:28:49,119 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:28:49,119 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 20:28:49,119 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:28:49,120 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:28:49,121 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:28:49,121 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:28:49,122 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-11-15 20:28:49,122 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:28:49,122 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:28:49,126 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-11-15 20:28:49,126 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:28:49,148 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:28:49,148 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:28:49,149 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:28:49,149 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:28:49,149 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:28:49,149 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:28:49,150 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:28:49,150 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:28:49,152 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:28:49,152 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:28:49,152 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:28:49,153 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:28:49,153 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:28:49,153 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:28:49,157 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:28:49,157 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:28:49,221 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 20:28:49,287 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-15 20:28:49,287 INFO L444 ModelExtractionUtils]: 46 out of 52 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-11-15 20:28:49,287 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 20:28:49,288 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 20:28:49,289 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 20:28:49,289 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_cstrcpy_~to.base)_1, ULTIMATE.start_cstrcpy_~to.offset) = 1*v_rep(select #length ULTIMATE.start_cstrcpy_~to.base)_1 - 1*ULTIMATE.start_cstrcpy_~to.offset Supporting invariants [] [2019-11-15 20:28:49,345 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2019-11-15 20:28:49,349 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-15 20:28:49,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:28:49,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:28:49,381 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 20:28:49,382 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:28:49,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:28:49,391 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 20:28:49,392 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:28:49,411 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:28:49,411 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:28:49,412 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 15 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-11-15 20:28:49,430 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 15 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 15 states and 19 transitions. Complement of second has 4 states. [2019-11-15 20:28:49,431 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:28:49,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 20:28:49,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2019-11-15 20:28:49,431 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 9 letters. Loop has 3 letters. [2019-11-15 20:28:49,432 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:28:49,432 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 12 letters. Loop has 3 letters. [2019-11-15 20:28:49,432 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:28:49,432 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 9 letters. Loop has 6 letters. [2019-11-15 20:28:49,433 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:28:49,433 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 19 transitions. [2019-11-15 20:28:49,434 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 20:28:49,434 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 0 states and 0 transitions. [2019-11-15 20:28:49,434 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-15 20:28:49,434 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-15 20:28:49,434 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-15 20:28:49,434 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 20:28:49,435 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 20:28:49,435 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 20:28:49,435 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 20:28:49,435 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-15 20:28:49,435 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-15 20:28:49,435 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 20:28:49,435 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-15 20:28:49,444 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.11 08:28:49 BoogieIcfgContainer [2019-11-15 20:28:49,444 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-15 20:28:49,445 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 20:28:49,446 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 20:28:49,446 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 20:28:49,446 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:28:44" (3/4) ... [2019-11-15 20:28:49,453 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-15 20:28:49,454 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 20:28:49,457 INFO L168 Benchmark]: Toolchain (without parser) took 6054.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 213.9 MB). Free memory was 946.1 MB in the beginning and 830.7 MB in the end (delta: 115.4 MB). Peak memory consumption was 329.3 MB. Max. memory is 11.5 GB. [2019-11-15 20:28:49,459 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:28:49,459 INFO L168 Benchmark]: CACSL2BoogieTranslator took 520.71 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -160.8 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. [2019-11-15 20:28:49,460 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.67 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:28:49,461 INFO L168 Benchmark]: Boogie Preprocessor took 27.80 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: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. [2019-11-15 20:28:49,463 INFO L168 Benchmark]: RCFGBuilder took 465.55 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.7 MB). Peak memory consumption was 21.7 MB. Max. memory is 11.5 GB. [2019-11-15 20:28:49,467 INFO L168 Benchmark]: BuchiAutomizer took 4977.55 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 84.4 MB). Free memory was 1.1 GB in the beginning and 838.9 MB in the end (delta: 244.7 MB). Peak memory consumption was 329.1 MB. Max. memory is 11.5 GB. [2019-11-15 20:28:49,473 INFO L168 Benchmark]: Witness Printer took 8.18 ms. Allocated memory is still 1.2 GB. Free memory was 838.9 MB in the beginning and 830.7 MB in the end (delta: 8.2 MB). Peak memory consumption was 8.2 MB. Max. memory is 11.5 GB. [2019-11-15 20:28:49,479 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 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 520.71 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -160.8 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 44.67 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 27.80 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: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 465.55 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.7 MB). Peak memory consumption was 21.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4977.55 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 84.4 MB). Free memory was 1.1 GB in the beginning and 838.9 MB in the end (delta: 244.7 MB). Peak memory consumption was 329.1 MB. Max. memory is 11.5 GB. * Witness Printer took 8.18 ms. Allocated memory is still 1.2 GB. Free memory was 838.9 MB in the beginning and 830.7 MB in the end (delta: 8.2 MB). Peak memory consumption was 8.2 MB. 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 3 terminating modules (1 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * i + length2 and consists of 5 locations. One deterministic module has affine ranking function unknown-#length-unknown[to] + -1 * to and consists of 3 locations. 1 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.9s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 4.4s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 12 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 38 SDtfs, 47 SDslu, 37 SDs, 0 SdLazy, 41 SolverSat, 10 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital172 mio100 ax111 hnf98 lsp84 ukn81 mio100 lsp53 div100 bol100 ite100 ukn100 eq181 hnf89 smp99 dnf159 smp96 tf100 neg94 sie119 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 40ms VariablesStem: 5 VariablesLoop: 2 DisjunctsStem: 4 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 12 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...