./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/loop-lit/mcmillan2006_true-unreach-call_true-termination.c.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_2061e01b-5d60-45dc-8aaa-4ce2f3d719cf/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_2061e01b-5d60-45dc-8aaa-4ce2f3d719cf/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_2061e01b-5d60-45dc-8aaa-4ce2f3d719cf/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_2061e01b-5d60-45dc-8aaa-4ce2f3d719cf/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/loop-lit/mcmillan2006_true-unreach-call_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_2061e01b-5d60-45dc-8aaa-4ce2f3d719cf/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_2061e01b-5d60-45dc-8aaa-4ce2f3d719cf/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 025e0289c8e9b33528493c96bf0a22ba3200731b ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:07:51,803 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 15:07:51,804 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 15:07:51,811 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 15:07:51,811 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 15:07:51,811 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 15:07:51,812 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 15:07:51,813 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 15:07:51,813 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 15:07:51,814 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 15:07:51,814 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 15:07:51,815 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 15:07:51,815 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 15:07:51,816 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 15:07:51,816 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 15:07:51,817 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 15:07:51,817 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 15:07:51,818 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 15:07:51,819 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 15:07:51,820 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 15:07:51,820 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 15:07:51,821 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 15:07:51,822 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 15:07:51,822 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 15:07:51,822 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 15:07:51,823 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 15:07:51,823 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 15:07:51,824 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 15:07:51,824 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 15:07:51,825 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 15:07:51,825 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 15:07:51,825 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 15:07:51,825 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 15:07:51,825 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 15:07:51,826 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 15:07:51,826 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 15:07:51,826 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_2061e01b-5d60-45dc-8aaa-4ce2f3d719cf/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-12-02 15:07:51,834 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 15:07:51,834 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 15:07:51,835 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 15:07:51,835 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 15:07:51,835 INFO L133 SettingsManager]: * Use SBE=true [2018-12-02 15:07:51,836 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-02 15:07:51,836 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-02 15:07:51,836 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-02 15:07:51,836 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-02 15:07:51,836 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-02 15:07:51,836 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-02 15:07:51,836 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 15:07:51,836 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 15:07:51,836 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-02 15:07:51,837 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 15:07:51,837 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 15:07:51,837 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 15:07:51,837 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-02 15:07:51,837 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-02 15:07:51,837 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-02 15:07:51,837 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 15:07:51,837 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 15:07:51,837 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-02 15:07:51,838 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 15:07:51,838 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-02 15:07:51,838 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 15:07:51,838 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 15:07:51,838 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-02 15:07:51,838 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 15:07:51,838 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-02 15:07:51,838 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-02 15:07:51,839 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-02 15:07:51,839 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_2061e01b-5d60-45dc-8aaa-4ce2f3d719cf/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 -> 025e0289c8e9b33528493c96bf0a22ba3200731b [2018-12-02 15:07:51,856 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 15:07:51,863 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 15:07:51,865 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 15:07:51,866 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 15:07:51,866 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 15:07:51,866 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_2061e01b-5d60-45dc-8aaa-4ce2f3d719cf/bin-2019/uautomizer/../../sv-benchmarks/c/loop-lit/mcmillan2006_true-unreach-call_true-termination.c.i [2018-12-02 15:07:51,901 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2061e01b-5d60-45dc-8aaa-4ce2f3d719cf/bin-2019/uautomizer/data/e83e0e206/1f1cf384001f4407adccd0b9f7cd9084/FLAG9a3a94584 [2018-12-02 15:07:52,339 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 15:07:52,339 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_2061e01b-5d60-45dc-8aaa-4ce2f3d719cf/sv-benchmarks/c/loop-lit/mcmillan2006_true-unreach-call_true-termination.c.i [2018-12-02 15:07:52,343 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2061e01b-5d60-45dc-8aaa-4ce2f3d719cf/bin-2019/uautomizer/data/e83e0e206/1f1cf384001f4407adccd0b9f7cd9084/FLAG9a3a94584 [2018-12-02 15:07:52,351 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_2061e01b-5d60-45dc-8aaa-4ce2f3d719cf/bin-2019/uautomizer/data/e83e0e206/1f1cf384001f4407adccd0b9f7cd9084 [2018-12-02 15:07:52,353 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 15:07:52,355 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 15:07:52,355 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 15:07:52,356 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 15:07:52,358 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 15:07:52,359 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:07:52" (1/1) ... [2018-12-02 15:07:52,360 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@537737cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:07:52, skipping insertion in model container [2018-12-02 15:07:52,360 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:07:52" (1/1) ... [2018-12-02 15:07:52,366 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 15:07:52,378 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 15:07:52,467 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 15:07:52,473 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 15:07:52,482 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 15:07:52,491 INFO L195 MainTranslator]: Completed translation [2018-12-02 15:07:52,491 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:07:52 WrapperNode [2018-12-02 15:07:52,491 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 15:07:52,492 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 15:07:52,492 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 15:07:52,492 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 15:07:52,496 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:07:52" (1/1) ... [2018-12-02 15:07:52,501 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:07:52" (1/1) ... [2018-12-02 15:07:52,511 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 15:07:52,511 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 15:07:52,511 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 15:07:52,511 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 15:07:52,546 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:07:52" (1/1) ... [2018-12-02 15:07:52,547 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:07:52" (1/1) ... [2018-12-02 15:07:52,548 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:07:52" (1/1) ... [2018-12-02 15:07:52,548 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:07:52" (1/1) ... [2018-12-02 15:07:52,552 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:07:52" (1/1) ... [2018-12-02 15:07:52,555 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:07:52" (1/1) ... [2018-12-02 15:07:52,556 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:07:52" (1/1) ... [2018-12-02 15:07:52,557 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 15:07:52,557 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 15:07:52,557 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 15:07:52,558 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 15:07:52,558 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:07:52" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2061e01b-5d60-45dc-8aaa-4ce2f3d719cf/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:07:52,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 15:07:52,591 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 15:07:52,592 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 15:07:52,592 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 15:07:52,592 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-02 15:07:52,681 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 15:07:52,681 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-02 15:07:52,682 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:07:52 BoogieIcfgContainer [2018-12-02 15:07:52,682 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 15:07:52,682 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-02 15:07:52,682 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-02 15:07:52,684 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-02 15:07:52,685 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 15:07:52,685 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 02.12 03:07:52" (1/3) ... [2018-12-02 15:07:52,686 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@40c2547d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.12 03:07:52, skipping insertion in model container [2018-12-02 15:07:52,686 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 15:07:52,686 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:07:52" (2/3) ... [2018-12-02 15:07:52,686 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@40c2547d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.12 03:07:52, skipping insertion in model container [2018-12-02 15:07:52,686 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 15:07:52,686 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:07:52" (3/3) ... [2018-12-02 15:07:52,687 INFO L375 chiAutomizerObserver]: Analyzing ICFG mcmillan2006_true-unreach-call_true-termination.c.i [2018-12-02 15:07:52,722 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 15:07:52,722 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-02 15:07:52,722 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-02 15:07:52,722 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-02 15:07:52,722 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 15:07:52,722 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 15:07:52,722 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-02 15:07:52,723 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 15:07:52,723 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-02 15:07:52,731 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2018-12-02 15:07:52,743 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2018-12-02 15:07:52,743 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 15:07:52,743 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 15:07:52,747 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-12-02 15:07:52,747 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 15:07:52,747 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-02 15:07:52,747 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2018-12-02 15:07:52,748 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2018-12-02 15:07:52,748 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 15:07:52,748 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 15:07:52,749 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-12-02 15:07:52,749 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 15:07:52,755 INFO L794 eck$LassoCheckResult]: Stem: 8#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 7#L-1true havoc main_#res;havoc main_#t~nondet1, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~post3, main_~i~0, main_#t~mem5, main_#t~post4, main_~i~1, main_~n~0, main_~x~0.base, main_~x~0.offset;main_~n~0 := main_#t~nondet1;havoc main_#t~nondet1; 15#L14true assume !!(0 <= main_~n~0 && main_~n~0 <= 1000);call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4 * main_~n~0);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;main_~i~0 := 0; 11#L16-3true [2018-12-02 15:07:52,756 INFO L796 eck$LassoCheckResult]: Loop: 11#L16-3true assume !!(main_~i~0 < main_~n~0);call write~int(0, main_~x~0.base, main_~x~0.offset + 4 * main_~i~0, 4); 16#L16-2true main_#t~post3 := main_~i~0;main_~i~0 := 1 + main_#t~post3;havoc main_#t~post3; 11#L16-3true [2018-12-02 15:07:52,762 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:07:52,762 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2018-12-02 15:07:52,764 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:07:52,764 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:07:52,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:07:52,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:07:52,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:07:52,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:07:52,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:07:52,829 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:07:52,830 INFO L82 PathProgramCache]: Analyzing trace with hash 1443, now seen corresponding path program 1 times [2018-12-02 15:07:52,830 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:07:52,830 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:07:52,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:07:52,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:07:52,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:07:52,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:07:52,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:07:52,843 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:07:52,843 INFO L82 PathProgramCache]: Analyzing trace with hash 28695942, now seen corresponding path program 1 times [2018-12-02 15:07:52,843 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:07:52,843 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:07:52,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:07:52,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:07:52,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:07:52,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:07:52,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:07:52,959 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 15:07:52,960 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 15:07:52,960 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 15:07:52,960 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 15:07:52,960 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 15:07:52,961 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 15:07:52,961 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 15:07:52,961 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 15:07:52,961 INFO L131 ssoRankerPreferences]: Filename of dumped script: mcmillan2006_true-unreach-call_true-termination.c.i_Iteration1_Lasso [2018-12-02 15:07:52,961 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 15:07:52,961 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 15:07:52,975 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:07:52,979 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:07:52,980 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:07:52,981 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:07:52,984 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:07:53,053 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:07:53,055 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:07:53,056 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:07:53,057 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:07:53,169 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 15:07:53,172 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 15:07:53,174 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:07:53,174 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 15:07:53,175 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 15:07:53,175 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 15:07:53,175 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 15:07:53,175 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 15:07:53,176 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 15:07:53,176 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 15:07:53,179 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 15:07:53,179 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:07:53,179 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 15:07:53,179 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 15:07:53,179 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 15:07:53,180 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 15:07:53,180 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 15:07:53,180 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 15:07:53,180 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 15:07:53,180 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 15:07:53,181 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:07:53,181 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 15:07:53,181 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 15:07:53,181 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 15:07:53,181 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 15:07:53,181 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 15:07:53,182 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 15:07:53,182 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 15:07:53,182 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 15:07:53,182 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:07:53,183 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 15:07:53,183 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 15:07:53,183 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 15:07:53,183 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 15:07:53,184 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 15:07:53,184 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 15:07:53,187 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 15:07:53,187 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:07:53,188 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 15:07:53,188 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 15:07:53,188 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 15:07:53,188 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 15:07:53,190 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 15:07:53,190 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 15:07:53,199 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 15:07:53,199 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:07:53,199 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 15:07:53,200 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 15:07:53,200 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 15:07:53,200 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 15:07:53,200 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 15:07:53,200 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 15:07:53,200 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 15:07:53,201 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 15:07:53,201 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:07:53,201 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 15:07:53,202 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 15:07:53,202 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 15:07:53,202 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 15:07:53,205 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 15:07:53,205 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 15:07:53,231 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 15:07:53,259 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-12-02 15:07:53,259 INFO L444 ModelExtractionUtils]: 15 out of 22 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-12-02 15:07:53,260 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 15:07:53,262 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-02 15:07:53,262 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 15:07:53,262 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0.offset, v_rep(select #length ULTIMATE.start_main_~x~0.base)_1, ULTIMATE.start_main_~i~0) = -1*ULTIMATE.start_main_~x~0.offset + 1*v_rep(select #length ULTIMATE.start_main_~x~0.base)_1 - 4*ULTIMATE.start_main_~i~0 Supporting invariants [] [2018-12-02 15:07:53,267 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-12-02 15:07:53,273 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-02 15:07:53,287 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:07:53,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:07:53,297 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:07:53,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:07:53,307 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:07:53,325 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:07:53,334 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:07:53,335 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states. Second operand 3 states. [2018-12-02 15:07:53,364 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states.. Second operand 3 states. Result 40 states and 51 transitions. Complement of second has 7 states. [2018-12-02 15:07:53,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-02 15:07:53,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-02 15:07:53,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 34 transitions. [2018-12-02 15:07:53,367 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 3 letters. Loop has 2 letters. [2018-12-02 15:07:53,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 15:07:53,368 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 5 letters. Loop has 2 letters. [2018-12-02 15:07:53,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 15:07:53,368 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 3 letters. Loop has 4 letters. [2018-12-02 15:07:53,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 15:07:53,369 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 51 transitions. [2018-12-02 15:07:53,371 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-02 15:07:53,373 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 11 states and 13 transitions. [2018-12-02 15:07:53,373 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2018-12-02 15:07:53,374 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-12-02 15:07:53,374 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 13 transitions. [2018-12-02 15:07:53,374 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 15:07:53,374 INFO L705 BuchiCegarLoop]: Abstraction has 11 states and 13 transitions. [2018-12-02 15:07:53,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 13 transitions. [2018-12-02 15:07:53,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-12-02 15:07:53,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-02 15:07:53,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2018-12-02 15:07:53,390 INFO L728 BuchiCegarLoop]: Abstraction has 11 states and 13 transitions. [2018-12-02 15:07:53,390 INFO L608 BuchiCegarLoop]: Abstraction has 11 states and 13 transitions. [2018-12-02 15:07:53,390 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-02 15:07:53,390 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 13 transitions. [2018-12-02 15:07:53,391 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-02 15:07:53,391 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 15:07:53,391 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 15:07:53,391 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-02 15:07:53,391 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-02 15:07:53,391 INFO L794 eck$LassoCheckResult]: Stem: 115#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 111#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~post3, main_~i~0, main_#t~mem5, main_#t~post4, main_~i~1, main_~n~0, main_~x~0.base, main_~x~0.offset;main_~n~0 := main_#t~nondet1;havoc main_#t~nondet1; 112#L14 assume !!(0 <= main_~n~0 && main_~n~0 <= 1000);call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4 * main_~n~0);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;main_~i~0 := 0; 117#L16-3 assume !(main_~i~0 < main_~n~0); 116#L16-4 main_~i~1 := 0; 110#L17-3 [2018-12-02 15:07:53,391 INFO L796 eck$LassoCheckResult]: Loop: 110#L17-3 assume !!(main_~i~1 < main_~n~0);call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset + 4 * main_~i~1, 4);__VERIFIER_assert_#in~cond := (if 0 == main_#t~mem5 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 113#L5 assume !(0 == __VERIFIER_assert_~cond); 114#L5-2 havoc main_#t~mem5; 109#L17-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 110#L17-3 [2018-12-02 15:07:53,392 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:07:53,392 INFO L82 PathProgramCache]: Analyzing trace with hash 28695884, now seen corresponding path program 1 times [2018-12-02 15:07:53,392 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:07:53,392 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:07:53,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:07:53,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:07:53,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:07:53,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:07:53,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:07:53,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:07:53,401 INFO L82 PathProgramCache]: Analyzing trace with hash 1823306, now seen corresponding path program 1 times [2018-12-02 15:07:53,401 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:07:53,402 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:07:53,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:07:53,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:07:53,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:07:53,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:07:53,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:07:53,411 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:07:53,411 INFO L82 PathProgramCache]: Analyzing trace with hash 1304171029, now seen corresponding path program 1 times [2018-12-02 15:07:53,411 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:07:53,411 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:07:53,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:07:53,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:07:53,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:07:53,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:07:53,452 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:07:53,453 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:07:53,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 15:07:53,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 15:07:53,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 15:07:53,504 INFO L87 Difference]: Start difference. First operand 11 states and 13 transitions. cyclomatic complexity: 4 Second operand 4 states. [2018-12-02 15:07:53,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:07:53,525 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2018-12-02 15:07:53,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 15:07:53,526 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 15 transitions. [2018-12-02 15:07:53,526 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-02 15:07:53,527 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 12 states and 13 transitions. [2018-12-02 15:07:53,527 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-12-02 15:07:53,527 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-12-02 15:07:53,527 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 13 transitions. [2018-12-02 15:07:53,527 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 15:07:53,527 INFO L705 BuchiCegarLoop]: Abstraction has 12 states and 13 transitions. [2018-12-02 15:07:53,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 13 transitions. [2018-12-02 15:07:53,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2018-12-02 15:07:53,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-02 15:07:53,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2018-12-02 15:07:53,528 INFO L728 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2018-12-02 15:07:53,528 INFO L608 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2018-12-02 15:07:53,528 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-02 15:07:53,528 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 12 transitions. [2018-12-02 15:07:53,529 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-02 15:07:53,529 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 15:07:53,529 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 15:07:53,529 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:07:53,529 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-02 15:07:53,529 INFO L794 eck$LassoCheckResult]: Stem: 151#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 147#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~post3, main_~i~0, main_#t~mem5, main_#t~post4, main_~i~1, main_~n~0, main_~x~0.base, main_~x~0.offset;main_~n~0 := main_#t~nondet1;havoc main_#t~nondet1; 148#L14 assume !!(0 <= main_~n~0 && main_~n~0 <= 1000);call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4 * main_~n~0);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;main_~i~0 := 0; 153#L16-3 assume !!(main_~i~0 < main_~n~0);call write~int(0, main_~x~0.base, main_~x~0.offset + 4 * main_~i~0, 4); 154#L16-2 main_#t~post3 := main_~i~0;main_~i~0 := 1 + main_#t~post3;havoc main_#t~post3; 155#L16-3 assume !(main_~i~0 < main_~n~0); 152#L16-4 main_~i~1 := 0; 146#L17-3 [2018-12-02 15:07:53,529 INFO L796 eck$LassoCheckResult]: Loop: 146#L17-3 assume !!(main_~i~1 < main_~n~0);call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset + 4 * main_~i~1, 4);__VERIFIER_assert_#in~cond := (if 0 == main_#t~mem5 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 149#L5 assume !(0 == __VERIFIER_assert_~cond); 150#L5-2 havoc main_#t~mem5; 145#L17-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 146#L17-3 [2018-12-02 15:07:53,529 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:07:53,529 INFO L82 PathProgramCache]: Analyzing trace with hash 1806996910, now seen corresponding path program 1 times [2018-12-02 15:07:53,530 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:07:53,530 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:07:53,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:07:53,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:07:53,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:07:53,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:07:53,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:07:53,539 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:07:53,539 INFO L82 PathProgramCache]: Analyzing trace with hash 1823306, now seen corresponding path program 2 times [2018-12-02 15:07:53,539 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:07:53,539 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:07:53,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:07:53,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:07:53,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:07:53,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:07:53,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:07:53,544 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:07:53,544 INFO L82 PathProgramCache]: Analyzing trace with hash -1358706313, now seen corresponding path program 1 times [2018-12-02 15:07:53,545 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:07:53,545 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:07:53,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:07:53,545 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 15:07:53,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:07:53,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:07:53,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:07:53,684 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 15:07:53,684 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 15:07:53,684 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 15:07:53,685 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 15:07:53,685 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 15:07:53,685 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 15:07:53,685 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 15:07:53,685 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 15:07:53,685 INFO L131 ssoRankerPreferences]: Filename of dumped script: mcmillan2006_true-unreach-call_true-termination.c.i_Iteration3_Lasso [2018-12-02 15:07:53,685 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 15:07:53,685 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 15:07:53,687 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:07:53,688 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:07:53,689 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:07:53,690 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:07:53,692 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:07:53,693 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:07:53,696 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:07:53,766 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:07:53,768 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:07:53,892 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 15:07:53,892 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 15:07:53,893 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:07:53,893 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 15:07:53,893 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 15:07:53,893 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 15:07:53,893 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 15:07:53,893 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 15:07:53,894 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 15:07:53,894 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 15:07:53,894 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 15:07:53,894 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:07:53,895 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 15:07:53,895 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 15:07:53,895 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 15:07:53,895 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 15:07:53,895 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 15:07:53,895 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 15:07:53,895 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 15:07:53,895 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 15:07:53,896 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:07:53,896 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 15:07:53,896 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 15:07:53,896 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 15:07:53,896 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 15:07:53,896 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 15:07:53,896 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 15:07:53,896 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 15:07:53,897 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 15:07:53,897 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:07:53,897 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 15:07:53,897 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 15:07:53,897 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 15:07:53,897 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 15:07:53,898 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 15:07:53,898 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 15:07:53,899 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 15:07:53,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:07:53,900 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 15:07:53,900 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 15:07:53,900 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 15:07:53,900 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 15:07:53,900 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 15:07:53,901 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 15:07:53,901 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 15:07:53,901 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 15:07:53,902 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:07:53,902 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 15:07:53,902 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 15:07:53,902 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 15:07:53,903 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 15:07:53,903 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 15:07:53,903 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 15:07:53,903 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 15:07:53,905 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 15:07:53,905 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:07:53,906 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 15:07:53,906 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 15:07:53,906 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 15:07:53,906 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 15:07:53,908 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 15:07:53,908 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 15:07:53,913 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 15:07:53,913 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:07:53,914 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 15:07:53,914 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 15:07:53,914 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 15:07:53,914 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 15:07:53,915 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 15:07:53,915 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 15:07:53,920 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 15:07:53,921 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:07:53,921 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 15:07:53,921 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 15:07:53,922 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 15:07:53,922 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 15:07:53,924 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 15:07:53,924 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 15:07:53,942 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 15:07:53,966 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2018-12-02 15:07:53,966 INFO L444 ModelExtractionUtils]: 14 out of 25 variables were initially zero. Simplification set additionally 7 variables to zero. [2018-12-02 15:07:53,967 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 15:07:53,968 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-02 15:07:53,968 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 15:07:53,968 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~x~0.base)_2, ULTIMATE.start_main_~x~0.offset, ULTIMATE.start_main_~i~1) = 1*v_rep(select #length ULTIMATE.start_main_~x~0.base)_2 - 1*ULTIMATE.start_main_~x~0.offset - 4*ULTIMATE.start_main_~i~1 Supporting invariants [] [2018-12-02 15:07:53,975 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-12-02 15:07:53,977 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-02 15:07:53,995 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:07:54,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:07:54,003 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:07:54,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:07:54,007 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:07:54,017 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:07:54,017 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:07:54,018 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 12 transitions. cyclomatic complexity: 3 Second operand 3 states. [2018-12-02 15:07:54,025 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 12 transitions. cyclomatic complexity: 3. Second operand 3 states. Result 15 states and 17 transitions. Complement of second has 4 states. [2018-12-02 15:07:54,026 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:07:54,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-02 15:07:54,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2018-12-02 15:07:54,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 7 letters. Loop has 4 letters. [2018-12-02 15:07:54,026 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 15:07:54,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 11 letters. Loop has 4 letters. [2018-12-02 15:07:54,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 15:07:54,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 7 letters. Loop has 8 letters. [2018-12-02 15:07:54,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 15:07:54,027 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 17 transitions. [2018-12-02 15:07:54,028 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-02 15:07:54,028 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 0 states and 0 transitions. [2018-12-02 15:07:54,028 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-02 15:07:54,028 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-02 15:07:54,028 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-02 15:07:54,028 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 15:07:54,028 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 15:07:54,028 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 15:07:54,029 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 15:07:54,029 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-02 15:07:54,029 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-02 15:07:54,029 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-02 15:07:54,029 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-02 15:07:54,033 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 02.12 03:07:54 BoogieIcfgContainer [2018-12-02 15:07:54,033 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-02 15:07:54,034 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 15:07:54,034 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 15:07:54,034 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 15:07:54,034 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:07:52" (3/4) ... [2018-12-02 15:07:54,037 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-02 15:07:54,037 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 15:07:54,037 INFO L168 Benchmark]: Toolchain (without parser) took 1683.54 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.0 MB). Free memory was 954.4 MB in the beginning and 832.9 MB in the end (delta: 121.5 MB). Peak memory consumption was 251.5 MB. Max. memory is 11.5 GB. [2018-12-02 15:07:54,039 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 15:07:54,039 INFO L168 Benchmark]: CACSL2BoogieTranslator took 136.01 ms. Allocated memory is still 1.0 GB. Free memory was 954.4 MB in the beginning and 942.6 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. [2018-12-02 15:07:54,039 INFO L168 Benchmark]: Boogie Procedure Inliner took 19.29 ms. Allocated memory is still 1.0 GB. Free memory is still 942.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 15:07:54,040 INFO L168 Benchmark]: Boogie Preprocessor took 45.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.0 MB). Free memory was 942.6 MB in the beginning and 1.1 GB in the end (delta: -182.3 MB). Peak memory consumption was 15.8 MB. Max. memory is 11.5 GB. [2018-12-02 15:07:54,040 INFO L168 Benchmark]: RCFGBuilder took 124.52 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: 15.0 MB). Peak memory consumption was 15.0 MB. Max. memory is 11.5 GB. [2018-12-02 15:07:54,041 INFO L168 Benchmark]: BuchiAutomizer took 1351.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 832.9 MB in the end (delta: 277.0 MB). Peak memory consumption was 277.0 MB. Max. memory is 11.5 GB. [2018-12-02 15:07:54,041 INFO L168 Benchmark]: Witness Printer took 3.29 ms. Allocated memory is still 1.2 GB. Free memory is still 832.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 15:07:54,043 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 136.01 ms. Allocated memory is still 1.0 GB. Free memory was 954.4 MB in the beginning and 942.6 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 19.29 ms. Allocated memory is still 1.0 GB. Free memory is still 942.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 45.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.0 MB). Free memory was 942.6 MB in the beginning and 1.1 GB in the end (delta: -182.3 MB). Peak memory consumption was 15.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 124.52 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: 15.0 MB). Peak memory consumption was 15.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 1351.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 832.9 MB in the end (delta: 277.0 MB). Peak memory consumption was 277.0 MB. Max. memory is 11.5 GB. * Witness Printer took 3.29 ms. Allocated memory is still 1.2 GB. Free memory is still 832.9 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 - 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 -1 * x + unknown-#length-unknown[x] + -4 * i and consists of 5 locations. One deterministic module has affine ranking function unknown-#length-unknown[x] + -1 * x + -4 * i and consists of 3 locations. 1 modules have a trivial ranking function, the largest among these consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.3s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 1.0s. 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, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 11 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 32 SDtfs, 30 SDslu, 30 SDs, 0 SdLazy, 26 SolverSat, 4 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital110 mio100 ax100 hnf99 lsp91 ukn84 mio100 lsp65 div100 bol100 ite100 ukn100 eq165 hnf90 smp92 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 11ms VariablesStem: 2 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...