./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/array-industry-pattern/array_shadowinit.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_9ec16381-08a0-4fea-acdc-693898dba170/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_9ec16381-08a0-4fea-acdc-693898dba170/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_9ec16381-08a0-4fea-acdc-693898dba170/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_9ec16381-08a0-4fea-acdc-693898dba170/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-industry-pattern/array_shadowinit.i -s /tmp/vcloud-vcloud-master/worker/working_dir_9ec16381-08a0-4fea-acdc-693898dba170/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_9ec16381-08a0-4fea-acdc-693898dba170/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b03f52438c8a4febc4c57e40202386008cb3a895 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:54:49,116 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 08:54:49,117 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 08:54:49,127 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 08:54:49,130 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 08:54:49,131 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 08:54:49,133 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 08:54:49,134 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 08:54:49,137 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 08:54:49,139 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 08:54:49,141 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 08:54:49,143 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 08:54:49,148 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 08:54:49,151 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 08:54:49,152 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 08:54:49,152 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 08:54:49,153 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 08:54:49,154 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 08:54:49,157 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 08:54:49,160 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 08:54:49,163 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 08:54:49,164 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 08:54:49,165 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 08:54:49,165 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 08:54:49,167 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 08:54:49,167 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 08:54:49,167 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 08:54:49,168 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 08:54:49,168 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 08:54:49,169 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 08:54:49,169 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 08:54:49,170 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 08:54:49,171 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 08:54:49,171 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 08:54:49,172 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 08:54:49,172 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 08:54:49,173 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 08:54:49,173 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 08:54:49,173 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 08:54:49,174 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 08:54:49,174 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 08:54:49,175 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_9ec16381-08a0-4fea-acdc-693898dba170/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-10-22 08:54:49,186 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 08:54:49,186 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 08:54:49,188 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 08:54:49,188 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 08:54:49,188 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 08:54:49,188 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-10-22 08:54:49,188 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-10-22 08:54:49,189 INFO L138 SettingsManager]: * Use old map elimination=false [2019-10-22 08:54:49,189 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-10-22 08:54:49,189 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-10-22 08:54:49,189 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-10-22 08:54:49,189 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 08:54:49,189 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 08:54:49,190 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 08:54:49,190 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 08:54:49,190 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 08:54:49,190 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 08:54:49,190 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-10-22 08:54:49,190 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-10-22 08:54:49,191 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-10-22 08:54:49,191 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 08:54:49,191 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 08:54:49,191 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-10-22 08:54:49,191 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 08:54:49,192 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-10-22 08:54:49,192 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 08:54:49,192 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 08:54:49,192 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-10-22 08:54:49,192 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 08:54:49,193 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 08:54:49,193 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-10-22 08:54:49,193 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-10-22 08:54:49,194 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_9ec16381-08a0-4fea-acdc-693898dba170/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b03f52438c8a4febc4c57e40202386008cb3a895 [2019-10-22 08:54:49,227 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 08:54:49,238 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 08:54:49,243 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 08:54:49,244 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 08:54:49,245 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 08:54:49,245 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_9ec16381-08a0-4fea-acdc-693898dba170/bin/uautomizer/../../sv-benchmarks/c/array-industry-pattern/array_shadowinit.i [2019-10-22 08:54:49,293 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9ec16381-08a0-4fea-acdc-693898dba170/bin/uautomizer/data/26e8c9dc5/2e3a7ac7450848b8b82d2a5f2cf757ab/FLAG2535c35ea [2019-10-22 08:54:49,678 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 08:54:49,678 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_9ec16381-08a0-4fea-acdc-693898dba170/sv-benchmarks/c/array-industry-pattern/array_shadowinit.i [2019-10-22 08:54:49,684 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9ec16381-08a0-4fea-acdc-693898dba170/bin/uautomizer/data/26e8c9dc5/2e3a7ac7450848b8b82d2a5f2cf757ab/FLAG2535c35ea [2019-10-22 08:54:49,695 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_9ec16381-08a0-4fea-acdc-693898dba170/bin/uautomizer/data/26e8c9dc5/2e3a7ac7450848b8b82d2a5f2cf757ab [2019-10-22 08:54:49,697 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 08:54:49,698 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 08:54:49,699 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 08:54:49,699 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 08:54:49,703 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 08:54:49,704 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:54:49" (1/1) ... [2019-10-22 08:54:49,706 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12e1fbfd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:49, skipping insertion in model container [2019-10-22 08:54:49,707 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:54:49" (1/1) ... [2019-10-22 08:54:49,714 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 08:54:49,730 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 08:54:49,922 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:54:49,931 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 08:54:50,041 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:54:50,059 INFO L192 MainTranslator]: Completed translation [2019-10-22 08:54:50,059 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:50 WrapperNode [2019-10-22 08:54:50,060 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 08:54:50,060 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 08:54:50,060 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 08:54:50,061 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 08:54:50,068 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:54:50" (1/1) ... [2019-10-22 08:54:50,076 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:54:50" (1/1) ... [2019-10-22 08:54:50,093 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 08:54:50,093 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 08:54:50,094 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 08:54:50,094 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 08:54:50,101 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:50" (1/1) ... [2019-10-22 08:54:50,102 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:50" (1/1) ... [2019-10-22 08:54:50,103 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:50" (1/1) ... [2019-10-22 08:54:50,104 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:50" (1/1) ... [2019-10-22 08:54:50,119 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:50" (1/1) ... [2019-10-22 08:54:50,123 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:50" (1/1) ... [2019-10-22 08:54:50,123 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:50" (1/1) ... [2019-10-22 08:54:50,125 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 08:54:50,125 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 08:54:50,126 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 08:54:50,126 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 08:54:50,127 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:50" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9ec16381-08a0-4fea-acdc-693898dba170/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:54:50,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 08:54:50,171 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 08:54:50,171 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 08:54:50,171 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 08:54:50,171 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 08:54:50,171 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 08:54:50,352 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 08:54:50,352 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-10-22 08:54:50,354 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:54:50 BoogieIcfgContainer [2019-10-22 08:54:50,354 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 08:54:50,354 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-10-22 08:54:50,354 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-10-22 08:54:50,357 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-10-22 08:54:50,358 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:54:50,370 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.10 08:54:49" (1/3) ... [2019-10-22 08:54:50,372 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5d8bb3b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:54:50, skipping insertion in model container [2019-10-22 08:54:50,372 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:54:50,372 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:50" (2/3) ... [2019-10-22 08:54:50,372 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5d8bb3b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:54:50, skipping insertion in model container [2019-10-22 08:54:50,372 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:54:50,372 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:54:50" (3/3) ... [2019-10-22 08:54:50,374 INFO L371 chiAutomizerObserver]: Analyzing ICFG array_shadowinit.i [2019-10-22 08:54:50,461 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-10-22 08:54:50,462 INFO L357 BuchiCegarLoop]: Hoare is false [2019-10-22 08:54:50,462 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-10-22 08:54:50,462 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 08:54:50,462 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 08:54:50,462 INFO L361 BuchiCegarLoop]: Difference is false [2019-10-22 08:54:50,462 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 08:54:50,462 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-10-22 08:54:50,482 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2019-10-22 08:54:50,502 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-10-22 08:54:50,503 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:54:50,504 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:54:50,510 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-10-22 08:54:50,511 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-10-22 08:54:50,511 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-10-22 08:54:50,511 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2019-10-22 08:54:50,513 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-10-22 08:54:50,514 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:54:50,514 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:54:50,514 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-10-22 08:54:50,515 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-10-22 08:54:50,522 INFO L791 eck$LassoCheckResult]: Stem: 11#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 8#L-1true havoc main_#res;havoc main_#t~nondet0, main_#t~mem1, main_~i~0, main_~k~0, main_~#a~0.base, main_~#a~0.offset;~N~0 := main_#t~nondet0;havoc main_#t~nondet0; 6#L7true assume ~N~0 > 0;havoc main_~i~0;havoc main_~k~0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(4 * ~N~0);main_~i~0 := 0;main_~k~0 := 0; 10#L12-2true [2019-10-22 08:54:50,522 INFO L793 eck$LassoCheckResult]: Loop: 10#L12-2true assume !!(main_~i~0 < ~N~0);call write~int(main_~k~0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~k~0, 4);main_~i~0 := 1 + main_~i~0;main_~k~0 := 1 + main_~k~0; 10#L12-2true [2019-10-22 08:54:50,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:50,530 INFO L82 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2019-10-22 08:54:50,538 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:50,538 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115623067] [2019-10-22 08:54:50,539 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:50,539 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:50,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:50,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:50,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:50,676 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:50,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:50,677 INFO L82 PathProgramCache]: Analyzing trace with hash 45, now seen corresponding path program 1 times [2019-10-22 08:54:50,678 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:50,678 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172917420] [2019-10-22 08:54:50,679 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:50,679 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:50,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:50,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:50,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:50,700 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:50,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:50,703 INFO L82 PathProgramCache]: Analyzing trace with hash 925612, now seen corresponding path program 1 times [2019-10-22 08:54:50,703 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:50,704 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215680042] [2019-10-22 08:54:50,704 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:50,704 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:50,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:50,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:50,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:50,744 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:50,937 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:54:50,938 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:54:50,938 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:54:50,938 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:54:50,938 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:54:50,939 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:50,939 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:54:50,940 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:54:50,940 INFO L131 ssoRankerPreferences]: Filename of dumped script: array_shadowinit.i_Iteration1_Lasso [2019-10-22 08:54:50,940 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:54:50,940 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:54:50,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 08:54:50,972 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:54:50,977 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:54:51,031 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:54:51,034 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:54:51,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 08:54:51,213 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:54:51,219 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:54:51,221 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:54:51,223 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:51,224 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:51,224 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:51,225 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:51,225 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:51,227 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:51,229 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:51,231 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:51,231 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:54:51,232 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:51,232 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:51,232 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:51,232 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:51,232 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:51,238 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:51,238 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:51,239 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:51,239 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:54:51,240 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:51,240 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-10-22 08:54:51,240 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:51,240 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:51,243 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-10-22 08:54:51,244 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:51,256 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:51,267 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:54:51,267 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:51,268 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:51,268 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:51,268 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:51,268 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:51,269 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:51,269 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:51,270 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:51,270 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:54:51,271 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:51,271 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:51,271 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:51,272 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:51,274 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:51,274 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:51,292 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:51,298 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:54:51,299 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:51,300 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:51,300 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:51,300 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:51,302 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:51,302 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:51,309 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:51,314 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:54:51,315 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:51,315 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:51,315 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:51,315 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:51,327 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:51,327 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:51,402 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:54:51,439 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-10-22 08:54:51,439 INFO L444 ModelExtractionUtils]: 13 out of 19 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-10-22 08:54:51,447 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:54:51,450 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:54:51,451 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:54:51,452 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~k~0, v_rep(select #length ULTIMATE.start_main_~#a~0.base)_1, ULTIMATE.start_main_~#a~0.offset) = -4*ULTIMATE.start_main_~k~0 + 1*v_rep(select #length ULTIMATE.start_main_~#a~0.base)_1 - 1*ULTIMATE.start_main_~#a~0.offset Supporting invariants [] [2019-10-22 08:54:51,459 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2019-10-22 08:54:51,467 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-22 08:54:51,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:51,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:51,503 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:54:51,504 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:51,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:51,517 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:54:51,518 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:51,518 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:54:51,535 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:54:51,537 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states. Second operand 2 states. [2019-10-22 08:54:51,580 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states.. Second operand 2 states. Result 35 states and 45 transitions. Complement of second has 6 states. [2019-10-22 08:54:51,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-10-22 08:54:51,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2019-10-22 08:54:51,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2019-10-22 08:54:51,585 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 3 letters. Loop has 1 letters. [2019-10-22 08:54:51,586 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:51,586 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 4 letters. Loop has 1 letters. [2019-10-22 08:54:51,587 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:51,587 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 3 letters. Loop has 2 letters. [2019-10-22 08:54:51,587 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:51,588 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 45 transitions. [2019-10-22 08:54:51,591 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:54:51,595 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 9 states and 11 transitions. [2019-10-22 08:54:51,596 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-10-22 08:54:51,596 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-10-22 08:54:51,597 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 11 transitions. [2019-10-22 08:54:51,597 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:54:51,597 INFO L688 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2019-10-22 08:54:51,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 11 transitions. [2019-10-22 08:54:51,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-10-22 08:54:51,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-10-22 08:54:51,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. [2019-10-22 08:54:51,625 INFO L711 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2019-10-22 08:54:51,625 INFO L591 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2019-10-22 08:54:51,625 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-10-22 08:54:51,625 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 11 transitions. [2019-10-22 08:54:51,626 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:54:51,626 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:54:51,626 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:54:51,627 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-10-22 08:54:51,627 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 08:54:51,627 INFO L791 eck$LassoCheckResult]: Stem: 97#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 91#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~mem1, main_~i~0, main_~k~0, main_~#a~0.base, main_~#a~0.offset;~N~0 := main_#t~nondet0;havoc main_#t~nondet0; 92#L7 assume ~N~0 > 0;havoc main_~i~0;havoc main_~k~0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(4 * ~N~0);main_~i~0 := 0;main_~k~0 := 0; 93#L12-2 assume !(main_~i~0 < ~N~0); 94#L12-3 main_~i~0 := 0; 90#L18-2 [2019-10-22 08:54:51,627 INFO L793 eck$LassoCheckResult]: Loop: 90#L18-2 assume !!(main_~i~0 < ~N~0);call main_#t~mem1 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);__VERIFIER_assert_#in~cond := (if main_#t~mem1 == main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 96#L2 assume !(0 == __VERIFIER_assert_~cond); 89#L2-3 havoc main_#t~mem1;main_~i~0 := 1 + main_~i~0; 90#L18-2 [2019-10-22 08:54:51,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:51,628 INFO L82 PathProgramCache]: Analyzing trace with hash 28693928, now seen corresponding path program 1 times [2019-10-22 08:54:51,628 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:51,628 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942760850] [2019-10-22 08:54:51,628 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:51,628 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:51,629 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:51,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:51,665 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:54:51,666 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942760850] [2019-10-22 08:54:51,666 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:51,667 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:54:51,667 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451828691] [2019-10-22 08:54:51,669 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:54:51,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:51,670 INFO L82 PathProgramCache]: Analyzing trace with hash 56828, now seen corresponding path program 1 times [2019-10-22 08:54:51,670 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:51,670 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140612256] [2019-10-22 08:54:51,670 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:51,670 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:51,673 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:51,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:51,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:51,700 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:51,785 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:51,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:54:51,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:54:51,790 INFO L87 Difference]: Start difference. First operand 9 states and 11 transitions. cyclomatic complexity: 4 Second operand 3 states. [2019-10-22 08:54:51,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:51,812 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2019-10-22 08:54:51,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:54:51,814 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 10 transitions. [2019-10-22 08:54:51,814 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:54:51,815 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 9 states and 10 transitions. [2019-10-22 08:54:51,815 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-10-22 08:54:51,815 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-10-22 08:54:51,815 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 10 transitions. [2019-10-22 08:54:51,815 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:54:51,816 INFO L688 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2019-10-22 08:54:51,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 10 transitions. [2019-10-22 08:54:51,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-10-22 08:54:51,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-10-22 08:54:51,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2019-10-22 08:54:51,817 INFO L711 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2019-10-22 08:54:51,817 INFO L591 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2019-10-22 08:54:51,817 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-10-22 08:54:51,817 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 10 transitions. [2019-10-22 08:54:51,818 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:54:51,818 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:54:51,818 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:54:51,821 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-10-22 08:54:51,822 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 08:54:51,822 INFO L791 eck$LassoCheckResult]: Stem: 120#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 115#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~mem1, main_~i~0, main_~k~0, main_~#a~0.base, main_~#a~0.offset;~N~0 := main_#t~nondet0;havoc main_#t~nondet0; 116#L7 assume ~N~0 > 0;havoc main_~i~0;havoc main_~k~0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(4 * ~N~0);main_~i~0 := 0;main_~k~0 := 0; 117#L12-2 assume !!(main_~i~0 < ~N~0);call write~int(main_~k~0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~k~0, 4);main_~i~0 := 1 + main_~i~0;main_~k~0 := 1 + main_~k~0; 118#L12-2 assume !(main_~i~0 < ~N~0); 119#L12-3 main_~i~0 := 0; 114#L18-2 [2019-10-22 08:54:51,822 INFO L793 eck$LassoCheckResult]: Loop: 114#L18-2 assume !!(main_~i~0 < ~N~0);call main_#t~mem1 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);__VERIFIER_assert_#in~cond := (if main_#t~mem1 == main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 121#L2 assume !(0 == __VERIFIER_assert_~cond); 113#L2-3 havoc main_#t~mem1;main_~i~0 := 1 + main_~i~0; 114#L18-2 [2019-10-22 08:54:51,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:51,823 INFO L82 PathProgramCache]: Analyzing trace with hash 889513522, now seen corresponding path program 1 times [2019-10-22 08:54:51,823 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:51,823 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537252272] [2019-10-22 08:54:51,823 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:51,823 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:51,824 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:51,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:51,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:51,856 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:51,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:51,856 INFO L82 PathProgramCache]: Analyzing trace with hash 56828, now seen corresponding path program 2 times [2019-10-22 08:54:51,856 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:51,857 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211123094] [2019-10-22 08:54:51,857 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:51,857 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:51,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:51,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:51,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:51,878 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:51,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:51,878 INFO L82 PathProgramCache]: Analyzing trace with hash -450855381, now seen corresponding path program 1 times [2019-10-22 08:54:51,878 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:51,879 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641342589] [2019-10-22 08:54:51,879 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:51,879 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:51,879 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:51,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:51,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:51,925 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:52,135 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 61 [2019-10-22 08:54:52,182 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:54:52,182 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:54:52,182 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:54:52,182 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:54:52,183 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:54:52,183 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:52,183 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:54:52,183 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:54:52,183 INFO L131 ssoRankerPreferences]: Filename of dumped script: array_shadowinit.i_Iteration3_Lasso [2019-10-22 08:54:52,183 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:54:52,183 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:54:52,187 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:52,198 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:54:52,201 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:54:52,203 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:54:52,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 08:54:52,211 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:54:52,318 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:54:52,528 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:54:52,528 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:54:52,529 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:54:52,530 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:52,530 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:52,530 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:52,530 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:52,530 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:52,531 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:52,531 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:52,533 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:52,534 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:54:52,535 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:52,535 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:52,535 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:52,536 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:52,536 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:52,536 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:52,537 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:52,537 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:52,538 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:54:52,538 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:52,539 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:52,539 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:52,539 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:52,539 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:52,539 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:52,540 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:52,540 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:52,541 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:54:52,541 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:52,541 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:52,542 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:52,542 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:52,542 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:52,542 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:52,543 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:52,543 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:52,544 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:54:52,544 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:52,545 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:52,545 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:52,545 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:52,546 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:52,547 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:52,549 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:52,549 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:54:52,550 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:52,550 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-10-22 08:54:52,550 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:52,551 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:52,552 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-10-22 08:54:52,553 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:52,558 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:52,558 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:54:52,559 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:52,559 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:52,559 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:52,559 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:52,560 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:52,561 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:52,563 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:52,563 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:54:52,564 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:52,564 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:52,564 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:52,564 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:52,566 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:52,566 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:52,571 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:52,572 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:54:52,573 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:52,573 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:52,573 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:52,573 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:52,576 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:52,577 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:52,600 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:54:52,612 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 08:54:52,612 INFO L444 ModelExtractionUtils]: 21 out of 25 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 08:54:52,613 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:54:52,614 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:54:52,614 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:54:52,614 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, ~N~0) = -1*ULTIMATE.start_main_~i~0 + 1*~N~0 Supporting invariants [] [2019-10-22 08:54:52,617 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2019-10-22 08:54:52,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:52,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:52,643 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:54:52,643 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:52,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:52,651 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:54:52,652 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:52,664 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:54:52,664 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:54:52,664 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 9 states and 10 transitions. cyclomatic complexity: 3 Second operand 3 states. [2019-10-22 08:54:52,674 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 9 states and 10 transitions. cyclomatic complexity: 3. Second operand 3 states. Result 12 states and 14 transitions. Complement of second has 4 states. [2019-10-22 08:54:52,674 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 08:54:52,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:54:52,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2019-10-22 08:54:52,675 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 6 letters. Loop has 3 letters. [2019-10-22 08:54:52,675 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:52,675 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 9 letters. Loop has 3 letters. [2019-10-22 08:54:52,675 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:52,675 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 6 letters. Loop has 6 letters. [2019-10-22 08:54:52,676 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:52,676 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 14 transitions. [2019-10-22 08:54:52,676 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:54:52,677 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 0 states and 0 transitions. [2019-10-22 08:54:52,677 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-10-22 08:54:52,677 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-10-22 08:54:52,677 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-10-22 08:54:52,677 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:54:52,677 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:54:52,677 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:54:52,677 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:54:52,677 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-10-22 08:54:52,678 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-10-22 08:54:52,678 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:54:52,678 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-10-22 08:54:52,684 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.10 08:54:52 BoogieIcfgContainer [2019-10-22 08:54:52,684 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-10-22 08:54:52,685 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 08:54:52,685 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 08:54:52,685 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 08:54:52,686 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:54:50" (3/4) ... [2019-10-22 08:54:52,689 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-10-22 08:54:52,689 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 08:54:52,691 INFO L168 Benchmark]: Toolchain (without parser) took 2992.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 211.8 MB). Free memory was 940.4 MB in the beginning and 950.0 MB in the end (delta: -9.6 MB). Peak memory consumption was 202.2 MB. Max. memory is 11.5 GB. [2019-10-22 08:54:52,691 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 966.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:54:52,692 INFO L168 Benchmark]: CACSL2BoogieTranslator took 360.75 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 211.8 MB). Free memory was 940.4 MB in the beginning and 1.2 GB in the end (delta: -269.9 MB). Peak memory consumption was 20.2 MB. Max. memory is 11.5 GB. [2019-10-22 08:54:52,692 INFO L168 Benchmark]: Boogie Procedure Inliner took 32.91 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 11.5 GB. [2019-10-22 08:54:52,693 INFO L168 Benchmark]: Boogie Preprocessor took 31.75 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. [2019-10-22 08:54:52,693 INFO L168 Benchmark]: RCFGBuilder took 228.43 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 20.5 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. [2019-10-22 08:54:52,694 INFO L168 Benchmark]: BuchiAutomizer took 2330.39 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 951.6 MB in the end (delta: 233.4 MB). Peak memory consumption was 233.4 MB. Max. memory is 11.5 GB. [2019-10-22 08:54:52,695 INFO L168 Benchmark]: Witness Printer took 4.31 ms. Allocated memory is still 1.2 GB. Free memory was 951.6 MB in the beginning and 950.0 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 11.5 GB. [2019-10-22 08:54:52,698 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 966.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 360.75 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 211.8 MB). Free memory was 940.4 MB in the beginning and 1.2 GB in the end (delta: -269.9 MB). Peak memory consumption was 20.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 32.91 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 31.75 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 228.43 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 20.5 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 2330.39 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 951.6 MB in the end (delta: 233.4 MB). Peak memory consumption was 233.4 MB. Max. memory is 11.5 GB. * Witness Printer took 4.31 ms. Allocated memory is still 1.2 GB. Free memory was 951.6 MB in the beginning and 950.0 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (1 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -4 * k + unknown-#length-unknown[a] + -1 * a and consists of 4 locations. One deterministic module has affine ranking function -1 * i + N and consists of 3 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.2s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 1.9s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 9 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 28 SDtfs, 19 SDslu, 8 SDs, 0 SdLazy, 17 SolverSat, 3 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital116 mio100 ax100 hnf100 lsp92 ukn70 mio100 lsp78 div100 bol100 ite100 ukn100 eq161 hnf90 smp97 dnf100 smp100 tf100 neg100 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 17ms VariablesStem: 2 VariablesLoop: 0 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...