./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/Toulouse-BranchesToLoop-alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_8fa49141-c8bb-48b1-aaad-d5d54c795659/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_8fa49141-c8bb-48b1-aaad-d5d54c795659/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_8fa49141-c8bb-48b1-aaad-d5d54c795659/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_8fa49141-c8bb-48b1-aaad-d5d54c795659/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/Toulouse-BranchesToLoop-alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_8fa49141-c8bb-48b1-aaad-d5d54c795659/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_8fa49141-c8bb-48b1-aaad-d5d54c795659/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 64bit --witnessprinter.graph.data.programhash 00af3b6676c9262f2d1d8ee1ad0dddc75df98c14 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 21:38:18,924 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 21:38:18,925 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 21:38:18,931 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 21:38:18,931 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 21:38:18,931 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 21:38:18,932 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 21:38:18,933 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 21:38:18,934 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 21:38:18,934 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 21:38:18,935 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 21:38:18,935 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 21:38:18,936 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 21:38:18,936 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 21:38:18,937 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 21:38:18,937 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 21:38:18,938 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 21:38:18,939 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 21:38:18,940 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 21:38:18,941 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 21:38:18,941 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 21:38:18,942 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 21:38:18,943 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 21:38:18,943 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 21:38:18,944 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 21:38:18,944 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 21:38:18,945 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 21:38:18,945 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 21:38:18,946 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 21:38:18,946 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 21:38:18,947 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 21:38:18,947 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 21:38:18,947 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 21:38:18,947 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 21:38:18,948 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 21:38:18,948 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 21:38:18,949 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_8fa49141-c8bb-48b1-aaad-d5d54c795659/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-12-02 21:38:18,957 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 21:38:18,957 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 21:38:18,958 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 21:38:18,958 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 21:38:18,958 INFO L133 SettingsManager]: * Use SBE=true [2018-12-02 21:38:18,958 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-02 21:38:18,958 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-02 21:38:18,958 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-02 21:38:18,959 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-02 21:38:18,959 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-02 21:38:18,959 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-02 21:38:18,959 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 21:38:18,959 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-02 21:38:18,959 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 21:38:18,960 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 21:38:18,960 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-02 21:38:18,960 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-02 21:38:18,960 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-02 21:38:18,960 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 21:38:18,960 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-02 21:38:18,960 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 21:38:18,961 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-02 21:38:18,961 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 21:38:18,961 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 21:38:18,961 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-02 21:38:18,961 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 21:38:18,961 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-02 21:38:18,961 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-02 21:38:18,962 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-02 21:38:18,962 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_8fa49141-c8bb-48b1-aaad-d5d54c795659/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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 00af3b6676c9262f2d1d8ee1ad0dddc75df98c14 [2018-12-02 21:38:18,979 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 21:38:18,986 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 21:38:18,988 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 21:38:18,988 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 21:38:18,989 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 21:38:18,989 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_8fa49141-c8bb-48b1-aaad-d5d54c795659/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/Toulouse-BranchesToLoop-alloca_true-termination.c.i [2018-12-02 21:38:19,024 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8fa49141-c8bb-48b1-aaad-d5d54c795659/bin-2019/uautomizer/data/5f9aa5876/3ac3ca571b224586a915f1377b0faaa8/FLAGfed6e3344 [2018-12-02 21:38:19,438 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 21:38:19,439 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_8fa49141-c8bb-48b1-aaad-d5d54c795659/sv-benchmarks/c/termination-memory-alloca/Toulouse-BranchesToLoop-alloca_true-termination.c.i [2018-12-02 21:38:19,446 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8fa49141-c8bb-48b1-aaad-d5d54c795659/bin-2019/uautomizer/data/5f9aa5876/3ac3ca571b224586a915f1377b0faaa8/FLAGfed6e3344 [2018-12-02 21:38:19,785 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_8fa49141-c8bb-48b1-aaad-d5d54c795659/bin-2019/uautomizer/data/5f9aa5876/3ac3ca571b224586a915f1377b0faaa8 [2018-12-02 21:38:19,791 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 21:38:19,792 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 21:38:19,794 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 21:38:19,794 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 21:38:19,798 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 21:38:19,799 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 09:38:19" (1/1) ... [2018-12-02 21:38:19,802 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@340b48b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:38:19, skipping insertion in model container [2018-12-02 21:38:19,802 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 09:38:19" (1/1) ... [2018-12-02 21:38:19,807 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 21:38:19,826 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 21:38:19,963 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 21:38:19,969 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 21:38:20,032 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 21:38:20,056 INFO L195 MainTranslator]: Completed translation [2018-12-02 21:38:20,056 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:38:20 WrapperNode [2018-12-02 21:38:20,056 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 21:38:20,057 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 21:38:20,057 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 21:38:20,057 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 21:38:20,061 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:38:20" (1/1) ... [2018-12-02 21:38:20,071 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:38:20" (1/1) ... [2018-12-02 21:38:20,084 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 21:38:20,084 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 21:38:20,084 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 21:38:20,084 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 21:38:20,089 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:38:20" (1/1) ... [2018-12-02 21:38:20,089 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:38:20" (1/1) ... [2018-12-02 21:38:20,091 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:38:20" (1/1) ... [2018-12-02 21:38:20,091 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:38:20" (1/1) ... [2018-12-02 21:38:20,094 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:38:20" (1/1) ... [2018-12-02 21:38:20,096 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:38:20" (1/1) ... [2018-12-02 21:38:20,097 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:38:20" (1/1) ... [2018-12-02 21:38:20,098 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 21:38:20,098 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 21:38:20,098 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 21:38:20,098 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 21:38:20,099 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:38:20" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8fa49141-c8bb-48b1-aaad-d5d54c795659/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 21:38:20,130 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 21:38:20,130 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-02 21:38:20,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 21:38:20,130 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 21:38:20,130 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 21:38:20,131 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 21:38:20,255 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 21:38:20,255 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-12-02 21:38:20,256 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 09:38:20 BoogieIcfgContainer [2018-12-02 21:38:20,256 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 21:38:20,256 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-02 21:38:20,256 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-02 21:38:20,259 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-02 21:38:20,259 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 21:38:20,259 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 02.12 09:38:19" (1/3) ... [2018-12-02 21:38:20,260 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5e24224c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.12 09:38:20, skipping insertion in model container [2018-12-02 21:38:20,260 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 21:38:20,260 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:38:20" (2/3) ... [2018-12-02 21:38:20,260 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5e24224c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.12 09:38:20, skipping insertion in model container [2018-12-02 21:38:20,260 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 21:38:20,260 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 09:38:20" (3/3) ... [2018-12-02 21:38:20,261 INFO L375 chiAutomizerObserver]: Analyzing ICFG Toulouse-BranchesToLoop-alloca_true-termination.c.i [2018-12-02 21:38:20,294 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 21:38:20,294 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-02 21:38:20,295 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-02 21:38:20,295 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-02 21:38:20,295 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 21:38:20,295 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 21:38:20,295 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-02 21:38:20,295 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 21:38:20,295 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-02 21:38:20,304 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states. [2018-12-02 21:38:20,317 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-02 21:38:20,317 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 21:38:20,317 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 21:38:20,321 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-12-02 21:38:20,321 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-02 21:38:20,321 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-02 21:38:20,321 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states. [2018-12-02 21:38:20,322 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-02 21:38:20,322 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 21:38:20,322 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 21:38:20,322 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-12-02 21:38:20,322 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-02 21:38:20,327 INFO L794 eck$LassoCheckResult]: Stem: 7#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3#L-1true havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~mem11, main_#t~mem12, main_#t~mem13, main_#t~mem14, main_#t~mem8, main_#t~mem9, main_#t~short10, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset, main_~m~0.base, main_~m~0.offset, main_~n~0.base, main_~n~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.alloc(4);main_~m~0.base, main_~m~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.alloc(4);main_~n~0.base, main_~n~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; 4#L553true assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;call write~int(-1, main_~x~0.base, main_~x~0.offset, 4); 12#L558-4true [2018-12-02 21:38:20,327 INFO L796 eck$LassoCheckResult]: Loop: 12#L558-4true call main_#t~mem8 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short10 := main_#t~mem8 < 100; 6#L558true assume !main_#t~short10; 9#L558-2true assume !!main_#t~short10;havoc main_#t~short10;havoc main_#t~mem8;havoc main_#t~mem9;call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem12 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem11 + main_#t~mem12, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem11;havoc main_#t~mem12;call main_#t~mem13 := read~int(main_~z~0.base, main_~z~0.offset, 4);call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem13 - main_#t~mem14, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem13;havoc main_#t~mem14; 12#L558-4true [2018-12-02 21:38:20,330 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:38:20,331 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2018-12-02 21:38:20,332 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:38:20,332 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:38:20,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:38:20,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:38:20,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:38:20,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 21:38:20,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 21:38:20,418 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:38:20,418 INFO L82 PathProgramCache]: Analyzing trace with hash 41873, now seen corresponding path program 1 times [2018-12-02 21:38:20,418 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:38:20,419 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:38:20,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:38:20,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:38:20,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:38:20,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:38:20,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 21:38:20,453 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:38:20,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 21:38:20,455 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-02 21:38:20,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 21:38:20,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 21:38:20,466 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 3 states. [2018-12-02 21:38:20,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:38:20,481 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2018-12-02 21:38:20,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 21:38:20,483 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 13 transitions. [2018-12-02 21:38:20,484 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-02 21:38:20,486 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 6 states and 7 transitions. [2018-12-02 21:38:20,486 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2018-12-02 21:38:20,487 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2018-12-02 21:38:20,487 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 7 transitions. [2018-12-02 21:38:20,487 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 21:38:20,487 INFO L705 BuchiCegarLoop]: Abstraction has 6 states and 7 transitions. [2018-12-02 21:38:20,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states and 7 transitions. [2018-12-02 21:38:20,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-12-02 21:38:20,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-02 21:38:20,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2018-12-02 21:38:20,503 INFO L728 BuchiCegarLoop]: Abstraction has 6 states and 7 transitions. [2018-12-02 21:38:20,503 INFO L608 BuchiCegarLoop]: Abstraction has 6 states and 7 transitions. [2018-12-02 21:38:20,504 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-02 21:38:20,504 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 7 transitions. [2018-12-02 21:38:20,504 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-02 21:38:20,504 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 21:38:20,504 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 21:38:20,504 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-12-02 21:38:20,504 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-02 21:38:20,504 INFO L794 eck$LassoCheckResult]: Stem: 35#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 30#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~mem11, main_#t~mem12, main_#t~mem13, main_#t~mem14, main_#t~mem8, main_#t~mem9, main_#t~short10, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset, main_~m~0.base, main_~m~0.offset, main_~n~0.base, main_~n~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.alloc(4);main_~m~0.base, main_~m~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.alloc(4);main_~n~0.base, main_~n~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; 31#L553 assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;call write~int(-1, main_~x~0.base, main_~x~0.offset, 4); 32#L558-4 [2018-12-02 21:38:20,505 INFO L796 eck$LassoCheckResult]: Loop: 32#L558-4 call main_#t~mem8 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short10 := main_#t~mem8 < 100; 33#L558 assume main_#t~short10;call main_#t~mem9 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short10 := main_#t~mem9 < 100; 34#L558-2 assume !!main_#t~short10;havoc main_#t~short10;havoc main_#t~mem8;havoc main_#t~mem9;call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem12 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem11 + main_#t~mem12, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem11;havoc main_#t~mem12;call main_#t~mem13 := read~int(main_~z~0.base, main_~z~0.offset, 4);call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem13 - main_#t~mem14, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem13;havoc main_#t~mem14; 32#L558-4 [2018-12-02 21:38:20,505 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:38:20,505 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 2 times [2018-12-02 21:38:20,505 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:38:20,505 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:38:20,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:38:20,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:38:20,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:38:20,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 21:38:20,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 21:38:20,521 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:38:20,521 INFO L82 PathProgramCache]: Analyzing trace with hash 41811, now seen corresponding path program 1 times [2018-12-02 21:38:20,522 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:38:20,522 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:38:20,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:38:20,522 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 21:38:20,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:38:20,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 21:38:20,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 21:38:20,558 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:38:20,558 INFO L82 PathProgramCache]: Analyzing trace with hash 889571280, now seen corresponding path program 1 times [2018-12-02 21:38:20,559 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:38:20,559 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:38:20,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:38:20,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:38:20,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:38:20,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 21:38:20,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 21:38:20,686 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2018-12-02 21:38:20,947 WARN L180 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 94 [2018-12-02 21:38:21,034 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 21:38:21,035 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 21:38:21,035 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 21:38:21,035 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 21:38:21,035 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 21:38:21,035 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 21:38:21,035 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 21:38:21,036 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 21:38:21,036 INFO L131 ssoRankerPreferences]: Filename of dumped script: Toulouse-BranchesToLoop-alloca_true-termination.c.i_Iteration2_Lasso [2018-12-02 21:38:21,036 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 21:38:21,036 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 21:38:21,050 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 21:38:21,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 21:38:21,054 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 21:38:21,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 21:38:21,059 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 21:38:21,060 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 21:38:21,062 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 21:38:21,063 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 21:38:21,064 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 21:38:21,066 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 21:38:21,067 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 21:38:21,070 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 21:38:21,074 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 21:38:21,313 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 78 [2018-12-02 21:38:21,394 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 21:38:21,395 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 21:38:21,397 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 21:38:21,400 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 21:38:21,733 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 21:38:21,736 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 21:38:21,737 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 21:38:21,738 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:38:21,738 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 21:38:21,739 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:38:21,739 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:38:21,739 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:38:21,740 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 21:38:21,740 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 21:38:21,741 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:38:21,741 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 21:38:21,741 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:38:21,742 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 21:38:21,742 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:38:21,742 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:38:21,742 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:38:21,742 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 21:38:21,742 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 21:38:21,743 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:38:21,743 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 21:38:21,743 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:38:21,743 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:38:21,743 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:38:21,744 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:38:21,745 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 21:38:21,745 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 21:38:21,746 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:38:21,747 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 21:38:21,747 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:38:21,747 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:38:21,747 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:38:21,747 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:38:21,748 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 21:38:21,748 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 21:38:21,750 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:38:21,750 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 21:38:21,751 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:38:21,751 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:38:21,751 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:38:21,751 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:38:21,752 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 21:38:21,753 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 21:38:21,755 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:38:21,755 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 21:38:21,756 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:38:21,756 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 21:38:21,756 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:38:21,756 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:38:21,756 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:38:21,756 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 21:38:21,757 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 21:38:21,757 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:38:21,758 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 21:38:21,758 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:38:21,758 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 21:38:21,758 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:38:21,758 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:38:21,759 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:38:21,759 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 21:38:21,759 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 21:38:21,760 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:38:21,760 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 21:38:21,760 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:38:21,761 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 21:38:21,761 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:38:21,761 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:38:21,761 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:38:21,761 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 21:38:21,761 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 21:38:21,762 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:38:21,762 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 21:38:21,763 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:38:21,763 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 21:38:21,763 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:38:21,763 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:38:21,763 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:38:21,763 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 21:38:21,764 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 21:38:21,764 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:38:21,765 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 21:38:21,765 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:38:21,765 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 21:38:21,765 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:38:21,765 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:38:21,765 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:38:21,766 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 21:38:21,766 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 21:38:21,767 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:38:21,767 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 21:38:21,767 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:38:21,767 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:38:21,767 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:38:21,768 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:38:21,769 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 21:38:21,769 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 21:38:21,771 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:38:21,772 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 21:38:21,772 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:38:21,772 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:38:21,772 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:38:21,772 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:38:21,773 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 21:38:21,774 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 21:38:21,776 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:38:21,776 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 21:38:21,777 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:38:21,777 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:38:21,777 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:38:21,777 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:38:21,781 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 21:38:21,781 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 21:38:21,803 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:38:21,803 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 21:38:21,804 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:38:21,804 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 21:38:21,804 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:38:21,804 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:38:21,805 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 21:38:21,805 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 21:38:21,808 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:38:21,808 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 21:38:21,808 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:38:21,808 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:38:21,809 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:38:21,809 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:38:21,809 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 21:38:21,809 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 21:38:21,812 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:38:21,813 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 21:38:21,813 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:38:21,813 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:38:21,813 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:38:21,813 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:38:21,814 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 21:38:21,814 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 21:38:21,817 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:38:21,817 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 21:38:21,818 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:38:21,818 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:38:21,818 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:38:21,818 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:38:21,819 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 21:38:21,819 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 21:38:21,825 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 21:38:21,829 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-02 21:38:21,829 INFO L444 ModelExtractionUtils]: 8 out of 13 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-12-02 21:38:21,831 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 21:38:21,832 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2018-12-02 21:38:21,832 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 21:38:21,832 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_1) = -2*v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_1 + 199 Supporting invariants [-1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_1 - 1 >= 0] [2018-12-02 21:38:21,954 INFO L297 tatePredicateManager]: 36 out of 40 supporting invariants were superfluous and have been removed [2018-12-02 21:38:21,962 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 21:38:21,979 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:38:21,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:38:21,989 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:38:22,008 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2018-12-02 21:38:22,018 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:38:22,027 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:38:22,028 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 41 [2018-12-02 21:38:22,032 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2018-12-02 21:38:22,044 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:38:22,045 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:38:22,046 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:38:22,047 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:38:22,048 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2018-12-02 21:38:22,048 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 21:38:22,055 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:38:22,070 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:38:22,076 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:38:22,084 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:38:22,084 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:33, output treesize:13 [2018-12-02 21:38:22,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:38:22,099 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:38:22,130 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 21:38:22,133 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-02 21:38:22,133 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 6 states and 7 transitions. cyclomatic complexity: 2 Second operand 5 states. [2018-12-02 21:38:22,192 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 6 states and 7 transitions. cyclomatic complexity: 2. Second operand 5 states. Result 12 states and 14 transitions. Complement of second has 7 states. [2018-12-02 21:38:22,193 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-02 21:38:22,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-02 21:38:22,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 10 transitions. [2018-12-02 21:38:22,195 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 3 letters. Loop has 3 letters. [2018-12-02 21:38:22,195 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 21:38:22,195 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 6 letters. Loop has 3 letters. [2018-12-02 21:38:22,196 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 21:38:22,196 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 3 letters. Loop has 6 letters. [2018-12-02 21:38:22,196 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 21:38:22,196 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 14 transitions. [2018-12-02 21:38:22,196 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-02 21:38:22,197 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 6 states and 6 transitions. [2018-12-02 21:38:22,197 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2018-12-02 21:38:22,197 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2018-12-02 21:38:22,197 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 6 transitions. [2018-12-02 21:38:22,197 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 21:38:22,197 INFO L705 BuchiCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-12-02 21:38:22,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states and 6 transitions. [2018-12-02 21:38:22,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-12-02 21:38:22,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-02 21:38:22,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-12-02 21:38:22,198 INFO L728 BuchiCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-12-02 21:38:22,198 INFO L608 BuchiCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-12-02 21:38:22,198 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-02 21:38:22,198 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 6 transitions. [2018-12-02 21:38:22,199 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-02 21:38:22,199 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 21:38:22,199 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 21:38:22,199 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-12-02 21:38:22,199 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-02 21:38:22,199 INFO L794 eck$LassoCheckResult]: Stem: 262#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 257#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~mem11, main_#t~mem12, main_#t~mem13, main_#t~mem14, main_#t~mem8, main_#t~mem9, main_#t~short10, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset, main_~m~0.base, main_~m~0.offset, main_~n~0.base, main_~n~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.alloc(4);main_~m~0.base, main_~m~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.alloc(4);main_~n~0.base, main_~n~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; 258#L553 assume 0 != main_#t~nondet7;havoc main_#t~nondet7;call write~int(1, main_~x~0.base, main_~x~0.offset, 4); 259#L558-4 [2018-12-02 21:38:22,199 INFO L796 eck$LassoCheckResult]: Loop: 259#L558-4 call main_#t~mem8 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short10 := main_#t~mem8 < 100; 260#L558 assume main_#t~short10;call main_#t~mem9 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short10 := main_#t~mem9 < 100; 261#L558-2 assume !!main_#t~short10;havoc main_#t~short10;havoc main_#t~mem8;havoc main_#t~mem9;call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem12 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem11 + main_#t~mem12, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem11;havoc main_#t~mem12;call main_#t~mem13 := read~int(main_~z~0.base, main_~z~0.offset, 4);call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem13 - main_#t~mem14, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem13;havoc main_#t~mem14; 259#L558-4 [2018-12-02 21:38:22,199 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:38:22,200 INFO L82 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2018-12-02 21:38:22,200 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:38:22,200 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:38:22,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:38:22,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:38:22,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:38:22,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 21:38:22,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 21:38:22,209 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:38:22,209 INFO L82 PathProgramCache]: Analyzing trace with hash 41811, now seen corresponding path program 2 times [2018-12-02 21:38:22,209 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:38:22,209 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:38:22,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:38:22,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:38:22,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:38:22,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 21:38:22,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 21:38:22,226 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:38:22,226 INFO L82 PathProgramCache]: Analyzing trace with hash 889511698, now seen corresponding path program 1 times [2018-12-02 21:38:22,226 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 21:38:22,227 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 21:38:22,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:38:22,227 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 21:38:22,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:38:22,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 21:38:22,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 21:38:22,506 WARN L180 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 94 [2018-12-02 21:38:22,590 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 21:38:22,590 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 21:38:22,590 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 21:38:22,590 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 21:38:22,591 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 21:38:22,591 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 21:38:22,591 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 21:38:22,591 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 21:38:22,591 INFO L131 ssoRankerPreferences]: Filename of dumped script: Toulouse-BranchesToLoop-alloca_true-termination.c.i_Iteration3_Lasso [2018-12-02 21:38:22,591 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 21:38:22,591 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 21:38:22,595 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 21:38:22,597 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 21:38:22,791 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 75 [2018-12-02 21:38:22,850 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 21:38:22,851 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 21:38:22,852 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 21:38:22,853 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 21:38:22,854 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 21:38:22,855 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 21:38:22,858 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 21:38:22,859 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 21:38:22,860 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 21:38:22,861 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 21:38:22,862 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 21:38:22,863 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 21:38:22,865 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 21:38:22,866 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 21:38:22,870 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 21:38:22,871 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 21:38:23,153 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 21:38:23,153 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 21:38:23,154 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 21:38:23,154 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:38:23,154 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 21:38:23,155 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:38:23,155 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:38:23,155 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:38:23,155 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 21:38:23,155 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 21:38:23,156 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:38:23,157 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 21:38:23,157 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:38:23,157 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 21:38:23,157 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:38:23,157 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:38:23,158 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 21:38:23,158 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 21:38:23,162 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:38:23,162 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 21:38:23,163 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:38:23,163 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 21:38:23,163 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:38:23,163 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:38:23,164 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 21:38:23,164 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 21:38:23,167 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:38:23,167 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 21:38:23,167 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:38:23,168 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 21:38:23,168 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:38:23,168 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:38:23,169 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 21:38:23,169 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 21:38:23,172 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:38:23,172 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 21:38:23,173 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:38:23,173 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:38:23,173 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:38:23,173 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:38:23,174 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 21:38:23,174 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 21:38:23,177 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:38:23,177 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 21:38:23,177 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:38:23,177 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 21:38:23,178 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:38:23,178 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:38:23,178 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 21:38:23,178 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 21:38:23,180 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 21:38:23,180 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 21:38:23,181 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 21:38:23,181 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 21:38:23,181 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 21:38:23,181 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 21:38:23,182 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 21:38:23,183 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 21:38:23,189 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 21:38:23,192 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-02 21:38:23,192 INFO L444 ModelExtractionUtils]: 8 out of 13 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-12-02 21:38:23,193 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 21:38:23,193 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2018-12-02 21:38:23,194 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 21:38:23,194 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_2) = -2*v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_2 + 199 Supporting invariants [1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_2 - 1 >= 0] [2018-12-02 21:38:23,303 INFO L297 tatePredicateManager]: 36 out of 40 supporting invariants were superfluous and have been removed [2018-12-02 21:38:23,307 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 21:38:23,323 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:38:23,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:38:23,331 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:38:23,334 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2018-12-02 21:38:23,341 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:38:23,346 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:38:23,347 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 41 [2018-12-02 21:38:23,350 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2018-12-02 21:38:23,360 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:38:23,361 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:38:23,361 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:38:23,362 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 21:38:23,363 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2018-12-02 21:38:23,364 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 21:38:23,384 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:38:23,388 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:38:23,397 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:38:23,406 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 21:38:23,406 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:33, output treesize:13 [2018-12-02 21:38:23,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:38:23,422 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:38:23,470 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 21:38:23,471 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2018-12-02 21:38:23,471 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 6 states and 6 transitions. cyclomatic complexity: 1 Second operand 5 states. [2018-12-02 21:38:23,507 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 6 states and 6 transitions. cyclomatic complexity: 1. Second operand 5 states. Result 9 states and 10 transitions. Complement of second has 7 states. [2018-12-02 21:38:23,508 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-02 21:38:23,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-02 21:38:23,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 6 transitions. [2018-12-02 21:38:23,508 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 6 transitions. Stem has 3 letters. Loop has 3 letters. [2018-12-02 21:38:23,508 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 21:38:23,508 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 6 transitions. Stem has 6 letters. Loop has 3 letters. [2018-12-02 21:38:23,508 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 21:38:23,508 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 6 transitions. Stem has 3 letters. Loop has 6 letters. [2018-12-02 21:38:23,508 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 21:38:23,508 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 10 transitions. [2018-12-02 21:38:23,509 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-02 21:38:23,509 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 0 states and 0 transitions. [2018-12-02 21:38:23,509 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-02 21:38:23,509 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-02 21:38:23,509 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-02 21:38:23,509 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 21:38:23,509 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 21:38:23,509 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 21:38:23,509 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 21:38:23,509 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-02 21:38:23,509 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-02 21:38:23,509 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-02 21:38:23,509 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-02 21:38:23,513 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 02.12 09:38:23 BoogieIcfgContainer [2018-12-02 21:38:23,513 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-02 21:38:23,513 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 21:38:23,513 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 21:38:23,513 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 21:38:23,514 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 09:38:20" (3/4) ... [2018-12-02 21:38:23,516 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-02 21:38:23,516 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 21:38:23,516 INFO L168 Benchmark]: Toolchain (without parser) took 3725.09 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 237.0 MB). Free memory was 956.0 MB in the beginning and 1.2 GB in the end (delta: -238.8 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 21:38:23,517 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 21:38:23,517 INFO L168 Benchmark]: CACSL2BoogieTranslator took 262.39 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 68.7 MB). Free memory was 956.0 MB in the beginning and 1.0 GB in the end (delta: -92.3 MB). Peak memory consumption was 25.0 MB. Max. memory is 11.5 GB. [2018-12-02 21:38:23,517 INFO L168 Benchmark]: Boogie Procedure Inliner took 27.16 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 21:38:23,517 INFO L168 Benchmark]: Boogie Preprocessor took 14.19 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 21:38:23,517 INFO L168 Benchmark]: RCFGBuilder took 157.57 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 19.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 11.5 GB. [2018-12-02 21:38:23,518 INFO L168 Benchmark]: BuchiAutomizer took 3257.08 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 168.3 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -165.6 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-02 21:38:23,518 INFO L168 Benchmark]: Witness Printer took 2.52 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 21:38:23,520 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 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 262.39 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 68.7 MB). Free memory was 956.0 MB in the beginning and 1.0 GB in the end (delta: -92.3 MB). Peak memory consumption was 25.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 27.16 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 14.19 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 157.57 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 19.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3257.08 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 168.3 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -165.6 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Witness Printer took 2.52 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 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 #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * 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 -2 * unknown-#memory_int-unknown[z][z] + 199 and consists of 5 locations. One deterministic module has affine ranking function -2 * unknown-#memory_int-unknown[y][y] + 199 and consists of 5 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.2s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 2.6s. Construction of modules took 0.0s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 6 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 15 SDtfs, 13 SDslu, 8 SDs, 0 SdLazy, 24 SolverSat, 12 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital354 mio100 ax105 hnf100 lsp89 ukn55 mio100 lsp37 div100 bol100 ite100 ukn100 eq194 hnf87 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 4ms VariablesStem: 2 VariablesLoop: 0 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...