./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/array-industry-pattern/array_shadowinit_true-unreach-call_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_0a4d20d8-8634-42af-a555-34922ba8612a/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_0a4d20d8-8634-42af-a555-34922ba8612a/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_0a4d20d8-8634-42af-a555-34922ba8612a/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_0a4d20d8-8634-42af-a555-34922ba8612a/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-industry-pattern/array_shadowinit_true-unreach-call_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_0a4d20d8-8634-42af-a555-34922ba8612a/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_0a4d20d8-8634-42af-a555-34922ba8612a/bin-2019/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.23-635dfa2 [2018-12-02 15:23:14,577 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 15:23:14,578 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 15:23:14,584 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 15:23:14,584 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 15:23:14,585 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 15:23:14,585 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 15:23:14,586 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 15:23:14,587 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 15:23:14,587 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 15:23:14,588 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 15:23:14,588 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 15:23:14,588 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 15:23:14,589 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 15:23:14,589 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 15:23:14,589 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 15:23:14,590 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 15:23:14,591 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 15:23:14,591 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 15:23:14,592 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 15:23:14,593 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 15:23:14,593 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 15:23:14,594 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 15:23:14,594 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 15:23:14,595 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 15:23:14,595 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 15:23:14,595 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 15:23:14,596 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 15:23:14,596 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 15:23:14,597 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 15:23:14,597 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 15:23:14,597 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 15:23:14,597 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 15:23:14,597 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 15:23:14,598 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 15:23:14,598 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 15:23:14,598 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_0a4d20d8-8634-42af-a555-34922ba8612a/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-12-02 15:23:14,606 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 15:23:14,606 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 15:23:14,607 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 15:23:14,607 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 15:23:14,607 INFO L133 SettingsManager]: * Use SBE=true [2018-12-02 15:23:14,607 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-02 15:23:14,607 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-02 15:23:14,607 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-02 15:23:14,607 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-02 15:23:14,607 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-02 15:23:14,607 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-02 15:23:14,608 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 15:23:14,608 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 15:23:14,608 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-02 15:23:14,608 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 15:23:14,608 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 15:23:14,608 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 15:23:14,608 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-02 15:23:14,608 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-02 15:23:14,608 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-02 15:23:14,608 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 15:23:14,608 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 15:23:14,609 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-02 15:23:14,609 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 15:23:14,609 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-02 15:23:14,609 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 15:23:14,609 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 15:23:14,609 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-02 15:23:14,609 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 15:23:14,609 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-02 15:23:14,609 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-02 15:23:14,610 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-02 15:23:14,610 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_0a4d20d8-8634-42af-a555-34922ba8612a/bin-2019/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 [2018-12-02 15:23:14,627 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 15:23:14,637 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 15:23:14,640 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 15:23:14,641 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 15:23:14,641 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 15:23:14,642 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_0a4d20d8-8634-42af-a555-34922ba8612a/bin-2019/uautomizer/../../sv-benchmarks/c/array-industry-pattern/array_shadowinit_true-unreach-call_true-termination.i [2018-12-02 15:23:14,679 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0a4d20d8-8634-42af-a555-34922ba8612a/bin-2019/uautomizer/data/016335af5/36378d333fa94966bb06ff0943a47216/FLAG714d3155f [2018-12-02 15:23:15,097 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 15:23:15,097 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_0a4d20d8-8634-42af-a555-34922ba8612a/sv-benchmarks/c/array-industry-pattern/array_shadowinit_true-unreach-call_true-termination.i [2018-12-02 15:23:15,101 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0a4d20d8-8634-42af-a555-34922ba8612a/bin-2019/uautomizer/data/016335af5/36378d333fa94966bb06ff0943a47216/FLAG714d3155f [2018-12-02 15:23:15,109 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_0a4d20d8-8634-42af-a555-34922ba8612a/bin-2019/uautomizer/data/016335af5/36378d333fa94966bb06ff0943a47216 [2018-12-02 15:23:15,111 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 15:23:15,111 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 15:23:15,112 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 15:23:15,112 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 15:23:15,114 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 15:23:15,114 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:23:15" (1/1) ... [2018-12-02 15:23:15,116 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14c56171 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:23:15, skipping insertion in model container [2018-12-02 15:23:15,116 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:23:15" (1/1) ... [2018-12-02 15:23:15,120 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 15:23:15,129 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 15:23:15,214 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 15:23:15,216 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 15:23:15,227 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 15:23:15,238 INFO L195 MainTranslator]: Completed translation [2018-12-02 15:23:15,238 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:23:15 WrapperNode [2018-12-02 15:23:15,238 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 15:23:15,239 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 15:23:15,239 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 15:23:15,239 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 15:23:15,243 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:23:15" (1/1) ... [2018-12-02 15:23:15,247 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:23:15" (1/1) ... [2018-12-02 15:23:15,257 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 15:23:15,258 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 15:23:15,258 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 15:23:15,258 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 15:23:15,263 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:23:15" (1/1) ... [2018-12-02 15:23:15,263 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:23:15" (1/1) ... [2018-12-02 15:23:15,264 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:23:15" (1/1) ... [2018-12-02 15:23:15,264 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:23:15" (1/1) ... [2018-12-02 15:23:15,294 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:23:15" (1/1) ... [2018-12-02 15:23:15,297 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:23:15" (1/1) ... [2018-12-02 15:23:15,298 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:23:15" (1/1) ... [2018-12-02 15:23:15,298 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 15:23:15,299 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 15:23:15,299 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 15:23:15,299 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 15:23:15,299 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:23:15" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0a4d20d8-8634-42af-a555-34922ba8612a/bin-2019/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 [2018-12-02 15:23:15,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 15:23:15,330 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 15:23:15,330 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 15:23:15,330 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 15:23:15,330 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-02 15:23:15,331 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 15:23:15,414 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 15:23:15,414 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-02 15:23:15,415 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:23:15 BoogieIcfgContainer [2018-12-02 15:23:15,415 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 15:23:15,415 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-02 15:23:15,415 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-02 15:23:15,417 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-02 15:23:15,418 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 15:23:15,418 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 02.12 03:23:15" (1/3) ... [2018-12-02 15:23:15,418 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7d433e21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.12 03:23:15, skipping insertion in model container [2018-12-02 15:23:15,418 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 15:23:15,418 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:23:15" (2/3) ... [2018-12-02 15:23:15,419 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7d433e21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.12 03:23:15, skipping insertion in model container [2018-12-02 15:23:15,419 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 15:23:15,419 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:23:15" (3/3) ... [2018-12-02 15:23:15,420 INFO L375 chiAutomizerObserver]: Analyzing ICFG array_shadowinit_true-unreach-call_true-termination.i [2018-12-02 15:23:15,449 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 15:23:15,449 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-02 15:23:15,449 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-02 15:23:15,449 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-02 15:23:15,449 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 15:23:15,449 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 15:23:15,449 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-02 15:23:15,450 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 15:23:15,450 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-02 15:23:15,457 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2018-12-02 15:23:15,469 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2018-12-02 15:23:15,469 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 15:23:15,470 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 15:23:15,473 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-12-02 15:23:15,473 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-12-02 15:23:15,473 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-02 15:23:15,474 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2018-12-02 15:23:15,474 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2018-12-02 15:23:15,474 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 15:23:15,474 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 15:23:15,475 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-12-02 15:23:15,475 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-12-02 15:23:15,479 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-12-02 15:23:15,479 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-12-02 15:23:15,483 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:23:15,483 INFO L82 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2018-12-02 15:23:15,484 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:23:15,484 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:23:15,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:23:15,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:23:15,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:23:15,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:23:15,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:23:15,547 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:23:15,547 INFO L82 PathProgramCache]: Analyzing trace with hash 45, now seen corresponding path program 1 times [2018-12-02 15:23:15,547 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:23:15,547 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:23:15,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:23:15,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:23:15,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:23:15,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:23:15,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:23:15,558 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:23:15,558 INFO L82 PathProgramCache]: Analyzing trace with hash 925612, now seen corresponding path program 1 times [2018-12-02 15:23:15,558 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:23:15,558 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:23:15,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:23:15,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:23:15,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:23:15,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:23:15,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:23:15,684 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 15:23:15,684 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 15:23:15,685 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 15:23:15,685 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 15:23:15,685 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 15:23:15,685 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 15:23:15,685 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 15:23:15,685 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 15:23:15,685 INFO L131 ssoRankerPreferences]: Filename of dumped script: array_shadowinit_true-unreach-call_true-termination.i_Iteration1_Lasso [2018-12-02 15:23:15,686 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 15:23:15,686 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 15:23:15,706 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:23:15,711 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:23:15,713 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:23:15,715 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:23:15,721 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:23:15,758 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:23:15,849 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 15:23:15,853 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 15:23:15,855 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-12-02 15:23:15,856 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 15:23:15,856 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 15:23:15,857 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 15:23:15,857 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 15:23:15,857 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 15:23:15,859 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 15:23:15,859 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 15:23:15,861 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 15:23:15,862 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-12-02 15:23:15,862 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 15:23:15,863 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 15:23:15,863 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 15:23:15,863 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 15:23:15,863 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 15:23:15,863 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 15:23:15,863 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 15:23:15,864 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 15:23:15,864 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-12-02 15:23:15,865 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 15:23:15,865 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 15:23:15,865 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 15:23:15,865 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 15:23:15,865 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 15:23:15,866 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 15:23:15,866 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 15:23:15,867 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 15:23:15,867 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-12-02 15:23:15,867 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 15:23:15,868 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 15:23:15,868 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 15:23:15,868 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 15:23:15,870 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 15:23:15,870 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 15:23:15,873 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 15:23:15,873 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-12-02 15:23:15,874 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 15:23:15,874 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 15:23:15,874 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 15:23:15,874 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 15:23:15,876 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 15:23:15,876 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 15:23:15,886 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 15:23:15,886 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-12-02 15:23:15,887 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 15:23:15,887 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 15:23:15,887 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 15:23:15,887 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 15:23:15,889 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 15:23:15,889 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 15:23:15,892 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 15:23:15,892 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-12-02 15:23:15,892 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 15:23:15,893 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 15:23:15,893 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 15:23:15,893 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 15:23:15,894 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 15:23:15,894 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 15:23:15,900 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 15:23:15,900 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-12-02 15:23:15,900 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 15:23:15,901 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 15:23:15,901 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 15:23:15,901 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 15:23:15,901 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 15:23:15,902 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 15:23:15,902 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 15:23:15,902 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 15:23:15,903 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-12-02 15:23:15,903 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 15:23:15,903 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 15:23:15,903 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 15:23:15,903 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 15:23:15,905 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 15:23:15,905 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 15:23:15,930 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 15:23:15,947 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-12-02 15:23:15,948 INFO L444 ModelExtractionUtils]: 12 out of 19 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-12-02 15:23:15,949 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 15:23:15,950 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-02 15:23:15,950 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 15:23:15,951 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-12-02 15:23:15,953 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2018-12-02 15:23:15,958 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-02 15:23:15,968 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:23:15,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:23:15,977 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:23:15,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:23:15,985 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:23:15,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:23:15,995 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-12-02 15:23:15,995 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states. Second operand 2 states. [2018-12-02 15:23:16,022 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-12-02 15:23:16,022 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-12-02 15:23:16,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-12-02 15:23:16,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2018-12-02 15:23:16,024 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 3 letters. Loop has 1 letters. [2018-12-02 15:23:16,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 15:23:16,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 4 letters. Loop has 1 letters. [2018-12-02 15:23:16,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 15:23:16,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 3 letters. Loop has 2 letters. [2018-12-02 15:23:16,026 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 15:23:16,026 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 45 transitions. [2018-12-02 15:23:16,028 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-02 15:23:16,030 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 9 states and 11 transitions. [2018-12-02 15:23:16,031 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2018-12-02 15:23:16,031 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2018-12-02 15:23:16,031 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 11 transitions. [2018-12-02 15:23:16,031 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 15:23:16,032 INFO L705 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2018-12-02 15:23:16,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 11 transitions. [2018-12-02 15:23:16,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-12-02 15:23:16,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-02 15:23:16,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. [2018-12-02 15:23:16,048 INFO L728 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2018-12-02 15:23:16,048 INFO L608 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2018-12-02 15:23:16,048 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-02 15:23:16,048 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 11 transitions. [2018-12-02 15:23:16,049 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-02 15:23:16,049 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 15:23:16,049 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 15:23:16,049 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-02 15:23:16,049 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-02 15:23:16,049 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-12-02 15:23:16,049 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-12-02 15:23:16,050 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:23:16,050 INFO L82 PathProgramCache]: Analyzing trace with hash 28693928, now seen corresponding path program 1 times [2018-12-02 15:23:16,050 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:23:16,050 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:23:16,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:23:16,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:23:16,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:23:16,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:23:16,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:23:16,073 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:23:16,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 15:23:16,074 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 15:23:16,074 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:23:16,075 INFO L82 PathProgramCache]: Analyzing trace with hash 56828, now seen corresponding path program 1 times [2018-12-02 15:23:16,075 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:23:16,075 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:23:16,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:23:16,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:23:16,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:23:16,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:23:16,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:23:16,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 15:23:16,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 15:23:16,130 INFO L87 Difference]: Start difference. First operand 9 states and 11 transitions. cyclomatic complexity: 4 Second operand 3 states. [2018-12-02 15:23:16,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:23:16,142 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2018-12-02 15:23:16,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 15:23:16,143 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 10 transitions. [2018-12-02 15:23:16,144 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-02 15:23:16,144 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 9 states and 10 transitions. [2018-12-02 15:23:16,144 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2018-12-02 15:23:16,144 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2018-12-02 15:23:16,144 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 10 transitions. [2018-12-02 15:23:16,144 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 15:23:16,145 INFO L705 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2018-12-02 15:23:16,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 10 transitions. [2018-12-02 15:23:16,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-12-02 15:23:16,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-02 15:23:16,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2018-12-02 15:23:16,146 INFO L728 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2018-12-02 15:23:16,146 INFO L608 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2018-12-02 15:23:16,146 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-02 15:23:16,146 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 10 transitions. [2018-12-02 15:23:16,146 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-02 15:23:16,146 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 15:23:16,146 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 15:23:16,147 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-12-02 15:23:16,147 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-02 15:23:16,147 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-12-02 15:23:16,147 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-12-02 15:23:16,147 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:23:16,147 INFO L82 PathProgramCache]: Analyzing trace with hash 889513522, now seen corresponding path program 1 times [2018-12-02 15:23:16,147 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:23:16,148 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:23:16,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:23:16,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:23:16,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:23:16,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:23:16,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:23:16,161 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:23:16,161 INFO L82 PathProgramCache]: Analyzing trace with hash 56828, now seen corresponding path program 2 times [2018-12-02 15:23:16,161 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:23:16,161 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:23:16,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:23:16,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:23:16,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:23:16,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:23:16,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:23:16,169 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:23:16,169 INFO L82 PathProgramCache]: Analyzing trace with hash -450855381, now seen corresponding path program 1 times [2018-12-02 15:23:16,169 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:23:16,169 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:23:16,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:23:16,170 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 15:23:16,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:23:16,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:23:16,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:23:16,329 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 15:23:16,329 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 15:23:16,329 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 15:23:16,329 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 15:23:16,329 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 15:23:16,329 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 15:23:16,330 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 15:23:16,330 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 15:23:16,330 INFO L131 ssoRankerPreferences]: Filename of dumped script: array_shadowinit_true-unreach-call_true-termination.i_Iteration3_Lasso [2018-12-02 15:23:16,330 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 15:23:16,330 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 15:23:16,332 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:23:16,338 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:23:16,339 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:23:16,385 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:23:16,386 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:23:16,387 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:23:16,389 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:23:16,483 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 15:23:16,483 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 15:23:16,483 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-12-02 15:23:16,484 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 15:23:16,484 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 15:23:16,484 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 15:23:16,484 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 15:23:16,485 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 15:23:16,485 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 15:23:16,485 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 15:23:16,487 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 15:23:16,488 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-12-02 15:23:16,488 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 15:23:16,488 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 15:23:16,488 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 15:23:16,489 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 15:23:16,489 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 15:23:16,489 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 15:23:16,489 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 15:23:16,490 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 15:23:16,490 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-12-02 15:23:16,490 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 15:23:16,490 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 15:23:16,490 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 15:23:16,490 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 15:23:16,493 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 15:23:16,493 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 15:23:16,510 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 15:23:16,526 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-12-02 15:23:16,526 INFO L444 ModelExtractionUtils]: 17 out of 25 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-12-02 15:23:16,527 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 15:23:16,528 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-02 15:23:16,528 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 15:23:16,528 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-12-02 15:23:16,530 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2018-12-02 15:23:16,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:23:16,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:23:16,565 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:23:16,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:23:16,570 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:23:16,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:23:16,577 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-12-02 15:23:16,577 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 9 states and 10 transitions. cyclomatic complexity: 3 Second operand 3 states. [2018-12-02 15:23:16,584 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-12-02 15:23:16,584 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-12-02 15:23:16,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-02 15:23:16,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2018-12-02 15:23:16,585 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 6 letters. Loop has 3 letters. [2018-12-02 15:23:16,585 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 15:23:16,585 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 9 letters. Loop has 3 letters. [2018-12-02 15:23:16,585 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 15:23:16,585 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 6 letters. Loop has 6 letters. [2018-12-02 15:23:16,586 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 15:23:16,586 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 14 transitions. [2018-12-02 15:23:16,586 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-02 15:23:16,587 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 0 states and 0 transitions. [2018-12-02 15:23:16,587 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-02 15:23:16,587 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-02 15:23:16,587 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-02 15:23:16,587 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 15:23:16,587 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 15:23:16,587 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 15:23:16,587 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 15:23:16,587 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-02 15:23:16,587 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-02 15:23:16,588 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-02 15:23:16,588 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-02 15:23:16,593 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 02.12 03:23:16 BoogieIcfgContainer [2018-12-02 15:23:16,593 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-02 15:23:16,593 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 15:23:16,594 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 15:23:16,594 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 15:23:16,594 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:23:15" (3/4) ... [2018-12-02 15:23:16,597 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-02 15:23:16,597 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 15:23:16,598 INFO L168 Benchmark]: Toolchain (without parser) took 1487.09 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.4 MB). Free memory was 957.1 MB in the beginning and 892.0 MB in the end (delta: 65.0 MB). Peak memory consumption was 191.4 MB. Max. memory is 11.5 GB. [2018-12-02 15:23:16,600 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 15:23:16,600 INFO L168 Benchmark]: CACSL2BoogieTranslator took 126.40 ms. Allocated memory is still 1.0 GB. Free memory was 957.1 MB in the beginning and 946.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-02 15:23:16,601 INFO L168 Benchmark]: Boogie Procedure Inliner took 18.99 ms. Allocated memory is still 1.0 GB. Free memory is still 946.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 15:23:16,601 INFO L168 Benchmark]: Boogie Preprocessor took 40.90 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.4 MB). Free memory was 946.3 MB in the beginning and 1.1 GB in the end (delta: -175.2 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. [2018-12-02 15:23:16,602 INFO L168 Benchmark]: RCFGBuilder took 116.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. [2018-12-02 15:23:16,602 INFO L168 Benchmark]: BuchiAutomizer took 1178.04 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 892.0 MB in the end (delta: 215.1 MB). Peak memory consumption was 215.1 MB. Max. memory is 11.5 GB. [2018-12-02 15:23:16,603 INFO L168 Benchmark]: Witness Printer took 3.98 ms. Allocated memory is still 1.2 GB. Free memory is still 892.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 15:23:16,606 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 126.40 ms. Allocated memory is still 1.0 GB. Free memory was 957.1 MB in the beginning and 946.3 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 18.99 ms. Allocated memory is still 1.0 GB. Free memory is still 946.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 40.90 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.4 MB). Free memory was 946.3 MB in the beginning and 1.1 GB in the end (delta: -175.2 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 116.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 1178.04 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 892.0 MB in the end (delta: 215.1 MB). Peak memory consumption was 215.1 MB. Max. memory is 11.5 GB. * Witness Printer took 3.98 ms. Allocated memory is still 1.2 GB. Free memory is still 892.0 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 1.1s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 0.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: 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: 7ms 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...