./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-15/array07_alloca.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_ecec993a-0fdf-4d1a-b75d-2933039bbee3/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_ecec993a-0fdf-4d1a-b75d-2933039bbee3/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_ecec993a-0fdf-4d1a-b75d-2933039bbee3/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_ecec993a-0fdf-4d1a-b75d-2933039bbee3/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-15/array07_alloca.i -s /tmp/vcloud-vcloud-master/worker/working_dir_ecec993a-0fdf-4d1a-b75d-2933039bbee3/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_ecec993a-0fdf-4d1a-b75d-2933039bbee3/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 77498d00b446eec99f943fd8f68173cd9df2461a .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 08:56:53,133 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 08:56:53,135 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 08:56:53,145 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 08:56:53,145 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 08:56:53,146 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 08:56:53,147 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 08:56:53,149 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 08:56:53,150 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 08:56:53,151 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 08:56:53,153 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 08:56:53,154 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 08:56:53,157 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 08:56:53,158 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 08:56:53,159 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 08:56:53,160 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 08:56:53,160 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 08:56:53,161 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 08:56:53,163 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 08:56:53,168 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 08:56:53,169 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 08:56:53,170 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 08:56:53,174 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 08:56:53,175 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 08:56:53,177 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 08:56:53,177 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 08:56:53,177 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 08:56:53,179 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 08:56:53,179 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 08:56:53,180 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 08:56:53,183 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 08:56:53,184 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 08:56:53,185 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 08:56:53,185 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 08:56:53,186 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 08:56:53,186 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 08:56:53,189 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 08:56:53,190 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 08:56:53,190 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 08:56:53,191 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 08:56:53,192 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 08:56:53,192 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_ecec993a-0fdf-4d1a-b75d-2933039bbee3/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-10-22 08:56:53,210 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 08:56:53,210 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 08:56:53,211 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 08:56:53,211 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 08:56:53,212 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 08:56:53,212 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-10-22 08:56:53,212 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-10-22 08:56:53,212 INFO L138 SettingsManager]: * Use old map elimination=false [2019-10-22 08:56:53,212 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-10-22 08:56:53,213 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-10-22 08:56:53,213 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-10-22 08:56:53,213 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 08:56:53,213 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 08:56:53,213 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 08:56:53,214 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 08:56:53,214 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-10-22 08:56:53,214 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-10-22 08:56:53,214 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-10-22 08:56:53,214 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 08:56:53,214 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-10-22 08:56:53,215 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 08:56:53,215 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-10-22 08:56:53,215 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 08:56:53,215 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 08:56:53,215 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-10-22 08:56:53,216 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 08:56:53,216 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 08:56:53,216 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-10-22 08:56:53,217 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-10-22 08:56:53,217 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_ecec993a-0fdf-4d1a-b75d-2933039bbee3/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 -> 77498d00b446eec99f943fd8f68173cd9df2461a [2019-10-22 08:56:53,248 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 08:56:53,259 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 08:56:53,262 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 08:56:53,265 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 08:56:53,266 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 08:56:53,266 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_ecec993a-0fdf-4d1a-b75d-2933039bbee3/bin/uautomizer/../../sv-benchmarks/c/termination-15/array07_alloca.i [2019-10-22 08:56:53,317 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ecec993a-0fdf-4d1a-b75d-2933039bbee3/bin/uautomizer/data/640c9e6f5/3619a257122f48c3ac4f8c60bd369261/FLAG778fd0142 [2019-10-22 08:56:53,736 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 08:56:53,737 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_ecec993a-0fdf-4d1a-b75d-2933039bbee3/sv-benchmarks/c/termination-15/array07_alloca.i [2019-10-22 08:56:53,743 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ecec993a-0fdf-4d1a-b75d-2933039bbee3/bin/uautomizer/data/640c9e6f5/3619a257122f48c3ac4f8c60bd369261/FLAG778fd0142 [2019-10-22 08:56:53,754 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_ecec993a-0fdf-4d1a-b75d-2933039bbee3/bin/uautomizer/data/640c9e6f5/3619a257122f48c3ac4f8c60bd369261 [2019-10-22 08:56:53,756 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 08:56:53,757 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 08:56:53,758 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 08:56:53,758 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 08:56:53,761 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 08:56:53,762 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:56:53" (1/1) ... [2019-10-22 08:56:53,765 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3cab1254 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:53, skipping insertion in model container [2019-10-22 08:56:53,766 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:56:53" (1/1) ... [2019-10-22 08:56:53,773 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 08:56:53,808 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 08:56:54,163 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:56:54,177 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 08:56:54,220 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:56:54,287 INFO L192 MainTranslator]: Completed translation [2019-10-22 08:56:54,288 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:54 WrapperNode [2019-10-22 08:56:54,288 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 08:56:54,289 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 08:56:54,289 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 08:56:54,289 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 08:56:54,298 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:54" (1/1) ... [2019-10-22 08:56:54,314 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:54" (1/1) ... [2019-10-22 08:56:54,339 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 08:56:54,339 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 08:56:54,339 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 08:56:54,340 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 08:56:54,349 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:54" (1/1) ... [2019-10-22 08:56:54,350 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:54" (1/1) ... [2019-10-22 08:56:54,352 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:54" (1/1) ... [2019-10-22 08:56:54,352 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:54" (1/1) ... [2019-10-22 08:56:54,357 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:54" (1/1) ... [2019-10-22 08:56:54,362 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:54" (1/1) ... [2019-10-22 08:56:54,363 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:54" (1/1) ... [2019-10-22 08:56:54,365 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 08:56:54,365 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 08:56:54,365 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 08:56:54,366 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 08:56:54,366 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:54" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ecec993a-0fdf-4d1a-b75d-2933039bbee3/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 08:56:54,431 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 08:56:54,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 08:56:54,432 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 08:56:54,432 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 08:56:54,432 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 08:56:54,432 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 08:56:54,627 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 08:56:54,627 INFO L284 CfgBuilder]: Removed 6 assume(true) statements. [2019-10-22 08:56:54,628 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:56:54 BoogieIcfgContainer [2019-10-22 08:56:54,629 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 08:56:54,629 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-10-22 08:56:54,629 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-10-22 08:56:54,632 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-10-22 08:56:54,633 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:56:54,633 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.10 08:56:53" (1/3) ... [2019-10-22 08:56:54,634 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@485448ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:56:54, skipping insertion in model container [2019-10-22 08:56:54,635 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:56:54,635 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:54" (2/3) ... [2019-10-22 08:56:54,635 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@485448ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:56:54, skipping insertion in model container [2019-10-22 08:56:54,635 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:56:54,635 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:56:54" (3/3) ... [2019-10-22 08:56:54,637 INFO L371 chiAutomizerObserver]: Analyzing ICFG array07_alloca.i [2019-10-22 08:56:54,693 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-10-22 08:56:54,693 INFO L357 BuchiCegarLoop]: Hoare is false [2019-10-22 08:56:54,693 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-10-22 08:56:54,693 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 08:56:54,694 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 08:56:54,694 INFO L361 BuchiCegarLoop]: Difference is false [2019-10-22 08:56:54,695 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 08:56:54,695 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-10-22 08:56:54,709 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2019-10-22 08:56:54,729 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2019-10-22 08:56:54,730 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:56:54,730 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:56:54,737 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-10-22 08:56:54,737 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:56:54,737 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-10-22 08:56:54,738 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2019-10-22 08:56:54,739 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2019-10-22 08:56:54,739 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:56:54,739 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:56:54,740 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-10-22 08:56:54,740 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:56:54,748 INFO L791 eck$LassoCheckResult]: Stem: 8#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 6#L-1true havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~post207, main_#t~mem209, main_#t~post210, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 14#L367true assume !(main_~length~0 < 1); 5#L367-2true call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 11#L369true assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 15#L370-3true [2019-10-22 08:56:54,749 INFO L793 eck$LassoCheckResult]: Loop: 15#L370-3true assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208; 13#L370-2true main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 15#L370-3true [2019-10-22 08:56:54,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:54,755 INFO L82 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2019-10-22 08:56:54,764 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:54,764 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667356590] [2019-10-22 08:56:54,764 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:54,765 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:54,765 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:54,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:54,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:54,881 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:54,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:54,883 INFO L82 PathProgramCache]: Analyzing trace with hash 1667, now seen corresponding path program 1 times [2019-10-22 08:56:54,883 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:54,883 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99948472] [2019-10-22 08:56:54,883 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:54,884 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:54,884 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:54,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:54,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:54,898 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:54,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:54,900 INFO L82 PathProgramCache]: Analyzing trace with hash 1806815563, now seen corresponding path program 1 times [2019-10-22 08:56:54,900 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:54,900 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755316542] [2019-10-22 08:56:54,900 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:54,901 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:54,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:54,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:54,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:54,929 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:55,220 WARN L191 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 40 [2019-10-22 08:56:55,278 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:56:55,279 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:56:55,280 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:56:55,280 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:56:55,280 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:56:55,280 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:56:55,281 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:56:55,281 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:56:55,281 INFO L131 ssoRankerPreferences]: Filename of dumped script: array07_alloca.i_Iteration1_Lasso [2019-10-22 08:56:55,281 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:56:55,281 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:56:55,309 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 08:56:55,315 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 08:56:55,319 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 08:56:55,324 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 08:56:55,327 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:55,440 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 08:56:55,443 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 08:56:55,446 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 08:56:55,449 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 08:56:55,662 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:56:55,668 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:56:55,670 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:55,672 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:55,673 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:55,673 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:55,673 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:55,674 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:55,676 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:55,676 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:55,679 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:55,682 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 08:56:55,683 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:55,683 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:55,684 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:55,684 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:55,684 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:55,684 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:55,684 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:55,685 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:55,686 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 08:56:55,686 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:55,686 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:55,687 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:55,687 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:55,695 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:55,696 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:55,705 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:55,706 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 08:56:55,707 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:55,707 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:55,707 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:55,707 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:55,707 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:55,708 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:55,708 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:55,709 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:55,709 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 08:56:55,710 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:55,710 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:55,710 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:55,710 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:55,719 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:55,719 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:55,854 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:56:55,885 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-10-22 08:56:55,885 INFO L444 ModelExtractionUtils]: 17 out of 22 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 08:56:55,890 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:56:55,892 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:56:55,892 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:56:55,893 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~arr~0.offset, v_rep(select #length ULTIMATE.start_main_~arr~0.base)_1) = -4*ULTIMATE.start_main_~i~0 - 1*ULTIMATE.start_main_~arr~0.offset + 1*v_rep(select #length ULTIMATE.start_main_~arr~0.base)_1 Supporting invariants [] [2019-10-22 08:56:55,910 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-10-22 08:56:55,918 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-22 08:56:55,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:55,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:55,956 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:56:55,958 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:55,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:55,979 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:56:55,980 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:55,997 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 08:56:56,015 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 08:56:56,016 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states. Second operand 3 states. [2019-10-22 08:56:56,082 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states.. Second operand 3 states. Result 30 states and 40 transitions. Complement of second has 7 states. [2019-10-22 08:56:56,084 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 08:56:56,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:56:56,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2019-10-22 08:56:56,088 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 5 letters. Loop has 2 letters. [2019-10-22 08:56:56,090 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:56:56,090 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 7 letters. Loop has 2 letters. [2019-10-22 08:56:56,090 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:56:56,090 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 5 letters. Loop has 4 letters. [2019-10-22 08:56:56,090 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:56:56,093 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 40 transitions. [2019-10-22 08:56:56,096 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-10-22 08:56:56,101 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 10 states and 13 transitions. [2019-10-22 08:56:56,102 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-10-22 08:56:56,103 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-10-22 08:56:56,103 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 13 transitions. [2019-10-22 08:56:56,104 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:56:56,104 INFO L688 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-10-22 08:56:56,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 13 transitions. [2019-10-22 08:56:56,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-10-22 08:56:56,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-10-22 08:56:56,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2019-10-22 08:56:56,133 INFO L711 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-10-22 08:56:56,133 INFO L591 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-10-22 08:56:56,133 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-10-22 08:56:56,133 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2019-10-22 08:56:56,134 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-10-22 08:56:56,135 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:56:56,135 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:56:56,136 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:56:56,136 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-10-22 08:56:56,136 INFO L791 eck$LassoCheckResult]: Stem: 107#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 104#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~post207, main_#t~mem209, main_#t~post210, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 105#L367 assume !(main_~length~0 < 1); 108#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 109#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 110#L370-3 assume !(main_~i~0 < main_~length~0); 106#L370-4 main_~j~0 := 0; 103#L374-2 [2019-10-22 08:56:56,136 INFO L793 eck$LassoCheckResult]: Loop: 103#L374-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset, 4);main_#t~post210 := main_#t~mem209;call write~int(main_#t~post210 - 1, main_~arr~0.base, main_~arr~0.offset, 4);main_~j~0 := main_~j~0 - main_#t~post210;havoc main_#t~mem209;havoc main_#t~post210; 103#L374-2 [2019-10-22 08:56:56,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:56,137 INFO L82 PathProgramCache]: Analyzing trace with hash 1806815505, now seen corresponding path program 1 times [2019-10-22 08:56:56,137 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:56,137 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801303627] [2019-10-22 08:56:56,137 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:56,137 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:56,138 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:56,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:56,205 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 08:56:56,206 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801303627] [2019-10-22 08:56:56,206 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:56:56,206 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:56:56,207 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556039167] [2019-10-22 08:56:56,209 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:56:56,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:56,209 INFO L82 PathProgramCache]: Analyzing trace with hash 68, now seen corresponding path program 1 times [2019-10-22 08:56:56,209 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:56,209 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520623606] [2019-10-22 08:56:56,209 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:56,209 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:56,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:56,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:56,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:56,223 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:56,264 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:56:56,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:56:56,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:56:56,267 INFO L87 Difference]: Start difference. First operand 10 states and 13 transitions. cyclomatic complexity: 5 Second operand 4 states. [2019-10-22 08:56:56,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:56,293 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2019-10-22 08:56:56,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:56:56,294 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 13 transitions. [2019-10-22 08:56:56,294 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-10-22 08:56:56,295 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 13 transitions. [2019-10-22 08:56:56,295 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-10-22 08:56:56,295 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-10-22 08:56:56,295 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 13 transitions. [2019-10-22 08:56:56,296 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:56:56,296 INFO L688 BuchiCegarLoop]: Abstraction has 11 states and 13 transitions. [2019-10-22 08:56:56,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 13 transitions. [2019-10-22 08:56:56,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2019-10-22 08:56:56,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-10-22 08:56:56,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2019-10-22 08:56:56,297 INFO L711 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2019-10-22 08:56:56,297 INFO L591 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2019-10-22 08:56:56,298 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-10-22 08:56:56,298 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 12 transitions. [2019-10-22 08:56:56,298 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-10-22 08:56:56,298 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:56:56,299 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:56:56,299 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:56:56,299 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-10-22 08:56:56,299 INFO L791 eck$LassoCheckResult]: Stem: 135#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 132#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~post207, main_#t~mem209, main_#t~post210, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 133#L367 assume !(main_~length~0 < 1); 136#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 137#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 138#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208; 139#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 140#L370-3 assume !(main_~i~0 < main_~length~0); 134#L370-4 main_~j~0 := 0; 131#L374-2 [2019-10-22 08:56:56,299 INFO L793 eck$LassoCheckResult]: Loop: 131#L374-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset, 4);main_#t~post210 := main_#t~mem209;call write~int(main_#t~post210 - 1, main_~arr~0.base, main_~arr~0.offset, 4);main_~j~0 := main_~j~0 - main_#t~post210;havoc main_#t~mem209;havoc main_#t~post210; 131#L374-2 [2019-10-22 08:56:56,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:56,300 INFO L82 PathProgramCache]: Analyzing trace with hash 1182969107, now seen corresponding path program 1 times [2019-10-22 08:56:56,300 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:56,300 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556429559] [2019-10-22 08:56:56,300 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:56,301 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:56,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:56,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:56,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:56,336 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:56,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:56,337 INFO L82 PathProgramCache]: Analyzing trace with hash 68, now seen corresponding path program 2 times [2019-10-22 08:56:56,337 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:56,337 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889136126] [2019-10-22 08:56:56,338 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:56,338 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:56,338 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:56,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:56,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:56,346 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:56,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:56,348 INFO L82 PathProgramCache]: Analyzing trace with hash -1982663310, now seen corresponding path program 1 times [2019-10-22 08:56:56,348 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:56,349 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327348038] [2019-10-22 08:56:56,349 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:56,349 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:56,349 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:56,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:56,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:56,375 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:56,556 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 59 [2019-10-22 08:56:56,618 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:56:56,619 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:56:56,619 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:56:56,619 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:56:56,619 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:56:56,619 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:56:56,619 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:56:56,620 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:56:56,620 INFO L131 ssoRankerPreferences]: Filename of dumped script: array07_alloca.i_Iteration3_Lasso [2019-10-22 08:56:56,620 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:56:56,620 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:56:56,630 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 08:56:56,636 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 08:56:56,641 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 08:56:56,644 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 08:56:56,647 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 08:56:56,777 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 08:56:56,779 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 08:56:56,781 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 08:56:56,783 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 08:56:57,035 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:56:57,035 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:56:57,035 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:57,036 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:57,036 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:57,036 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:57,036 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:57,037 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:57,037 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:57,037 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:57,038 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:57,038 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 08:56:57,038 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:57,039 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:57,039 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:57,039 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:57,039 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:57,040 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:57,040 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:57,040 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:57,041 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 08:56:57,041 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:57,041 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:57,042 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:57,042 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:57,043 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:57,043 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:57,045 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:57,046 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:57,046 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:57,046 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:57,046 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:57,046 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:57,047 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:57,047 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:57,047 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:57,048 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:57,048 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:57,049 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:57,049 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:57,049 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:57,049 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:57,050 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:57,051 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:57,053 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:57,053 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 08:56:57,054 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:57,054 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:57,054 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:57,054 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:57,058 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:57,058 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:57,080 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:57,080 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:57,081 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:57,081 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-10-22 08:56:57,081 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:57,081 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:57,083 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-10-22 08:56:57,083 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:57,091 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:57,092 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:57,092 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:57,093 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:57,093 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:57,093 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:57,094 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:57,094 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:57,101 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:57,102 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 08:56:57,102 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:57,102 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:57,103 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:57,103 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:57,103 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:57,109 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:57,109 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:57,110 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:57,110 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 08:56:57,111 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:57,111 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:57,111 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:57,112 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:57,112 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:57,112 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:57,112 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:57,113 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:57,113 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 08:56:57,114 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:57,114 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:57,114 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:57,114 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:57,115 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:57,115 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:57,117 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:57,117 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:57,118 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:57,118 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:57,118 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:57,118 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:57,118 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:57,119 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:57,121 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:57,121 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:57,121 INFO L489 LassoAnalysis]: Using template '2-nested'. [2019-10-22 08:56:57,122 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 08:56:57,122 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:57,123 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:57,123 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:57,123 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:57,123 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 08:56:57,123 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-10-22 08:56:57,124 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:57,124 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:57,125 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:57,125 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:57,125 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:57,125 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:57,126 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:57,126 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 08:56:57,126 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-10-22 08:56:57,126 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:57,131 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:57,131 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 08:56:57,132 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:57,132 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:57,132 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:57,132 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 08:56:57,134 INFO L400 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-10-22 08:56:57,134 INFO L401 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2019-10-22 08:56:57,137 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:57,137 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 08:56:57,138 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:57,138 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:57,138 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:57,138 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:57,139 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 08:56:57,139 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-10-22 08:56:57,139 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:57,140 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:57,140 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:57,141 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:57,141 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:57,141 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:57,141 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 08:56:57,142 INFO L400 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-10-22 08:56:57,142 INFO L401 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2019-10-22 08:56:57,148 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:57,148 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:57,149 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:57,149 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:57,149 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:57,149 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 08:56:57,154 INFO L400 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-10-22 08:56:57,155 INFO L401 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2019-10-22 08:56:57,238 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:56:57,309 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-10-22 08:56:57,309 INFO L444 ModelExtractionUtils]: 38 out of 46 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-10-22 08:56:57,310 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:56:57,316 INFO L438 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 3. [2019-10-22 08:56:57,316 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:56:57,316 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function 2-nested ranking function: f0 = 2*v_rep(select (select #memory_int ULTIMATE.start_main_~arr~0.base) ULTIMATE.start_main_~arr~0.offset)_1 + 1 f1 = -2*ULTIMATE.start_main_~j~0 + 2*ULTIMATE.start_main_~length~0 Supporting invariants [] [2019-10-22 08:56:57,326 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-10-22 08:56:57,327 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 08:56:57,328 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 08:56:57,328 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 08:56:57,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:57,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:57,364 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:56:57,364 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:57,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:57,376 WARN L254 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 08:56:57,376 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:57,376 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 08:56:57,377 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2019-10-22 08:56:57,377 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 12 transitions. cyclomatic complexity: 4 Second operand 2 states. [2019-10-22 08:56:57,389 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states and 12 transitions. cyclomatic complexity: 4. Second operand 2 states. Result 11 states and 13 transitions. Complement of second has 2 states. [2019-10-22 08:56:57,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2019-10-22 08:56:57,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2019-10-22 08:56:57,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 11 transitions. [2019-10-22 08:56:57,391 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 11 transitions. Stem has 9 letters. Loop has 1 letters. [2019-10-22 08:56:57,391 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:56:57,391 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 11 transitions. Stem has 10 letters. Loop has 1 letters. [2019-10-22 08:56:57,391 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:56:57,392 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 11 transitions. Stem has 9 letters. Loop has 2 letters. [2019-10-22 08:56:57,392 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:56:57,392 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 13 transitions. [2019-10-22 08:56:57,392 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:56:57,393 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 0 states and 0 transitions. [2019-10-22 08:56:57,393 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-10-22 08:56:57,393 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-10-22 08:56:57,393 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-10-22 08:56:57,393 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:56:57,393 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:56:57,393 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:56:57,393 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:56:57,393 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-10-22 08:56:57,393 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-10-22 08:56:57,394 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:56:57,394 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-10-22 08:56:57,401 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.10 08:56:57 BoogieIcfgContainer [2019-10-22 08:56:57,401 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-10-22 08:56:57,401 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 08:56:57,401 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 08:56:57,402 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 08:56:57,402 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:56:54" (3/4) ... [2019-10-22 08:56:57,405 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-10-22 08:56:57,405 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 08:56:57,407 INFO L168 Benchmark]: Toolchain (without parser) took 3649.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -128.6 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2019-10-22 08:56:57,408 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:56:57,408 INFO L168 Benchmark]: CACSL2BoogieTranslator took 530.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -183.4 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. [2019-10-22 08:56:57,409 INFO L168 Benchmark]: Boogie Procedure Inliner took 49.97 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 08:56:57,409 INFO L168 Benchmark]: Boogie Preprocessor took 25.71 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-10-22 08:56:57,410 INFO L168 Benchmark]: RCFGBuilder took 263.47 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: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. [2019-10-22 08:56:57,410 INFO L168 Benchmark]: BuchiAutomizer took 2771.83 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: 32.4 MB). Peak memory consumption was 32.4 MB. Max. memory is 11.5 GB. [2019-10-22 08:56:57,411 INFO L168 Benchmark]: Witness Printer took 4.16 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: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. [2019-10-22 08:56:57,415 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 530.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -183.4 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 49.97 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 25.71 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 263.47 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: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 2771.83 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: 32.4 MB). Peak memory consumption was 32.4 MB. Max. memory is 11.5 GB. * Witness Printer took 4.16 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: 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 - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - 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 3 terminating modules (1 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -4 * i + -1 * arr + unknown-#length-unknown[arr] and consists of 5 locations. One deterministic module has 2-nested ranking function (if 2 * unknown-#memory_int-unknown[arr][arr] + 1 > 0 then 1 else 0), (if 2 * unknown-#memory_int-unknown[arr][arr] + 1 > 0 then 2 * unknown-#memory_int-unknown[arr][arr] + 1 else -2 * j + 2 * length) and consists of 2 locations. 1 modules have a trivial ranking function, the largest among these consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.7s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 2.3s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 10 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 30 SDtfs, 33 SDslu, 12 SDs, 0 SdLazy, 23 SolverSat, 5 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital112 mio100 ax100 hnf99 lsp94 ukn79 mio100 lsp66 div100 bol100 ite100 ukn100 eq169 hnf89 smp95 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 5ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 3 MotzkinApplications: 9 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...