./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/ldv-memsafety-bitfields/test-bitfields-2.1_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_47d96e92-932e-4445-9d4b-4a2bde91b640/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_47d96e92-932e-4445-9d4b-4a2bde91b640/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_47d96e92-932e-4445-9d4b-4a2bde91b640/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_47d96e92-932e-4445-9d4b-4a2bde91b640/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/ldv-memsafety-bitfields/test-bitfields-2.1_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_47d96e92-932e-4445-9d4b-4a2bde91b640/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_47d96e92-932e-4445-9d4b-4a2bde91b640/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 6cbc2f8335eda1137ed277d7eb74d7775ef6f777 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 10:33:25,700 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 10:33:25,702 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 10:33:25,709 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 10:33:25,709 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 10:33:25,710 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 10:33:25,711 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 10:33:25,712 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 10:33:25,714 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 10:33:25,714 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 10:33:25,715 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 10:33:25,716 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 10:33:25,716 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 10:33:25,717 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 10:33:25,718 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 10:33:25,718 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 10:33:25,720 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 10:33:25,721 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 10:33:25,722 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 10:33:25,724 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 10:33:25,724 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 10:33:25,725 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 10:33:25,727 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 10:33:25,728 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 10:33:25,728 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 10:33:25,729 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 10:33:25,729 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 10:33:25,730 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 10:33:25,731 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 10:33:25,732 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 10:33:25,732 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 10:33:25,732 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 10:33:25,732 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 10:33:25,732 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 10:33:25,733 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 10:33:25,733 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 10:33:25,734 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_47d96e92-932e-4445-9d4b-4a2bde91b640/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-28 10:33:25,744 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 10:33:25,744 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 10:33:25,745 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 10:33:25,745 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 10:33:25,745 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 10:33:25,745 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 10:33:25,746 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 10:33:25,746 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 10:33:25,746 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 10:33:25,746 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 10:33:25,746 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 10:33:25,746 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 10:33:25,746 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 10:33:25,746 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 10:33:25,747 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 10:33:25,748 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 10:33:25,748 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 10:33:25,748 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 10:33:25,748 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 10:33:25,749 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 10:33:25,749 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 10:33:25,749 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 10:33:25,750 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 10:33:25,750 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 10:33:25,750 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 10:33:25,750 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 10:33:25,750 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 10:33:25,750 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 10:33:25,750 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 10:33:25,750 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 10:33:25,751 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 10:33:25,751 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 10:33:25,751 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_47d96e92-932e-4445-9d4b-4a2bde91b640/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 -> 6cbc2f8335eda1137ed277d7eb74d7775ef6f777 [2018-11-28 10:33:25,777 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 10:33:25,786 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 10:33:25,789 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 10:33:25,790 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 10:33:25,791 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 10:33:25,791 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_47d96e92-932e-4445-9d4b-4a2bde91b640/bin-2019/uautomizer/../../sv-benchmarks/c/ldv-memsafety-bitfields/test-bitfields-2.1_true-valid-memsafety_true-termination.i [2018-11-28 10:33:25,839 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_47d96e92-932e-4445-9d4b-4a2bde91b640/bin-2019/uautomizer/data/1b4a8f694/547f390ddbd74fb1a530c8a3adab8a40/FLAG2caacc00f [2018-11-28 10:33:26,198 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 10:33:26,199 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_47d96e92-932e-4445-9d4b-4a2bde91b640/sv-benchmarks/c/ldv-memsafety-bitfields/test-bitfields-2.1_true-valid-memsafety_true-termination.i [2018-11-28 10:33:26,204 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_47d96e92-932e-4445-9d4b-4a2bde91b640/bin-2019/uautomizer/data/1b4a8f694/547f390ddbd74fb1a530c8a3adab8a40/FLAG2caacc00f [2018-11-28 10:33:26,627 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_47d96e92-932e-4445-9d4b-4a2bde91b640/bin-2019/uautomizer/data/1b4a8f694/547f390ddbd74fb1a530c8a3adab8a40 [2018-11-28 10:33:26,629 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 10:33:26,630 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 10:33:26,631 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 10:33:26,631 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 10:33:26,634 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 10:33:26,635 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 10:33:26" (1/1) ... [2018-11-28 10:33:26,637 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@516c935c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:33:26, skipping insertion in model container [2018-11-28 10:33:26,637 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 10:33:26" (1/1) ... [2018-11-28 10:33:26,642 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 10:33:26,651 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 10:33:26,753 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 10:33:26,762 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 10:33:26,773 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 10:33:26,784 INFO L195 MainTranslator]: Completed translation [2018-11-28 10:33:26,785 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:33:26 WrapperNode [2018-11-28 10:33:26,785 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 10:33:26,785 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 10:33:26,785 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 10:33:26,785 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 10:33:26,790 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:33:26" (1/1) ... [2018-11-28 10:33:26,797 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:33:26" (1/1) ... [2018-11-28 10:33:26,811 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 10:33:26,811 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 10:33:26,811 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 10:33:26,811 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 10:33:26,817 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:33:26" (1/1) ... [2018-11-28 10:33:26,817 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:33:26" (1/1) ... [2018-11-28 10:33:26,853 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:33:26" (1/1) ... [2018-11-28 10:33:26,854 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:33:26" (1/1) ... [2018-11-28 10:33:26,859 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:33:26" (1/1) ... [2018-11-28 10:33:26,863 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:33:26" (1/1) ... [2018-11-28 10:33:26,864 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:33:26" (1/1) ... [2018-11-28 10:33:26,866 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 10:33:26,866 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 10:33:26,866 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 10:33:26,866 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 10:33:26,867 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:33:26" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_47d96e92-932e-4445-9d4b-4a2bde91b640/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 10:33:26,900 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2018-11-28 10:33:26,900 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2018-11-28 10:33:26,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2018-11-28 10:33:26,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-28 10:33:26,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 10:33:26,901 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 10:33:26,901 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2018-11-28 10:33:26,901 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 10:33:26,901 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 10:33:26,901 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 10:33:26,901 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 10:33:27,032 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-28 10:33:27,065 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 10:33:27,065 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-11-28 10:33:27,065 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 10:33:27 BoogieIcfgContainer [2018-11-28 10:33:27,065 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 10:33:27,066 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 10:33:27,066 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 10:33:27,068 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 10:33:27,069 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 10:33:27,069 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 10:33:26" (1/3) ... [2018-11-28 10:33:27,070 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@779026cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 10:33:27, skipping insertion in model container [2018-11-28 10:33:27,070 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 10:33:27,070 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:33:26" (2/3) ... [2018-11-28 10:33:27,070 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@779026cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 10:33:27, skipping insertion in model container [2018-11-28 10:33:27,070 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 10:33:27,070 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 10:33:27" (3/3) ... [2018-11-28 10:33:27,073 INFO L375 chiAutomizerObserver]: Analyzing ICFG test-bitfields-2.1_true-valid-memsafety_true-termination.i [2018-11-28 10:33:27,117 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 10:33:27,118 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 10:33:27,118 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 10:33:27,118 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 10:33:27,118 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 10:33:27,118 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 10:33:27,118 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 10:33:27,118 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 10:33:27,119 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 10:33:27,128 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2018-11-28 10:33:27,145 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2018-11-28 10:33:27,146 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 10:33:27,146 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 10:33:27,150 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-28 10:33:27,150 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-28 10:33:27,150 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 10:33:27,150 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2018-11-28 10:33:27,151 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2018-11-28 10:33:27,152 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 10:33:27,152 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 10:33:27,152 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-28 10:33:27,152 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-28 10:33:27,157 INFO L794 eck$LassoCheckResult]: Stem: 13#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#d~0.base, ~#d~0.offset := #Ultimate.alloc(5);call write~init~int(0, ~#d~0.base, ~#d~0.offset, 1);call write~init~int(0, ~#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); 11#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_~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(3);main_~p~0.base, main_~p~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;call write~int(1, ~#d~0.base, ~#d~0.offset, 1);call write~int(2, ~#d~0.base, 1 + ~#d~0.offset, 1);call write~int(3, ~#d~0.base, 2 + ~#d~0.offset, 1);call write~int(4, ~#d~0.base, 3 + ~#d~0.offset, 1);call write~int(5, ~#d~0.base, 4 + ~#d~0.offset, 1); 12#L31true 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, 3);< 17##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; 3#$Ultimate##0true #t~loopctr7 := 0; 9#L-1-1true [2018-11-28 10:33:27,157 INFO L796 eck$LassoCheckResult]: Loop: 9#L-1-1true assume #t~loopctr7 < size;call #t~mem8 := read~unchecked~int(src.base, src.offset + #t~loopctr7, 1);call write~unchecked~int(#t~mem8, dest.base, dest.offset + #t~loopctr7, 1);#t~loopctr7 := 1 + #t~loopctr7; 9#L-1-1true [2018-11-28 10:33:27,162 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:33:27,162 INFO L82 PathProgramCache]: Analyzing trace with hash 28738897, now seen corresponding path program 1 times [2018-11-28 10:33:27,164 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:33:27,165 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:33:27,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:33:27,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:33:27,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:33:27,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:33:27,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:33:27,273 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:33:27,273 INFO L82 PathProgramCache]: Analyzing trace with hash 72, now seen corresponding path program 1 times [2018-11-28 10:33:27,274 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:33:27,274 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:33:27,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:33:27,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:33:27,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:33:27,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:33:27,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:33:27,283 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:33:27,283 INFO L82 PathProgramCache]: Analyzing trace with hash 890905848, now seen corresponding path program 1 times [2018-11-28 10:33:27,283 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:33:27,284 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:33:27,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:33:27,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:33:27,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:33:27,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:33:27,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:33:27,644 WARN L180 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 80 [2018-11-28 10:33:27,918 WARN L180 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 83 [2018-11-28 10:33:28,022 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2018-11-28 10:33:28,029 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 10:33:28,030 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 10:33:28,030 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 10:33:28,030 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 10:33:28,031 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 10:33:28,031 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 10:33:28,031 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 10:33:28,031 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 10:33:28,031 INFO L131 ssoRankerPreferences]: Filename of dumped script: test-bitfields-2.1_true-valid-memsafety_true-termination.i_Iteration1_Lasso [2018-11-28 10:33:28,031 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 10:33:28,032 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 10:33:28,048 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 10:33:28,052 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 10:33:28,053 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:33:28,054 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:33:28,059 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:33:28,289 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 10:33:28,291 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 10:33:28,292 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 10:33:28,293 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 10:33:28,294 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 10:33:28,296 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 10:33:28,297 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 10:33:28,299 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 10:33:28,300 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 10:33:28,301 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 10:33:28,303 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 10:33:28,304 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 10:33:28,305 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 10:33:28,311 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 10:33:28,313 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 10:33:28,314 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 10:33:28,502 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 10:33:28,505 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 10:33:28,507 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 10:33:28,508 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:33:28,509 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:33:28,509 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:33:28,509 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:33:28,509 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:33:28,511 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:33:28,511 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:33:28,513 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:33:28,513 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 10:33:28,514 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:33:28,514 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:33:28,514 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:33:28,514 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:33:28,514 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:33:28,515 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:33:28,515 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:33:28,515 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:33:28,516 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 10:33:28,516 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:33:28,517 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:33:28,517 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:33:28,517 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:33:28,517 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:33:28,518 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:33:28,518 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:33:28,518 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:33:28,519 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 10:33:28,519 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:33:28,519 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:33:28,519 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:33:28,519 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:33:28,520 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:33:28,520 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:33:28,520 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:33:28,521 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:33:28,521 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 10:33:28,522 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:33:28,522 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:33:28,522 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:33:28,522 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:33:28,524 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 10:33:28,524 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 10:33:28,528 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:33:28,528 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 10:33:28,529 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:33:28,529 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:33:28,529 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:33:28,529 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:33:28,530 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 10:33:28,531 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 10:33:28,534 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:33:28,535 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 10:33:28,535 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:33:28,535 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:33:28,535 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:33:28,535 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:33:28,537 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 10:33:28,537 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 10:33:28,542 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:33:28,542 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 10:33:28,543 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:33:28,543 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:33:28,543 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:33:28,543 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:33:28,545 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 10:33:28,545 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 10:33:28,549 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:33:28,550 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 10:33:28,550 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:33:28,551 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:33:28,551 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:33:28,551 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:33:28,552 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 10:33:28,552 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 10:33:28,556 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:33:28,556 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 10:33:28,557 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:33:28,557 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 10:33:28,557 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:33:28,557 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:33:28,559 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 10:33:28,559 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 10:33:28,567 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:33:28,568 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 10:33:28,568 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:33:28,568 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:33:28,569 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:33:28,569 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:33:28,570 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 10:33:28,570 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 10:33:28,573 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:33:28,573 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 10:33:28,573 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:33:28,574 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 10:33:28,574 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:33:28,574 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:33:28,575 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 10:33:28,575 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 10:33:28,579 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:33:28,580 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 10:33:28,580 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:33:28,580 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:33:28,580 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:33:28,580 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:33:28,582 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 10:33:28,582 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 10:33:28,586 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:33:28,586 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 10:33:28,587 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:33:28,587 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:33:28,587 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:33:28,587 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:33:28,588 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 10:33:28,589 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 10:33:28,593 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:33:28,593 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 10:33:28,593 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:33:28,594 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:33:28,594 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:33:28,594 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:33:28,595 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 10:33:28,595 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 10:33:28,598 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:33:28,599 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 10:33:28,599 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:33:28,599 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:33:28,600 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:33:28,600 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:33:28,601 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 10:33:28,602 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 10:33:28,619 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 10:33:28,636 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-28 10:33:28,636 INFO L444 ModelExtractionUtils]: 14 out of 19 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-28 10:33:28,639 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 10:33:28,640 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 10:33:28,640 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 10:33:28,641 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(#Ultimate.C_memcpy_#t~loopctr7, #Ultimate.C_memcpy_size) = -1*#Ultimate.C_memcpy_#t~loopctr7 + 1*#Ultimate.C_memcpy_size Supporting invariants [] [2018-11-28 10:33:28,693 INFO L297 tatePredicateManager]: 16 out of 16 supporting invariants were superfluous and have been removed [2018-11-28 10:33:28,702 WARN L1298 BoogieBacktranslator]: unknown boogie variable size [2018-11-28 10:33:28,720 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:33:28,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:33:28,745 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 10:33:28,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:33:28,759 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 10:33:28,759 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 10:33:28,773 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 10:33:28,775 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states. Second operand 2 states. [2018-11-28 10:33:28,828 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states.. Second operand 2 states. Result 26 states and 35 transitions. Complement of second has 6 states. [2018-11-28 10:33:28,828 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 10:33:28,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-28 10:33:28,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2018-11-28 10:33:28,832 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 5 letters. Loop has 1 letters. [2018-11-28 10:33:28,834 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 10:33:28,834 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 6 letters. Loop has 1 letters. [2018-11-28 10:33:28,834 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 10:33:28,834 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 5 letters. Loop has 2 letters. [2018-11-28 10:33:28,834 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 10:33:28,835 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 35 transitions. [2018-11-28 10:33:28,837 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-28 10:33:28,840 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 9 states and 11 transitions. [2018-11-28 10:33:28,840 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2018-11-28 10:33:28,841 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2018-11-28 10:33:28,841 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 11 transitions. [2018-11-28 10:33:28,841 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 10:33:28,841 INFO L705 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2018-11-28 10:33:28,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 11 transitions. [2018-11-28 10:33:28,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2018-11-28 10:33:28,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-28 10:33:28,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2018-11-28 10:33:28,860 INFO L728 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2018-11-28 10:33:28,861 INFO L608 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2018-11-28 10:33:28,861 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 10:33:28,861 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 10 transitions. [2018-11-28 10:33:28,861 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-28 10:33:28,861 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 10:33:28,861 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 10:33:28,862 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-28 10:33:28,862 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-28 10:33:28,862 INFO L794 eck$LassoCheckResult]: Stem: 156#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#d~0.base, ~#d~0.offset := #Ultimate.alloc(5);call write~init~int(0, ~#d~0.base, ~#d~0.offset, 1);call write~init~int(0, ~#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); 153#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_~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(3);main_~p~0.base, main_~p~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;call write~int(1, ~#d~0.base, ~#d~0.offset, 1);call write~int(2, ~#d~0.base, 1 + ~#d~0.offset, 1);call write~int(3, ~#d~0.base, 2 + ~#d~0.offset, 1);call write~int(4, ~#d~0.base, 3 + ~#d~0.offset, 1);call write~int(5, ~#d~0.base, 4 + ~#d~0.offset, 1); 154#L31 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, 3);< 155##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; 157#$Ultimate##0 #t~loopctr7 := 0; 158#L-1-1 assume !(#t~loopctr7 < size);#t~loopctr9 := 0; 159#L-1-3 [2018-11-28 10:33:28,862 INFO L796 eck$LassoCheckResult]: Loop: 159#L-1-3 assume #t~loopctr9 < size;#t~loopctr9 := 4 + #t~loopctr9; 159#L-1-3 [2018-11-28 10:33:28,862 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:33:28,863 INFO L82 PathProgramCache]: Analyzing trace with hash 890905850, now seen corresponding path program 1 times [2018-11-28 10:33:28,863 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:33:28,863 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:33:28,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:33:28,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:33:28,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:33:28,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:33:28,936 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 10:33:28,938 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 10:33:28,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 10:33:28,939 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 10:33:28,939 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:33:28,939 INFO L82 PathProgramCache]: Analyzing trace with hash 78, now seen corresponding path program 1 times [2018-11-28 10:33:28,940 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:33:28,940 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:33:28,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:33:28,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:33:28,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:33:28,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:33:28,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:33:28,956 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 10:33:28,956 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 10:33:28,956 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 10:33:28,956 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 10:33:28,956 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 10:33:28,957 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 10:33:28,957 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 10:33:28,957 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 10:33:28,957 INFO L131 ssoRankerPreferences]: Filename of dumped script: test-bitfields-2.1_true-valid-memsafety_true-termination.i_Iteration2_Loop [2018-11-28 10:33:28,957 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 10:33:28,957 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 10:33:28,958 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 10:33:28,974 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 10:33:28,975 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_47d96e92-932e-4445-9d4b-4a2bde91b640/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 10:33:28,984 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 10:33:28,985 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_47d96e92-932e-4445-9d4b-4a2bde91b640/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 10:33:29,010 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 10:33:29,011 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 10:33:29,090 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 10:33:29,092 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 10:33:29,092 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 10:33:29,092 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 10:33:29,092 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 10:33:29,092 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 10:33:29,092 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 10:33:29,092 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 10:33:29,092 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 10:33:29,092 INFO L131 ssoRankerPreferences]: Filename of dumped script: test-bitfields-2.1_true-valid-memsafety_true-termination.i_Iteration2_Loop [2018-11-28 10:33:29,092 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 10:33:29,093 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 10:33:29,093 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 10:33:29,133 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 10:33:29,133 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 10:33:29,133 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:33:29,134 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:33:29,134 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:33:29,134 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:33:29,134 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:33:29,134 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:33:29,135 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:33:29,135 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:33:29,137 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 10:33:29,140 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 10:33:29,140 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 10:33:29,140 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 10:33:29,140 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 10:33:29,141 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 10:33:29,141 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(#Ultimate.C_memcpy_size, #Ultimate.C_memcpy_#t~loopctr9) = 1*#Ultimate.C_memcpy_size - 1*#Ultimate.C_memcpy_#t~loopctr9 Supporting invariants [] [2018-11-28 10:33:29,141 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 10:33:29,143 WARN L1298 BoogieBacktranslator]: unknown boogie variable size [2018-11-28 10:33:29,151 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:33:29,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:33:29,170 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 10:33:29,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:33:29,174 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 10:33:29,174 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 10:33:29,174 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 10:33:29,175 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 10 transitions. cyclomatic complexity: 4 Second operand 2 states. [2018-11-28 10:33:29,180 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 10:33:29,181 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 10:33:29,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-28 10:33:29,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 8 transitions. [2018-11-28 10:33:29,183 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 8 transitions. Stem has 6 letters. Loop has 1 letters. [2018-11-28 10:33:29,183 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 10:33:29,183 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 8 transitions. Stem has 7 letters. Loop has 1 letters. [2018-11-28 10:33:29,183 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 10:33:29,183 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 8 transitions. Stem has 6 letters. Loop has 2 letters. [2018-11-28 10:33:29,184 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 10:33:29,184 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 11 transitions. [2018-11-28 10:33:29,185 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 10:33:29,185 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 0 states and 0 transitions. [2018-11-28 10:33:29,185 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-28 10:33:29,185 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-28 10:33:29,185 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-28 10:33:29,185 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 10:33:29,185 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 10:33:29,186 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 10:33:29,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 10:33:29,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-28 10:33:29,189 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 4 states. [2018-11-28 10:33:29,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:33:29,191 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-28 10:33:29,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-28 10:33:29,192 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2018-11-28 10:33:29,192 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 10:33:29,192 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2018-11-28 10:33:29,192 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-28 10:33:29,192 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-28 10:33:29,192 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-28 10:33:29,192 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 10:33:29,192 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 10:33:29,193 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 10:33:29,193 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 10:33:29,193 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 10:33:29,193 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-28 10:33:29,193 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 10:33:29,193 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-28 10:33:29,198 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 10:33:29 BoogieIcfgContainer [2018-11-28 10:33:29,198 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 10:33:29,198 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 10:33:29,198 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 10:33:29,198 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 10:33:29,199 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 10:33:27" (3/4) ... [2018-11-28 10:33:29,202 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 10:33:29,202 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 10:33:29,203 INFO L168 Benchmark]: Toolchain (without parser) took 2572.91 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 199.8 MB). Free memory was 953.3 MB in the beginning and 1.2 GB in the end (delta: -221.7 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 10:33:29,203 INFO L168 Benchmark]: CDTParser took 0.16 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 10:33:29,204 INFO L168 Benchmark]: CACSL2BoogieTranslator took 153.92 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 10:33:29,204 INFO L168 Benchmark]: Boogie Procedure Inliner took 25.38 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 10:33:29,205 INFO L168 Benchmark]: Boogie Preprocessor took 55.11 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.5 MB). Free memory was 939.9 MB in the beginning and 1.1 GB in the end (delta: -162.1 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. [2018-11-28 10:33:29,205 INFO L168 Benchmark]: RCFGBuilder took 199.15 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2018-11-28 10:33:29,206 INFO L168 Benchmark]: BuchiAutomizer took 2132.20 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 91.2 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -91.3 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 10:33:29,206 INFO L168 Benchmark]: Witness Printer took 3.79 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 10:33:29,209 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.16 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 153.92 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 25.38 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 55.11 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.5 MB). Free memory was 939.9 MB in the beginning and 1.1 GB in the end (delta: -162.1 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 199.15 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 2132.20 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 91.2 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -91.3 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 3.79 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable 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~loopctr7-aux + unknown-size-unknown and consists of 3 locations. One deterministic module has affine ranking function unknown-size-unknown + -1 * aux-#t~loopctr9-aux 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.8s. 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: inital69 mio100 ax100 hnf100 lsp98 ukn85 mio100 lsp77 div100 bol100 ite100 ukn100 eq175 hnf88 smp100 dnf100 smp100 tf108 neg100 sie109 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 11ms VariablesStem: 2 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 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...