./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/array-industry-pattern/array_shadowinit_true-unreach-call_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 91b1670e Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/array-industry-pattern/array_shadowinit_true-unreach-call_true-termination.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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-91b1670 [2018-11-28 23:25:11,060 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 23:25:11,064 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 23:25:11,084 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 23:25:11,085 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 23:25:11,086 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 23:25:11,087 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 23:25:11,089 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 23:25:11,091 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 23:25:11,092 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 23:25:11,093 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 23:25:11,094 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 23:25:11,095 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 23:25:11,096 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 23:25:11,097 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 23:25:11,098 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 23:25:11,098 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 23:25:11,100 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 23:25:11,103 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 23:25:11,105 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 23:25:11,106 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 23:25:11,107 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 23:25:11,110 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 23:25:11,111 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 23:25:11,111 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 23:25:11,112 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 23:25:11,113 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 23:25:11,114 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 23:25:11,115 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 23:25:11,116 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 23:25:11,117 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 23:25:11,117 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 23:25:11,118 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 23:25:11,118 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 23:25:11,119 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 23:25:11,120 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 23:25:11,120 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-28 23:25:11,139 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 23:25:11,142 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 23:25:11,143 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 23:25:11,147 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 23:25:11,147 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 23:25:11,147 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 23:25:11,148 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 23:25:11,148 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 23:25:11,148 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 23:25:11,149 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 23:25:11,149 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 23:25:11,149 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 23:25:11,149 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 23:25:11,149 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 23:25:11,150 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 23:25:11,150 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 23:25:11,150 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 23:25:11,150 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 23:25:11,150 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 23:25:11,150 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 23:25:11,154 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 23:25:11,154 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 23:25:11,154 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 23:25:11,155 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 23:25:11,155 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 23:25:11,155 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 23:25:11,155 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 23:25:11,155 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 23:25:11,159 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 23:25:11,160 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 23:25:11,160 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 23:25:11,161 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 23:25:11,161 INFO L133 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 [2018-11-28 23:25:11,219 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 23:25:11,236 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 23:25:11,242 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 23:25:11,244 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 23:25:11,244 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 23:25:11,245 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/array-industry-pattern/array_shadowinit_true-unreach-call_true-termination.i [2018-11-28 23:25:11,310 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc1689317/1c0083d01bcc4f4da61892aaa00b5cc5/FLAG56db228d7 [2018-11-28 23:25:11,728 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 23:25:11,729 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/array-industry-pattern/array_shadowinit_true-unreach-call_true-termination.i [2018-11-28 23:25:11,735 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc1689317/1c0083d01bcc4f4da61892aaa00b5cc5/FLAG56db228d7 [2018-11-28 23:25:12,113 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc1689317/1c0083d01bcc4f4da61892aaa00b5cc5 [2018-11-28 23:25:12,117 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 23:25:12,118 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 23:25:12,119 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 23:25:12,119 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 23:25:12,123 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 23:25:12,124 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:25:12" (1/1) ... [2018-11-28 23:25:12,127 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4922bd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:25:12, skipping insertion in model container [2018-11-28 23:25:12,127 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:25:12" (1/1) ... [2018-11-28 23:25:12,134 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 23:25:12,155 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 23:25:12,337 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:25:12,341 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 23:25:12,365 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:25:12,389 INFO L195 MainTranslator]: Completed translation [2018-11-28 23:25:12,389 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:25:12 WrapperNode [2018-11-28 23:25:12,389 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 23:25:12,390 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 23:25:12,390 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 23:25:12,391 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 23:25:12,400 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:25:12" (1/1) ... [2018-11-28 23:25:12,409 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:25:12" (1/1) ... [2018-11-28 23:25:12,432 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 23:25:12,432 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 23:25:12,432 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 23:25:12,433 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 23:25:12,444 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:25:12" (1/1) ... [2018-11-28 23:25:12,444 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:25:12" (1/1) ... [2018-11-28 23:25:12,446 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:25:12" (1/1) ... [2018-11-28 23:25:12,446 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:25:12" (1/1) ... [2018-11-28 23:25:12,461 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:25:12" (1/1) ... [2018-11-28 23:25:12,470 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:25:12" (1/1) ... [2018-11-28 23:25:12,471 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:25:12" (1/1) ... [2018-11-28 23:25:12,473 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 23:25:12,474 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 23:25:12,474 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 23:25:12,474 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 23:25:12,475 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:25:12" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2018-11-28 23:25:12,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 23:25:12,630 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 23:25:12,630 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 23:25:12,630 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 23:25:12,630 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 23:25:12,631 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 23:25:13,006 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 23:25:13,007 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-28 23:25:13,007 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:25:13 BoogieIcfgContainer [2018-11-28 23:25:13,007 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 23:25:13,009 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 23:25:13,009 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 23:25:13,013 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 23:25:13,014 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:25:13,014 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 11:25:12" (1/3) ... [2018-11-28 23:25:13,015 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2d1c6eff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:25:13, skipping insertion in model container [2018-11-28 23:25:13,015 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:25:13,015 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:25:12" (2/3) ... [2018-11-28 23:25:13,016 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2d1c6eff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:25:13, skipping insertion in model container [2018-11-28 23:25:13,016 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:25:13,016 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:25:13" (3/3) ... [2018-11-28 23:25:13,018 INFO L375 chiAutomizerObserver]: Analyzing ICFG array_shadowinit_true-unreach-call_true-termination.i [2018-11-28 23:25:13,072 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 23:25:13,073 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 23:25:13,073 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 23:25:13,073 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 23:25:13,076 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 23:25:13,076 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 23:25:13,076 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 23:25:13,077 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 23:25:13,077 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 23:25:13,095 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2018-11-28 23:25:13,118 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2018-11-28 23:25:13,119 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:25:13,119 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:25:13,125 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-28 23:25:13,126 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-28 23:25:13,126 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 23:25:13,126 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2018-11-28 23:25:13,128 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2018-11-28 23:25:13,128 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:25:13,128 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:25:13,129 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-28 23:25:13,129 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-28 23:25:13,137 INFO L794 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.alloc(4 * ~N~0);main_~i~0 := 0;main_~k~0 := 0; 10#L12-2true [2018-11-28 23:25:13,137 INFO L796 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 [2018-11-28 23:25:13,145 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:25:13,145 INFO L82 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2018-11-28 23:25:13,148 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:25:13,149 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:25:13,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:25:13,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:25:13,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:25:13,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:25:13,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:25:13,284 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:25:13,284 INFO L82 PathProgramCache]: Analyzing trace with hash 45, now seen corresponding path program 1 times [2018-11-28 23:25:13,284 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:25:13,285 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:25:13,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:25:13,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:25:13,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:25:13,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:25:13,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:25:13,310 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:25:13,310 INFO L82 PathProgramCache]: Analyzing trace with hash 925612, now seen corresponding path program 1 times [2018-11-28 23:25:13,310 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:25:13,310 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:25:13,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:25:13,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:25:13,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:25:13,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:25:13,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:25:13,788 WARN L180 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-11-28 23:25:13,813 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:25:13,815 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:25:13,815 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:25:13,816 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:25:13,816 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:25:13,816 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:25:13,817 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:25:13,817 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:25:13,817 INFO L131 ssoRankerPreferences]: Filename of dumped script: array_shadowinit_true-unreach-call_true-termination.i_Iteration1_Lasso [2018-11-28 23:25:13,817 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:25:13,817 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:25:13,846 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:25:13,856 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:25:13,866 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:25:13,878 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:25:13,884 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:25:14,024 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:25:14,398 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:25:14,404 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:25:14,407 INFO L122 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 [2018-11-28 23:25:14,409 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:25:14,410 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:25:14,411 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:25:14,411 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:25:14,411 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:25:14,414 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:25:14,414 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:25:14,418 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:25:14,418 INFO L122 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 [2018-11-28 23:25:14,419 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:25:14,419 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:25:14,419 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:25:14,420 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:25:14,420 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:25:14,420 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:25:14,422 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:25:14,423 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:25:14,424 INFO L122 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 [2018-11-28 23:25:14,425 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:25:14,425 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:25:14,426 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:25:14,426 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:25:14,426 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:25:14,426 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:25:14,428 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:25:14,429 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:25:14,430 INFO L122 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 [2018-11-28 23:25:14,431 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:25:14,431 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:25:14,431 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:25:14,431 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:25:14,436 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:25:14,436 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:25:14,442 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:25:14,442 INFO L122 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 [2018-11-28 23:25:14,443 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:25:14,443 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:25:14,443 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:25:14,444 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:25:14,448 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:25:14,448 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:25:14,473 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:25:14,473 INFO L122 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 [2018-11-28 23:25:14,475 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:25:14,475 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:25:14,475 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:25:14,476 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:25:14,484 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:25:14,484 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:25:14,495 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:25:14,495 INFO L122 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 [2018-11-28 23:25:14,498 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:25:14,499 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:25:14,499 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:25:14,499 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:25:14,503 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:25:14,503 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:25:14,520 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:25:14,521 INFO L122 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 [2018-11-28 23:25:14,522 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:25:14,522 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:25:14,523 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:25:14,523 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:25:14,523 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:25:14,524 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:25:14,524 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:25:14,525 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:25:14,525 INFO L122 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 [2018-11-28 23:25:14,529 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:25:14,529 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:25:14,529 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:25:14,529 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:25:14,542 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:25:14,548 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:25:14,646 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:25:14,696 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-28 23:25:14,696 INFO L444 ModelExtractionUtils]: 12 out of 19 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-28 23:25:14,698 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:25:14,701 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:25:14,702 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:25:14,702 INFO L520 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 [] [2018-11-28 23:25:14,716 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2018-11-28 23:25:14,725 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-28 23:25:14,838 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:25:14,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:25:14,877 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:25:14,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:25:14,911 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:25:14,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:25:14,935 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 [2018-11-28 23:25:14,937 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states. Second operand 2 states. [2018-11-28 23:25:15,098 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. [2018-11-28 23:25:15,100 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 [2018-11-28 23:25:15,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-28 23:25:15,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2018-11-28 23:25:15,106 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 3 letters. Loop has 1 letters. [2018-11-28 23:25:15,108 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:25:15,110 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 4 letters. Loop has 1 letters. [2018-11-28 23:25:15,112 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:25:15,112 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 3 letters. Loop has 2 letters. [2018-11-28 23:25:15,112 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:25:15,114 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 45 transitions. [2018-11-28 23:25:15,121 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 23:25:15,124 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 9 states and 11 transitions. [2018-11-28 23:25:15,126 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2018-11-28 23:25:15,126 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2018-11-28 23:25:15,127 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 11 transitions. [2018-11-28 23:25:15,127 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:25:15,127 INFO L705 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2018-11-28 23:25:15,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 11 transitions. [2018-11-28 23:25:15,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-11-28 23:25:15,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-28 23:25:15,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. [2018-11-28 23:25:15,153 INFO L728 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2018-11-28 23:25:15,153 INFO L608 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2018-11-28 23:25:15,153 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 23:25:15,153 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 11 transitions. [2018-11-28 23:25:15,154 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 23:25:15,154 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:25:15,154 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:25:15,154 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-28 23:25:15,155 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 23:25:15,155 INFO L794 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.alloc(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 [2018-11-28 23:25:15,155 INFO L796 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 [2018-11-28 23:25:15,155 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:25:15,156 INFO L82 PathProgramCache]: Analyzing trace with hash 28693928, now seen corresponding path program 1 times [2018-11-28 23:25:15,156 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:25:15,156 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:25:15,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:25:15,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:25:15,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:25:15,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:25:15,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:25:15,211 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:25:15,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 23:25:15,213 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 23:25:15,213 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:25:15,213 INFO L82 PathProgramCache]: Analyzing trace with hash 56828, now seen corresponding path program 1 times [2018-11-28 23:25:15,214 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:25:15,214 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:25:15,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:25:15,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:25:15,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:25:15,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:25:15,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:25:15,363 WARN L180 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-11-28 23:25:15,524 WARN L180 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 30 [2018-11-28 23:25:15,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 23:25:15,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 23:25:15,531 INFO L87 Difference]: Start difference. First operand 9 states and 11 transitions. cyclomatic complexity: 4 Second operand 3 states. [2018-11-28 23:25:15,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:25:15,575 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2018-11-28 23:25:15,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 23:25:15,577 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 10 transitions. [2018-11-28 23:25:15,578 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 23:25:15,579 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 9 states and 10 transitions. [2018-11-28 23:25:15,579 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2018-11-28 23:25:15,579 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2018-11-28 23:25:15,579 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 10 transitions. [2018-11-28 23:25:15,579 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:25:15,580 INFO L705 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2018-11-28 23:25:15,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 10 transitions. [2018-11-28 23:25:15,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-11-28 23:25:15,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-28 23:25:15,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2018-11-28 23:25:15,582 INFO L728 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2018-11-28 23:25:15,582 INFO L608 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2018-11-28 23:25:15,582 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 23:25:15,582 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 10 transitions. [2018-11-28 23:25:15,583 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 23:25:15,584 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:25:15,584 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:25:15,585 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-28 23:25:15,585 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 23:25:15,585 INFO L794 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.alloc(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 [2018-11-28 23:25:15,585 INFO L796 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 [2018-11-28 23:25:15,587 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:25:15,587 INFO L82 PathProgramCache]: Analyzing trace with hash 889513522, now seen corresponding path program 1 times [2018-11-28 23:25:15,587 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:25:15,587 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:25:15,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:25:15,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:25:15,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:25:15,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:25:15,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:25:15,612 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:25:15,613 INFO L82 PathProgramCache]: Analyzing trace with hash 56828, now seen corresponding path program 2 times [2018-11-28 23:25:15,614 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:25:15,614 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:25:15,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:25:15,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:25:15,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:25:15,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:25:15,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:25:15,626 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:25:15,627 INFO L82 PathProgramCache]: Analyzing trace with hash -450855381, now seen corresponding path program 1 times [2018-11-28 23:25:15,627 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:25:15,627 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:25:15,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:25:15,628 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:25:15,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:25:15,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:25:15,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:25:15,770 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-11-28 23:25:15,987 WARN L180 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 30 [2018-11-28 23:25:16,142 WARN L180 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 57 [2018-11-28 23:25:16,199 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:25:16,199 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:25:16,199 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:25:16,199 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:25:16,199 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:25:16,200 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:25:16,200 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:25:16,200 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:25:16,200 INFO L131 ssoRankerPreferences]: Filename of dumped script: array_shadowinit_true-unreach-call_true-termination.i_Iteration3_Lasso [2018-11-28 23:25:16,200 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:25:16,200 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:25:16,204 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:25:16,211 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:25:16,215 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:25:16,349 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 35 [2018-11-28 23:25:16,366 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:25:16,370 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:25:16,376 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:25:16,380 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:25:16,673 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:25:16,673 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:25:16,673 INFO L122 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 [2018-11-28 23:25:16,679 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:25:16,679 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:25:16,679 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:25:16,679 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:25:16,679 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:25:16,680 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:25:16,680 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:25:16,684 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:25:16,684 INFO L122 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 [2018-11-28 23:25:16,686 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:25:16,686 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:25:16,686 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:25:16,687 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:25:16,687 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:25:16,687 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:25:16,687 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:25:16,688 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:25:16,691 INFO L122 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 [2018-11-28 23:25:16,693 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:25:16,693 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:25:16,693 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:25:16,693 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:25:16,698 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:25:16,699 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:25:16,739 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:25:16,786 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-28 23:25:16,790 INFO L444 ModelExtractionUtils]: 17 out of 25 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-11-28 23:25:16,791 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:25:16,793 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:25:16,793 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:25:16,794 INFO L520 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 [] [2018-11-28 23:25:16,811 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2018-11-28 23:25:16,888 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:25:16,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:25:16,904 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:25:16,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:25:16,914 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:25:17,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:25:17,029 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 [2018-11-28 23:25:17,030 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 9 states and 10 transitions. cyclomatic complexity: 3 Second operand 3 states. [2018-11-28 23:25:17,056 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. [2018-11-28 23:25:17,058 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 [2018-11-28 23:25:17,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:25:17,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2018-11-28 23:25:17,059 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 6 letters. Loop has 3 letters. [2018-11-28 23:25:17,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:25:17,059 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 9 letters. Loop has 3 letters. [2018-11-28 23:25:17,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:25:17,060 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 6 letters. Loop has 6 letters. [2018-11-28 23:25:17,060 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:25:17,060 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 14 transitions. [2018-11-28 23:25:17,061 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:25:17,061 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 0 states and 0 transitions. [2018-11-28 23:25:17,063 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-28 23:25:17,063 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-28 23:25:17,063 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-28 23:25:17,063 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:25:17,063 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:25:17,063 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:25:17,063 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:25:17,063 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-28 23:25:17,064 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-28 23:25:17,064 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:25:17,064 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-28 23:25:17,071 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 11:25:17 BoogieIcfgContainer [2018-11-28 23:25:17,071 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 23:25:17,072 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 23:25:17,072 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 23:25:17,072 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 23:25:17,073 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:25:13" (3/4) ... [2018-11-28 23:25:17,077 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 23:25:17,078 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 23:25:17,079 INFO L168 Benchmark]: Toolchain (without parser) took 4961.20 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.1 MB). Free memory was 951.4 MB in the beginning and 865.8 MB in the end (delta: 85.5 MB). Peak memory consumption was 196.7 MB. Max. memory is 11.5 GB. [2018-11-28 23:25:17,080 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:25:17,082 INFO L168 Benchmark]: CACSL2BoogieTranslator took 270.59 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-28 23:25:17,083 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.91 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:25:17,084 INFO L168 Benchmark]: Boogie Preprocessor took 41.08 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-28 23:25:17,085 INFO L168 Benchmark]: RCFGBuilder took 533.64 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.1 MB). Free memory was 935.2 MB in the beginning and 1.1 GB in the end (delta: -149.3 MB). Peak memory consumption was 13.1 MB. Max. memory is 11.5 GB. [2018-11-28 23:25:17,087 INFO L168 Benchmark]: BuchiAutomizer took 4062.53 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 865.8 MB in the end (delta: 218.7 MB). Peak memory consumption was 218.7 MB. Max. memory is 11.5 GB. [2018-11-28 23:25:17,088 INFO L168 Benchmark]: Witness Printer took 6.13 ms. Allocated memory is still 1.1 GB. Free memory is still 865.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:25:17,095 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 270.59 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 41.91 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 41.08 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 533.64 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.1 MB). Free memory was 935.2 MB in the beginning and 1.1 GB in the end (delta: -149.3 MB). Peak memory consumption was 13.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4062.53 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 865.8 MB in the end (delta: 218.7 MB). Peak memory consumption was 218.7 MB. Max. memory is 11.5 GB. * Witness Printer took 6.13 ms. Allocated memory is still 1.1 GB. Free memory is still 865.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 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 4.0s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 3.1s. Construction of modules took 0.1s. Büchi inclusion checks took 0.5s. 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.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital113 mio100 ax100 hnf100 lsp92 ukn69 mio100 lsp81 div100 bol100 ite100 ukn100 eq161 hnf90 smp97 dnf100 smp100 tf100 neg100 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 25ms VariablesStem: 1 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...