./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/list-ext-properties/simple-ext_false-unreach-call_false-valid-memcleanup_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_52c454eb-a25d-4b08-955e-0072e3ec58fe/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_52c454eb-a25d-4b08-955e-0072e3ec58fe/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_52c454eb-a25d-4b08-955e-0072e3ec58fe/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_52c454eb-a25d-4b08-955e-0072e3ec58fe/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/list-ext-properties/simple-ext_false-unreach-call_false-valid-memcleanup_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_52c454eb-a25d-4b08-955e-0072e3ec58fe/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_52c454eb-a25d-4b08-955e-0072e3ec58fe/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash dd1b14b919fe0392bfa201e707626cf5228609a3 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-09 22:40:47,935 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-09 22:40:47,936 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-09 22:40:47,943 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-09 22:40:47,944 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-09 22:40:47,944 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-09 22:40:47,945 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-09 22:40:47,946 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-09 22:40:47,948 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-09 22:40:47,948 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-09 22:40:47,949 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-09 22:40:47,949 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-09 22:40:47,949 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-09 22:40:47,950 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-09 22:40:47,951 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-09 22:40:47,951 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-09 22:40:47,952 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-09 22:40:47,954 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-09 22:40:47,955 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-09 22:40:47,956 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-09 22:40:47,957 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-09 22:40:47,958 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-09 22:40:47,959 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-09 22:40:47,960 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-09 22:40:47,960 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-09 22:40:47,960 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-09 22:40:47,962 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-09 22:40:47,962 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-09 22:40:47,963 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-09 22:40:47,963 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-09 22:40:47,963 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-09 22:40:47,964 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-09 22:40:47,964 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-09 22:40:47,964 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-09 22:40:47,964 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-09 22:40:47,965 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-09 22:40:47,965 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_52c454eb-a25d-4b08-955e-0072e3ec58fe/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-09 22:40:47,973 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-09 22:40:47,973 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-09 22:40:47,974 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-09 22:40:47,974 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-09 22:40:47,974 INFO L133 SettingsManager]: * Use SBE=true [2018-11-09 22:40:47,974 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-09 22:40:47,974 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-09 22:40:47,975 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-09 22:40:47,975 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-09 22:40:47,975 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-09 22:40:47,975 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-09 22:40:47,975 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-09 22:40:47,975 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-09 22:40:47,975 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-09 22:40:47,976 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-09 22:40:47,976 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-09 22:40:47,976 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-09 22:40:47,976 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-09 22:40:47,976 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-09 22:40:47,976 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-09 22:40:47,977 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-09 22:40:47,977 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-09 22:40:47,977 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-09 22:40:47,977 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-09 22:40:47,978 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-09 22:40:47,978 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-09 22:40:47,978 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-09 22:40:47,978 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-09 22:40:47,978 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-09 22:40:47,978 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-09 22:40:47,979 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-09 22:40:47,979 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_52c454eb-a25d-4b08-955e-0072e3ec58fe/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> dd1b14b919fe0392bfa201e707626cf5228609a3 [2018-11-09 22:40:48,004 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-09 22:40:48,013 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-09 22:40:48,016 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-09 22:40:48,017 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-09 22:40:48,017 INFO L276 PluginConnector]: CDTParser initialized [2018-11-09 22:40:48,017 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_52c454eb-a25d-4b08-955e-0072e3ec58fe/bin-2019/uautomizer/../../sv-benchmarks/c/list-ext-properties/simple-ext_false-unreach-call_false-valid-memcleanup_true-termination.i [2018-11-09 22:40:48,051 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_52c454eb-a25d-4b08-955e-0072e3ec58fe/bin-2019/uautomizer/data/018238722/92893f3f0c634c09a3e433810b3597c2/FLAG7d987b47c [2018-11-09 22:40:48,479 INFO L298 CDTParser]: Found 1 translation units. [2018-11-09 22:40:48,479 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_52c454eb-a25d-4b08-955e-0072e3ec58fe/sv-benchmarks/c/list-ext-properties/simple-ext_false-unreach-call_false-valid-memcleanup_true-termination.i [2018-11-09 22:40:48,486 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_52c454eb-a25d-4b08-955e-0072e3ec58fe/bin-2019/uautomizer/data/018238722/92893f3f0c634c09a3e433810b3597c2/FLAG7d987b47c [2018-11-09 22:40:48,495 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_52c454eb-a25d-4b08-955e-0072e3ec58fe/bin-2019/uautomizer/data/018238722/92893f3f0c634c09a3e433810b3597c2 [2018-11-09 22:40:48,497 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-09 22:40:48,498 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-09 22:40:48,498 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-09 22:40:48,498 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-09 22:40:48,501 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-09 22:40:48,502 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:40:48" (1/1) ... [2018-11-09 22:40:48,504 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7cb1b920 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:40:48, skipping insertion in model container [2018-11-09 22:40:48,504 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:40:48" (1/1) ... [2018-11-09 22:40:48,510 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-09 22:40:48,538 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-09 22:40:48,734 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-09 22:40:48,742 INFO L189 MainTranslator]: Completed pre-run [2018-11-09 22:40:48,771 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-09 22:40:48,805 INFO L193 MainTranslator]: Completed translation [2018-11-09 22:40:48,805 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:40:48 WrapperNode [2018-11-09 22:40:48,805 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-09 22:40:48,806 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-09 22:40:48,806 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-09 22:40:48,806 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-09 22:40:48,850 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:40:48" (1/1) ... [2018-11-09 22:40:48,862 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:40:48" (1/1) ... [2018-11-09 22:40:48,880 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-09 22:40:48,880 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-09 22:40:48,880 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-09 22:40:48,880 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-09 22:40:48,888 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:40:48" (1/1) ... [2018-11-09 22:40:48,888 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:40:48" (1/1) ... [2018-11-09 22:40:48,890 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:40:48" (1/1) ... [2018-11-09 22:40:48,891 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:40:48" (1/1) ... [2018-11-09 22:40:48,895 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:40:48" (1/1) ... [2018-11-09 22:40:48,899 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:40:48" (1/1) ... [2018-11-09 22:40:48,900 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:40:48" (1/1) ... [2018-11-09 22:40:48,902 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-09 22:40:48,903 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-09 22:40:48,903 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-09 22:40:48,903 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-09 22:40:48,904 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:40:48" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_52c454eb-a25d-4b08-955e-0072e3ec58fe/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-11-09 22:40:48,946 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-09 22:40:48,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-09 22:40:48,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-09 22:40:48,947 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-09 22:40:48,947 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-09 22:40:48,947 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-09 22:40:49,154 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-09 22:40:49,155 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:40:49 BoogieIcfgContainer [2018-11-09 22:40:49,155 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-09 22:40:49,155 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-09 22:40:49,155 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-09 22:40:49,158 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-09 22:40:49,159 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-09 22:40:49,159 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.11 10:40:48" (1/3) ... [2018-11-09 22:40:49,160 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4a0443f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.11 10:40:49, skipping insertion in model container [2018-11-09 22:40:49,160 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-09 22:40:49,160 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:40:48" (2/3) ... [2018-11-09 22:40:49,160 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4a0443f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.11 10:40:49, skipping insertion in model container [2018-11-09 22:40:49,160 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-09 22:40:49,160 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:40:49" (3/3) ... [2018-11-09 22:40:49,161 INFO L375 chiAutomizerObserver]: Analyzing ICFG simple-ext_false-unreach-call_false-valid-memcleanup_true-termination.i [2018-11-09 22:40:49,198 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-09 22:40:49,199 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-09 22:40:49,199 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-09 22:40:49,199 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-09 22:40:49,199 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-09 22:40:49,199 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-09 22:40:49,199 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-09 22:40:49,199 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-09 22:40:49,199 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-09 22:40:49,210 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states. [2018-11-09 22:40:49,226 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 19 [2018-11-09 22:40:49,226 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-09 22:40:49,226 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-09 22:40:49,231 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-09 22:40:49,231 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-09 22:40:49,231 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-09 22:40:49,231 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states. [2018-11-09 22:40:49,233 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 19 [2018-11-09 22:40:49,233 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-09 22:40:49,233 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-09 22:40:49,234 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-09 22:40:49,234 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-09 22:40:49,239 INFO L793 eck$LassoCheckResult]: Stem: 31#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 13#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_#t~post4, main_#t~nondet1, main_#t~mem5, main_#t~mem6.base, main_#t~mem6.offset, main_#t~post7, main_#t~mem8.base, main_#t~mem8.offset, main_~tmp~0.base, main_~tmp~0.offset, main_~a~0.base, main_~a~0.offset, main_~t~0.base, main_~t~0.offset, main_~p~0.base, main_~p~0.offset, main_~i~0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 8;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~a~0.base, main_~a~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset; 29#L629true assume !(main_~a~0.base == 0 && main_~a~0.offset == 0); 17#L629-2true havoc main_~t~0.base, main_~t~0.offset;main_~p~0.base, main_~p~0.offset := main_~a~0.base, main_~a~0.offset;main_~i~0 := 0; 28#L633-3true [2018-11-09 22:40:49,239 INFO L795 eck$LassoCheckResult]: Loop: 28#L633-3true assume true; 26#L633-1true assume !!(main_~i~0 < 30 && main_#t~nondet1 != 0);havoc main_#t~nondet1; 22#L634true SUMMARY for call write~int(main_~i~0, main_~p~0.base, main_~p~0.offset + 0, 4); srcloc: L634 4#L634-1true #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 8;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~t~0.base, main_~t~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset; 19#L636true assume !(main_~t~0.base == 0 && main_~t~0.offset == 0); 23#L636-2true SUMMARY for call write~$Pointer$(main_~t~0.base, main_~t~0.offset, main_~p~0.base, main_~p~0.offset + 4, 4); srcloc: L636-2 32#L637true SUMMARY for call main_#t~mem3.base, main_#t~mem3.offset := read~$Pointer$(main_~p~0.base, main_~p~0.offset + 4, 4); srcloc: L637 16#L638true main_~p~0.base, main_~p~0.offset := main_#t~mem3.base, main_#t~mem3.offset;havoc main_#t~mem3.base, main_#t~mem3.offset;main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 28#L633-3true [2018-11-09 22:40:49,243 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:40:49,243 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2018-11-09 22:40:49,244 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 22:40:49,245 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 22:40:49,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:40:49,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 22:40:49,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:40:49,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 22:40:49,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 22:40:49,321 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:40:49,321 INFO L82 PathProgramCache]: Analyzing trace with hash -960426293, now seen corresponding path program 1 times [2018-11-09 22:40:49,322 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 22:40:49,322 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 22:40:49,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:40:49,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 22:40:49,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:40:49,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 22:40:49,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 22:40:49,356 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:40:49,357 INFO L82 PathProgramCache]: Analyzing trace with hash -925062385, now seen corresponding path program 1 times [2018-11-09 22:40:49,357 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 22:40:49,357 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 22:40:49,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:40:49,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 22:40:49,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:40:49,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 22:40:49,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 22:40:49,581 WARN L179 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 82 [2018-11-09 22:40:49,763 INFO L214 LassoAnalysis]: Preferences: [2018-11-09 22:40:49,764 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-09 22:40:49,765 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-09 22:40:49,765 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-09 22:40:49,765 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-09 22:40:49,765 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-09 22:40:49,766 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-09 22:40:49,766 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-09 22:40:49,766 INFO L131 ssoRankerPreferences]: Filename of dumped script: simple-ext_false-unreach-call_false-valid-memcleanup_true-termination.i_Iteration1_Lasso [2018-11-09 22:40:49,766 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-09 22:40:49,766 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-09 22:40:49,788 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:40:49,793 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:40:49,797 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:40:49,800 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:40:49,804 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:40:49,806 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:40:49,809 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:40:49,811 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:40:49,813 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:40:49,815 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:40:49,816 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:40:49,818 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:40:49,821 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:40:50,010 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 65 [2018-11-09 22:40:50,010 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:40:50,012 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:40:50,013 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:40:50,282 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-09 22:40:50,287 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-09 22:40:50,288 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 22:40:50,289 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:40:50,289 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 22:40:50,290 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:40:50,290 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:40:50,290 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:40:50,292 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 22:40:50,292 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 22:40:50,294 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:40:50,295 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 22:40:50,295 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:40:50,295 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 22:40:50,295 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:40:50,296 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:40:50,296 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:40:50,296 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 22:40:50,296 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 22:40:50,297 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:40:50,297 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 22:40:50,298 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:40:50,298 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 22:40:50,298 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:40:50,298 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:40:50,298 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:40:50,299 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 22:40:50,299 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 22:40:50,300 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:40:50,300 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 22:40:50,300 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:40:50,301 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 22:40:50,301 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:40:50,301 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-09 22:40:50,301 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:40:50,302 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-09 22:40:50,302 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 22:40:50,306 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:40:50,306 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 22:40:50,306 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:40:50,307 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:40:50,307 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:40:50,307 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:40:50,309 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 22:40:50,309 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 22:40:50,312 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:40:50,312 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 22:40:50,313 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:40:50,313 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 22:40:50,313 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:40:50,313 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:40:50,313 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:40:50,314 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 22:40:50,314 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 22:40:50,314 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:40:50,315 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 22:40:50,315 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:40:50,315 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 22:40:50,315 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:40:50,315 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:40:50,316 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:40:50,316 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 22:40:50,316 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 22:40:50,317 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:40:50,318 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 22:40:50,319 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:40:50,319 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 22:40:50,319 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:40:50,319 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:40:50,319 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:40:50,320 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 22:40:50,320 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 22:40:50,321 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:40:50,321 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 22:40:50,322 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:40:50,323 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:40:50,323 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:40:50,323 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:40:50,324 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 22:40:50,324 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 22:40:50,327 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:40:50,328 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 22:40:50,328 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:40:50,328 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 22:40:50,329 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:40:50,329 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:40:50,329 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:40:50,330 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 22:40:50,330 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 22:40:50,331 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:40:50,331 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 22:40:50,332 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:40:50,332 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 22:40:50,332 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:40:50,332 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:40:50,332 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:40:50,332 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 22:40:50,332 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 22:40:50,333 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:40:50,333 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 22:40:50,333 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:40:50,333 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 22:40:50,333 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:40:50,334 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:40:50,334 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:40:50,334 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 22:40:50,334 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 22:40:50,335 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:40:50,335 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 22:40:50,336 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:40:50,336 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:40:50,336 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:40:50,336 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:40:50,337 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 22:40:50,337 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 22:40:50,352 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-09 22:40:50,363 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-09 22:40:50,363 INFO L444 ModelExtractionUtils]: 2 out of 7 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-09 22:40:50,365 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-09 22:40:50,366 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-09 22:40:50,366 INFO L517 LassoAnalysis]: Proved termination. [2018-11-09 22:40:50,366 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 59 Supporting invariants [] [2018-11-09 22:40:50,372 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-09 22:40:50,386 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:40:50,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 22:40:50,398 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 22:40:50,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 22:40:50,410 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 22:40:50,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-09 22:40:50,426 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-09 22:40:50,427 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states. Second operand 4 states. [2018-11-09 22:40:50,472 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states.. Second operand 4 states. Result 64 states and 76 transitions. Complement of second has 8 states. [2018-11-09 22:40:50,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-09 22:40:50,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-09 22:40:50,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2018-11-09 22:40:50,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 41 transitions. Stem has 4 letters. Loop has 8 letters. [2018-11-09 22:40:50,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-09 22:40:50,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 41 transitions. Stem has 12 letters. Loop has 8 letters. [2018-11-09 22:40:50,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-09 22:40:50,477 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 41 transitions. Stem has 4 letters. Loop has 16 letters. [2018-11-09 22:40:50,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-09 22:40:50,477 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 64 states and 76 transitions. [2018-11-09 22:40:50,480 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2018-11-09 22:40:50,482 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 64 states to 29 states and 34 transitions. [2018-11-09 22:40:50,483 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-11-09 22:40:50,483 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2018-11-09 22:40:50,483 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 34 transitions. [2018-11-09 22:40:50,484 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-09 22:40:50,484 INFO L705 BuchiCegarLoop]: Abstraction has 29 states and 34 transitions. [2018-11-09 22:40:50,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 34 transitions. [2018-11-09 22:40:50,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-11-09 22:40:50,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-09 22:40:50,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2018-11-09 22:40:50,502 INFO L728 BuchiCegarLoop]: Abstraction has 29 states and 34 transitions. [2018-11-09 22:40:50,502 INFO L608 BuchiCegarLoop]: Abstraction has 29 states and 34 transitions. [2018-11-09 22:40:50,502 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-09 22:40:50,502 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 34 transitions. [2018-11-09 22:40:50,503 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2018-11-09 22:40:50,503 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-09 22:40:50,503 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-09 22:40:50,504 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-09 22:40:50,504 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-09 22:40:50,504 INFO L793 eck$LassoCheckResult]: Stem: 200#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 184#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_#t~post4, main_#t~nondet1, main_#t~mem5, main_#t~mem6.base, main_#t~mem6.offset, main_#t~post7, main_#t~mem8.base, main_#t~mem8.offset, main_~tmp~0.base, main_~tmp~0.offset, main_~a~0.base, main_~a~0.offset, main_~t~0.base, main_~t~0.offset, main_~p~0.base, main_~p~0.offset, main_~i~0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 8;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~a~0.base, main_~a~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset; 185#L629 assume !(main_~a~0.base == 0 && main_~a~0.offset == 0); 189#L629-2 havoc main_~t~0.base, main_~t~0.offset;main_~p~0.base, main_~p~0.offset := main_~a~0.base, main_~a~0.offset;main_~i~0 := 0; 190#L633-3 assume true; 197#L633-1 assume !(main_~i~0 < 30 && main_#t~nondet1 != 0);havoc main_#t~nondet1; 198#L633-4 SUMMARY for call write~int(main_~i~0, main_~p~0.base, main_~p~0.offset + 0, 4); srcloc: L633-4 182#L641 SUMMARY for call write~$Pointer$(0, 0, main_~p~0.base, main_~p~0.offset + 4, 4); srcloc: L641 183#L642 main_~p~0.base, main_~p~0.offset := main_~a~0.base, main_~a~0.offset;main_~i~0 := 0; 180#L645-3 [2018-11-09 22:40:50,504 INFO L795 eck$LassoCheckResult]: Loop: 180#L645-3 assume true; 173#L645-1 assume !!(main_~p~0.base != 0 || main_~p~0.offset != 0); 175#L646 SUMMARY for call main_#t~mem5 := read~int(main_~p~0.base, main_~p~0.offset + 0, 4); srcloc: L646 201#L646-1 assume !(main_#t~mem5 != 1);havoc main_#t~mem5; 192#L646-3 SUMMARY for call main_#t~mem6.base, main_#t~mem6.offset := read~$Pointer$(main_~p~0.base, main_~p~0.offset + 4, 4); srcloc: L646-3 186#L649 main_~p~0.base, main_~p~0.offset := main_#t~mem6.base, main_#t~mem6.offset;havoc main_#t~mem6.base, main_#t~mem6.offset;main_#t~post7 := main_~i~0;main_~i~0 := main_#t~post7 + 1;havoc main_#t~post7; 180#L645-3 [2018-11-09 22:40:50,504 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:40:50,504 INFO L82 PathProgramCache]: Analyzing trace with hash -361796192, now seen corresponding path program 1 times [2018-11-09 22:40:50,505 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 22:40:50,505 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 22:40:50,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:40:50,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 22:40:50,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:40:50,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 22:40:50,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 22:40:50,521 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:40:50,521 INFO L82 PathProgramCache]: Analyzing trace with hash -2040861009, now seen corresponding path program 1 times [2018-11-09 22:40:50,521 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 22:40:50,521 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 22:40:50,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:40:50,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 22:40:50,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:40:50,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 22:40:50,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 22:40:50,531 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:40:50,531 INFO L82 PathProgramCache]: Analyzing trace with hash -2084345586, now seen corresponding path program 1 times [2018-11-09 22:40:50,531 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 22:40:50,531 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 22:40:50,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:40:50,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 22:40:50,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:40:50,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 22:40:50,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-09 22:40:50,589 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-09 22:40:50,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-09 22:40:50,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-09 22:40:50,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-09 22:40:50,664 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. cyclomatic complexity: 8 Second operand 6 states. [2018-11-09 22:40:50,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 22:40:50,796 INFO L93 Difference]: Finished difference Result 71 states and 76 transitions. [2018-11-09 22:40:50,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-09 22:40:50,797 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 71 states and 76 transitions. [2018-11-09 22:40:50,798 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2018-11-09 22:40:50,799 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 71 states to 66 states and 71 transitions. [2018-11-09 22:40:50,799 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 48 [2018-11-09 22:40:50,800 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 48 [2018-11-09 22:40:50,814 INFO L73 IsDeterministic]: Start isDeterministic. Operand 66 states and 71 transitions. [2018-11-09 22:40:50,814 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-09 22:40:50,814 INFO L705 BuchiCegarLoop]: Abstraction has 66 states and 71 transitions. [2018-11-09 22:40:50,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states and 71 transitions. [2018-11-09 22:40:50,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 34. [2018-11-09 22:40:50,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-09 22:40:50,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2018-11-09 22:40:50,818 INFO L728 BuchiCegarLoop]: Abstraction has 34 states and 37 transitions. [2018-11-09 22:40:50,818 INFO L608 BuchiCegarLoop]: Abstraction has 34 states and 37 transitions. [2018-11-09 22:40:50,818 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-09 22:40:50,818 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 37 transitions. [2018-11-09 22:40:50,819 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-09 22:40:50,820 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-09 22:40:50,820 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-09 22:40:50,820 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-09 22:40:50,820 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-09 22:40:50,820 INFO L793 eck$LassoCheckResult]: Stem: 318#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 298#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_#t~post4, main_#t~nondet1, main_#t~mem5, main_#t~mem6.base, main_#t~mem6.offset, main_#t~post7, main_#t~mem8.base, main_#t~mem8.offset, main_~tmp~0.base, main_~tmp~0.offset, main_~a~0.base, main_~a~0.offset, main_~t~0.base, main_~t~0.offset, main_~p~0.base, main_~p~0.offset, main_~i~0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 8;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~a~0.base, main_~a~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset; 299#L629 assume !(main_~a~0.base == 0 && main_~a~0.offset == 0); 304#L629-2 havoc main_~t~0.base, main_~t~0.offset;main_~p~0.base, main_~p~0.offset := main_~a~0.base, main_~a~0.offset;main_~i~0 := 0; 305#L633-3 assume true; 315#L633-1 assume !(main_~i~0 < 30 && main_#t~nondet1 != 0);havoc main_#t~nondet1; 316#L633-4 SUMMARY for call write~int(main_~i~0, main_~p~0.base, main_~p~0.offset + 0, 4); srcloc: L633-4 317#L641 SUMMARY for call write~$Pointer$(0, 0, main_~p~0.base, main_~p~0.offset + 4, 4); srcloc: L641 314#L642 main_~p~0.base, main_~p~0.offset := main_~a~0.base, main_~a~0.offset;main_~i~0 := 0; 294#L645-3 assume true; 288#L645-1 assume !(main_~p~0.base != 0 || main_~p~0.offset != 0); 289#L645-4 main_~p~0.base, main_~p~0.offset := main_~a~0.base, main_~a~0.offset; 295#L654-3 [2018-11-09 22:40:50,821 INFO L795 eck$LassoCheckResult]: Loop: 295#L654-3 assume true; 292#L654-1 assume !!(main_~p~0.base != 0 || main_~p~0.offset != 0); 293#L655 SUMMARY for call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~p~0.base, main_~p~0.offset + 4, 4); srcloc: L655 309#L655-1 main_~tmp~0.base, main_~tmp~0.offset := main_#t~mem8.base, main_#t~mem8.offset;havoc main_#t~mem8.base, main_#t~mem8.offset;ULTIMATE.dealloc_old_#valid := #valid;assume { :begin_inline_ULTIMATE.dealloc } true;ULTIMATE.dealloc_~addr.base, ULTIMATE.dealloc_~addr.offset := main_~p~0.base, main_~p~0.offset;havoc #valid;assume #valid == ULTIMATE.dealloc_old_#valid[ULTIMATE.dealloc_~addr.base := 0];assume { :end_inline_ULTIMATE.dealloc } true;main_~p~0.base, main_~p~0.offset := main_~tmp~0.base, main_~tmp~0.offset; 295#L654-3 [2018-11-09 22:40:50,821 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:40:50,821 INFO L82 PathProgramCache]: Analyzing trace with hash 2097602911, now seen corresponding path program 1 times [2018-11-09 22:40:50,821 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 22:40:50,822 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 22:40:50,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:40:50,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 22:40:50,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:40:50,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 22:40:50,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-09 22:40:50,838 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-09 22:40:50,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-09 22:40:50,839 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-09 22:40:50,839 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:40:50,839 INFO L82 PathProgramCache]: Analyzing trace with hash 3115176, now seen corresponding path program 1 times [2018-11-09 22:40:50,839 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 22:40:50,839 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 22:40:50,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:40:50,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 22:40:50,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:40:50,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 22:40:50,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 22:40:50,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-09 22:40:50,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-09 22:40:50,911 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. cyclomatic complexity: 6 Second operand 4 states. [2018-11-09 22:40:50,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 22:40:50,939 INFO L93 Difference]: Finished difference Result 51 states and 53 transitions. [2018-11-09 22:40:50,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-09 22:40:50,940 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 53 transitions. [2018-11-09 22:40:50,941 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-09 22:40:50,942 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 45 states and 47 transitions. [2018-11-09 22:40:50,942 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2018-11-09 22:40:50,942 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2018-11-09 22:40:50,942 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 47 transitions. [2018-11-09 22:40:50,943 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-09 22:40:50,943 INFO L705 BuchiCegarLoop]: Abstraction has 45 states and 47 transitions. [2018-11-09 22:40:50,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 47 transitions. [2018-11-09 22:40:50,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 30. [2018-11-09 22:40:50,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-09 22:40:50,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2018-11-09 22:40:50,945 INFO L728 BuchiCegarLoop]: Abstraction has 30 states and 32 transitions. [2018-11-09 22:40:50,945 INFO L608 BuchiCegarLoop]: Abstraction has 30 states and 32 transitions. [2018-11-09 22:40:50,945 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-09 22:40:50,945 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 32 transitions. [2018-11-09 22:40:50,945 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-09 22:40:50,945 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-09 22:40:50,945 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-09 22:40:50,946 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-09 22:40:50,946 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-09 22:40:50,946 INFO L793 eck$LassoCheckResult]: Stem: 409#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 393#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_#t~post4, main_#t~nondet1, main_#t~mem5, main_#t~mem6.base, main_#t~mem6.offset, main_#t~post7, main_#t~mem8.base, main_#t~mem8.offset, main_~tmp~0.base, main_~tmp~0.offset, main_~a~0.base, main_~a~0.offset, main_~t~0.base, main_~t~0.offset, main_~p~0.base, main_~p~0.offset, main_~i~0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 8;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~a~0.base, main_~a~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset; 394#L629 assume !(main_~a~0.base == 0 && main_~a~0.offset == 0); 399#L629-2 havoc main_~t~0.base, main_~t~0.offset;main_~p~0.base, main_~p~0.offset := main_~a~0.base, main_~a~0.offset;main_~i~0 := 0; 400#L633-3 assume true; 408#L633-1 assume !!(main_~i~0 < 30 && main_#t~nondet1 != 0);havoc main_#t~nondet1; 402#L634 SUMMARY for call write~int(main_~i~0, main_~p~0.base, main_~p~0.offset + 0, 4); srcloc: L634 384#L634-1 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 8;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~t~0.base, main_~t~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset; 385#L636 assume !(main_~t~0.base == 0 && main_~t~0.offset == 0); 401#L636-2 SUMMARY for call write~$Pointer$(main_~t~0.base, main_~t~0.offset, main_~p~0.base, main_~p~0.offset + 4, 4); srcloc: L636-2 403#L637 SUMMARY for call main_#t~mem3.base, main_#t~mem3.offset := read~$Pointer$(main_~p~0.base, main_~p~0.offset + 4, 4); srcloc: L637 397#L638 main_~p~0.base, main_~p~0.offset := main_#t~mem3.base, main_#t~mem3.offset;havoc main_#t~mem3.base, main_#t~mem3.offset;main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 398#L633-3 assume true; 406#L633-1 assume !(main_~i~0 < 30 && main_#t~nondet1 != 0);havoc main_#t~nondet1; 407#L633-4 SUMMARY for call write~int(main_~i~0, main_~p~0.base, main_~p~0.offset + 0, 4); srcloc: L633-4 389#L641 SUMMARY for call write~$Pointer$(0, 0, main_~p~0.base, main_~p~0.offset + 4, 4); srcloc: L641 390#L642 main_~p~0.base, main_~p~0.offset := main_~a~0.base, main_~a~0.offset;main_~i~0 := 0; 388#L645-3 assume true; 382#L645-1 assume !!(main_~p~0.base != 0 || main_~p~0.offset != 0); 383#L646 [2018-11-09 22:40:50,946 INFO L795 eck$LassoCheckResult]: Loop: 383#L646 SUMMARY for call main_#t~mem5 := read~int(main_~p~0.base, main_~p~0.offset + 0, 4); srcloc: L646 410#L646-1 assume !(main_#t~mem5 != 1);havoc main_#t~mem5; 405#L646-3 SUMMARY for call main_#t~mem6.base, main_#t~mem6.offset := read~$Pointer$(main_~p~0.base, main_~p~0.offset + 4, 4); srcloc: L646-3 395#L649 main_~p~0.base, main_~p~0.offset := main_#t~mem6.base, main_#t~mem6.offset;havoc main_#t~mem6.base, main_#t~mem6.offset;main_#t~post7 := main_~i~0;main_~i~0 := main_#t~post7 + 1;havoc main_#t~post7; 396#L645-3 assume true; 411#L645-1 assume !!(main_~p~0.base != 0 || main_~p~0.offset != 0); 383#L646 [2018-11-09 22:40:50,946 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:40:50,946 INFO L82 PathProgramCache]: Analyzing trace with hash -1181079204, now seen corresponding path program 1 times [2018-11-09 22:40:50,946 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 22:40:50,946 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 22:40:50,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:40:50,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 22:40:50,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:40:50,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 22:40:50,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 22:40:50,967 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:40:50,967 INFO L82 PathProgramCache]: Analyzing trace with hash -1832798289, now seen corresponding path program 2 times [2018-11-09 22:40:50,968 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 22:40:50,968 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 22:40:50,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:40:50,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 22:40:50,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:40:50,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 22:40:50,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 22:40:50,975 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:40:50,975 INFO L82 PathProgramCache]: Analyzing trace with hash -567267126, now seen corresponding path program 1 times [2018-11-09 22:40:50,975 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 22:40:50,975 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 22:40:50,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:40:50,976 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-09 22:40:50,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:40:50,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 22:40:51,090 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-09 22:40:51,091 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-09 22:40:51,091 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_52c454eb-a25d-4b08-955e-0072e3ec58fe/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-09 22:40:51,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 22:40:51,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 22:40:51,125 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 22:40:51,141 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-09 22:40:51,141 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-09 22:40:51,145 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:40:51,145 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-09 22:40:51,184 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 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 11 treesize of output 8 [2018-11-09 22:40:51,185 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-09 22:40:51,186 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-09 22:40:51,187 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:40:51,192 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:40:51,192 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-11-09 22:40:51,210 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 22:40:51,211 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 22:40:51,212 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-09 22:40:51,212 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-09 22:40:51,217 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:40:51,217 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:18 [2018-11-09 22:40:51,234 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 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 13 treesize of output 10 [2018-11-09 22:40:51,236 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-09 22:40:51,236 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-09 22:40:51,238 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:40:51,244 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:40:51,244 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:24 [2018-11-09 22:40:51,262 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 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 20 treesize of output 16 [2018-11-09 22:40:51,264 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-11-09 22:40:51,264 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-09 22:40:51,266 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:40:51,269 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:40:51,269 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:12 [2018-11-09 22:40:51,285 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-11-09 22:40:51,289 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-09 22:40:51,289 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-09 22:40:51,293 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:40:51,297 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:40:51,297 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:23, output treesize:7 [2018-11-09 22:40:51,313 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 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 15 treesize of output 11 [2018-11-09 22:40:51,315 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-09 22:40:51,315 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-09 22:40:51,316 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:40:51,317 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:40:51,318 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-11-09 22:40:51,319 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-09 22:40:51,335 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-09 22:40:51,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 16 [2018-11-09 22:40:51,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-09 22:40:51,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2018-11-09 22:40:51,398 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. cyclomatic complexity: 5 Second operand 16 states. [2018-11-09 22:40:51,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 22:40:51,619 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2018-11-09 22:40:51,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-09 22:40:51,621 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 66 states and 69 transitions. [2018-11-09 22:40:51,621 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-09 22:40:51,622 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 66 states to 58 states and 61 transitions. [2018-11-09 22:40:51,622 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2018-11-09 22:40:51,622 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2018-11-09 22:40:51,622 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 61 transitions. [2018-11-09 22:40:51,622 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-09 22:40:51,622 INFO L705 BuchiCegarLoop]: Abstraction has 58 states and 61 transitions. [2018-11-09 22:40:51,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states and 61 transitions. [2018-11-09 22:40:51,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 38. [2018-11-09 22:40:51,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-09 22:40:51,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2018-11-09 22:40:51,625 INFO L728 BuchiCegarLoop]: Abstraction has 38 states and 40 transitions. [2018-11-09 22:40:51,625 INFO L608 BuchiCegarLoop]: Abstraction has 38 states and 40 transitions. [2018-11-09 22:40:51,625 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-09 22:40:51,625 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 40 transitions. [2018-11-09 22:40:51,625 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-09 22:40:51,626 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-09 22:40:51,626 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-09 22:40:51,626 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-09 22:40:51,626 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-09 22:40:51,626 INFO L793 eck$LassoCheckResult]: Stem: 614#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 596#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_#t~post4, main_#t~nondet1, main_#t~mem5, main_#t~mem6.base, main_#t~mem6.offset, main_#t~post7, main_#t~mem8.base, main_#t~mem8.offset, main_~tmp~0.base, main_~tmp~0.offset, main_~a~0.base, main_~a~0.offset, main_~t~0.base, main_~t~0.offset, main_~p~0.base, main_~p~0.offset, main_~i~0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 8;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~a~0.base, main_~a~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset; 597#L629 assume !(main_~a~0.base == 0 && main_~a~0.offset == 0); 602#L629-2 havoc main_~t~0.base, main_~t~0.offset;main_~p~0.base, main_~p~0.offset := main_~a~0.base, main_~a~0.offset;main_~i~0 := 0; 603#L633-3 assume true; 612#L633-1 assume !!(main_~i~0 < 30 && main_#t~nondet1 != 0);havoc main_#t~nondet1; 622#L634 SUMMARY for call write~int(main_~i~0, main_~p~0.base, main_~p~0.offset + 0, 4); srcloc: L634 621#L634-1 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 8;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~t~0.base, main_~t~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset; 620#L636 assume !(main_~t~0.base == 0 && main_~t~0.offset == 0); 619#L636-2 SUMMARY for call write~$Pointer$(main_~t~0.base, main_~t~0.offset, main_~p~0.base, main_~p~0.offset + 4, 4); srcloc: L636-2 618#L637 SUMMARY for call main_#t~mem3.base, main_#t~mem3.offset := read~$Pointer$(main_~p~0.base, main_~p~0.offset + 4, 4); srcloc: L637 617#L638 main_~p~0.base, main_~p~0.offset := main_#t~mem3.base, main_#t~mem3.offset;havoc main_#t~mem3.base, main_#t~mem3.offset;main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 613#L633-3 assume true; 611#L633-1 assume !!(main_~i~0 < 30 && main_#t~nondet1 != 0);havoc main_#t~nondet1; 606#L634 SUMMARY for call write~int(main_~i~0, main_~p~0.base, main_~p~0.offset + 0, 4); srcloc: L634 587#L634-1 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 8;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~t~0.base, main_~t~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset; 588#L636 assume !(main_~t~0.base == 0 && main_~t~0.offset == 0); 604#L636-2 SUMMARY for call write~$Pointer$(main_~t~0.base, main_~t~0.offset, main_~p~0.base, main_~p~0.offset + 4, 4); srcloc: L636-2 605#L637 SUMMARY for call main_#t~mem3.base, main_#t~mem3.offset := read~$Pointer$(main_~p~0.base, main_~p~0.offset + 4, 4); srcloc: L637 600#L638 main_~p~0.base, main_~p~0.offset := main_#t~mem3.base, main_#t~mem3.offset;havoc main_#t~mem3.base, main_#t~mem3.offset;main_#t~post4 := main_~i~0;main_~i~0 := main_#t~post4 + 1;havoc main_#t~post4; 601#L633-3 assume true; 609#L633-1 assume !(main_~i~0 < 30 && main_#t~nondet1 != 0);havoc main_#t~nondet1; 610#L633-4 SUMMARY for call write~int(main_~i~0, main_~p~0.base, main_~p~0.offset + 0, 4); srcloc: L633-4 592#L641 SUMMARY for call write~$Pointer$(0, 0, main_~p~0.base, main_~p~0.offset + 4, 4); srcloc: L641 593#L642 main_~p~0.base, main_~p~0.offset := main_~a~0.base, main_~a~0.offset;main_~i~0 := 0; 591#L645-3 assume true; 585#L645-1 assume !!(main_~p~0.base != 0 || main_~p~0.offset != 0); 586#L646 [2018-11-09 22:40:51,627 INFO L795 eck$LassoCheckResult]: Loop: 586#L646 SUMMARY for call main_#t~mem5 := read~int(main_~p~0.base, main_~p~0.offset + 0, 4); srcloc: L646 615#L646-1 assume !(main_#t~mem5 != 1);havoc main_#t~mem5; 608#L646-3 SUMMARY for call main_#t~mem6.base, main_#t~mem6.offset := read~$Pointer$(main_~p~0.base, main_~p~0.offset + 4, 4); srcloc: L646-3 598#L649 main_~p~0.base, main_~p~0.offset := main_#t~mem6.base, main_#t~mem6.offset;havoc main_#t~mem6.base, main_#t~mem6.offset;main_#t~post7 := main_~i~0;main_~i~0 := main_#t~post7 + 1;havoc main_#t~post7; 599#L645-3 assume true; 616#L645-1 assume !!(main_~p~0.base != 0 || main_~p~0.offset != 0); 586#L646 [2018-11-09 22:40:51,627 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:40:51,627 INFO L82 PathProgramCache]: Analyzing trace with hash 431976786, now seen corresponding path program 2 times [2018-11-09 22:40:51,627 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 22:40:51,627 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 22:40:51,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:40:51,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 22:40:51,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:40:51,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 22:40:51,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 22:40:51,656 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:40:51,657 INFO L82 PathProgramCache]: Analyzing trace with hash -1832798289, now seen corresponding path program 3 times [2018-11-09 22:40:51,657 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 22:40:51,657 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 22:40:51,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:40:51,659 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-09 22:40:51,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:40:51,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 22:40:51,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 22:40:51,664 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:40:51,665 INFO L82 PathProgramCache]: Analyzing trace with hash 2118199360, now seen corresponding path program 2 times [2018-11-09 22:40:51,665 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 22:40:51,665 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 22:40:51,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:40:51,665 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-09 22:40:51,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:40:51,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 22:40:51,844 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-09 22:40:51,844 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-09 22:40:51,844 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_52c454eb-a25d-4b08-955e-0072e3ec58fe/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-09 22:40:51,851 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-09 22:40:51,874 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-09 22:40:51,874 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-09 22:40:51,876 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 22:40:51,878 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-09 22:40:51,879 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-09 22:40:51,882 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:40:51,882 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-09 22:40:51,939 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 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 11 treesize of output 8 [2018-11-09 22:40:51,940 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-09 22:40:51,941 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-09 22:40:51,942 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:40:51,947 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:40:51,948 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-11-09 22:40:51,965 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 22:40:51,965 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 22:40:51,966 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-09 22:40:51,966 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-09 22:40:51,974 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:40:51,974 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:18 [2018-11-09 22:40:51,989 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 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 13 treesize of output 10 [2018-11-09 22:40:51,990 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-09 22:40:51,991 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-09 22:40:51,992 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:40:51,997 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:40:51,998 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:29 [2018-11-09 22:40:52,046 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 22:40:52,049 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 26 [2018-11-09 22:40:52,051 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-11-09 22:40:52,051 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-09 22:40:52,054 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:40:52,060 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:40:52,060 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:43, output treesize:32 [2018-11-09 22:40:52,063 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 22:40:52,064 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 22:40:52,064 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-09 22:40:52,064 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-09 22:40:52,070 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:40:52,070 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:31 [2018-11-09 22:40:52,088 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 22:40:52,091 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 34 [2018-11-09 22:40:52,092 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-09 22:40:52,092 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-09 22:40:52,096 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:40:52,102 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:40:52,102 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:37 [2018-11-09 22:40:52,131 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 31 [2018-11-09 22:40:52,133 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-11-09 22:40:52,133 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-09 22:40:52,137 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2018-11-09 22:40:52,137 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-09 22:40:52,138 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:40:52,140 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:40:52,141 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:49, output treesize:12 [2018-11-09 22:40:52,161 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-11-09 22:40:52,163 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-09 22:40:52,163 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-09 22:40:52,166 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:40:52,170 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:40:52,170 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:23, output treesize:7 [2018-11-09 22:40:52,185 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 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 15 treesize of output 11 [2018-11-09 22:40:52,187 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-09 22:40:52,187 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-09 22:40:52,188 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:40:52,189 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:40:52,189 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-11-09 22:40:52,191 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-09 22:40:52,207 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-09 22:40:52,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 25 [2018-11-09 22:40:52,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-09 22:40:52,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=494, Unknown=0, NotChecked=0, Total=600 [2018-11-09 22:40:52,255 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. cyclomatic complexity: 5 Second operand 25 states. [2018-11-09 22:40:52,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 22:40:52,557 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-11-09 22:40:52,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-09 22:40:52,558 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 36 transitions. [2018-11-09 22:40:52,558 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-09 22:40:52,558 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 0 states and 0 transitions. [2018-11-09 22:40:52,558 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-09 22:40:52,558 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-09 22:40:52,558 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-09 22:40:52,558 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-09 22:40:52,559 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-09 22:40:52,559 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-09 22:40:52,559 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-09 22:40:52,559 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-09 22:40:52,559 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-09 22:40:52,559 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-09 22:40:52,559 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-09 22:40:52,563 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 09.11 10:40:52 BoogieIcfgContainer [2018-11-09 22:40:52,563 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-09 22:40:52,563 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-09 22:40:52,563 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-09 22:40:52,563 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-09 22:40:52,564 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:40:49" (3/4) ... [2018-11-09 22:40:52,566 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-09 22:40:52,566 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-09 22:40:52,566 INFO L168 Benchmark]: Toolchain (without parser) took 4069.14 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 224.9 MB). Free memory was 956.5 MB in the beginning and 810.4 MB in the end (delta: 146.1 MB). Peak memory consumption was 371.0 MB. Max. memory is 11.5 GB. [2018-11-09 22:40:52,567 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-09 22:40:52,567 INFO L168 Benchmark]: CACSL2BoogieTranslator took 307.47 ms. Allocated memory is still 1.0 GB. Free memory was 956.5 MB in the beginning and 929.6 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. [2018-11-09 22:40:52,567 INFO L168 Benchmark]: Boogie Procedure Inliner took 73.88 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 929.6 MB in the beginning and 1.1 GB in the end (delta: -210.5 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. [2018-11-09 22:40:52,567 INFO L168 Benchmark]: Boogie Preprocessor took 22.49 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-09 22:40:52,568 INFO L168 Benchmark]: RCFGBuilder took 252.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 28.6 MB). Peak memory consumption was 28.6 MB. Max. memory is 11.5 GB. [2018-11-09 22:40:52,568 INFO L168 Benchmark]: BuchiAutomizer took 3407.63 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 78.6 MB). Free memory was 1.1 GB in the beginning and 810.4 MB in the end (delta: 301.2 MB). Peak memory consumption was 379.8 MB. Max. memory is 11.5 GB. [2018-11-09 22:40:52,568 INFO L168 Benchmark]: Witness Printer took 2.67 ms. Allocated memory is still 1.3 GB. Free memory is still 810.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-09 22:40:52,570 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.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 307.47 ms. Allocated memory is still 1.0 GB. Free memory was 956.5 MB in the beginning and 929.6 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 73.88 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 929.6 MB in the beginning and 1.1 GB in the end (delta: -210.5 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 22.49 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 252.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 28.6 MB). Peak memory consumption was 28.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3407.63 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 78.6 MB). Free memory was 1.1 GB in the beginning and 810.4 MB in the end (delta: 301.2 MB). Peak memory consumption was 379.8 MB. Max. memory is 11.5 GB. * Witness Printer took 2.67 ms. Allocated memory is still 1.3 GB. Free memory is still 810.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (4 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i + 59 and consists of 5 locations. 4 modules have a trivial ranking function, the largest among these consists of 25 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.3s and 6 iterations. TraceHistogramMax:3. Analysis of lassos took 2.4s. Construction of modules took 0.3s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 67 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 38 states and ocurred in iteration 4. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 59 SDtfs, 307 SDslu, 205 SDs, 0 SdLazy, 612 SolverSat, 95 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc3 concLT0 SILN0 SILU1 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital192 mio100 ax100 hnf100 lsp94 ukn77 mio100 lsp21 div100 bol100 ite100 ukn100 eq216 hnf89 smp100 dnf176 smp100 tf100 neg96 sie107 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 6ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 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...