./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/array-memsafety/cstrncmp-alloca_true-valid-memsafety_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_b46a765a-985b-4399-8574-02f0bd75d4fd/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_b46a765a-985b-4399-8574-02f0bd75d4fd/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_b46a765a-985b-4399-8574-02f0bd75d4fd/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_b46a765a-985b-4399-8574-02f0bd75d4fd/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/cstrncmp-alloca_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_b46a765a-985b-4399-8574-02f0bd75d4fd/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_b46a765a-985b-4399-8574-02f0bd75d4fd/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 60847b137b78d6fc8305d5c5fcc8bf5228130e36 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 11:52:47,743 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 11:52:47,744 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 11:52:47,750 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 11:52:47,750 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 11:52:47,751 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 11:52:47,751 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 11:52:47,752 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 11:52:47,753 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 11:52:47,754 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 11:52:47,754 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 11:52:47,754 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 11:52:47,755 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 11:52:47,755 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 11:52:47,756 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 11:52:47,756 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 11:52:47,756 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 11:52:47,757 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 11:52:47,758 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 11:52:47,759 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 11:52:47,759 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 11:52:47,760 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 11:52:47,761 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 11:52:47,761 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 11:52:47,761 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 11:52:47,761 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 11:52:47,762 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 11:52:47,762 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 11:52:47,763 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 11:52:47,763 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 11:52:47,763 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 11:52:47,764 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 11:52:47,764 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 11:52:47,764 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 11:52:47,764 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 11:52:47,765 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 11:52:47,765 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_b46a765a-985b-4399-8574-02f0bd75d4fd/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-12-09 11:52:47,772 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 11:52:47,772 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 11:52:47,773 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 11:52:47,773 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 11:52:47,773 INFO L133 SettingsManager]: * Use SBE=true [2018-12-09 11:52:47,773 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-09 11:52:47,773 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-09 11:52:47,773 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-09 11:52:47,773 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-09 11:52:47,774 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-09 11:52:47,774 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-09 11:52:47,774 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 11:52:47,774 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 11:52:47,774 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-09 11:52:47,774 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 11:52:47,774 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 11:52:47,774 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 11:52:47,774 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-09 11:52:47,774 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-09 11:52:47,774 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-09 11:52:47,774 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 11:52:47,774 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 11:52:47,775 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-09 11:52:47,775 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 11:52:47,775 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-09 11:52:47,775 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 11:52:47,775 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 11:52:47,775 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-09 11:52:47,775 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 11:52:47,775 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-09 11:52:47,775 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-09 11:52:47,776 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-09 11:52:47,776 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_b46a765a-985b-4399-8574-02f0bd75d4fd/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 -> 60847b137b78d6fc8305d5c5fcc8bf5228130e36 [2018-12-09 11:52:47,793 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 11:52:47,802 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 11:52:47,805 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 11:52:47,806 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 11:52:47,806 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 11:52:47,807 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_b46a765a-985b-4399-8574-02f0bd75d4fd/bin-2019/uautomizer/../../sv-benchmarks/c/array-memsafety/cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-12-09 11:52:47,847 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b46a765a-985b-4399-8574-02f0bd75d4fd/bin-2019/uautomizer/data/353c1155e/4abbc8b6ccdb4702883ae76341e1b5e5/FLAGaf0aab74d [2018-12-09 11:52:48,294 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 11:52:48,295 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_b46a765a-985b-4399-8574-02f0bd75d4fd/sv-benchmarks/c/array-memsafety/cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-12-09 11:52:48,301 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b46a765a-985b-4399-8574-02f0bd75d4fd/bin-2019/uautomizer/data/353c1155e/4abbc8b6ccdb4702883ae76341e1b5e5/FLAGaf0aab74d [2018-12-09 11:52:48,309 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_b46a765a-985b-4399-8574-02f0bd75d4fd/bin-2019/uautomizer/data/353c1155e/4abbc8b6ccdb4702883ae76341e1b5e5 [2018-12-09 11:52:48,311 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 11:52:48,312 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 11:52:48,312 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 11:52:48,312 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 11:52:48,315 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 11:52:48,316 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 11:52:48" (1/1) ... [2018-12-09 11:52:48,318 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4834854b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:52:48, skipping insertion in model container [2018-12-09 11:52:48,318 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 11:52:48" (1/1) ... [2018-12-09 11:52:48,322 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 11:52:48,345 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 11:52:48,487 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 11:52:48,494 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 11:52:48,550 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 11:52:48,570 INFO L195 MainTranslator]: Completed translation [2018-12-09 11:52:48,571 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:52:48 WrapperNode [2018-12-09 11:52:48,571 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 11:52:48,571 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 11:52:48,571 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 11:52:48,571 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 11:52:48,576 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:52:48" (1/1) ... [2018-12-09 11:52:48,586 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:52:48" (1/1) ... [2018-12-09 11:52:48,600 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 11:52:48,600 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 11:52:48,600 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 11:52:48,600 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 11:52:48,605 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:52:48" (1/1) ... [2018-12-09 11:52:48,606 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:52:48" (1/1) ... [2018-12-09 11:52:48,608 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:52:48" (1/1) ... [2018-12-09 11:52:48,608 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:52:48" (1/1) ... [2018-12-09 11:52:48,612 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:52:48" (1/1) ... [2018-12-09 11:52:48,616 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:52:48" (1/1) ... [2018-12-09 11:52:48,617 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:52:48" (1/1) ... [2018-12-09 11:52:48,619 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 11:52:48,619 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 11:52:48,619 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 11:52:48,619 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 11:52:48,620 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:52:48" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b46a765a-985b-4399-8574-02f0bd75d4fd/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-09 11:52:48,652 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 11:52:48,652 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-09 11:52:48,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 11:52:48,652 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 11:52:48,652 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 11:52:48,652 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 11:52:48,791 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 11:52:48,791 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-12-09 11:52:48,791 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 11:52:48 BoogieIcfgContainer [2018-12-09 11:52:48,792 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 11:52:48,792 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-09 11:52:48,792 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-09 11:52:48,794 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-09 11:52:48,795 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 11:52:48,795 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.12 11:52:48" (1/3) ... [2018-12-09 11:52:48,796 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1c5be6fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.12 11:52:48, skipping insertion in model container [2018-12-09 11:52:48,796 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 11:52:48,796 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:52:48" (2/3) ... [2018-12-09 11:52:48,796 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1c5be6fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.12 11:52:48, skipping insertion in model container [2018-12-09 11:52:48,797 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 11:52:48,797 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 11:52:48" (3/3) ... [2018-12-09 11:52:48,798 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-12-09 11:52:48,836 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-09 11:52:48,836 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-09 11:52:48,836 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-09 11:52:48,836 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-09 11:52:48,836 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 11:52:48,837 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 11:52:48,837 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-09 11:52:48,837 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 11:52:48,837 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-09 11:52:48,845 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-12-09 11:52:48,857 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-09 11:52:48,857 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 11:52:48,857 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 11:52:48,861 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-12-09 11:52:48,861 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-12-09 11:52:48,862 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-09 11:52:48,862 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-12-09 11:52:48,863 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-09 11:52:48,863 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 11:52:48,863 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 11:52:48,864 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-12-09 11:52:48,864 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-12-09 11:52:48,871 INFO L794 eck$LassoCheckResult]: Stem: 13#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10#L-1true havoc main_#res;havoc main_#t~nondet13, main_#t~nondet14, main_#t~malloc15.base, main_#t~malloc15.offset, main_#t~malloc16.base, main_#t~malloc16.offset, main_#t~nondet17, main_#t~ret18, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet13;havoc main_#t~nondet13;main_~length2~0 := main_#t~nondet14;havoc main_#t~nondet14; 3#L558true assume !(main_~length1~0 < 1); 6#L558-2true assume !(main_~length2~0 < 1); 19#L561-1true call main_#t~malloc15.base, main_#t~malloc15.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc15.base, main_#t~malloc15.offset;call main_#t~malloc16.base, main_#t~malloc16.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc16.base, main_#t~malloc16.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset, cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset, cstrncmp_#in~n := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_#t~nondet17;havoc cstrncmp_#res;havoc cstrncmp_#t~mem6, cstrncmp_#t~short7, cstrncmp_#t~post8.base, cstrncmp_#t~post8.offset, cstrncmp_#t~post9.base, cstrncmp_#t~post9.offset, cstrncmp_#t~post2, cstrncmp_#t~mem3, cstrncmp_#t~mem4, cstrncmp_#t~short5, cstrncmp_#t~mem10, cstrncmp_#t~mem11, cstrncmp_#t~ite12, cstrncmp_~s1.base, cstrncmp_~s1.offset, cstrncmp_~s2.base, cstrncmp_~s2.offset, cstrncmp_~n, cstrncmp_~uc1~0, cstrncmp_~uc2~0;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset;cstrncmp_~n := cstrncmp_#in~n;havoc cstrncmp_~uc1~0;havoc cstrncmp_~uc2~0; 9#L543true assume !(0 == cstrncmp_~n); 15#L545-5true [2018-12-09 11:52:48,871 INFO L796 eck$LassoCheckResult]: Loop: 15#L545-5true cstrncmp_#t~post2 := cstrncmp_~n;cstrncmp_~n := cstrncmp_#t~post2 - 1;cstrncmp_#t~short5 := cstrncmp_#t~post2 > 0; 7#L545-1true assume cstrncmp_#t~short5;call cstrncmp_#t~mem3 := read~int(cstrncmp_~s1.base, cstrncmp_~s1.offset, 1);call cstrncmp_#t~mem4 := read~int(cstrncmp_~s2.base, cstrncmp_~s2.offset, 1);cstrncmp_#t~short5 := cstrncmp_#t~mem3 == cstrncmp_#t~mem4; 12#L545-3true assume !!cstrncmp_#t~short5;havoc cstrncmp_#t~mem4;havoc cstrncmp_#t~mem3;havoc cstrncmp_#t~post2;havoc cstrncmp_#t~short5;cstrncmp_#t~short7 := 0 == cstrncmp_~n; 5#L546true assume cstrncmp_#t~short7; 8#L546-2true assume !cstrncmp_#t~short7;havoc cstrncmp_#t~short7;havoc cstrncmp_#t~mem6;cstrncmp_#t~post8.base, cstrncmp_#t~post8.offset := cstrncmp_~s1.base, cstrncmp_~s1.offset;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#t~post8.base, 1 + cstrncmp_#t~post8.offset;havoc cstrncmp_#t~post8.base, cstrncmp_#t~post8.offset;cstrncmp_#t~post9.base, cstrncmp_#t~post9.offset := cstrncmp_~s2.base, cstrncmp_~s2.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#t~post9.base, 1 + cstrncmp_#t~post9.offset;havoc cstrncmp_#t~post9.base, cstrncmp_#t~post9.offset; 15#L545-5true [2018-12-09 11:52:48,874 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:52:48,874 INFO L82 PathProgramCache]: Analyzing trace with hash 889572238, now seen corresponding path program 1 times [2018-12-09 11:52:48,875 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:52:48,876 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:52:48,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:52:48,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:52:48,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:52:48,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 11:52:48,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 11:52:48,966 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:52:48,967 INFO L82 PathProgramCache]: Analyzing trace with hash 52587176, now seen corresponding path program 1 times [2018-12-09 11:52:48,967 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:52:48,967 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:52:48,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:52:48,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:52:48,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:52:48,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:52:49,002 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-09 11:52:49,003 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:52:49,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 11:52:49,006 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-09 11:52:49,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 11:52:49,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 11:52:49,016 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 3 states. [2018-12-09 11:52:49,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:52:49,032 INFO L93 Difference]: Finished difference Result 19 states and 26 transitions. [2018-12-09 11:52:49,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 11:52:49,035 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 26 transitions. [2018-12-09 11:52:49,036 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-09 11:52:49,039 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 11 states and 14 transitions. [2018-12-09 11:52:49,040 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-12-09 11:52:49,040 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-12-09 11:52:49,040 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 14 transitions. [2018-12-09 11:52:49,041 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 11:52:49,041 INFO L705 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2018-12-09 11:52:49,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 14 transitions. [2018-12-09 11:52:49,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-12-09 11:52:49,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-09 11:52:49,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2018-12-09 11:52:49,059 INFO L728 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2018-12-09 11:52:49,059 INFO L608 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2018-12-09 11:52:49,059 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-09 11:52:49,059 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 14 transitions. [2018-12-09 11:52:49,060 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-09 11:52:49,060 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 11:52:49,060 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 11:52:49,060 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-12-09 11:52:49,060 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-12-09 11:52:49,060 INFO L794 eck$LassoCheckResult]: Stem: 51#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 46#L-1 havoc main_#res;havoc main_#t~nondet13, main_#t~nondet14, main_#t~malloc15.base, main_#t~malloc15.offset, main_#t~malloc16.base, main_#t~malloc16.offset, main_#t~nondet17, main_#t~ret18, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet13;havoc main_#t~nondet13;main_~length2~0 := main_#t~nondet14;havoc main_#t~nondet14; 47#L558 assume !(main_~length1~0 < 1); 50#L558-2 assume !(main_~length2~0 < 1); 55#L561-1 call main_#t~malloc15.base, main_#t~malloc15.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc15.base, main_#t~malloc15.offset;call main_#t~malloc16.base, main_#t~malloc16.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc16.base, main_#t~malloc16.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset, cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset, cstrncmp_#in~n := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_#t~nondet17;havoc cstrncmp_#res;havoc cstrncmp_#t~mem6, cstrncmp_#t~short7, cstrncmp_#t~post8.base, cstrncmp_#t~post8.offset, cstrncmp_#t~post9.base, cstrncmp_#t~post9.offset, cstrncmp_#t~post2, cstrncmp_#t~mem3, cstrncmp_#t~mem4, cstrncmp_#t~short5, cstrncmp_#t~mem10, cstrncmp_#t~mem11, cstrncmp_#t~ite12, cstrncmp_~s1.base, cstrncmp_~s1.offset, cstrncmp_~s2.base, cstrncmp_~s2.offset, cstrncmp_~n, cstrncmp_~uc1~0, cstrncmp_~uc2~0;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset;cstrncmp_~n := cstrncmp_#in~n;havoc cstrncmp_~uc1~0;havoc cstrncmp_~uc2~0; 56#L543 assume !(0 == cstrncmp_~n); 53#L545-5 [2018-12-09 11:52:49,060 INFO L796 eck$LassoCheckResult]: Loop: 53#L545-5 cstrncmp_#t~post2 := cstrncmp_~n;cstrncmp_~n := cstrncmp_#t~post2 - 1;cstrncmp_#t~short5 := cstrncmp_#t~post2 > 0; 54#L545-1 assume cstrncmp_#t~short5;call cstrncmp_#t~mem3 := read~int(cstrncmp_~s1.base, cstrncmp_~s1.offset, 1);call cstrncmp_#t~mem4 := read~int(cstrncmp_~s2.base, cstrncmp_~s2.offset, 1);cstrncmp_#t~short5 := cstrncmp_#t~mem3 == cstrncmp_#t~mem4; 48#L545-3 assume !!cstrncmp_#t~short5;havoc cstrncmp_#t~mem4;havoc cstrncmp_#t~mem3;havoc cstrncmp_#t~post2;havoc cstrncmp_#t~short5;cstrncmp_#t~short7 := 0 == cstrncmp_~n; 49#L546 assume !cstrncmp_#t~short7;call cstrncmp_#t~mem6 := read~int(cstrncmp_~s1.base, cstrncmp_~s1.offset, 1);cstrncmp_#t~short7 := 0 == cstrncmp_#t~mem6; 52#L546-2 assume !cstrncmp_#t~short7;havoc cstrncmp_#t~short7;havoc cstrncmp_#t~mem6;cstrncmp_#t~post8.base, cstrncmp_#t~post8.offset := cstrncmp_~s1.base, cstrncmp_~s1.offset;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#t~post8.base, 1 + cstrncmp_#t~post8.offset;havoc cstrncmp_#t~post8.base, cstrncmp_#t~post8.offset;cstrncmp_#t~post9.base, cstrncmp_#t~post9.offset := cstrncmp_~s2.base, cstrncmp_~s2.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#t~post9.base, 1 + cstrncmp_#t~post9.offset;havoc cstrncmp_#t~post9.base, cstrncmp_#t~post9.offset; 53#L545-5 [2018-12-09 11:52:49,061 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:52:49,061 INFO L82 PathProgramCache]: Analyzing trace with hash 889572238, now seen corresponding path program 2 times [2018-12-09 11:52:49,061 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:52:49,061 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:52:49,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:52:49,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:52:49,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:52:49,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 11:52:49,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 11:52:49,078 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:52:49,078 INFO L82 PathProgramCache]: Analyzing trace with hash 52587238, now seen corresponding path program 1 times [2018-12-09 11:52:49,078 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:52:49,078 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:52:49,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:52:49,079 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 11:52:49,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:52:49,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 11:52:49,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 11:52:49,093 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:52:49,093 INFO L82 PathProgramCache]: Analyzing trace with hash -2120298631, now seen corresponding path program 1 times [2018-12-09 11:52:49,093 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:52:49,093 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:52:49,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:52:49,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:52:49,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:52:49,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 11:52:49,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 11:52:49,246 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 59 [2018-12-09 11:52:49,431 WARN L180 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 87 [2018-12-09 11:52:49,508 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 11:52:49,509 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 11:52:49,509 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 11:52:49,509 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 11:52:49,509 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 11:52:49,509 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 11:52:49,510 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 11:52:49,510 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 11:52:49,510 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrncmp-alloca_true-valid-memsafety_true-termination.i_Iteration2_Lasso [2018-12-09 11:52:49,510 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 11:52:49,510 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 11:52:49,523 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-09 11:52:49,527 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-09 11:52:49,528 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-09 11:52:49,529 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-09 11:52:49,531 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-09 11:52:49,533 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-09 11:52:49,534 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-09 11:52:49,535 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-09 11:52:49,782 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-09 11:52:49,784 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-09 11:52:49,784 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-09 11:52:49,785 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-09 11:52:49,786 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-09 11:52:49,787 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-09 11:52:49,790 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-09 11:52:49,791 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-09 11:52:49,799 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-09 11:52:49,800 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-09 11:52:49,801 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-09 11:52:49,802 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-09 11:52:49,803 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-09 11:52:49,804 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-09 11:52:49,805 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-09 11:52:49,806 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-09 11:52:50,128 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 11:52:50,132 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 11:52:50,133 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-09 11:52:50,134 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 11:52:50,134 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 11:52:50,134 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 11:52:50,135 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 11:52:50,135 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 11:52:50,136 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 11:52:50,136 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 11:52:50,137 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 11:52:50,138 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-09 11:52:50,138 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 11:52:50,138 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 11:52:50,138 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 11:52:50,138 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 11:52:50,138 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 11:52:50,139 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 11:52:50,139 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 11:52:50,139 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 11:52:50,139 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-09 11:52:50,140 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 11:52:50,140 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 11:52:50,140 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 11:52:50,140 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 11:52:50,140 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 11:52:50,140 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 11:52:50,140 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 11:52:50,141 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 11:52:50,141 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-09 11:52:50,141 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 11:52:50,141 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 11:52:50,141 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 11:52:50,141 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 11:52:50,143 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 11:52:50,143 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 11:52:50,144 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 11:52:50,145 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-09 11:52:50,145 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 11:52:50,145 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 11:52:50,145 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 11:52:50,145 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 11:52:50,145 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 11:52:50,145 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 11:52:50,145 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 11:52:50,146 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 11:52:50,146 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-09 11:52:50,146 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 11:52:50,146 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 11:52:50,146 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 11:52:50,147 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 11:52:50,147 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 11:52:50,147 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 11:52:50,147 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 11:52:50,147 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 11:52:50,148 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-09 11:52:50,148 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 11:52:50,148 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 11:52:50,148 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 11:52:50,148 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 11:52:50,148 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 11:52:50,148 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 11:52:50,148 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 11:52:50,149 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 11:52:50,149 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-09 11:52:50,149 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 11:52:50,149 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 11:52:50,149 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 11:52:50,150 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 11:52:50,150 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 11:52:50,150 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 11:52:50,150 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 11:52:50,153 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 11:52:50,153 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-09 11:52:50,153 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 11:52:50,153 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 11:52:50,153 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 11:52:50,153 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 11:52:50,155 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 11:52:50,155 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 11:52:50,164 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 11:52:50,164 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-09 11:52:50,165 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 11:52:50,165 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 11:52:50,165 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 11:52:50,165 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 11:52:50,166 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 11:52:50,167 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 11:52:50,168 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 11:52:50,169 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-09 11:52:50,169 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 11:52:50,169 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 11:52:50,170 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 11:52:50,170 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 11:52:50,171 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 11:52:50,171 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 11:52:50,173 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 11:52:50,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-09 11:52:50,174 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 11:52:50,174 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 11:52:50,174 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 11:52:50,174 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 11:52:50,176 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 11:52:50,176 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 11:52:50,178 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 11:52:50,178 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-09 11:52:50,178 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 11:52:50,179 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 11:52:50,179 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 11:52:50,179 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 11:52:50,181 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 11:52:50,181 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 11:52:50,192 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 11:52:50,193 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-09 11:52:50,193 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 11:52:50,193 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 11:52:50,194 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 11:52:50,194 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 11:52:50,195 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 11:52:50,195 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 11:52:50,200 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 11:52:50,200 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-09 11:52:50,201 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 11:52:50,201 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 11:52:50,201 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 11:52:50,201 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 11:52:50,202 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 11:52:50,202 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 11:52:50,203 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 11:52:50,203 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-09 11:52:50,203 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 11:52:50,204 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 11:52:50,204 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 11:52:50,204 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 11:52:50,206 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 11:52:50,206 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 11:52:50,238 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 11:52:50,259 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-09 11:52:50,259 INFO L444 ModelExtractionUtils]: 35 out of 40 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-12-09 11:52:50,261 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 11:52:50,262 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-09 11:52:50,262 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 11:52:50,262 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_cstrncmp_~s2.base)_1, ULTIMATE.start_cstrncmp_~s1.offset) = 1*v_rep(select #length ULTIMATE.start_cstrncmp_~s2.base)_1 - 1*ULTIMATE.start_cstrncmp_~s1.offset Supporting invariants [] [2018-12-09 11:52:50,305 INFO L297 tatePredicateManager]: 15 out of 16 supporting invariants were superfluous and have been removed [2018-12-09 11:52:50,312 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-09 11:52:50,329 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:52:50,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:52:50,341 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 11:52:50,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:52:50,369 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 11:52:50,380 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-09 11:52:50,382 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-12-09 11:52:50,383 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 4 Second operand 5 states. [2018-12-09 11:52:50,430 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 4. Second operand 5 states. Result 25 states and 31 transitions. Complement of second has 7 states. [2018-12-09 11:52:50,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-09 11:52:50,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-09 11:52:50,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 18 transitions. [2018-12-09 11:52:50,433 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 6 letters. Loop has 5 letters. [2018-12-09 11:52:50,434 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 11:52:50,434 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 11 letters. Loop has 5 letters. [2018-12-09 11:52:50,435 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 11:52:50,435 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 6 letters. Loop has 10 letters. [2018-12-09 11:52:50,435 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 11:52:50,435 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 31 transitions. [2018-12-09 11:52:50,436 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-09 11:52:50,436 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 22 states and 27 transitions. [2018-12-09 11:52:50,436 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-12-09 11:52:50,437 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-12-09 11:52:50,437 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 27 transitions. [2018-12-09 11:52:50,437 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 11:52:50,437 INFO L705 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2018-12-09 11:52:50,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 27 transitions. [2018-12-09 11:52:50,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2018-12-09 11:52:50,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-09 11:52:50,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2018-12-09 11:52:50,439 INFO L728 BuchiCegarLoop]: Abstraction has 21 states and 26 transitions. [2018-12-09 11:52:50,439 INFO L608 BuchiCegarLoop]: Abstraction has 21 states and 26 transitions. [2018-12-09 11:52:50,439 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-09 11:52:50,439 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 26 transitions. [2018-12-09 11:52:50,440 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-09 11:52:50,440 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 11:52:50,440 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 11:52:50,440 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:52:50,440 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-12-09 11:52:50,440 INFO L794 eck$LassoCheckResult]: Stem: 217#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 210#L-1 havoc main_#res;havoc main_#t~nondet13, main_#t~nondet14, main_#t~malloc15.base, main_#t~malloc15.offset, main_#t~malloc16.base, main_#t~malloc16.offset, main_#t~nondet17, main_#t~ret18, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet13;havoc main_#t~nondet13;main_~length2~0 := main_#t~nondet14;havoc main_#t~nondet14; 211#L558 assume !(main_~length1~0 < 1); 216#L558-2 assume !(main_~length2~0 < 1); 224#L561-1 call main_#t~malloc15.base, main_#t~malloc15.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc15.base, main_#t~malloc15.offset;call main_#t~malloc16.base, main_#t~malloc16.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc16.base, main_#t~malloc16.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset, cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset, cstrncmp_#in~n := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_#t~nondet17;havoc cstrncmp_#res;havoc cstrncmp_#t~mem6, cstrncmp_#t~short7, cstrncmp_#t~post8.base, cstrncmp_#t~post8.offset, cstrncmp_#t~post9.base, cstrncmp_#t~post9.offset, cstrncmp_#t~post2, cstrncmp_#t~mem3, cstrncmp_#t~mem4, cstrncmp_#t~short5, cstrncmp_#t~mem10, cstrncmp_#t~mem11, cstrncmp_#t~ite12, cstrncmp_~s1.base, cstrncmp_~s1.offset, cstrncmp_~s2.base, cstrncmp_~s2.offset, cstrncmp_~n, cstrncmp_~uc1~0, cstrncmp_~uc2~0;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset;cstrncmp_~n := cstrncmp_#in~n;havoc cstrncmp_~uc1~0;havoc cstrncmp_~uc2~0; 226#L543 assume !(0 == cstrncmp_~n); 228#L545-5 cstrncmp_#t~post2 := cstrncmp_~n;cstrncmp_~n := cstrncmp_#t~post2 - 1;cstrncmp_#t~short5 := cstrncmp_#t~post2 > 0; 221#L545-1 [2018-12-09 11:52:50,441 INFO L796 eck$LassoCheckResult]: Loop: 221#L545-1 assume !cstrncmp_#t~short5; 212#L545-3 assume !!cstrncmp_#t~short5;havoc cstrncmp_#t~mem4;havoc cstrncmp_#t~mem3;havoc cstrncmp_#t~post2;havoc cstrncmp_#t~short5;cstrncmp_#t~short7 := 0 == cstrncmp_~n; 213#L546 assume !cstrncmp_#t~short7;call cstrncmp_#t~mem6 := read~int(cstrncmp_~s1.base, cstrncmp_~s1.offset, 1);cstrncmp_#t~short7 := 0 == cstrncmp_#t~mem6; 218#L546-2 assume !cstrncmp_#t~short7;havoc cstrncmp_#t~short7;havoc cstrncmp_#t~mem6;cstrncmp_#t~post8.base, cstrncmp_#t~post8.offset := cstrncmp_~s1.base, cstrncmp_~s1.offset;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#t~post8.base, 1 + cstrncmp_#t~post8.offset;havoc cstrncmp_#t~post8.base, cstrncmp_#t~post8.offset;cstrncmp_#t~post9.base, cstrncmp_#t~post9.offset := cstrncmp_~s2.base, cstrncmp_~s2.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#t~post9.base, 1 + cstrncmp_#t~post9.offset;havoc cstrncmp_#t~post9.base, cstrncmp_#t~post9.offset; 220#L545-5 cstrncmp_#t~post2 := cstrncmp_~n;cstrncmp_~n := cstrncmp_#t~post2 - 1;cstrncmp_#t~short5 := cstrncmp_#t~post2 > 0; 221#L545-1 [2018-12-09 11:52:50,441 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:52:50,441 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935627, now seen corresponding path program 1 times [2018-12-09 11:52:50,441 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:52:50,441 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:52:50,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:52:50,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:52:50,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:52:50,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 11:52:50,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 11:52:50,456 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:52:50,456 INFO L82 PathProgramCache]: Analyzing trace with hash 57448140, now seen corresponding path program 1 times [2018-12-09 11:52:50,456 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:52:50,456 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:52:50,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:52:50,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:52:50,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:52:50,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:52:50,462 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-09 11:52:50,462 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:52:50,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 11:52:50,463 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-09 11:52:50,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 11:52:50,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 11:52:50,463 INFO L87 Difference]: Start difference. First operand 21 states and 26 transitions. cyclomatic complexity: 7 Second operand 3 states. [2018-12-09 11:52:50,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:52:50,469 INFO L93 Difference]: Finished difference Result 15 states and 18 transitions. [2018-12-09 11:52:50,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 11:52:50,470 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 18 transitions. [2018-12-09 11:52:50,470 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-09 11:52:50,470 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 0 states and 0 transitions. [2018-12-09 11:52:50,471 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-09 11:52:50,471 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-09 11:52:50,471 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-09 11:52:50,471 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 11:52:50,471 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 11:52:50,471 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 11:52:50,471 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 11:52:50,471 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-09 11:52:50,471 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-09 11:52:50,471 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-09 11:52:50,472 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-09 11:52:50,477 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 09.12 11:52:50 BoogieIcfgContainer [2018-12-09 11:52:50,477 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-09 11:52:50,477 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 11:52:50,477 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 11:52:50,478 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 11:52:50,478 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 11:52:48" (3/4) ... [2018-12-09 11:52:50,481 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-09 11:52:50,481 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 11:52:50,481 INFO L168 Benchmark]: Toolchain (without parser) took 2170.37 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 232.3 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -152.0 MB). Peak memory consumption was 80.2 MB. Max. memory is 11.5 GB. [2018-12-09 11:52:50,482 INFO L168 Benchmark]: CDTParser took 0.15 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-09 11:52:50,483 INFO L168 Benchmark]: CACSL2BoogieTranslator took 258.90 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 162.0 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -196.4 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. [2018-12-09 11:52:50,483 INFO L168 Benchmark]: Boogie Procedure Inliner took 28.74 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 11:52:50,483 INFO L168 Benchmark]: Boogie Preprocessor took 18.60 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 11:52:50,484 INFO L168 Benchmark]: RCFGBuilder took 172.58 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. [2018-12-09 11:52:50,484 INFO L168 Benchmark]: BuchiAutomizer took 1685.24 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 70.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.1 MB). Peak memory consumption was 90.4 MB. Max. memory is 11.5 GB. [2018-12-09 11:52:50,484 INFO L168 Benchmark]: Witness Printer took 3.55 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 11:52:50,487 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.15 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 258.90 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 162.0 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -196.4 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 28.74 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.60 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 172.58 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 1685.24 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 70.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.1 MB). Peak memory consumption was 90.4 MB. Max. memory is 11.5 GB. * Witness Printer took 3.55 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. 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 (2 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[s2] + -1 * s1 and consists of 5 locations. 2 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.6s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 1.4s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 1. 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 21 states and ocurred in iteration 2. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 49 SDtfs, 14 SDslu, 40 SDs, 0 SdLazy, 18 SolverSat, 5 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital230 mio100 ax100 hnf99 lsp87 ukn85 mio100 lsp44 div100 bol100 ite100 ukn100 eq192 hnf88 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 14ms VariablesStem: 4 VariablesLoop: 4 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...