./Ultimate.py --spec ../../sv-benchmarks/c/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 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_ebd2ef55-97f0-4b87-bac1-53855e3cdc56/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_ebd2ef55-97f0-4b87-bac1-53855e3cdc56/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_ebd2ef55-97f0-4b87-bac1-53855e3cdc56/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_ebd2ef55-97f0-4b87-bac1-53855e3cdc56/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_ebd2ef55-97f0-4b87-bac1-53855e3cdc56/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_ebd2ef55-97f0-4b87-bac1-53855e3cdc56/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-1dbac8b [2018-11-10 11:52:15,007 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 11:52:15,008 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 11:52:15,016 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 11:52:15,016 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 11:52:15,017 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 11:52:15,018 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 11:52:15,019 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 11:52:15,020 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 11:52:15,021 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 11:52:15,021 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 11:52:15,022 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 11:52:15,022 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 11:52:15,023 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 11:52:15,023 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 11:52:15,024 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 11:52:15,024 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 11:52:15,025 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 11:52:15,027 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 11:52:15,027 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 11:52:15,028 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 11:52:15,029 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 11:52:15,030 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 11:52:15,030 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 11:52:15,030 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 11:52:15,031 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 11:52:15,032 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 11:52:15,032 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 11:52:15,033 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 11:52:15,034 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 11:52:15,034 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 11:52:15,034 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 11:52:15,034 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 11:52:15,035 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 11:52:15,035 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 11:52:15,036 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 11:52:15,036 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_ebd2ef55-97f0-4b87-bac1-53855e3cdc56/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-10 11:52:15,044 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 11:52:15,044 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 11:52:15,045 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 11:52:15,045 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 11:52:15,045 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 11:52:15,046 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 11:52:15,046 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 11:52:15,046 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 11:52:15,046 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 11:52:15,046 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 11:52:15,046 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 11:52:15,046 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 11:52:15,046 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 11:52:15,047 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 11:52:15,047 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 11:52:15,047 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 11:52:15,047 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 11:52:15,047 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 11:52:15,047 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 11:52:15,047 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 11:52:15,047 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 11:52:15,048 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 11:52:15,048 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 11:52:15,048 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 11:52:15,048 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 11:52:15,048 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 11:52:15,048 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 11:52:15,048 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 11:52:15,049 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 11:52:15,049 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 11:52:15,049 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 11:52:15,050 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_ebd2ef55-97f0-4b87-bac1-53855e3cdc56/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-10 11:52:15,074 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 11:52:15,083 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 11:52:15,086 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 11:52:15,087 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 11:52:15,088 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 11:52:15,088 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_ebd2ef55-97f0-4b87-bac1-53855e3cdc56/bin-2019/uautomizer/../../sv-benchmarks/c/ldv-memsafety-bitfields/test-bitfields-3_true-valid-memsafety_true-termination.i [2018-11-10 11:52:15,136 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ebd2ef55-97f0-4b87-bac1-53855e3cdc56/bin-2019/uautomizer/data/1411d7c9e/5af987cf8ae84562a86a088fa119012b/FLAG9793cdc81 [2018-11-10 11:52:15,489 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 11:52:15,490 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_ebd2ef55-97f0-4b87-bac1-53855e3cdc56/sv-benchmarks/c/ldv-memsafety-bitfields/test-bitfields-3_true-valid-memsafety_true-termination.i [2018-11-10 11:52:15,496 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ebd2ef55-97f0-4b87-bac1-53855e3cdc56/bin-2019/uautomizer/data/1411d7c9e/5af987cf8ae84562a86a088fa119012b/FLAG9793cdc81 [2018-11-10 11:52:15,509 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_ebd2ef55-97f0-4b87-bac1-53855e3cdc56/bin-2019/uautomizer/data/1411d7c9e/5af987cf8ae84562a86a088fa119012b [2018-11-10 11:52:15,512 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 11:52:15,513 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 11:52:15,514 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 11:52:15,514 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 11:52:15,518 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 11:52:15,519 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 11:52:15" (1/1) ... [2018-11-10 11:52:15,521 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7449498f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:52:15, skipping insertion in model container [2018-11-10 11:52:15,521 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 11:52:15" (1/1) ... [2018-11-10 11:52:15,530 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 11:52:15,549 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 11:52:15,679 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 11:52:15,690 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 11:52:15,708 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 11:52:15,722 INFO L193 MainTranslator]: Completed translation [2018-11-10 11:52:15,723 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:52:15 WrapperNode [2018-11-10 11:52:15,723 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 11:52:15,724 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 11:52:15,724 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 11:52:15,724 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 11:52:15,732 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:52:15" (1/1) ... [2018-11-10 11:52:15,741 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:52:15" (1/1) ... [2018-11-10 11:52:15,758 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 11:52:15,759 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 11:52:15,759 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 11:52:15,759 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 11:52:15,765 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:52:15" (1/1) ... [2018-11-10 11:52:15,765 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:52:15" (1/1) ... [2018-11-10 11:52:15,767 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:52:15" (1/1) ... [2018-11-10 11:52:15,767 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:52:15" (1/1) ... [2018-11-10 11:52:15,771 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:52:15" (1/1) ... [2018-11-10 11:52:15,774 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:52:15" (1/1) ... [2018-11-10 11:52:15,776 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:52:15" (1/1) ... [2018-11-10 11:52:15,777 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 11:52:15,777 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 11:52:15,777 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 11:52:15,778 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 11:52:15,778 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:52:15" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ebd2ef55-97f0-4b87-bac1-53855e3cdc56/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-10 11:52:15,862 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 11:52:15,862 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 11:52:15,862 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2018-11-10 11:52:15,863 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2018-11-10 11:52:15,863 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 11:52:16,080 WARN L632 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-10 11:52:16,090 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 11:52:16,090 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:52:16 BoogieIcfgContainer [2018-11-10 11:52:16,090 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 11:52:16,091 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 11:52:16,091 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 11:52:16,093 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 11:52:16,093 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 11:52:16,093 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 11:52:15" (1/3) ... [2018-11-10 11:52:16,094 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@68dbde73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 11:52:16, skipping insertion in model container [2018-11-10 11:52:16,094 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 11:52:16,094 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:52:15" (2/3) ... [2018-11-10 11:52:16,095 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@68dbde73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 11:52:16, skipping insertion in model container [2018-11-10 11:52:16,095 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 11:52:16,095 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:52:16" (3/3) ... [2018-11-10 11:52:16,096 INFO L375 chiAutomizerObserver]: Analyzing ICFG test-bitfields-3_true-valid-memsafety_true-termination.i [2018-11-10 11:52:16,145 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 11:52:16,146 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 11:52:16,146 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 11:52:16,146 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 11:52:16,146 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 11:52:16,147 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 11:52:16,147 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 11:52:16,147 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 11:52:16,147 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 11:52:16,157 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states. [2018-11-10 11:52:16,173 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-10 11:52:16,173 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 11:52:16,173 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 11:52:16,177 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-10 11:52:16,177 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-10 11:52:16,178 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 11:52:16,178 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states. [2018-11-10 11:52:16,179 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-10 11:52:16,179 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 11:52:16,180 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 11:52:16,180 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-10 11:52:16,180 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-10 11:52:16,185 INFO L793 eck$LassoCheckResult]: Stem: 29#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 10;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];~#d~0.base, ~#d~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;write~unchecked~int_old_#memory_int := #memory_int;assume { :begin_inline_write~unchecked~int } true;write~unchecked~int_#value, write~unchecked~int_#ptr.base, write~unchecked~int_#ptr.offset, write~unchecked~int_#sizeOfWrittenType := 0, ~#d~0.base, ~#d~0.offset + 0, 1;havoc #memory_int;assume #memory_int == write~unchecked~int_old_#memory_int[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset := write~unchecked~int_#value];assume { :end_inline_write~unchecked~int } true;write~unchecked~int_old_#memory_int := #memory_int;assume { :begin_inline_write~unchecked~int } true;write~unchecked~int_#value, write~unchecked~int_#ptr.base, write~unchecked~int_#ptr.offset, write~unchecked~int_#sizeOfWrittenType := 3, ~#d~0.base, ~#d~0.offset + 1, 1;havoc #memory_int;assume #memory_int == write~unchecked~int_old_#memory_int[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset := write~unchecked~int_#value];assume { :end_inline_write~unchecked~int } true;write~unchecked~int_old_#memory_int := #memory_int;assume { :begin_inline_write~unchecked~int } true;write~unchecked~int_#value, write~unchecked~int_#ptr.base, write~unchecked~int_#ptr.offset, write~unchecked~int_#sizeOfWrittenType := 0, ~#d~0.base, ~#d~0.offset + 2, 1;havoc #memory_int;assume #memory_int == write~unchecked~int_old_#memory_int[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset := write~unchecked~int_#value];assume { :end_inline_write~unchecked~int } true;write~unchecked~int_old_#memory_int := #memory_int;assume { :begin_inline_write~unchecked~int } true;write~unchecked~int_#value, write~unchecked~int_#ptr.base, write~unchecked~int_#ptr.offset, write~unchecked~int_#sizeOfWrittenType := 0, ~#d~0.base, ~#d~0.offset + 3, 1;havoc #memory_int;assume #memory_int == write~unchecked~int_old_#memory_int[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset := write~unchecked~int_#value];assume { :end_inline_write~unchecked~int } true;write~unchecked~int_old_#memory_int := #memory_int;assume { :begin_inline_write~unchecked~int } true;write~unchecked~int_#value, write~unchecked~int_#ptr.base, write~unchecked~int_#ptr.offset, write~unchecked~int_#sizeOfWrittenType := 0, ~#d~0.base, ~#d~0.offset + 4, 1;havoc #memory_int;assume #memory_int == write~unchecked~int_old_#memory_int[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset := write~unchecked~int_#value];assume { :end_inline_write~unchecked~int } true;write~unchecked~int_old_#memory_int := #memory_int;assume { :begin_inline_write~unchecked~int } true;write~unchecked~int_#value, write~unchecked~int_#ptr.base, write~unchecked~int_#ptr.offset, write~unchecked~int_#sizeOfWrittenType := 0, ~#d~0.base, ~#d~0.offset + 5, 1;havoc #memory_int;assume #memory_int == write~unchecked~int_old_#memory_int[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset := write~unchecked~int_#value];assume { :end_inline_write~unchecked~int } true;write~unchecked~int_old_#memory_int := #memory_int;assume { :begin_inline_write~unchecked~int } true;write~unchecked~int_#value, write~unchecked~int_#ptr.base, write~unchecked~int_#ptr.offset, write~unchecked~int_#sizeOfWrittenType := 0, ~#d~0.base, ~#d~0.offset + 6, 4;havoc #memory_int;assume #memory_int == write~unchecked~int_old_#memory_int[write~unchecked~int_#ptr.base,write~unchecked~int_#ptr.offset := write~unchecked~int_#value];assume { :end_inline_write~unchecked~int } true; 11#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~memcpy1.base, main_#t~memcpy1.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;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 10;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~p~0.base, main_~p~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset; 25#L41true call main_#t~memcpy1.base, main_#t~memcpy1.offset := #Ultimate.C_memcpy(main_~p~0.base, main_~p~0.offset, ~#d~0.base, ~#d~0.offset, 10);< 15##Ultimate.C_memcpyENTRYtrue assume #valid[dest.base] == 1;assume #valid[src.base] == 1;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; 26#L-1-1true [2018-11-10 11:52:16,185 INFO L795 eck$LassoCheckResult]: Loop: 26#L-1-1true assume #t~loopctr13 < size;#memory_int := #memory_int[dest.base,dest.offset + #t~loopctr13 * 1 := #memory_int[src.base,src.offset + #t~loopctr13 * 1]];#t~loopctr13 := #t~loopctr13 + 1; 26#L-1-1true [2018-11-10 11:52:16,190 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:52:16,190 INFO L82 PathProgramCache]: Analyzing trace with hash 28775830, now seen corresponding path program 1 times [2018-11-10 11:52:16,191 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:52:16,192 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:52:16,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:52:16,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:52:16,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:52:16,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:52:16,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:52:16,304 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:52:16,304 INFO L82 PathProgramCache]: Analyzing trace with hash 115, now seen corresponding path program 1 times [2018-11-10 11:52:16,304 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:52:16,305 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:52:16,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:52:16,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:52:16,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:52:16,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:52:16,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:52:16,311 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:52:16,311 INFO L82 PathProgramCache]: Analyzing trace with hash 892050814, now seen corresponding path program 1 times [2018-11-10 11:52:16,311 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:52:16,311 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:52:16,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:52:16,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:52:16,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:52:16,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:52:16,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:52:16,620 WARN L179 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2018-11-10 11:52:16,970 WARN L179 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 101 [2018-11-10 11:52:17,039 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 11:52:17,039 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 11:52:17,040 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 11:52:17,040 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 11:52:17,040 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 11:52:17,040 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 11:52:17,040 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 11:52:17,040 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 11:52:17,041 INFO L131 ssoRankerPreferences]: Filename of dumped script: test-bitfields-3_true-valid-memsafety_true-termination.i_Iteration1_Lasso [2018-11-10 11:52:17,041 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 11:52:17,041 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 11:52:17,063 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:52:17,076 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-10 11:52:17,077 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-10 11:52:17,079 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-10 11:52:17,081 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-10 11:52:17,082 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-10 11:52:17,084 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-10 11:52:17,085 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-10 11:52:17,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-10 11:52:17,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-10 11:52:17,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-10 11:52:17,107 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-10 11:52:17,109 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-10 11:52:17,116 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-10 11:52:17,118 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-10 11:52:17,120 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-10 11:52:17,123 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-10 11:52:17,126 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-10 11:52:17,129 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-10 11:52:17,131 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-10 11:52:17,236 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-10 11:52:17,239 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-10 11:52:17,241 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-10 11:52:17,243 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-10 11:52:17,245 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-10 11:52:17,247 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-10 11:52:17,249 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-10 11:52:17,251 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-10 11:52:17,252 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-10 11:52:17,254 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-10 11:52:17,255 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-10 11:52:17,257 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-10 11:52:17,259 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-10 11:52:17,261 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-10 11:52:17,263 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-10 11:52:17,265 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-10 11:52:17,266 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-10 11:52:17,268 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-10 11:52:17,269 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-10 11:52:17,271 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-10 11:52:17,441 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 11:52:17,444 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 11:52:17,446 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-10 11:52:17,447 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:52:17,447 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:52:17,448 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:52:17,448 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:52:17,448 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:52:17,450 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:52:17,450 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:52:17,451 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:52:17,452 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-10 11:52:17,452 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:52:17,452 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:52:17,453 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:52:17,453 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:52:17,453 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:52:17,453 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:52:17,453 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:52:17,454 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:52:17,454 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-10 11:52:17,455 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:52:17,455 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:52:17,455 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:52:17,455 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:52:17,455 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:52:17,455 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:52:17,455 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:52:17,456 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:52:17,456 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-10 11:52:17,456 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:52:17,457 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:52:17,457 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:52:17,457 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:52:17,457 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:52:17,457 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:52:17,457 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:52:17,458 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:52:17,458 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-10 11:52:17,458 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:52:17,459 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:52:17,459 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:52:17,459 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:52:17,459 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:52:17,459 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:52:17,459 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:52:17,460 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:52:17,461 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-10 11:52:17,461 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:52:17,461 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:52:17,462 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:52:17,462 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:52:17,462 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:52:17,462 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:52:17,462 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:52:17,463 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:52:17,463 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-10 11:52:17,464 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:52:17,464 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:52:17,464 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:52:17,464 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:52:17,464 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:52:17,465 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:52:17,465 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:52:17,466 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:52:17,466 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-10 11:52:17,467 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:52:17,467 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:52:17,467 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:52:17,467 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:52:17,469 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:52:17,469 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:52:17,473 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:52:17,473 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-10 11:52:17,474 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:52:17,474 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:52:17,474 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:52:17,474 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:52:17,474 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:52:17,475 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:52:17,475 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:52:17,476 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:52:17,476 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-10 11:52:17,476 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:52:17,476 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:52:17,477 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:52:17,477 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:52:17,477 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:52:17,477 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:52:17,477 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:52:17,478 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:52:17,478 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-10 11:52:17,478 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:52:17,478 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:52:17,478 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:52:17,479 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:52:17,479 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:52:17,479 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:52:17,479 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:52:17,480 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:52:17,480 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-10 11:52:17,480 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:52:17,480 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:52:17,480 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:52:17,480 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:52:17,481 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:52:17,481 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:52:17,481 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:52:17,481 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:52:17,482 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-10 11:52:17,482 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:52:17,482 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:52:17,482 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:52:17,482 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:52:17,482 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:52:17,483 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:52:17,483 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:52:17,483 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:52:17,483 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-10 11:52:17,484 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:52:17,484 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:52:17,484 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:52:17,484 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:52:17,484 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:52:17,484 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:52:17,484 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:52:17,485 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:52:17,485 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-10 11:52:17,485 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:52:17,486 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:52:17,486 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:52:17,486 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:52:17,486 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:52:17,486 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:52:17,486 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:52:17,487 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:52:17,487 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-10 11:52:17,487 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:52:17,487 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:52:17,488 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:52:17,488 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:52:17,488 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:52:17,488 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:52:17,488 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:52:17,489 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:52:17,490 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-10 11:52:17,490 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:52:17,490 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:52:17,490 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:52:17,490 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:52:17,491 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:52:17,491 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:52:17,491 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:52:17,492 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:52:17,492 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-10 11:52:17,493 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:52:17,493 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:52:17,493 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:52:17,493 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:52:17,494 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:52:17,495 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:52:17,500 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:52:17,500 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-10 11:52:17,501 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:52:17,501 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:52:17,501 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:52:17,501 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:52:17,503 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:52:17,512 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:52:17,518 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:52:17,518 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-10 11:52:17,519 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:52:17,519 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:52:17,519 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:52:17,519 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:52:17,522 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:52:17,522 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:52:17,526 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:52:17,526 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-10 11:52:17,527 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:52:17,527 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:52:17,529 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:52:17,529 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:52:17,530 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:52:17,530 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:52:17,534 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:52:17,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-10 11:52:17,535 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:52:17,535 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:52:17,536 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:52:17,536 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:52:17,537 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:52:17,537 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:52:17,541 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:52:17,541 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-10 11:52:17,541 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:52:17,542 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:52:17,542 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:52:17,542 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:52:17,543 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:52:17,543 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:52:17,548 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:52:17,548 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-10 11:52:17,548 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:52:17,549 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 11:52:17,549 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:52:17,549 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:52:17,550 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 11:52:17,550 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:52:17,556 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:52:17,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-10 11:52:17,557 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:52:17,557 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 11:52:17,557 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:52:17,557 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:52:17,559 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 11:52:17,559 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:52:17,567 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:52:17,567 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-10 11:52:17,568 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:52:17,568 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:52:17,568 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:52:17,568 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:52:17,570 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:52:17,571 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:52:17,591 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 11:52:17,614 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-10 11:52:17,614 INFO L444 ModelExtractionUtils]: 15 out of 22 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-10 11:52:17,616 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 11:52:17,617 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 11:52:17,618 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 11:52:17,618 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(#Ultimate.C_memcpy_size, #Ultimate.C_memcpy_#t~loopctr13) = 1*#Ultimate.C_memcpy_size - 1*#Ultimate.C_memcpy_#t~loopctr13 Supporting invariants [] [2018-11-10 11:52:17,641 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2018-11-10 11:52:17,647 WARN L1239 BoogieBacktranslator]: unknown boogie variable size [2018-11-10 11:52:17,657 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:52:17,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:52:17,678 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:52:17,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:52:17,696 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:52:17,697 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-10 11:52:17,707 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-10 11:52:17,708 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states. Second operand 2 states. [2018-11-10 11:52:17,746 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states.. Second operand 2 states. Result 36 states and 48 transitions. Complement of second has 6 states. [2018-11-10 11:52:17,747 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-10 11:52:17,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-10 11:52:17,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2018-11-10 11:52:17,750 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 5 letters. Loop has 1 letters. [2018-11-10 11:52:17,751 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 11:52:17,751 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 6 letters. Loop has 1 letters. [2018-11-10 11:52:17,751 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 11:52:17,751 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 5 letters. Loop has 2 letters. [2018-11-10 11:52:17,752 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 11:52:17,752 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 48 transitions. [2018-11-10 11:52:17,754 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 11:52:17,755 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 0 states and 0 transitions. [2018-11-10 11:52:17,756 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 11:52:17,756 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 11:52:17,757 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 11:52:17,757 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 11:52:17,759 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 11:52:17,759 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 11:52:17,759 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 11:52:17,759 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 11:52:17,759 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 11:52:17,759 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 11:52:17,759 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 11:52:17,764 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 11:52:17 BoogieIcfgContainer [2018-11-10 11:52:17,764 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 11:52:17,764 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 11:52:17,764 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 11:52:17,765 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 11:52:17,765 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:52:16" (3/4) ... [2018-11-10 11:52:17,767 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 11:52:17,768 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 11:52:17,768 INFO L168 Benchmark]: Toolchain (without parser) took 2255.83 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 960.3 MB in the beginning and 1.1 GB in the end (delta: -143.6 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 11:52:17,769 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 11:52:17,770 INFO L168 Benchmark]: CACSL2BoogieTranslator took 209.40 ms. Allocated memory is still 1.0 GB. Free memory was 960.3 MB in the beginning and 949.4 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 11.5 GB. [2018-11-10 11:52:17,770 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.55 ms. Allocated memory is still 1.0 GB. Free memory was 949.4 MB in the beginning and 945.6 MB in the end (delta: 3.8 MB). Peak memory consumption was 3.8 MB. Max. memory is 11.5 GB. [2018-11-10 11:52:17,771 INFO L168 Benchmark]: Boogie Preprocessor took 18.50 ms. Allocated memory is still 1.0 GB. Free memory was 945.6 MB in the beginning and 943.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 11:52:17,771 INFO L168 Benchmark]: RCFGBuilder took 313.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 943.0 MB in the beginning and 1.1 GB in the end (delta: -168.3 MB). Peak memory consumption was 15.6 MB. Max. memory is 11.5 GB. [2018-11-10 11:52:17,772 INFO L168 Benchmark]: BuchiAutomizer took 1673.37 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: 3.8 MB). Peak memory consumption was 3.8 MB. Max. memory is 11.5 GB. [2018-11-10 11:52:17,772 INFO L168 Benchmark]: Witness Printer took 3.42 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: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2018-11-10 11:52:17,774 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 209.40 ms. Allocated memory is still 1.0 GB. Free memory was 960.3 MB in the beginning and 949.4 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 34.55 ms. Allocated memory is still 1.0 GB. Free memory was 949.4 MB in the beginning and 945.6 MB in the end (delta: 3.8 MB). Peak memory consumption was 3.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.50 ms. Allocated memory is still 1.0 GB. Free memory was 945.6 MB in the beginning and 943.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 313.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 943.0 MB in the beginning and 1.1 GB in the end (delta: -168.3 MB). Peak memory consumption was 15.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 1673.37 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: 3.8 MB). Peak memory consumption was 3.8 MB. Max. memory is 11.5 GB. * Witness Printer took 3.42 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: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - 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 1 terminating modules (0 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-size-unknown + -1 * aux-#t~loopctr13-aux and consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.6s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 1.4s. Construction of modules took 0.0s. Büchi inclusion checks took 0.0s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 0 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 6 SDtfs, 6 SDslu, 1 SDs, 0 SdLazy, 6 SolverSat, 1 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital152 mio100 ax100 hnf100 lsp96 ukn53 mio100 lsp55 div100 bol100 ite100 ukn100 eq188 hnf80 smp86 dnf100 smp100 tf100 neg100 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 7ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...