./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/count_down-alloca-2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_dbaaf5c8-aa13-4284-90ef-d8373dbd0d25/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_dbaaf5c8-aa13-4284-90ef-d8373dbd0d25/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_dbaaf5c8-aa13-4284-90ef-d8373dbd0d25/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_dbaaf5c8-aa13-4284-90ef-d8373dbd0d25/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/count_down-alloca-2.i -s /tmp/vcloud-vcloud-master/worker/working_dir_dbaaf5c8-aa13-4284-90ef-d8373dbd0d25/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_dbaaf5c8-aa13-4284-90ef-d8373dbd0d25/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 9016787135830d25851d4a1126db5f65005e4eb5 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 09:02:56,479 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 09:02:56,481 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 09:02:56,493 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 09:02:56,494 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 09:02:56,494 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 09:02:56,495 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 09:02:56,497 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 09:02:56,498 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 09:02:56,499 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 09:02:56,500 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 09:02:56,501 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 09:02:56,501 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 09:02:56,502 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 09:02:56,503 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 09:02:56,504 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 09:02:56,505 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 09:02:56,505 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 09:02:56,507 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 09:02:56,508 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 09:02:56,509 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 09:02:56,510 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 09:02:56,511 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 09:02:56,512 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 09:02:56,513 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 09:02:56,514 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 09:02:56,514 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 09:02:56,514 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 09:02:56,515 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 09:02:56,516 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 09:02:56,516 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 09:02:56,517 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 09:02:56,517 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 09:02:56,518 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 09:02:56,518 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 09:02:56,519 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 09:02:56,519 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 09:02:56,520 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 09:02:56,520 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 09:02:56,520 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 09:02:56,521 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 09:02:56,522 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_dbaaf5c8-aa13-4284-90ef-d8373dbd0d25/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-10-22 09:02:56,536 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 09:02:56,536 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 09:02:56,537 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 09:02:56,537 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 09:02:56,537 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 09:02:56,538 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-10-22 09:02:56,538 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-10-22 09:02:56,538 INFO L138 SettingsManager]: * Use old map elimination=false [2019-10-22 09:02:56,538 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-10-22 09:02:56,538 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-10-22 09:02:56,538 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-10-22 09:02:56,539 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 09:02:56,539 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 09:02:56,539 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 09:02:56,539 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 09:02:56,539 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-10-22 09:02:56,540 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-10-22 09:02:56,540 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-10-22 09:02:56,540 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 09:02:56,540 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-10-22 09:02:56,540 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 09:02:56,540 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-10-22 09:02:56,541 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 09:02:56,541 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 09:02:56,541 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-10-22 09:02:56,541 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 09:02:56,541 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 09:02:56,541 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-10-22 09:02:56,543 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-10-22 09:02:56,546 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/working_dir_dbaaf5c8-aa13-4284-90ef-d8373dbd0d25/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9016787135830d25851d4a1126db5f65005e4eb5 [2019-10-22 09:02:56,586 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 09:02:56,597 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 09:02:56,601 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 09:02:56,603 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 09:02:56,604 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 09:02:56,605 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_dbaaf5c8-aa13-4284-90ef-d8373dbd0d25/bin/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/count_down-alloca-2.i [2019-10-22 09:02:56,661 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_dbaaf5c8-aa13-4284-90ef-d8373dbd0d25/bin/uautomizer/data/169f56a86/e14435ce8ba94bc5b2d05eb469356e32/FLAG186aa55b2 [2019-10-22 09:02:57,092 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 09:02:57,093 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_dbaaf5c8-aa13-4284-90ef-d8373dbd0d25/sv-benchmarks/c/termination-memory-alloca/count_down-alloca-2.i [2019-10-22 09:02:57,106 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_dbaaf5c8-aa13-4284-90ef-d8373dbd0d25/bin/uautomizer/data/169f56a86/e14435ce8ba94bc5b2d05eb469356e32/FLAG186aa55b2 [2019-10-22 09:02:57,116 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_dbaaf5c8-aa13-4284-90ef-d8373dbd0d25/bin/uautomizer/data/169f56a86/e14435ce8ba94bc5b2d05eb469356e32 [2019-10-22 09:02:57,119 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 09:02:57,120 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 09:02:57,121 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 09:02:57,121 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 09:02:57,124 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 09:02:57,125 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:02:57" (1/1) ... [2019-10-22 09:02:57,128 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24abdaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:57, skipping insertion in model container [2019-10-22 09:02:57,128 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:02:57" (1/1) ... [2019-10-22 09:02:57,135 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 09:02:57,167 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 09:02:57,542 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:02:57,556 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 09:02:57,619 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:02:57,659 INFO L192 MainTranslator]: Completed translation [2019-10-22 09:02:57,659 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:57 WrapperNode [2019-10-22 09:02:57,660 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 09:02:57,660 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 09:02:57,661 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 09:02:57,661 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 09:02:57,668 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:57" (1/1) ... [2019-10-22 09:02:57,678 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:57" (1/1) ... [2019-10-22 09:02:57,693 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 09:02:57,693 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 09:02:57,693 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 09:02:57,694 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 09:02:57,702 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:57" (1/1) ... [2019-10-22 09:02:57,702 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:57" (1/1) ... [2019-10-22 09:02:57,704 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:57" (1/1) ... [2019-10-22 09:02:57,704 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:57" (1/1) ... [2019-10-22 09:02:57,709 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:57" (1/1) ... [2019-10-22 09:02:57,713 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:57" (1/1) ... [2019-10-22 09:02:57,715 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:57" (1/1) ... [2019-10-22 09:02:57,716 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 09:02:57,717 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 09:02:57,717 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 09:02:57,717 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 09:02:57,718 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:57" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dbaaf5c8-aa13-4284-90ef-d8373dbd0d25/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-10-22 09:02:57,778 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 09:02:57,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 09:02:57,779 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 09:02:57,779 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 09:02:57,779 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 09:02:57,779 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 09:02:57,986 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 09:02:57,986 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-10-22 09:02:57,988 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:02:57 BoogieIcfgContainer [2019-10-22 09:02:57,988 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 09:02:57,989 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-10-22 09:02:57,989 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-10-22 09:02:57,992 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-10-22 09:02:57,993 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:02:57,993 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.10 09:02:57" (1/3) ... [2019-10-22 09:02:57,994 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5c36e3be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 09:02:57, skipping insertion in model container [2019-10-22 09:02:57,994 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:02:57,994 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:57" (2/3) ... [2019-10-22 09:02:57,995 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5c36e3be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 09:02:57, skipping insertion in model container [2019-10-22 09:02:57,995 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:02:57,995 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:02:57" (3/3) ... [2019-10-22 09:02:57,996 INFO L371 chiAutomizerObserver]: Analyzing ICFG count_down-alloca-2.i [2019-10-22 09:02:58,059 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-10-22 09:02:58,059 INFO L357 BuchiCegarLoop]: Hoare is false [2019-10-22 09:02:58,060 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-10-22 09:02:58,060 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 09:02:58,061 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 09:02:58,061 INFO L361 BuchiCegarLoop]: Difference is false [2019-10-22 09:02:58,061 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 09:02:58,062 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-10-22 09:02:58,076 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-10-22 09:02:58,101 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-10-22 09:02:58,102 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:02:58,102 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:02:58,108 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-10-22 09:02:58,108 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-10-22 09:02:58,109 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-10-22 09:02:58,109 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-10-22 09:02:58,110 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-10-22 09:02:58,111 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:02:58,111 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:02:58,111 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-10-22 09:02:58,111 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-10-22 09:02:58,118 INFO L791 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8#L-1true havoc main_#res;havoc main_#t~nondet2, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet5, main_#t~post4, main_#t~mem8, main_#t~post9, main_#t~mem7, main_#t~post6, main_~i~0, main_~j~0, main_~val~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~length~0 := main_#t~nondet2;havoc main_#t~nondet2; 12#L551true assume !(main_~length~0 < 1); 18#L551-2true call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 9#L553true assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 13#L554-3true [2019-10-22 09:02:58,120 INFO L793 eck$LassoCheckResult]: Loop: 13#L554-3true assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet5;havoc main_#t~nondet5; 5#L556true assume main_~val~0 < 0;main_~val~0 := 0; 7#L556-2true call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 11#L554-2true main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 13#L554-3true [2019-10-22 09:02:58,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:58,125 INFO L82 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2019-10-22 09:02:58,133 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:58,134 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19752259] [2019-10-22 09:02:58,134 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:58,134 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:58,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:58,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:58,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:58,263 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:58,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:58,265 INFO L82 PathProgramCache]: Analyzing trace with hash 1603878, now seen corresponding path program 1 times [2019-10-22 09:02:58,265 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:58,265 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069809792] [2019-10-22 09:02:58,265 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:58,265 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:58,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:58,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:58,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:58,284 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:58,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:58,285 INFO L82 PathProgramCache]: Analyzing trace with hash 1182970350, now seen corresponding path program 1 times [2019-10-22 09:02:58,286 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:58,286 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190391925] [2019-10-22 09:02:58,286 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:58,286 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:58,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:58,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:58,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:58,316 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:58,521 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:02:58,521 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:02:58,522 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:02:58,522 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:02:58,522 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:02:58,522 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:02:58,522 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:02:58,522 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:02:58,522 INFO L131 ssoRankerPreferences]: Filename of dumped script: count_down-alloca-2.i_Iteration1_Lasso [2019-10-22 09:02:58,523 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:02:58,523 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:02:58,545 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:58,550 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:58,552 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:58,554 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:58,557 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:58,653 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:58,656 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:58,659 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:58,662 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:58,664 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:58,667 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:58,669 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:58,672 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:58,674 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:58,676 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:58,916 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:02:58,921 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:02:58,923 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-10-22 09:02:58,924 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:58,925 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:58,925 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:58,925 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:58,926 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:58,927 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:58,928 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:58,930 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:58,935 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-10-22 09:02:58,936 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:58,936 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:58,936 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:58,937 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:58,937 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:58,937 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:58,937 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:58,938 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:58,938 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-10-22 09:02:58,943 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:58,943 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:58,943 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:58,943 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:58,944 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:58,944 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:58,944 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:58,945 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:58,946 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-10-22 09:02:58,946 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:58,946 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:58,947 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:58,950 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:58,950 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:58,951 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:58,951 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:58,952 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:58,952 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:58,953 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:58,953 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:58,953 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:58,953 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:58,953 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:58,954 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:58,954 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:58,955 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:58,958 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-10-22 09:02:58,959 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:58,959 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-10-22 09:02:58,959 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:58,959 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:58,962 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-10-22 09:02:58,962 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:58,998 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:59,005 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-10-22 09:02:59,006 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:59,006 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:59,006 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:59,006 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:59,009 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:59,009 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:59,029 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:59,029 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-10-22 09:02:59,030 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:59,030 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:59,030 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:59,030 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:59,037 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:59,037 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:59,105 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:02:59,123 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-10-22 09:02:59,123 INFO L444 ModelExtractionUtils]: 17 out of 22 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 09:02:59,125 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:02:59,126 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 09:02:59,127 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:02:59,135 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~arr~0.offset, ULTIMATE.start_main_~i~0, v_rep(select #length ULTIMATE.start_main_~arr~0.base)_1) = -1*ULTIMATE.start_main_~arr~0.offset - 4*ULTIMATE.start_main_~i~0 + 1*v_rep(select #length ULTIMATE.start_main_~arr~0.base)_1 Supporting invariants [] [2019-10-22 09:02:59,150 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-10-22 09:02:59,158 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-22 09:02:59,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:59,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:59,191 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:02:59,193 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:59,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:59,210 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 09:02:59,211 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:59,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:59,240 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-10-22 09:02:59,241 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states. Second operand 4 states. [2019-10-22 09:02:59,319 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states.. Second operand 4 states. Result 43 states and 60 transitions. Complement of second has 7 states. [2019-10-22 09:02:59,321 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-10-22 09:02:59,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-10-22 09:02:59,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2019-10-22 09:02:59,325 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 5 letters. Loop has 4 letters. [2019-10-22 09:02:59,326 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:59,327 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 9 letters. Loop has 4 letters. [2019-10-22 09:02:59,327 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:59,328 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 5 letters. Loop has 8 letters. [2019-10-22 09:02:59,328 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:59,329 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 60 transitions. [2019-10-22 09:02:59,333 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-10-22 09:02:59,341 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 15 states and 20 transitions. [2019-10-22 09:02:59,343 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-10-22 09:02:59,344 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-10-22 09:02:59,344 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 20 transitions. [2019-10-22 09:02:59,345 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:02:59,345 INFO L688 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2019-10-22 09:02:59,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 20 transitions. [2019-10-22 09:02:59,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-10-22 09:02:59,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-10-22 09:02:59,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2019-10-22 09:02:59,375 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2019-10-22 09:02:59,375 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2019-10-22 09:02:59,376 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-10-22 09:02:59,376 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. [2019-10-22 09:02:59,376 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-10-22 09:02:59,377 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:02:59,377 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:02:59,377 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:59,377 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-10-22 09:02:59,378 INFO L791 eck$LassoCheckResult]: Stem: 136#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 132#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet5, main_#t~post4, main_#t~mem8, main_#t~post9, main_#t~mem7, main_#t~post6, main_~i~0, main_~j~0, main_~val~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~length~0 := main_#t~nondet2;havoc main_#t~nondet2; 133#L551 assume !(main_~length~0 < 1); 138#L551-2 call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 134#L553 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 135#L554-3 assume !(main_~i~0 < main_~length~0); 139#L554-4 main_~j~0 := 0; 127#L561-3 [2019-10-22 09:02:59,378 INFO L793 eck$LassoCheckResult]: Loop: 127#L561-3 assume !!(main_~j~0 < main_~length~0); 128#L562-3 call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 140#L562-1 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 141#L561-2 main_#t~post6 := main_~j~0;main_~j~0 := 1 + main_#t~post6;havoc main_#t~post6; 127#L561-3 [2019-10-22 09:02:59,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:59,378 INFO L82 PathProgramCache]: Analyzing trace with hash 1806815512, now seen corresponding path program 1 times [2019-10-22 09:02:59,378 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:59,379 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988627424] [2019-10-22 09:02:59,379 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:59,380 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:59,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:59,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:59,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:59,428 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988627424] [2019-10-22 09:02:59,429 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:59,429 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 09:02:59,430 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085664746] [2019-10-22 09:02:59,432 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 09:02:59,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:59,432 INFO L82 PathProgramCache]: Analyzing trace with hash 2252300, now seen corresponding path program 1 times [2019-10-22 09:02:59,432 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:59,433 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305101875] [2019-10-22 09:02:59,433 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:59,433 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:59,433 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:59,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:59,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:59,442 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:59,487 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:59,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:02:59,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:02:59,491 INFO L87 Difference]: Start difference. First operand 15 states and 20 transitions. cyclomatic complexity: 7 Second operand 4 states. [2019-10-22 09:02:59,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:59,527 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2019-10-22 09:02:59,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 09:02:59,532 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 23 transitions. [2019-10-22 09:02:59,533 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-10-22 09:02:59,533 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 23 transitions. [2019-10-22 09:02:59,533 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-10-22 09:02:59,534 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-10-22 09:02:59,534 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 23 transitions. [2019-10-22 09:02:59,534 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:02:59,534 INFO L688 BuchiCegarLoop]: Abstraction has 18 states and 23 transitions. [2019-10-22 09:02:59,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 23 transitions. [2019-10-22 09:02:59,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 15. [2019-10-22 09:02:59,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-10-22 09:02:59,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2019-10-22 09:02:59,539 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2019-10-22 09:02:59,539 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2019-10-22 09:02:59,539 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-10-22 09:02:59,539 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 19 transitions. [2019-10-22 09:02:59,540 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-10-22 09:02:59,540 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:02:59,540 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:02:59,540 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:59,540 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-10-22 09:02:59,541 INFO L791 eck$LassoCheckResult]: Stem: 176#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 172#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet5, main_#t~post4, main_#t~mem8, main_#t~post9, main_#t~mem7, main_#t~post6, main_~i~0, main_~j~0, main_~val~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~length~0 := main_#t~nondet2;havoc main_#t~nondet2; 173#L551 assume !(main_~length~0 < 1); 178#L551-2 call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 174#L553 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 175#L554-3 assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet5;havoc main_#t~nondet5; 169#L556 assume !(main_~val~0 < 0); 170#L556-2 call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 171#L554-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 177#L554-3 assume !(main_~i~0 < main_~length~0); 179#L554-4 main_~j~0 := 0; 167#L561-3 [2019-10-22 09:02:59,541 INFO L793 eck$LassoCheckResult]: Loop: 167#L561-3 assume !!(main_~j~0 < main_~length~0); 168#L562-3 call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 180#L562-1 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 181#L561-2 main_#t~post6 := main_~j~0;main_~j~0 := 1 + main_#t~post6;havoc main_#t~post6; 167#L561-3 [2019-10-22 09:02:59,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:59,541 INFO L82 PathProgramCache]: Analyzing trace with hash -1329979393, now seen corresponding path program 1 times [2019-10-22 09:02:59,541 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:59,542 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020477196] [2019-10-22 09:02:59,542 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:59,542 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:59,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:59,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:59,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:59,562 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:59,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:59,563 INFO L82 PathProgramCache]: Analyzing trace with hash 2252300, now seen corresponding path program 2 times [2019-10-22 09:02:59,563 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:59,564 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015851142] [2019-10-22 09:02:59,564 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:59,564 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:59,564 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:59,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:59,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:59,572 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:59,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:59,573 INFO L82 PathProgramCache]: Analyzing trace with hash -2035265782, now seen corresponding path program 1 times [2019-10-22 09:02:59,573 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:59,573 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077317347] [2019-10-22 09:02:59,574 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:59,574 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:59,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:59,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:59,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:59,602 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:59,787 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 63 [2019-10-22 09:02:59,840 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:02:59,840 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:02:59,841 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:02:59,841 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:02:59,841 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:02:59,841 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:02:59,841 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:02:59,841 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:02:59,841 INFO L131 ssoRankerPreferences]: Filename of dumped script: count_down-alloca-2.i_Iteration3_Lasso [2019-10-22 09:02:59,842 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:02:59,842 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:02:59,845 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:59,851 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:59,853 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:59,989 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:59,991 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:59,997 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:00,000 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:00,002 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:00,004 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:00,007 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:00,009 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:00,012 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:00,035 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:00,037 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:00,255 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:03:00,255 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:03:00,256 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-10-22 09:03:00,256 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:03:00,256 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:03:00,257 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:03:00,257 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:03:00,257 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:03:00,257 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:03:00,257 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:03:00,258 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:03:00,259 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-10-22 09:03:00,259 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:03:00,259 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:03:00,259 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:03:00,260 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:03:00,260 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:03:00,260 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:03:00,260 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:03:00,261 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:03:00,261 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-10-22 09:03:00,261 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:03:00,262 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:03:00,262 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:03:00,262 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:03:00,265 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:03:00,265 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:03:00,296 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:03:00,333 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2019-10-22 09:03:00,333 INFO L444 ModelExtractionUtils]: 17 out of 25 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-10-22 09:03:00,334 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:03:00,335 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-10-22 09:03:00,335 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:03:00,336 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0) = -2*ULTIMATE.start_main_~j~0 + 1 Supporting invariants [-1*ULTIMATE.start_main_~length~0 + 1 >= 0] [2019-10-22 09:03:00,344 INFO L297 tatePredicateManager]: 3 out of 4 supporting invariants were superfluous and have been removed [2019-10-22 09:03:00,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:00,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:03:00,379 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-22 09:03:00,379 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:03:00,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:03:00,419 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-22 09:03:00,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:03:00,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:03:00,435 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 2 loop predicates [2019-10-22 09:03:00,435 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 19 transitions. cyclomatic complexity: 6 Second operand 6 states. [2019-10-22 09:03:00,566 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 19 transitions. cyclomatic complexity: 6. Second operand 6 states. Result 41 states and 53 transitions. Complement of second has 11 states. [2019-10-22 09:03:00,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 6 stem states 1 non-accepting loop states 2 accepting loop states [2019-10-22 09:03:00,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-10-22 09:03:00,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 39 transitions. [2019-10-22 09:03:00,567 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 39 transitions. Stem has 11 letters. Loop has 4 letters. [2019-10-22 09:03:00,567 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:03:00,568 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 39 transitions. Stem has 15 letters. Loop has 4 letters. [2019-10-22 09:03:00,568 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:03:00,568 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 39 transitions. Stem has 11 letters. Loop has 8 letters. [2019-10-22 09:03:00,568 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:03:00,568 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 53 transitions. [2019-10-22 09:03:00,569 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-10-22 09:03:00,570 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 40 states and 52 transitions. [2019-10-22 09:03:00,570 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2019-10-22 09:03:00,570 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2019-10-22 09:03:00,571 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 52 transitions. [2019-10-22 09:03:00,571 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:03:00,571 INFO L688 BuchiCegarLoop]: Abstraction has 40 states and 52 transitions. [2019-10-22 09:03:00,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 52 transitions. [2019-10-22 09:03:00,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 34. [2019-10-22 09:03:00,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-10-22 09:03:00,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 45 transitions. [2019-10-22 09:03:00,574 INFO L711 BuchiCegarLoop]: Abstraction has 34 states and 45 transitions. [2019-10-22 09:03:00,575 INFO L591 BuchiCegarLoop]: Abstraction has 34 states and 45 transitions. [2019-10-22 09:03:00,575 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-10-22 09:03:00,575 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 45 transitions. [2019-10-22 09:03:00,576 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-10-22 09:03:00,576 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:03:00,576 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:03:00,576 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:03:00,576 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 09:03:00,577 INFO L791 eck$LassoCheckResult]: Stem: 342#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 338#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet5, main_#t~post4, main_#t~mem8, main_#t~post9, main_#t~mem7, main_#t~post6, main_~i~0, main_~j~0, main_~val~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~length~0 := main_#t~nondet2;havoc main_#t~nondet2; 339#L551 assume main_~length~0 < 1;main_~length~0 := 1; 344#L551-2 call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 340#L553 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 341#L554-3 assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet5;havoc main_#t~nondet5; 334#L556 assume !(main_~val~0 < 0); 335#L556-2 call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 359#L554-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 356#L554-3 assume !(main_~i~0 < main_~length~0); 355#L554-4 main_~j~0 := 0; 353#L561-3 assume !!(main_~j~0 < main_~length~0); 333#L562-3 [2019-10-22 09:03:00,577 INFO L793 eck$LassoCheckResult]: Loop: 333#L562-3 call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 349#L562-1 assume !!(main_#t~mem7 > 0);havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);main_#t~post9 := main_#t~mem8;call write~int(main_#t~post9 - 1, main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);havoc main_#t~post9;havoc main_#t~mem8; 333#L562-3 [2019-10-22 09:03:00,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:00,577 INFO L82 PathProgramCache]: Analyzing trace with hash 2113338830, now seen corresponding path program 1 times [2019-10-22 09:03:00,577 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:03:00,577 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270091588] [2019-10-22 09:03:00,578 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:00,578 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:00,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:03:00,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:03:00,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:03:00,595 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:03:00,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:00,596 INFO L82 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 1 times [2019-10-22 09:03:00,596 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:03:00,596 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141520784] [2019-10-22 09:03:00,596 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:00,596 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:00,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:03:00,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:03:00,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:03:00,604 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:03:00,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:00,605 INFO L82 PathProgramCache]: Analyzing trace with hash -600913837, now seen corresponding path program 1 times [2019-10-22 09:03:00,605 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:03:00,605 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834300869] [2019-10-22 09:03:00,605 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:00,605 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:00,605 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:03:00,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:03:00,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:03:00,628 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:03:00,772 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 64 [2019-10-22 09:03:00,811 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:03:00,811 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:03:00,811 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:03:00,812 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:03:00,812 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:03:00,812 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:03:00,812 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:03:00,812 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:03:00,812 INFO L131 ssoRankerPreferences]: Filename of dumped script: count_down-alloca-2.i_Iteration4_Lasso [2019-10-22 09:03:00,812 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:03:00,812 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:03:00,814 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:00,817 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:00,818 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:00,821 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:00,823 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:00,825 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:00,827 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:00,829 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:00,958 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:00,959 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:00,961 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:00,963 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:00,964 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:00,966 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:01,194 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:03:01,195 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:03:01,195 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:03:01,198 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:03:01,198 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:03:01,198 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:03:01,198 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:03:01,198 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:03:01,199 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:03:01,199 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:03:01,199 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:03:01,200 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-10-22 09:03:01,200 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:03:01,200 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:03:01,200 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:03:01,200 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:03:01,201 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:03:01,201 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:03:01,201 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:03:01,201 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:03:01,202 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:03:01,202 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:03:01,202 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:03:01,202 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:03:01,202 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:03:01,203 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:03:01,203 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:03:01,205 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:03:01,206 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-10-22 09:03:01,206 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:03:01,206 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:03:01,206 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:03:01,206 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:03:01,207 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:03:01,207 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:03:01,207 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:03:01,208 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:03:01,208 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:03:01,208 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:03:01,208 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:03:01,209 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:03:01,209 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:03:01,210 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:03:01,210 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:03:01,211 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:03:01,212 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-10-22 09:03:01,212 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:03:01,212 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:03:01,212 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:03:01,212 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:03:01,212 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:03:01,213 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:03:01,213 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:03:01,213 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:03:01,214 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-10-22 09:03:01,214 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:03:01,214 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:03:01,215 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:03:01,215 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:03:01,216 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:03:01,216 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:03:01,218 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:03:01,218 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-10-22 09:03:01,219 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:03:01,219 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:03:01,219 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:03:01,219 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:03:01,221 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:03:01,221 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:03:01,232 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:03:01,236 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 09:03:01,236 INFO L444 ModelExtractionUtils]: 10 out of 13 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 09:03:01,236 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:03:01,237 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 09:03:01,237 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:03:01,237 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~arr~0.base) (+ (* ULTIMATE.start_main_~j~0 4) ULTIMATE.start_main_~arr~0.offset))_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~arr~0.base) (+ (* ULTIMATE.start_main_~j~0 4) ULTIMATE.start_main_~arr~0.offset))_2 Supporting invariants [] [2019-10-22 09:03:01,245 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2019-10-22 09:03:01,246 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 09:03:01,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:01,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:03:01,266 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:03:01,266 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:03:01,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:03:01,272 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-22 09:03:01,272 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:03:01,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:03:01,283 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-10-22 09:03:01,283 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 34 states and 45 transitions. cyclomatic complexity: 16 Second operand 3 states. [2019-10-22 09:03:01,299 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 34 states and 45 transitions. cyclomatic complexity: 16. Second operand 3 states. Result 50 states and 65 transitions. Complement of second has 7 states. [2019-10-22 09:03:01,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-10-22 09:03:01,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 09:03:01,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2019-10-22 09:03:01,300 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 12 letters. Loop has 2 letters. [2019-10-22 09:03:01,300 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:03:01,300 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 14 letters. Loop has 2 letters. [2019-10-22 09:03:01,300 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:03:01,300 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 12 letters. Loop has 4 letters. [2019-10-22 09:03:01,301 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:03:01,301 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 65 transitions. [2019-10-22 09:03:01,302 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-10-22 09:03:01,302 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 44 states and 57 transitions. [2019-10-22 09:03:01,302 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2019-10-22 09:03:01,303 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2019-10-22 09:03:01,303 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 57 transitions. [2019-10-22 09:03:01,303 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:03:01,303 INFO L688 BuchiCegarLoop]: Abstraction has 44 states and 57 transitions. [2019-10-22 09:03:01,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states and 57 transitions. [2019-10-22 09:03:01,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2019-10-22 09:03:01,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-10-22 09:03:01,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 55 transitions. [2019-10-22 09:03:01,306 INFO L711 BuchiCegarLoop]: Abstraction has 42 states and 55 transitions. [2019-10-22 09:03:01,306 INFO L591 BuchiCegarLoop]: Abstraction has 42 states and 55 transitions. [2019-10-22 09:03:01,306 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-10-22 09:03:01,306 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 55 transitions. [2019-10-22 09:03:01,307 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-10-22 09:03:01,307 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:03:01,307 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:03:01,307 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:03:01,308 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 09:03:01,308 INFO L791 eck$LassoCheckResult]: Stem: 507#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 503#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet5, main_#t~post4, main_#t~mem8, main_#t~post9, main_#t~mem7, main_#t~post6, main_~i~0, main_~j~0, main_~val~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~length~0 := main_#t~nondet2;havoc main_#t~nondet2; 504#L551 assume main_~length~0 < 1;main_~length~0 := 1; 510#L551-2 call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 505#L553 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 506#L554-3 assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet5;havoc main_#t~nondet5; 500#L556 assume !(main_~val~0 < 0); 501#L556-2 call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 502#L554-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 508#L554-3 assume !(main_~i~0 < main_~length~0); 509#L554-4 main_~j~0 := 0; 495#L561-3 assume !!(main_~j~0 < main_~length~0); 496#L562-3 call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 520#L562-1 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 519#L561-2 main_#t~post6 := main_~j~0;main_~j~0 := 1 + main_#t~post6;havoc main_#t~post6; 497#L561-3 assume !!(main_~j~0 < main_~length~0); 499#L562-3 [2019-10-22 09:03:01,308 INFO L793 eck$LassoCheckResult]: Loop: 499#L562-3 call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 512#L562-1 assume !!(main_#t~mem7 > 0);havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);main_#t~post9 := main_#t~mem8;call write~int(main_#t~post9 - 1, main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);havoc main_#t~post9;havoc main_#t~mem8; 499#L562-3 [2019-10-22 09:03:01,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:01,308 INFO L82 PathProgramCache]: Analyzing trace with hash -1952579805, now seen corresponding path program 1 times [2019-10-22 09:03:01,308 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:03:01,308 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931978054] [2019-10-22 09:03:01,308 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:01,309 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:01,309 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:03:01,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:03:01,405 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:03:01,405 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931978054] [2019-10-22 09:03:01,406 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [679224436] [2019-10-22 09:03:01,406 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dbaaf5c8-aa13-4284-90ef-d8373dbd0d25/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:03:01,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:03:01,465 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 09:03:01,466 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:03:01,486 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-22 09:03:01,486 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-22 09:03:01,487 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2019-10-22 09:03:01,487 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632952996] [2019-10-22 09:03:01,487 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 09:03:01,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:01,487 INFO L82 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 2 times [2019-10-22 09:03:01,488 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:03:01,488 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157363617] [2019-10-22 09:03:01,488 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:01,488 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:01,488 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:03:01,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:03:01,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:03:01,494 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:03:01,518 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:03:01,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 09:03:01,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-10-22 09:03:01,518 INFO L87 Difference]: Start difference. First operand 42 states and 55 transitions. cyclomatic complexity: 20 Second operand 5 states. [2019-10-22 09:03:01,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:03:01,547 INFO L93 Difference]: Finished difference Result 49 states and 62 transitions. [2019-10-22 09:03:01,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 09:03:01,548 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 62 transitions. [2019-10-22 09:03:01,549 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-10-22 09:03:01,549 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 35 states and 45 transitions. [2019-10-22 09:03:01,549 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2019-10-22 09:03:01,549 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2019-10-22 09:03:01,549 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 45 transitions. [2019-10-22 09:03:01,549 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:03:01,550 INFO L688 BuchiCegarLoop]: Abstraction has 35 states and 45 transitions. [2019-10-22 09:03:01,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 45 transitions. [2019-10-22 09:03:01,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-10-22 09:03:01,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-10-22 09:03:01,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 45 transitions. [2019-10-22 09:03:01,552 INFO L711 BuchiCegarLoop]: Abstraction has 35 states and 45 transitions. [2019-10-22 09:03:01,552 INFO L591 BuchiCegarLoop]: Abstraction has 35 states and 45 transitions. [2019-10-22 09:03:01,552 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-10-22 09:03:01,552 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 45 transitions. [2019-10-22 09:03:01,553 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-10-22 09:03:01,553 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:03:01,553 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:03:01,553 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:03:01,553 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 09:03:01,554 INFO L791 eck$LassoCheckResult]: Stem: 657#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 653#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet5, main_#t~post4, main_#t~mem8, main_#t~post9, main_#t~mem7, main_#t~post6, main_~i~0, main_~j~0, main_~val~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~length~0 := main_#t~nondet2;havoc main_#t~nondet2; 654#L551 assume !(main_~length~0 < 1); 659#L551-2 call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 655#L553 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 656#L554-3 assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet5;havoc main_#t~nondet5; 660#L556 assume !(main_~val~0 < 0); 678#L556-2 call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 677#L554-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 661#L554-3 assume !(main_~i~0 < main_~length~0); 662#L554-4 main_~j~0 := 0; 666#L561-3 assume !!(main_~j~0 < main_~length~0); 675#L562-3 call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 672#L562-1 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 668#L561-2 main_#t~post6 := main_~j~0;main_~j~0 := 1 + main_#t~post6;havoc main_#t~post6; 647#L561-3 assume !!(main_~j~0 < main_~length~0); 649#L562-3 [2019-10-22 09:03:01,554 INFO L793 eck$LassoCheckResult]: Loop: 649#L562-3 call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 663#L562-1 assume !!(main_#t~mem7 > 0);havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);main_#t~post9 := main_#t~mem8;call write~int(main_#t~post9 - 1, main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);havoc main_#t~post9;havoc main_#t~mem8; 649#L562-3 [2019-10-22 09:03:01,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:01,554 INFO L82 PathProgramCache]: Analyzing trace with hash 1331270241, now seen corresponding path program 2 times [2019-10-22 09:03:01,554 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:03:01,554 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582375946] [2019-10-22 09:03:01,554 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:01,554 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:01,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:03:01,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:03:01,618 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:03:01,619 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582375946] [2019-10-22 09:03:01,619 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [574209852] [2019-10-22 09:03:01,619 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dbaaf5c8-aa13-4284-90ef-d8373dbd0d25/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:03:01,662 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-22 09:03:01,662 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-22 09:03:01,662 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 09:03:01,663 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:03:01,717 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:03:01,718 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 09:03:01,718 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 13 [2019-10-22 09:03:01,718 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655249741] [2019-10-22 09:03:01,718 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 09:03:01,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:01,719 INFO L82 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 3 times [2019-10-22 09:03:01,719 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:03:01,719 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484707042] [2019-10-22 09:03:01,719 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:01,719 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:01,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:03:01,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:03:01,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:03:01,724 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:03:01,748 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:03:01,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-22 09:03:01,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2019-10-22 09:03:01,749 INFO L87 Difference]: Start difference. First operand 35 states and 45 transitions. cyclomatic complexity: 16 Second operand 14 states. [2019-10-22 09:03:01,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:03:01,904 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2019-10-22 09:03:01,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-22 09:03:01,905 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 42 transitions. [2019-10-22 09:03:01,905 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-10-22 09:03:01,906 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 27 states and 34 transitions. [2019-10-22 09:03:01,906 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-10-22 09:03:01,906 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-10-22 09:03:01,906 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 34 transitions. [2019-10-22 09:03:01,906 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:03:01,906 INFO L688 BuchiCegarLoop]: Abstraction has 27 states and 34 transitions. [2019-10-22 09:03:01,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 34 transitions. [2019-10-22 09:03:01,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 24. [2019-10-22 09:03:01,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-10-22 09:03:01,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2019-10-22 09:03:01,910 INFO L711 BuchiCegarLoop]: Abstraction has 24 states and 30 transitions. [2019-10-22 09:03:01,911 INFO L591 BuchiCegarLoop]: Abstraction has 24 states and 30 transitions. [2019-10-22 09:03:01,911 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-10-22 09:03:01,911 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 30 transitions. [2019-10-22 09:03:01,911 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-10-22 09:03:01,912 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:03:01,912 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:03:01,912 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:03:01,912 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-10-22 09:03:01,912 INFO L791 eck$LassoCheckResult]: Stem: 793#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 789#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet5, main_#t~post4, main_#t~mem8, main_#t~post9, main_#t~mem7, main_#t~post6, main_~i~0, main_~j~0, main_~val~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~length~0 := main_#t~nondet2;havoc main_#t~nondet2; 790#L551 assume !(main_~length~0 < 1); 796#L551-2 call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 791#L553 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 792#L554-3 assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet5;havoc main_#t~nondet5; 797#L556 assume !(main_~val~0 < 0); 807#L556-2 call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 794#L554-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 795#L554-3 assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet5;havoc main_#t~nondet5; 786#L556 assume !(main_~val~0 < 0); 787#L556-2 call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 788#L554-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 806#L554-3 assume !(main_~i~0 < main_~length~0); 802#L554-4 main_~j~0 := 0; 784#L561-3 assume !!(main_~j~0 < main_~length~0); 785#L562-3 call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 798#L562-1 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 799#L561-2 [2019-10-22 09:03:01,912 INFO L793 eck$LassoCheckResult]: Loop: 799#L561-2 main_#t~post6 := main_~j~0;main_~j~0 := 1 + main_#t~post6;havoc main_#t~post6; 805#L561-3 assume !!(main_~j~0 < main_~length~0); 803#L562-3 call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 804#L562-1 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 799#L561-2 [2019-10-22 09:03:01,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:01,913 INFO L82 PathProgramCache]: Analyzing trace with hash -983203256, now seen corresponding path program 1 times [2019-10-22 09:03:01,913 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:03:01,913 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374093452] [2019-10-22 09:03:01,913 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:01,913 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:01,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:03:01,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:03:01,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:03:01,929 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:03:01,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:01,930 INFO L82 PathProgramCache]: Analyzing trace with hash 2664470, now seen corresponding path program 3 times [2019-10-22 09:03:01,930 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:03:01,930 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509955324] [2019-10-22 09:03:01,930 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:01,930 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:01,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:03:01,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:03:01,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:03:01,935 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:03:01,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:01,935 INFO L82 PathProgramCache]: Analyzing trace with hash -1226461475, now seen corresponding path program 3 times [2019-10-22 09:03:01,935 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:03:01,935 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394002856] [2019-10-22 09:03:01,936 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:01,936 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:01,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:03:01,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:03:01,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:03:01,952 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:03:02,138 WARN L191 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 87 [2019-10-22 09:03:02,182 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:03:02,182 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:03:02,182 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:03:02,182 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:03:02,182 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:03:02,182 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:03:02,182 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:03:02,183 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:03:02,183 INFO L131 ssoRankerPreferences]: Filename of dumped script: count_down-alloca-2.i_Iteration7_Lasso [2019-10-22 09:03:02,183 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:03:02,183 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:03:02,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-10-22 09:03:02,200 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:02,202 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:02,204 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:02,206 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:02,276 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:02,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:02,279 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:02,284 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:02,286 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:02,289 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:02,290 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:02,291 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:02,294 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:02,295 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:02,465 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:03:02,466 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:03:02,466 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-10-22 09:03:02,466 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:03:02,466 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:03:02,467 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:03:02,467 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:03:02,467 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:03:02,467 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:03:02,467 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:03:02,468 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:03:02,468 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-10-22 09:03:02,468 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:03:02,468 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:03:02,469 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:03:02,469 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:03:02,469 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:03:02,469 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:03:02,469 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:03:02,470 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:03:02,470 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-10-22 09:03:02,470 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:03:02,470 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:03:02,470 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:03:02,471 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:03:02,471 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:03:02,471 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:03:02,471 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:03:02,472 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:03:02,472 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-10-22 09:03:02,473 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:03:02,473 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:03:02,473 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:03:02,473 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:03:02,474 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:03:02,474 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:03:02,475 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:03:02,476 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:03:02,476 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:03:02,476 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:03:02,476 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:03:02,476 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:03:02,477 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:03:02,477 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:03:02,478 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:03:02,479 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-10-22 09:03:02,479 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:03:02,479 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-10-22 09:03:02,480 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:03:02,480 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:03:02,481 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-10-22 09:03:02,481 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:03:02,485 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:03:02,485 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-10-22 09:03:02,486 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:03:02,486 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:03:02,486 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:03:02,486 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:03:02,487 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:03:02,488 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:03:02,489 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:03:02,489 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-10-22 09:03:02,489 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:03:02,490 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:03:02,490 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:03:02,490 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:03:02,491 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:03:02,491 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:03:02,494 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:03:02,495 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-10-22 09:03:02,495 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:03:02,496 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:03:02,496 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:03:02,496 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:03:02,496 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:03:02,497 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:03:02,498 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:03:02,498 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:03:02,499 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:03:02,499 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:03:02,499 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:03:02,499 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:03:02,501 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:03:02,501 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:03:02,519 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:03:02,539 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-10-22 09:03:02,539 INFO L444 ModelExtractionUtils]: 16 out of 22 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-10-22 09:03:02,540 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:03:02,541 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 09:03:02,541 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:03:02,541 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~length~0) = -1*ULTIMATE.start_main_~j~0 + 1*ULTIMATE.start_main_~length~0 Supporting invariants [] [2019-10-22 09:03:02,559 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-10-22 09:03:02,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:02,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:03:02,584 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:03:02,584 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:03:02,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:03:02,595 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 09:03:02,595 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:03:02,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:03:02,612 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-10-22 09:03:02,612 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 30 transitions. cyclomatic complexity: 9 Second operand 4 states. [2019-10-22 09:03:02,632 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 30 transitions. cyclomatic complexity: 9. Second operand 4 states. Result 32 states and 40 transitions. Complement of second has 6 states. [2019-10-22 09:03:02,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-10-22 09:03:02,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-10-22 09:03:02,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2019-10-22 09:03:02,634 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 18 letters. Loop has 4 letters. [2019-10-22 09:03:02,634 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:03:02,634 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 22 letters. Loop has 4 letters. [2019-10-22 09:03:02,634 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:03:02,634 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 18 letters. Loop has 8 letters. [2019-10-22 09:03:02,634 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:03:02,635 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 40 transitions. [2019-10-22 09:03:02,635 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-10-22 09:03:02,635 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 29 states and 36 transitions. [2019-10-22 09:03:02,636 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-10-22 09:03:02,636 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-10-22 09:03:02,636 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 36 transitions. [2019-10-22 09:03:02,636 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:03:02,636 INFO L688 BuchiCegarLoop]: Abstraction has 29 states and 36 transitions. [2019-10-22 09:03:02,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 36 transitions. [2019-10-22 09:03:02,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2019-10-22 09:03:02,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-10-22 09:03:02,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2019-10-22 09:03:02,638 INFO L711 BuchiCegarLoop]: Abstraction has 28 states and 35 transitions. [2019-10-22 09:03:02,638 INFO L591 BuchiCegarLoop]: Abstraction has 28 states and 35 transitions. [2019-10-22 09:03:02,638 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-10-22 09:03:02,638 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 35 transitions. [2019-10-22 09:03:02,638 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-10-22 09:03:02,638 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:03:02,638 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:03:02,641 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:03:02,641 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 09:03:02,641 INFO L791 eck$LassoCheckResult]: Stem: 953#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 949#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet5, main_#t~post4, main_#t~mem8, main_#t~post9, main_#t~mem7, main_#t~post6, main_~i~0, main_~j~0, main_~val~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~length~0 := main_#t~nondet2;havoc main_#t~nondet2; 950#L551 assume !(main_~length~0 < 1); 955#L551-2 call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 951#L553 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 952#L554-3 assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet5;havoc main_#t~nondet5; 956#L556 assume !(main_~val~0 < 0); 969#L556-2 call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 968#L554-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 957#L554-3 assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet5;havoc main_#t~nondet5; 946#L556 assume !(main_~val~0 < 0); 947#L556-2 call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 948#L554-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 954#L554-3 assume !(main_~i~0 < main_~length~0); 962#L554-4 main_~j~0 := 0; 942#L561-3 assume !!(main_~j~0 < main_~length~0); 943#L562-3 call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 963#L562-1 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 964#L561-2 main_#t~post6 := main_~j~0;main_~j~0 := 1 + main_#t~post6;havoc main_#t~post6; 944#L561-3 assume !!(main_~j~0 < main_~length~0); 945#L562-3 call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 958#L562-1 [2019-10-22 09:03:02,641 INFO L793 eck$LassoCheckResult]: Loop: 958#L562-1 assume !!(main_#t~mem7 > 0);havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);main_#t~post9 := main_#t~mem8;call write~int(main_#t~post9 - 1, main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);havoc main_#t~post9;havoc main_#t~mem8; 959#L562-3 call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 958#L562-1 [2019-10-22 09:03:02,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:02,642 INFO L82 PathProgramCache]: Analyzing trace with hash 1068815382, now seen corresponding path program 4 times [2019-10-22 09:03:02,642 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:03:02,642 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801522779] [2019-10-22 09:03:02,642 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:02,642 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:02,642 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:03:02,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:03:02,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:03:02,675 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:03:02,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:02,676 INFO L82 PathProgramCache]: Analyzing trace with hash 2652, now seen corresponding path program 4 times [2019-10-22 09:03:02,676 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:03:02,676 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719491456] [2019-10-22 09:03:02,676 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:02,676 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:02,676 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:03:02,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:03:02,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:03:02,681 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:03:02,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:02,682 INFO L82 PathProgramCache]: Analyzing trace with hash 634400049, now seen corresponding path program 1 times [2019-10-22 09:03:02,682 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:03:02,682 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186181572] [2019-10-22 09:03:02,682 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:02,682 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:02,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:03:02,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:03:02,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:03:02,707 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:03:02,931 WARN L191 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 90 [2019-10-22 09:03:02,973 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:03:02,973 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:03:02,973 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:03:02,973 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:03:02,973 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:03:02,973 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:03:02,974 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:03:02,974 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:03:02,974 INFO L131 ssoRankerPreferences]: Filename of dumped script: count_down-alloca-2.i_Iteration8_Lasso [2019-10-22 09:03:02,974 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:03:02,974 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:03:02,976 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:02,980 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:02,981 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:02,984 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:02,986 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:03,077 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:03,079 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:03,082 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:03,083 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:03,085 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:03,087 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:03,089 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:03,091 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:03,263 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:03:03,263 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:03:03,263 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-10-22 09:03:03,264 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:03:03,264 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:03:03,264 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:03:03,264 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:03:03,265 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:03:03,265 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:03:03,265 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:03:03,265 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:03:03,266 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-10-22 09:03:03,266 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:03:03,266 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:03:03,266 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:03:03,266 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:03:03,266 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:03:03,267 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:03:03,267 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:03:03,268 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:03:03,268 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-10-22 09:03:03,268 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:03:03,269 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:03:03,269 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:03:03,269 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:03:03,271 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:03:03,271 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:03:03,272 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:03:03,272 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-10-22 09:03:03,273 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:03:03,273 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:03:03,273 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:03:03,273 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:03:03,273 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:03:03,273 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:03:03,273 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:03:03,274 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:03:03,274 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-10-22 09:03:03,274 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:03:03,274 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:03:03,275 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:03:03,275 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:03:03,276 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:03:03,276 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:03:03,277 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:03:03,277 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-10-22 09:03:03,277 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:03:03,278 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:03:03,278 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:03:03,278 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:03:03,279 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:03:03,280 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:03:03,286 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:03:03,286 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-10-22 09:03:03,287 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:03:03,287 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:03:03,287 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:03:03,287 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:03:03,288 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:03:03,288 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:03:03,290 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:03:03,290 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-10-22 09:03:03,290 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:03:03,290 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:03:03,291 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:03:03,291 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:03:03,291 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:03:03,291 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:03:03,292 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:03:03,293 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-10-22 09:03:03,293 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:03:03,293 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:03:03,293 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:03:03,293 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:03:03,294 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:03:03,294 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:03:03,295 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:03:03,295 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-10-22 09:03:03,296 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:03:03,296 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:03:03,296 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:03:03,296 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:03:03,297 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:03:03,297 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:03:03,300 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:03:03,301 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-10-22 09:03:03,301 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:03:03,301 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-10-22 09:03:03,301 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:03:03,301 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:03:03,302 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-10-22 09:03:03,302 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:03:03,306 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:03:03,306 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-10-22 09:03:03,306 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:03:03,307 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:03:03,307 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:03:03,307 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:03:03,308 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:03:03,308 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:03:03,314 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:03:03,319 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-10-22 09:03:03,319 INFO L444 ModelExtractionUtils]: 5 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 09:03:03,319 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:03:03,320 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-10-22 09:03:03,320 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:03:03,320 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_#t~mem7) = 1*ULTIMATE.start_main_#t~mem7 Supporting invariants [1*ULTIMATE.start_main_#t~mem7 - 1*v_rep(select (select #memory_int ULTIMATE.start_main_~arr~0.base) (+ ULTIMATE.start_main_~arr~0.offset (* ULTIMATE.start_main_~j~0 4)))_1 >= 0] [2019-10-22 09:03:03,340 INFO L297 tatePredicateManager]: 4 out of 5 supporting invariants were superfluous and have been removed [2019-10-22 09:03:03,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:03,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:03:03,377 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-22 09:03:03,379 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:03:03,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:03:03,384 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-22 09:03:03,385 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:03:03,415 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 17 [2019-10-22 09:03:03,418 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 09:03:03,422 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:03:03,423 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 09:03:03,423 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:17 [2019-10-22 09:03:03,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:03:03,436 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-10-22 09:03:03,436 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 35 transitions. cyclomatic complexity: 11 Second operand 3 states. [2019-10-22 09:03:03,463 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 35 transitions. cyclomatic complexity: 11. Second operand 3 states. Result 29 states and 36 transitions. Complement of second has 5 states. [2019-10-22 09:03:03,465 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-10-22 09:03:03,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 09:03:03,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2019-10-22 09:03:03,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 21 letters. Loop has 2 letters. [2019-10-22 09:03:03,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:03:03,466 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 09:03:03,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:03,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:03:03,495 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-22 09:03:03,496 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:03:03,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:03:03,502 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-22 09:03:03,502 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:03:03,506 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 17 [2019-10-22 09:03:03,506 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 09:03:03,510 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:03:03,510 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 09:03:03,510 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:17 [2019-10-22 09:03:03,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:03:03,519 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2019-10-22 09:03:03,520 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 35 transitions. cyclomatic complexity: 11 Second operand 3 states. [2019-10-22 09:03:03,547 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 35 transitions. cyclomatic complexity: 11. Second operand 3 states. Result 29 states and 36 transitions. Complement of second has 5 states. [2019-10-22 09:03:03,548 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-10-22 09:03:03,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 09:03:03,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2019-10-22 09:03:03,549 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 21 letters. Loop has 2 letters. [2019-10-22 09:03:03,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:03:03,549 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 09:03:03,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:03,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:03:03,574 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-22 09:03:03,574 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:03:03,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:03:03,580 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-22 09:03:03,580 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:03:03,584 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 17 [2019-10-22 09:03:03,584 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 09:03:03,587 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:03:03,588 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 09:03:03,588 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:17 [2019-10-22 09:03:03,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:03:03,597 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-10-22 09:03:03,597 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 35 transitions. cyclomatic complexity: 11 Second operand 3 states. [2019-10-22 09:03:03,619 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 35 transitions. cyclomatic complexity: 11. Second operand 3 states. Result 32 states and 40 transitions. Complement of second has 4 states. [2019-10-22 09:03:03,620 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-10-22 09:03:03,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 09:03:03,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 20 transitions. [2019-10-22 09:03:03,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 21 letters. Loop has 2 letters. [2019-10-22 09:03:03,621 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:03:03,621 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 23 letters. Loop has 2 letters. [2019-10-22 09:03:03,621 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:03:03,621 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 21 letters. Loop has 4 letters. [2019-10-22 09:03:03,621 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:03:03,621 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 40 transitions. [2019-10-22 09:03:03,622 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 09:03:03,622 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 0 states and 0 transitions. [2019-10-22 09:03:03,622 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-10-22 09:03:03,622 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-10-22 09:03:03,622 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-10-22 09:03:03,622 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:03:03,622 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 09:03:03,623 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 09:03:03,623 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 09:03:03,623 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-10-22 09:03:03,623 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-10-22 09:03:03,623 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 09:03:03,623 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-10-22 09:03:03,629 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.10 09:03:03 BoogieIcfgContainer [2019-10-22 09:03:03,629 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-10-22 09:03:03,630 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 09:03:03,630 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 09:03:03,630 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 09:03:03,630 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:02:57" (3/4) ... [2019-10-22 09:03:03,633 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-10-22 09:03:03,634 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 09:03:03,635 INFO L168 Benchmark]: Toolchain (without parser) took 6514.96 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 188.7 MB). Free memory was 939.1 MB in the beginning and 1.0 GB in the end (delta: -82.4 MB). Peak memory consumption was 106.3 MB. Max. memory is 11.5 GB. [2019-10-22 09:03:03,635 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:03:03,636 INFO L168 Benchmark]: CACSL2BoogieTranslator took 539.36 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 939.1 MB in the beginning and 1.1 GB in the end (delta: -184.4 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. [2019-10-22 09:03:03,636 INFO L168 Benchmark]: Boogie Procedure Inliner took 32.63 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-10-22 09:03:03,636 INFO L168 Benchmark]: Boogie Preprocessor took 23.34 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-10-22 09:03:03,637 INFO L168 Benchmark]: RCFGBuilder took 271.21 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 23.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. [2019-10-22 09:03:03,637 INFO L168 Benchmark]: BuchiAutomizer took 5640.78 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 47.7 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 78.3 MB). Peak memory consumption was 126.0 MB. Max. memory is 11.5 GB. [2019-10-22 09:03:03,637 INFO L168 Benchmark]: Witness Printer took 4.07 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. [2019-10-22 09:03:03,640 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 539.36 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 939.1 MB in the beginning and 1.1 GB in the end (delta: -184.4 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 32.63 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 23.34 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 271.21 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 23.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5640.78 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 47.7 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 78.3 MB). Peak memory consumption was 126.0 MB. Max. memory is 11.5 GB. * Witness Printer took 4.07 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 8 terminating modules (3 trivial, 4 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -1 * arr + -4 * i + unknown-#length-unknown[arr] and consists of 5 locations. One deterministic module has affine ranking function -2 * j + 1 and consists of 9 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[arr][j * 4 + arr] and consists of 4 locations. One deterministic module has affine ranking function -1 * j + length and consists of 4 locations. One nondeterministic module has affine ranking function org.eclipse.cdt.internal.core.dom.parser.c.CASTArraySubscriptExpression@41bbd985 and consists of 3 locations. 3 modules have a trivial ranking function, the largest among these consists of 14 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.5s and 9 iterations. TraceHistogramMax:2. Analysis of lassos took 4.3s. Construction of modules took 0.2s. Büchi inclusion checks took 0.8s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 15 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 42 states and ocurred in iteration 4. Nontrivial modules had stage [4, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 137 SDtfs, 236 SDslu, 113 SDs, 0 SdLazy, 219 SolverSat, 49 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU3 SILI0 SILT0 lasso5 LassoPreprocessingBenchmarks: Lassos: inital138 mio100 ax113 hnf98 lsp83 ukn77 mio100 lsp56 div100 bol100 ite100 ukn100 eq162 hnf90 smp91 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 40ms VariablesStem: 3 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...