./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/ldv-memsafety-bitfields/test-bitfields-3_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0cd3be1d Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_0cdc5b13-9fed-43c3-8c3b-6329660789eb/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_0cdc5b13-9fed-43c3-8c3b-6329660789eb/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_0cdc5b13-9fed-43c3-8c3b-6329660789eb/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_0cdc5b13-9fed-43c3-8c3b-6329660789eb/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/ldv-memsafety-bitfields/test-bitfields-3_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_0cdc5b13-9fed-43c3-8c3b-6329660789eb/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_0cdc5b13-9fed-43c3-8c3b-6329660789eb/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 2187ad12904216f135de1d4e0a00e45b56b4da69 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-0cd3be1 [2018-11-28 11:16:26,842 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 11:16:26,843 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 11:16:26,849 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 11:16:26,850 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 11:16:26,850 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 11:16:26,851 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 11:16:26,852 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 11:16:26,854 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 11:16:26,854 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 11:16:26,855 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 11:16:26,855 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 11:16:26,856 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 11:16:26,856 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 11:16:26,857 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 11:16:26,857 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 11:16:26,858 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 11:16:26,859 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 11:16:26,861 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 11:16:26,862 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 11:16:26,862 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 11:16:26,863 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 11:16:26,864 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 11:16:26,864 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 11:16:26,864 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 11:16:26,865 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 11:16:26,866 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 11:16:26,866 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 11:16:26,866 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 11:16:26,867 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 11:16:26,867 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 11:16:26,868 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 11:16:26,868 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 11:16:26,868 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 11:16:26,868 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 11:16:26,869 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 11:16:26,869 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_0cdc5b13-9fed-43c3-8c3b-6329660789eb/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-28 11:16:26,877 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 11:16:26,877 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 11:16:26,878 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 11:16:26,878 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 11:16:26,878 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 11:16:26,878 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 11:16:26,879 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 11:16:26,879 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 11:16:26,879 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 11:16:26,879 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 11:16:26,879 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 11:16:26,879 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 11:16:26,879 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 11:16:26,880 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 11:16:26,880 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 11:16:26,880 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 11:16:26,880 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 11:16:26,880 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 11:16:26,880 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 11:16:26,880 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 11:16:26,881 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 11:16:26,881 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 11:16:26,881 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 11:16:26,881 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 11:16:26,881 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 11:16:26,881 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 11:16:26,882 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 11:16:26,882 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 11:16:26,882 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 11:16:26,882 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 11:16:26,882 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 11:16:26,883 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 11:16:26,883 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_0cdc5b13-9fed-43c3-8c3b-6329660789eb/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 -> 2187ad12904216f135de1d4e0a00e45b56b4da69 [2018-11-28 11:16:26,902 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 11:16:26,910 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 11:16:26,912 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 11:16:26,913 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 11:16:26,914 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 11:16:26,914 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_0cdc5b13-9fed-43c3-8c3b-6329660789eb/bin-2019/uautomizer/../../sv-benchmarks/c/ldv-memsafety-bitfields/test-bitfields-3_true-valid-memsafety_true-termination.i [2018-11-28 11:16:26,954 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0cdc5b13-9fed-43c3-8c3b-6329660789eb/bin-2019/uautomizer/data/95e125e71/3729dd83eaf8419db3186f85520258e7/FLAGa383917f3 [2018-11-28 11:16:27,365 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 11:16:27,366 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_0cdc5b13-9fed-43c3-8c3b-6329660789eb/sv-benchmarks/c/ldv-memsafety-bitfields/test-bitfields-3_true-valid-memsafety_true-termination.i [2018-11-28 11:16:27,369 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0cdc5b13-9fed-43c3-8c3b-6329660789eb/bin-2019/uautomizer/data/95e125e71/3729dd83eaf8419db3186f85520258e7/FLAGa383917f3 [2018-11-28 11:16:27,380 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_0cdc5b13-9fed-43c3-8c3b-6329660789eb/bin-2019/uautomizer/data/95e125e71/3729dd83eaf8419db3186f85520258e7 [2018-11-28 11:16:27,382 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 11:16:27,383 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 11:16:27,384 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 11:16:27,384 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 11:16:27,387 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 11:16:27,388 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:16:27" (1/1) ... [2018-11-28 11:16:27,390 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3bd8d9d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:16:27, skipping insertion in model container [2018-11-28 11:16:27,390 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:16:27" (1/1) ... [2018-11-28 11:16:27,396 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 11:16:27,408 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 11:16:27,511 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 11:16:27,520 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 11:16:27,533 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 11:16:27,545 INFO L195 MainTranslator]: Completed translation [2018-11-28 11:16:27,545 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:16:27 WrapperNode [2018-11-28 11:16:27,545 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 11:16:27,546 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 11:16:27,546 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 11:16:27,546 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 11:16:27,551 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:16:27" (1/1) ... [2018-11-28 11:16:27,556 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:16:27" (1/1) ... [2018-11-28 11:16:27,569 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 11:16:27,569 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 11:16:27,569 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 11:16:27,569 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 11:16:27,611 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:16:27" (1/1) ... [2018-11-28 11:16:27,612 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:16:27" (1/1) ... [2018-11-28 11:16:27,614 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:16:27" (1/1) ... [2018-11-28 11:16:27,614 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:16:27" (1/1) ... [2018-11-28 11:16:27,619 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:16:27" (1/1) ... [2018-11-28 11:16:27,623 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:16:27" (1/1) ... [2018-11-28 11:16:27,625 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:16:27" (1/1) ... [2018-11-28 11:16:27,626 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 11:16:27,627 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 11:16:27,627 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 11:16:27,627 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 11:16:27,628 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:16:27" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0cdc5b13-9fed-43c3-8c3b-6329660789eb/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-28 11:16:27,663 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2018-11-28 11:16:27,663 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2018-11-28 11:16:27,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2018-11-28 11:16:27,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-28 11:16:27,664 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 11:16:27,664 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2018-11-28 11:16:27,664 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 11:16:27,664 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 11:16:27,664 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 11:16:27,664 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 11:16:27,847 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-28 11:16:27,878 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 11:16:27,878 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-11-28 11:16:27,879 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:16:27 BoogieIcfgContainer [2018-11-28 11:16:27,879 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 11:16:27,879 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 11:16:27,879 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 11:16:27,882 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 11:16:27,883 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 11:16:27,883 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 11:16:27" (1/3) ... [2018-11-28 11:16:27,884 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2c425e4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:16:27, skipping insertion in model container [2018-11-28 11:16:27,884 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 11:16:27,884 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:16:27" (2/3) ... [2018-11-28 11:16:27,884 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2c425e4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:16:27, skipping insertion in model container [2018-11-28 11:16:27,884 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 11:16:27,884 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:16:27" (3/3) ... [2018-11-28 11:16:27,886 INFO L375 chiAutomizerObserver]: Analyzing ICFG test-bitfields-3_true-valid-memsafety_true-termination.i [2018-11-28 11:16:27,925 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 11:16:27,926 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 11:16:27,926 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 11:16:27,926 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 11:16:27,926 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 11:16:27,926 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 11:16:27,926 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 11:16:27,926 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 11:16:27,926 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 11:16:27,936 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states. [2018-11-28 11:16:27,952 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2018-11-28 11:16:27,952 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:16:27,952 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:16:27,956 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-28 11:16:27,956 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-28 11:16:27,957 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 11:16:27,957 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states. [2018-11-28 11:16:27,959 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2018-11-28 11:16:27,959 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:16:27,959 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:16:27,959 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-28 11:16:27,960 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-28 11:16:27,965 INFO L794 eck$LassoCheckResult]: Stem: 28#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#d~0.base, ~#d~0.offset := #Ultimate.alloc(10);call write~init~int(0, ~#d~0.base, ~#d~0.offset, 1);call write~init~int(3, ~#d~0.base, 1 + ~#d~0.offset, 1);call write~init~int(0, ~#d~0.base, 2 + ~#d~0.offset, 1);call write~init~int(0, ~#d~0.base, 3 + ~#d~0.offset, 1);call write~init~int(0, ~#d~0.base, 4 + ~#d~0.offset, 1);call write~init~int(0, ~#d~0.base, 5 + ~#d~0.offset, 1);call write~init~int(0, ~#d~0.base, 6 + ~#d~0.offset, 4); 10#L-1true havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~memcpy~res1.base, main_#t~memcpy~res1.offset, main_#t~mem2, main_#t~mem3, main_#t~mem4, main_#t~mem5, main_#t~mem6, main_#t~mem7, main_#t~mem8, main_#t~mem9, main_#t~mem10, main_#t~mem11, main_~p~0.base, main_~p~0.offset;havoc main_~p~0.base, main_~p~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.alloc(10);main_~p~0.base, main_~p~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset; 24#L41true call main_#t~memcpy~res1.base, main_#t~memcpy~res1.offset := #Ultimate.C_memcpy(main_~p~0.base, main_~p~0.offset, ~#d~0.base, ~#d~0.offset, 10);< 14##Ultimate.C_memcpyENTRYtrue assume 1 == #valid[dest.base];assume 1 == #valid[src.base];assume size + dest.offset <= #length[dest.base] && 0 <= dest.offset;assume size + src.offset <= #length[src.base] && 0 <= src.offset; 5#$Ultimate##0true #t~loopctr13 := 0; 25#L-1-1true [2018-11-28 11:16:27,965 INFO L796 eck$LassoCheckResult]: Loop: 25#L-1-1true assume #t~loopctr13 < size;call #t~mem14 := read~unchecked~int(src.base, src.offset + #t~loopctr13, 1);call write~unchecked~int(#t~mem14, dest.base, dest.offset + #t~loopctr13, 1);call #t~mem15 := read~unchecked~int(src.base, src.offset + #t~loopctr13, 4);call write~unchecked~int(#t~mem15, dest.base, dest.offset + #t~loopctr13, 4);#t~loopctr13 := 1 + #t~loopctr13; 25#L-1-1true [2018-11-28 11:16:27,969 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:16:27,969 INFO L82 PathProgramCache]: Analyzing trace with hash 28780603, now seen corresponding path program 1 times [2018-11-28 11:16:27,971 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:16:27,971 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:16:28,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:16:28,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:16:28,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:16:28,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:16:28,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:16:28,071 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:16:28,071 INFO L82 PathProgramCache]: Analyzing trace with hash 114, now seen corresponding path program 1 times [2018-11-28 11:16:28,071 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:16:28,071 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:16:28,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:16:28,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:16:28,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:16:28,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:16:28,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:16:28,080 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:16:28,081 INFO L82 PathProgramCache]: Analyzing trace with hash 892198776, now seen corresponding path program 1 times [2018-11-28 11:16:28,081 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:16:28,081 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:16:28,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:16:28,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:16:28,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:16:28,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:16:28,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:16:28,351 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2018-11-28 11:16:28,638 WARN L180 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 86 [2018-11-28 11:16:28,700 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 11:16:28,701 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 11:16:28,701 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 11:16:28,701 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 11:16:28,701 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 11:16:28,701 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:16:28,701 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 11:16:28,701 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 11:16:28,702 INFO L131 ssoRankerPreferences]: Filename of dumped script: test-bitfields-3_true-valid-memsafety_true-termination.i_Iteration1_Lasso [2018-11-28 11:16:28,702 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 11:16:28,702 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 11:16:28,718 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-28 11:16:28,725 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-28 11:16:28,727 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-28 11:16:28,728 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-28 11:16:28,729 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-28 11:16:28,738 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-28 11:16:28,739 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-28 11:16:28,741 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-28 11:16:28,742 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-28 11:16:28,744 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-28 11:16:28,745 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-28 11:16:28,747 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-28 11:16:29,012 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 64 [2018-11-28 11:16:29,087 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-28 11:16:29,088 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-28 11:16:29,089 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-28 11:16:29,091 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-28 11:16:29,092 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-28 11:16:29,094 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-28 11:16:29,095 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-28 11:16:29,096 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-28 11:16:29,097 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-28 11:16:29,099 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-28 11:16:29,100 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-28 11:16:29,101 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-28 11:16:29,102 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-28 11:16:29,104 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-28 11:16:29,105 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-28 11:16:29,333 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 11:16:29,337 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 11:16:29,339 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-28 11:16:29,341 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:16:29,341 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:16:29,342 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:16:29,342 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:16:29,342 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:16:29,344 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:16:29,344 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:16:29,346 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:16:29,346 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-28 11:16:29,347 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:16:29,347 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:16:29,347 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:16:29,347 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:16:29,347 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:16:29,348 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:16:29,348 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:16:29,348 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:16:29,349 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-28 11:16:29,349 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:16:29,349 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:16:29,349 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:16:29,350 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:16:29,350 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:16:29,350 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:16:29,350 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:16:29,351 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:16:29,351 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-28 11:16:29,352 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:16:29,352 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:16:29,352 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:16:29,352 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:16:29,352 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:16:29,352 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:16:29,352 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:16:29,353 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:16:29,353 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-28 11:16:29,353 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:16:29,353 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:16:29,354 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:16:29,354 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:16:29,355 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:16:29,355 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:16:29,357 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:16:29,357 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-28 11:16:29,358 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:16:29,358 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:16:29,358 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:16:29,358 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:16:29,358 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:16:29,359 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:16:29,359 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:16:29,359 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:16:29,360 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-28 11:16:29,360 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:16:29,360 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:16:29,360 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:16:29,360 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:16:29,360 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:16:29,360 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:16:29,360 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:16:29,361 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:16:29,361 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-28 11:16:29,361 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:16:29,361 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:16:29,362 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:16:29,362 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:16:29,362 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:16:29,362 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:16:29,362 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:16:29,362 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:16:29,363 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-28 11:16:29,363 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:16:29,363 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:16:29,363 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:16:29,363 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:16:29,363 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:16:29,364 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:16:29,364 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:16:29,365 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:16:29,365 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-28 11:16:29,366 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:16:29,366 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:16:29,366 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:16:29,366 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:16:29,366 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:16:29,366 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:16:29,366 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:16:29,367 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:16:29,367 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-28 11:16:29,367 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:16:29,367 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:16:29,367 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:16:29,368 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:16:29,368 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:16:29,368 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:16:29,368 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:16:29,368 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:16:29,368 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-28 11:16:29,369 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:16:29,369 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:16:29,369 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:16:29,369 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:16:29,371 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:16:29,371 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:16:29,377 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:16:29,377 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-28 11:16:29,378 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:16:29,378 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:16:29,378 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:16:29,378 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:16:29,381 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:16:29,381 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:16:29,391 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:16:29,391 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-28 11:16:29,392 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:16:29,392 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:16:29,392 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:16:29,392 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:16:29,394 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:16:29,394 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:16:29,398 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:16:29,398 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-28 11:16:29,399 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:16:29,399 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:16:29,399 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:16:29,399 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:16:29,400 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:16:29,400 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:16:29,404 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:16:29,404 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-28 11:16:29,405 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:16:29,405 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:16:29,405 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:16:29,405 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:16:29,406 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:16:29,407 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:16:29,411 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:16:29,411 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-28 11:16:29,412 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:16:29,412 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:16:29,412 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:16:29,412 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:16:29,413 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:16:29,413 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:16:29,415 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:16:29,416 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-28 11:16:29,416 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:16:29,416 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:16:29,416 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:16:29,417 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:16:29,418 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:16:29,419 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:16:29,437 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 11:16:29,460 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-28 11:16:29,460 INFO L444 ModelExtractionUtils]: 12 out of 19 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-28 11:16:29,463 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 11:16:29,464 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 11:16:29,464 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 11:16:29,465 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(#Ultimate.C_memcpy_#t~loopctr13, #Ultimate.C_memcpy_size) = -1*#Ultimate.C_memcpy_#t~loopctr13 + 1*#Ultimate.C_memcpy_size Supporting invariants [] [2018-11-28 11:16:29,525 INFO L297 tatePredicateManager]: 27 out of 27 supporting invariants were superfluous and have been removed [2018-11-28 11:16:29,530 WARN L1298 BoogieBacktranslator]: unknown boogie variable size [2018-11-28 11:16:29,541 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:16:29,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:16:29,563 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:16:29,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:16:29,576 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:16:29,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:16:29,586 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2018-11-28 11:16:29,587 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states. Second operand 2 states. [2018-11-28 11:16:29,627 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states.. Second operand 2 states. Result 38 states and 53 transitions. Complement of second has 6 states. [2018-11-28 11:16:29,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 11:16:29,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-28 11:16:29,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2018-11-28 11:16:29,631 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 5 letters. Loop has 1 letters. [2018-11-28 11:16:29,632 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:16:29,632 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 6 letters. Loop has 1 letters. [2018-11-28 11:16:29,632 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:16:29,633 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 5 letters. Loop has 2 letters. [2018-11-28 11:16:29,633 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:16:29,634 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 53 transitions. [2018-11-28 11:16:29,635 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-28 11:16:29,638 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 9 states and 11 transitions. [2018-11-28 11:16:29,639 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2018-11-28 11:16:29,639 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2018-11-28 11:16:29,639 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 11 transitions. [2018-11-28 11:16:29,639 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 11:16:29,639 INFO L705 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2018-11-28 11:16:29,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 11 transitions. [2018-11-28 11:16:29,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2018-11-28 11:16:29,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-28 11:16:29,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2018-11-28 11:16:29,656 INFO L728 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2018-11-28 11:16:29,656 INFO L608 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2018-11-28 11:16:29,656 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 11:16:29,656 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 10 transitions. [2018-11-28 11:16:29,656 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-28 11:16:29,656 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:16:29,656 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:16:29,656 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-28 11:16:29,657 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-28 11:16:29,657 INFO L794 eck$LassoCheckResult]: Stem: 225#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#d~0.base, ~#d~0.offset := #Ultimate.alloc(10);call write~init~int(0, ~#d~0.base, ~#d~0.offset, 1);call write~init~int(3, ~#d~0.base, 1 + ~#d~0.offset, 1);call write~init~int(0, ~#d~0.base, 2 + ~#d~0.offset, 1);call write~init~int(0, ~#d~0.base, 3 + ~#d~0.offset, 1);call write~init~int(0, ~#d~0.base, 4 + ~#d~0.offset, 1);call write~init~int(0, ~#d~0.base, 5 + ~#d~0.offset, 1);call write~init~int(0, ~#d~0.base, 6 + ~#d~0.offset, 4); 221#L-1 havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~memcpy~res1.base, main_#t~memcpy~res1.offset, main_#t~mem2, main_#t~mem3, main_#t~mem4, main_#t~mem5, main_#t~mem6, main_#t~mem7, main_#t~mem8, main_#t~mem9, main_#t~mem10, main_#t~mem11, main_~p~0.base, main_~p~0.offset;havoc main_~p~0.base, main_~p~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.alloc(10);main_~p~0.base, main_~p~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset; 222#L41 call main_#t~memcpy~res1.base, main_#t~memcpy~res1.offset := #Ultimate.C_memcpy(main_~p~0.base, main_~p~0.offset, ~#d~0.base, ~#d~0.offset, 10);< 227##Ultimate.C_memcpyENTRY assume 1 == #valid[dest.base];assume 1 == #valid[src.base];assume size + dest.offset <= #length[dest.base] && 0 <= dest.offset;assume size + src.offset <= #length[src.base] && 0 <= src.offset; 223#$Ultimate##0 #t~loopctr13 := 0; 224#L-1-1 assume !(#t~loopctr13 < size);#t~loopctr16 := 0; 226#L-1-3 [2018-11-28 11:16:29,657 INFO L796 eck$LassoCheckResult]: Loop: 226#L-1-3 assume #t~loopctr16 < size;#t~loopctr16 := 4 + #t~loopctr16; 226#L-1-3 [2018-11-28 11:16:29,657 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:16:29,657 INFO L82 PathProgramCache]: Analyzing trace with hash 892198778, now seen corresponding path program 1 times [2018-11-28 11:16:29,657 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:16:29,657 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:16:29,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:16:29,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:16:29,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:16:29,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:16:29,694 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-28 11:16:29,695 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:16:29,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:16:29,696 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 11:16:29,696 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:16:29,696 INFO L82 PathProgramCache]: Analyzing trace with hash 120, now seen corresponding path program 1 times [2018-11-28 11:16:29,697 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:16:29,697 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:16:29,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:16:29,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:16:29,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:16:29,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:16:29,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:16:29,705 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 11:16:29,705 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 11:16:29,705 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 11:16:29,705 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 11:16:29,705 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 11:16:29,705 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:16:29,705 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 11:16:29,705 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 11:16:29,706 INFO L131 ssoRankerPreferences]: Filename of dumped script: test-bitfields-3_true-valid-memsafety_true-termination.i_Iteration2_Loop [2018-11-28 11:16:29,706 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 11:16:29,706 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 11:16:29,706 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:16:29,733 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 11:16:29,734 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0cdc5b13-9fed-43c3-8c3b-6329660789eb/bin-2019/uautomizer/z3 Starting monitored process 2 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 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:16:29,737 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 11:16:29,737 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0cdc5b13-9fed-43c3-8c3b-6329660789eb/bin-2019/uautomizer/z3 Starting monitored process 3 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 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:16:29,759 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 11:16:29,759 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 11:16:29,844 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 11:16:29,845 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 11:16:29,845 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 11:16:29,845 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 11:16:29,845 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 11:16:29,845 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 11:16:29,845 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:16:29,845 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 11:16:29,845 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 11:16:29,845 INFO L131 ssoRankerPreferences]: Filename of dumped script: test-bitfields-3_true-valid-memsafety_true-termination.i_Iteration2_Loop [2018-11-28 11:16:29,845 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 11:16:29,846 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 11:16:29,846 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-28 11:16:29,862 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 11:16:29,862 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 11:16:29,862 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:16:29,863 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:16:29,863 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:16:29,863 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:16:29,863 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:16:29,863 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:16:29,864 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:16:29,864 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:16:29,865 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 11:16:29,867 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-28 11:16:29,867 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 11:16:29,867 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 11:16:29,867 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 11:16:29,868 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 11:16:29,868 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(#Ultimate.C_memcpy_#t~loopctr16, #Ultimate.C_memcpy_size) = -1*#Ultimate.C_memcpy_#t~loopctr16 + 1*#Ultimate.C_memcpy_size Supporting invariants [] [2018-11-28 11:16:29,868 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 11:16:29,874 WARN L1298 BoogieBacktranslator]: unknown boogie variable size [2018-11-28 11:16:29,883 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:16:29,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:16:29,897 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:16:29,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:16:29,901 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:16:29,901 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-28 11:16:29,901 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2018-11-28 11:16:29,901 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 10 transitions. cyclomatic complexity: 4 Second operand 2 states. [2018-11-28 11:16:29,905 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 10 transitions. cyclomatic complexity: 4. Second operand 2 states. Result 9 states and 11 transitions. Complement of second has 3 states. [2018-11-28 11:16:29,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2018-11-28 11:16:29,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-28 11:16:29,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 8 transitions. [2018-11-28 11:16:29,907 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 8 transitions. Stem has 6 letters. Loop has 1 letters. [2018-11-28 11:16:29,907 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:16:29,907 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 8 transitions. Stem has 7 letters. Loop has 1 letters. [2018-11-28 11:16:29,907 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:16:29,907 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 8 transitions. Stem has 6 letters. Loop has 2 letters. [2018-11-28 11:16:29,907 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:16:29,907 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 11 transitions. [2018-11-28 11:16:29,908 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 11:16:29,908 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 0 states and 0 transitions. [2018-11-28 11:16:29,908 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-28 11:16:29,908 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-28 11:16:29,908 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-28 11:16:29,908 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 11:16:29,908 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 11:16:29,908 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 11:16:29,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 11:16:29,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-28 11:16:29,912 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 4 states. [2018-11-28 11:16:29,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:16:29,914 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-28 11:16:29,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-28 11:16:29,914 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2018-11-28 11:16:29,914 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 11:16:29,914 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2018-11-28 11:16:29,914 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-28 11:16:29,914 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-28 11:16:29,914 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-28 11:16:29,914 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 11:16:29,914 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 11:16:29,915 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 11:16:29,915 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 11:16:29,915 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 11:16:29,915 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-28 11:16:29,915 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 11:16:29,915 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-28 11:16:29,919 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 11:16:29 BoogieIcfgContainer [2018-11-28 11:16:29,919 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 11:16:29,920 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 11:16:29,920 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 11:16:29,920 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 11:16:29,920 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:16:27" (3/4) ... [2018-11-28 11:16:29,923 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 11:16:29,923 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 11:16:29,923 INFO L168 Benchmark]: Toolchain (without parser) took 2540.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.9 MB). Free memory was 953.3 MB in the beginning and 1.0 GB in the end (delta: -63.3 MB). Peak memory consumption was 63.6 MB. Max. memory is 11.5 GB. [2018-11-28 11:16:29,924 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 11:16:29,924 INFO L168 Benchmark]: CACSL2BoogieTranslator took 161.58 ms. Allocated memory is still 1.0 GB. Free memory was 953.3 MB in the beginning and 942.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-28 11:16:29,925 INFO L168 Benchmark]: Boogie Procedure Inliner took 23.00 ms. Allocated memory is still 1.0 GB. Free memory was 942.6 MB in the beginning and 939.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-28 11:16:29,925 INFO L168 Benchmark]: Boogie Preprocessor took 57.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.9 MB). Free memory was 939.9 MB in the beginning and 1.1 GB in the end (delta: -184.7 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. [2018-11-28 11:16:29,926 INFO L168 Benchmark]: RCFGBuilder took 252.10 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: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. [2018-11-28 11:16:29,926 INFO L168 Benchmark]: BuchiAutomizer took 2040.13 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 88.3 MB). Peak memory consumption was 88.3 MB. Max. memory is 11.5 GB. [2018-11-28 11:16:29,927 INFO L168 Benchmark]: Witness Printer took 3.23 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 11:16:29,931 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.12 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 161.58 ms. Allocated memory is still 1.0 GB. Free memory was 953.3 MB in the beginning and 942.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 23.00 ms. Allocated memory is still 1.0 GB. Free memory was 942.6 MB in the beginning and 939.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 57.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.9 MB). Free memory was 939.9 MB in the beginning and 1.1 GB in the end (delta: -184.7 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 252.10 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: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 2040.13 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 88.3 MB). Peak memory consumption was 88.3 MB. Max. memory is 11.5 GB. * Witness Printer took 3.23 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable size - GenericResult: Unfinished Backtranslation unknown boogie variable size * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (1 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * aux-#t~loopctr13-aux + unknown-size-unknown and consists of 3 locations. One deterministic module has affine ranking function -1 * aux-#t~loopctr16-aux + unknown-size-unknown and consists of 2 locations. 1 modules have a trivial ranking function, the largest among these consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.0s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 1.7s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 8 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 13 SDtfs, 14 SDslu, 1 SDs, 0 SdLazy, 11 SolverSat, 2 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT1 lasso1 LassoPreprocessingBenchmarks: Lassos: inital74 mio100 ax100 hnf100 lsp99 ukn88 mio100 lsp76 div100 bol100 ite100 ukn100 eq175 hnf89 smp100 dnf100 smp100 tf108 neg100 sie108 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 3ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...