./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/ldv-memsafety-bitfields/test-bitfields-3_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 91b1670e Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/ldv-memsafety-bitfields/test-bitfields-3_true-valid-memsafety_true-termination.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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.24-91b1670 [2018-11-29 00:12:42,025 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-29 00:12:42,027 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-29 00:12:42,041 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-29 00:12:42,041 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-29 00:12:42,042 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-29 00:12:42,044 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-29 00:12:42,045 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-29 00:12:42,047 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-29 00:12:42,048 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-29 00:12:42,049 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-29 00:12:42,049 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-29 00:12:42,050 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-29 00:12:42,051 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-29 00:12:42,052 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-29 00:12:42,053 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-29 00:12:42,054 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-29 00:12:42,059 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-29 00:12:42,064 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-29 00:12:42,066 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-29 00:12:42,070 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-29 00:12:42,073 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-29 00:12:42,079 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-29 00:12:42,079 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-29 00:12:42,079 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-29 00:12:42,081 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-29 00:12:42,083 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-29 00:12:42,084 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-29 00:12:42,085 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-29 00:12:42,090 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-29 00:12:42,090 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-29 00:12:42,091 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-29 00:12:42,091 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-29 00:12:42,091 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-29 00:12:42,094 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-29 00:12:42,095 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-29 00:12:42,096 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-29 00:12:42,130 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-29 00:12:42,130 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-29 00:12:42,132 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-29 00:12:42,132 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-29 00:12:42,132 INFO L133 SettingsManager]: * Use SBE=true [2018-11-29 00:12:42,132 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-29 00:12:42,132 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-29 00:12:42,133 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-29 00:12:42,134 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-29 00:12:42,134 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-29 00:12:42,134 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-29 00:12:42,134 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-29 00:12:42,134 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-29 00:12:42,135 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-29 00:12:42,135 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-29 00:12:42,135 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-29 00:12:42,135 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-29 00:12:42,135 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-29 00:12:42,135 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-29 00:12:42,136 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-29 00:12:42,137 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-29 00:12:42,137 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-29 00:12:42,137 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-29 00:12:42,138 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-29 00:12:42,138 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-29 00:12:42,138 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-29 00:12:42,138 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-29 00:12:42,138 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-29 00:12:42,138 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-29 00:12:42,139 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-29 00:12:42,139 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-29 00:12:42,140 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-29 00:12:42,140 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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-29 00:12:42,195 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-29 00:12:42,210 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-29 00:12:42,216 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-29 00:12:42,218 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-29 00:12:42,218 INFO L276 PluginConnector]: CDTParser initialized [2018-11-29 00:12:42,219 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/ldv-memsafety-bitfields/test-bitfields-3_true-valid-memsafety_true-termination.i [2018-11-29 00:12:42,281 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9315c778a/cfd799626354433982d5d75aaeb8c317/FLAGa6285b893 [2018-11-29 00:12:42,764 INFO L307 CDTParser]: Found 1 translation units. [2018-11-29 00:12:42,765 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/ldv-memsafety-bitfields/test-bitfields-3_true-valid-memsafety_true-termination.i [2018-11-29 00:12:42,775 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9315c778a/cfd799626354433982d5d75aaeb8c317/FLAGa6285b893 [2018-11-29 00:12:43,097 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9315c778a/cfd799626354433982d5d75aaeb8c317 [2018-11-29 00:12:43,101 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-29 00:12:43,102 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-29 00:12:43,103 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-29 00:12:43,103 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-29 00:12:43,107 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-29 00:12:43,108 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:12:43" (1/1) ... [2018-11-29 00:12:43,113 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58fe42a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:12:43, skipping insertion in model container [2018-11-29 00:12:43,114 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:12:43" (1/1) ... [2018-11-29 00:12:43,122 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-29 00:12:43,143 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-29 00:12:43,371 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-29 00:12:43,396 INFO L191 MainTranslator]: Completed pre-run [2018-11-29 00:12:43,430 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-29 00:12:43,465 INFO L195 MainTranslator]: Completed translation [2018-11-29 00:12:43,466 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:12:43 WrapperNode [2018-11-29 00:12:43,466 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-29 00:12:43,467 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-29 00:12:43,467 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-29 00:12:43,468 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-29 00:12:43,478 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:12:43" (1/1) ... [2018-11-29 00:12:43,490 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:12:43" (1/1) ... [2018-11-29 00:12:43,526 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-29 00:12:43,528 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-29 00:12:43,528 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-29 00:12:43,528 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-29 00:12:43,538 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:12:43" (1/1) ... [2018-11-29 00:12:43,538 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:12:43" (1/1) ... [2018-11-29 00:12:43,541 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:12:43" (1/1) ... [2018-11-29 00:12:43,541 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:12:43" (1/1) ... [2018-11-29 00:12:43,549 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:12:43" (1/1) ... [2018-11-29 00:12:43,556 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:12:43" (1/1) ... [2018-11-29 00:12:43,557 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:12:43" (1/1) ... [2018-11-29 00:12:43,627 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-29 00:12:43,632 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-29 00:12:43,632 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-29 00:12:43,632 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-29 00:12:43,635 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:12:43" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-29 00:12:43,699 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2018-11-29 00:12:43,700 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2018-11-29 00:12:43,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2018-11-29 00:12:43,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-29 00:12:43,700 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-29 00:12:43,700 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2018-11-29 00:12:43,700 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-29 00:12:43,701 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-29 00:12:43,701 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-29 00:12:43,701 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-29 00:12:44,189 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-29 00:12:44,239 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-29 00:12:44,239 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-11-29 00:12:44,240 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:12:44 BoogieIcfgContainer [2018-11-29 00:12:44,240 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-29 00:12:44,241 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-29 00:12:44,241 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-29 00:12:44,244 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-29 00:12:44,245 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-29 00:12:44,246 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.11 12:12:43" (1/3) ... [2018-11-29 00:12:44,247 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7887dead and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.11 12:12:44, skipping insertion in model container [2018-11-29 00:12:44,247 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-29 00:12:44,247 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:12:43" (2/3) ... [2018-11-29 00:12:44,247 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7887dead and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.11 12:12:44, skipping insertion in model container [2018-11-29 00:12:44,247 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-29 00:12:44,248 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:12:44" (3/3) ... [2018-11-29 00:12:44,249 INFO L375 chiAutomizerObserver]: Analyzing ICFG test-bitfields-3_true-valid-memsafety_true-termination.i [2018-11-29 00:12:44,307 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-29 00:12:44,307 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-29 00:12:44,308 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-29 00:12:44,308 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-29 00:12:44,308 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-29 00:12:44,308 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-29 00:12:44,308 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-29 00:12:44,309 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-29 00:12:44,309 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-29 00:12:44,324 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states. [2018-11-29 00:12:44,351 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2018-11-29 00:12:44,351 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:12:44,351 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:12:44,357 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-29 00:12:44,357 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-29 00:12:44,358 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-29 00:12:44,358 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states. [2018-11-29 00:12:44,361 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2018-11-29 00:12:44,362 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:12:44,362 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:12:44,362 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-29 00:12:44,362 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-29 00:12:44,371 INFO L794 eck$LassoCheckResult]: Stem: 28#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#d~0.base, ~#d~0.offset := #Ultimate.alloc(10);call write~init~int(0, ~#d~0.base, ~#d~0.offset, 1);call write~init~int(3, ~#d~0.base, 1 + ~#d~0.offset, 1);call write~init~int(0, ~#d~0.base, 2 + ~#d~0.offset, 1);call write~init~int(0, ~#d~0.base, 3 + ~#d~0.offset, 1);call write~init~int(0, ~#d~0.base, 4 + ~#d~0.offset, 1);call write~init~int(0, ~#d~0.base, 5 + ~#d~0.offset, 1);call write~init~int(0, ~#d~0.base, 6 + ~#d~0.offset, 4); 10#L-1true havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~memcpy~res1.base, main_#t~memcpy~res1.offset, main_#t~mem2, main_#t~mem3, main_#t~mem4, main_#t~mem5, main_#t~mem6, main_#t~mem7, main_#t~mem8, main_#t~mem9, main_#t~mem10, main_#t~mem11, main_~p~0.base, main_~p~0.offset;havoc main_~p~0.base, main_~p~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.alloc(10);main_~p~0.base, main_~p~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset; 24#L41true call main_#t~memcpy~res1.base, main_#t~memcpy~res1.offset := #Ultimate.C_memcpy(main_~p~0.base, main_~p~0.offset, ~#d~0.base, ~#d~0.offset, 10);< 14##Ultimate.C_memcpyENTRYtrue assume 1 == #valid[dest.base];assume 1 == #valid[src.base];assume size + dest.offset <= #length[dest.base] && 0 <= dest.offset;assume size + src.offset <= #length[src.base] && 0 <= src.offset; 5#$Ultimate##0true #t~loopctr13 := 0; 25#L-1-1true [2018-11-29 00:12:44,372 INFO L796 eck$LassoCheckResult]: Loop: 25#L-1-1true assume #t~loopctr13 < size;call #t~mem14 := read~unchecked~int(src.base, src.offset + #t~loopctr13, 1);call write~unchecked~int(#t~mem14, dest.base, dest.offset + #t~loopctr13, 1);call #t~mem15 := read~unchecked~int(src.base, src.offset + #t~loopctr13, 4);call write~unchecked~int(#t~mem15, dest.base, dest.offset + #t~loopctr13, 4);#t~loopctr13 := 1 + #t~loopctr13; 25#L-1-1true [2018-11-29 00:12:44,379 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:12:44,379 INFO L82 PathProgramCache]: Analyzing trace with hash 28780603, now seen corresponding path program 1 times [2018-11-29 00:12:44,381 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:12:44,382 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:12:44,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:12:44,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:12:44,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:12:44,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:12:44,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:12:44,538 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:12:44,539 INFO L82 PathProgramCache]: Analyzing trace with hash 114, now seen corresponding path program 1 times [2018-11-29 00:12:44,539 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:12:44,539 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:12:44,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:12:44,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:12:44,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:12:44,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:12:44,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:12:44,558 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:12:44,558 INFO L82 PathProgramCache]: Analyzing trace with hash 892198776, now seen corresponding path program 1 times [2018-11-29 00:12:44,558 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:12:44,558 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:12:44,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:12:44,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:12:44,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:12:44,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:12:44,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:12:45,154 WARN L180 SmtUtils]: Spent 286.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2018-11-29 00:12:45,385 WARN L180 SmtUtils]: Spent 221.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2018-11-29 00:12:46,047 WARN L180 SmtUtils]: Spent 562.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 86 [2018-11-29 00:12:46,160 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:12:46,161 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:12:46,161 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:12:46,162 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:12:46,162 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-29 00:12:46,162 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:12:46,162 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:12:46,162 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:12:46,162 INFO L131 ssoRankerPreferences]: Filename of dumped script: test-bitfields-3_true-valid-memsafety_true-termination.i_Iteration1_Lasso [2018-11-29 00:12:46,163 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:12:46,163 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:12:46,192 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-29 00:12:46,215 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-29 00:12:46,218 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-29 00:12:46,221 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-29 00:12:46,224 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-29 00:12:46,234 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-29 00:12:46,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-29 00:12:46,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-29 00:12:46,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-29 00:12:46,253 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-29 00:12:46,262 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-29 00:12:46,286 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-29 00:12:46,971 WARN L180 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 64 [2018-11-29 00:12:47,185 WARN L180 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 45 [2018-11-29 00:12:47,186 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-29 00:12:47,203 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-29 00:12:47,205 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-29 00:12:47,209 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-29 00:12:47,218 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-29 00:12:47,220 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-29 00:12:47,223 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-29 00:12:47,226 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-29 00:12:47,229 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-29 00:12:47,232 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-29 00:12:47,237 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-29 00:12:47,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-29 00:12:47,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-29 00:12:47,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-29 00:12:47,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-29 00:12:47,766 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:12:47,772 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-29 00:12:47,774 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-29 00:12:47,777 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:12:47,777 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:12:47,778 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:12:47,779 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:12:47,779 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:12:47,781 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:12:47,782 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:12:47,784 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:12:47,785 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-29 00:12:47,785 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:12:47,786 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:12:47,786 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:12:47,787 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:12:47,787 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:12:47,787 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:12:47,788 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:12:47,789 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:12:47,790 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-29 00:12:47,791 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:12:47,791 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:12:47,791 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:12:47,791 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:12:47,791 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:12:47,792 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:12:47,792 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:12:47,794 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:12:47,795 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-29 00:12:47,795 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:12:47,795 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:12:47,796 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:12:47,797 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:12:47,797 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:12:47,797 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:12:47,798 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:12:47,799 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:12:47,799 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-29 00:12:47,800 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:12:47,800 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:12:47,800 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:12:47,802 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:12:47,805 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:12:47,805 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:12:47,810 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:12:47,810 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-29 00:12:47,811 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:12:47,811 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:12:47,811 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:12:47,811 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:12:47,811 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:12:47,812 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:12:47,812 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:12:47,815 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:12:47,816 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-29 00:12:47,816 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:12:47,817 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:12:47,817 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:12:47,817 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:12:47,817 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:12:47,819 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:12:47,819 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:12:47,820 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:12:47,821 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-29 00:12:47,822 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:12:47,822 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:12:47,822 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:12:47,822 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:12:47,823 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:12:47,823 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:12:47,823 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:12:47,826 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:12:47,826 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-29 00:12:47,827 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:12:47,827 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:12:47,827 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:12:47,829 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:12:47,829 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:12:47,830 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:12:47,830 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:12:47,832 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:12:47,832 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-29 00:12:47,833 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:12:47,833 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:12:47,833 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:12:47,833 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:12:47,835 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:12:47,835 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:12:47,836 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:12:47,837 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:12:47,837 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-29 00:12:47,839 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:12:47,840 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:12:47,840 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:12:47,840 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:12:47,840 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:12:47,841 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:12:47,842 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:12:47,842 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:12:47,843 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-29 00:12:47,844 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:12:47,844 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:12:47,844 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:12:47,844 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:12:47,849 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:12:47,849 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:12:47,859 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:12:47,860 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-29 00:12:47,861 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:12:47,861 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:12:47,861 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:12:47,861 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:12:47,868 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:12:47,868 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:12:47,886 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:12:47,887 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-29 00:12:47,888 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:12:47,888 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:12:47,888 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:12:47,888 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:12:47,892 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:12:47,892 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:12:47,899 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:12:47,900 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-29 00:12:47,900 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:12:47,901 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:12:47,902 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:12:47,902 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:12:47,904 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:12:47,904 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:12:47,911 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:12:47,911 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-29 00:12:47,912 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:12:47,912 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:12:47,912 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:12:47,912 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:12:47,916 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:12:47,916 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:12:47,923 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:12:47,923 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-29 00:12:47,924 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:12:47,924 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:12:47,924 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:12:47,924 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:12:47,927 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:12:47,928 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:12:47,931 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:12:47,932 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-29 00:12:47,933 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:12:47,933 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:12:47,933 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:12:47,933 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:12:47,938 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:12:47,938 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:12:47,969 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-29 00:12:48,007 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-29 00:12:48,008 INFO L444 ModelExtractionUtils]: 12 out of 19 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-29 00:12:48,011 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-29 00:12:48,013 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-29 00:12:48,013 INFO L518 LassoAnalysis]: Proved termination. [2018-11-29 00:12:48,014 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(#Ultimate.C_memcpy_#t~loopctr13, #Ultimate.C_memcpy_size) = -1*#Ultimate.C_memcpy_#t~loopctr13 + 1*#Ultimate.C_memcpy_size Supporting invariants [] [2018-11-29 00:12:48,308 INFO L297 tatePredicateManager]: 27 out of 27 supporting invariants were superfluous and have been removed [2018-11-29 00:12:48,326 WARN L1298 BoogieBacktranslator]: unknown boogie variable size [2018-11-29 00:12:48,356 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:12:48,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:12:48,397 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:12:48,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:12:48,415 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:12:48,416 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-29 00:12:48,431 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-29 00:12:48,433 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states. Second operand 2 states. [2018-11-29 00:12:48,512 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states.. Second operand 2 states. Result 38 states and 53 transitions. Complement of second has 6 states. [2018-11-29 00:12:48,513 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-29 00:12:48,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-29 00:12:48,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2018-11-29 00:12:48,518 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 5 letters. Loop has 1 letters. [2018-11-29 00:12:48,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:12:48,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 6 letters. Loop has 1 letters. [2018-11-29 00:12:48,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:12:48,521 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 5 letters. Loop has 2 letters. [2018-11-29 00:12:48,521 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:12:48,522 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 53 transitions. [2018-11-29 00:12:48,526 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-29 00:12:48,530 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 9 states and 11 transitions. [2018-11-29 00:12:48,531 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2018-11-29 00:12:48,532 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2018-11-29 00:12:48,532 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 11 transitions. [2018-11-29 00:12:48,533 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:12:48,533 INFO L705 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2018-11-29 00:12:48,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 11 transitions. [2018-11-29 00:12:48,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2018-11-29 00:12:48,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-29 00:12:48,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2018-11-29 00:12:48,579 INFO L728 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2018-11-29 00:12:48,579 INFO L608 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2018-11-29 00:12:48,579 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-29 00:12:48,580 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 10 transitions. [2018-11-29 00:12:48,580 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-29 00:12:48,580 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:12:48,580 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:12:48,581 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-29 00:12:48,581 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-29 00:12:48,581 INFO L794 eck$LassoCheckResult]: Stem: 225#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#d~0.base, ~#d~0.offset := #Ultimate.alloc(10);call write~init~int(0, ~#d~0.base, ~#d~0.offset, 1);call write~init~int(3, ~#d~0.base, 1 + ~#d~0.offset, 1);call write~init~int(0, ~#d~0.base, 2 + ~#d~0.offset, 1);call write~init~int(0, ~#d~0.base, 3 + ~#d~0.offset, 1);call write~init~int(0, ~#d~0.base, 4 + ~#d~0.offset, 1);call write~init~int(0, ~#d~0.base, 5 + ~#d~0.offset, 1);call write~init~int(0, ~#d~0.base, 6 + ~#d~0.offset, 4); 221#L-1 havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~memcpy~res1.base, main_#t~memcpy~res1.offset, main_#t~mem2, main_#t~mem3, main_#t~mem4, main_#t~mem5, main_#t~mem6, main_#t~mem7, main_#t~mem8, main_#t~mem9, main_#t~mem10, main_#t~mem11, main_~p~0.base, main_~p~0.offset;havoc main_~p~0.base, main_~p~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.alloc(10);main_~p~0.base, main_~p~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset; 222#L41 call main_#t~memcpy~res1.base, main_#t~memcpy~res1.offset := #Ultimate.C_memcpy(main_~p~0.base, main_~p~0.offset, ~#d~0.base, ~#d~0.offset, 10);< 227##Ultimate.C_memcpyENTRY assume 1 == #valid[dest.base];assume 1 == #valid[src.base];assume size + dest.offset <= #length[dest.base] && 0 <= dest.offset;assume size + src.offset <= #length[src.base] && 0 <= src.offset; 223#$Ultimate##0 #t~loopctr13 := 0; 224#L-1-1 assume !(#t~loopctr13 < size);#t~loopctr16 := 0; 226#L-1-3 [2018-11-29 00:12:48,581 INFO L796 eck$LassoCheckResult]: Loop: 226#L-1-3 assume #t~loopctr16 < size;#t~loopctr16 := 4 + #t~loopctr16; 226#L-1-3 [2018-11-29 00:12:48,582 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:12:48,583 INFO L82 PathProgramCache]: Analyzing trace with hash 892198778, now seen corresponding path program 1 times [2018-11-29 00:12:48,583 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:12:48,583 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:12:48,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:12:48,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:12:48,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:12:48,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:12:48,709 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-29 00:12:48,711 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:12:48,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-29 00:12:48,713 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-29 00:12:48,713 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:12:48,713 INFO L82 PathProgramCache]: Analyzing trace with hash 120, now seen corresponding path program 1 times [2018-11-29 00:12:48,713 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:12:48,713 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:12:48,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:12:48,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:12:48,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:12:48,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:12:48,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:12:48,730 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:12:48,730 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:12:48,730 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:12:48,731 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:12:48,731 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-29 00:12:48,731 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:12:48,731 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:12:48,731 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:12:48,732 INFO L131 ssoRankerPreferences]: Filename of dumped script: test-bitfields-3_true-valid-memsafety_true-termination.i_Iteration2_Loop [2018-11-29 00:12:48,732 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:12:48,732 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:12:48,733 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-29 00:12:48,758 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:12:48,759 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-29 00:12:48,764 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:12:48,764 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-29 00:12:48,814 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-29 00:12:48,814 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:12:48,937 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-29 00:12:48,939 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:12:48,939 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:12:48,939 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:12:48,939 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:12:48,939 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-29 00:12:48,939 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:12:48,939 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:12:48,940 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:12:48,940 INFO L131 ssoRankerPreferences]: Filename of dumped script: test-bitfields-3_true-valid-memsafety_true-termination.i_Iteration2_Loop [2018-11-29 00:12:48,940 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:12:48,940 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:12:48,941 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-29 00:12:48,990 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:12:48,990 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-29 00:12:48,992 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-29 00:12:48,992 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:12:48,992 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:12:48,993 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:12:48,993 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:12:48,993 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:12:48,993 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:12:48,993 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:12:48,996 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-29 00:12:49,000 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-29 00:12:49,000 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-29 00:12:49,001 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-29 00:12:49,001 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-29 00:12:49,001 INFO L518 LassoAnalysis]: Proved termination. [2018-11-29 00:12:49,001 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(#Ultimate.C_memcpy_#t~loopctr16, #Ultimate.C_memcpy_size) = -1*#Ultimate.C_memcpy_#t~loopctr16 + 1*#Ultimate.C_memcpy_size Supporting invariants [] [2018-11-29 00:12:49,002 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-29 00:12:49,019 WARN L1298 BoogieBacktranslator]: unknown boogie variable size [2018-11-29 00:12:49,066 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:12:49,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:12:49,098 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:12:49,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:12:49,115 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:12:49,115 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-29 00:12:49,116 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-29 00:12:49,116 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 10 transitions. cyclomatic complexity: 4 Second operand 2 states. [2018-11-29 00:12:49,145 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-29 00:12:49,146 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-29 00:12:49,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-29 00:12:49,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 8 transitions. [2018-11-29 00:12:49,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 8 transitions. Stem has 6 letters. Loop has 1 letters. [2018-11-29 00:12:49,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:12:49,149 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 8 transitions. Stem has 7 letters. Loop has 1 letters. [2018-11-29 00:12:49,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:12:49,149 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 8 transitions. Stem has 6 letters. Loop has 2 letters. [2018-11-29 00:12:49,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:12:49,149 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 11 transitions. [2018-11-29 00:12:49,150 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-29 00:12:49,150 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 0 states and 0 transitions. [2018-11-29 00:12:49,150 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-29 00:12:49,150 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-29 00:12:49,153 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-29 00:12:49,153 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:12:49,153 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-29 00:12:49,153 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-29 00:12:49,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-29 00:12:49,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-29 00:12:49,159 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 4 states. [2018-11-29 00:12:49,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:12:49,163 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-29 00:12:49,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-29 00:12:49,164 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2018-11-29 00:12:49,164 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-29 00:12:49,164 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2018-11-29 00:12:49,164 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-29 00:12:49,164 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-29 00:12:49,164 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-29 00:12:49,165 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:12:49,165 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-29 00:12:49,165 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-29 00:12:49,165 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-29 00:12:49,165 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-29 00:12:49,165 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-29 00:12:49,165 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-29 00:12:49,165 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-29 00:12:49,175 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.11 12:12:49 BoogieIcfgContainer [2018-11-29 00:12:49,175 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-29 00:12:49,176 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-29 00:12:49,176 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-29 00:12:49,176 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-29 00:12:49,178 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:12:44" (3/4) ... [2018-11-29 00:12:49,182 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-29 00:12:49,183 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-29 00:12:49,183 INFO L168 Benchmark]: Toolchain (without parser) took 6082.31 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 209.2 MB). Free memory was 944.6 MB in the beginning and 1.2 GB in the end (delta: -205.9 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2018-11-29 00:12:49,185 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-29 00:12:49,186 INFO L168 Benchmark]: CACSL2BoogieTranslator took 363.33 ms. Allocated memory is still 1.0 GB. Free memory was 944.6 MB in the beginning and 932.6 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. [2018-11-29 00:12:49,187 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.59 ms. Allocated memory is still 1.0 GB. Free memory was 932.6 MB in the beginning and 927.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-29 00:12:49,188 INFO L168 Benchmark]: Boogie Preprocessor took 103.56 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 927.2 MB in the beginning and 1.1 GB in the end (delta: -204.6 MB). Peak memory consumption was 13.8 MB. Max. memory is 11.5 GB. [2018-11-29 00:12:49,191 INFO L168 Benchmark]: RCFGBuilder took 608.24 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: 26.4 MB). Peak memory consumption was 26.4 MB. Max. memory is 11.5 GB. [2018-11-29 00:12:49,192 INFO L168 Benchmark]: BuchiAutomizer took 4934.75 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 72.4 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -45.1 MB). Peak memory consumption was 27.3 MB. Max. memory is 11.5 GB. [2018-11-29 00:12:49,193 INFO L168 Benchmark]: Witness Printer took 6.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-29 00:12:49,199 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 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 363.33 ms. Allocated memory is still 1.0 GB. Free memory was 944.6 MB in the beginning and 932.6 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 60.59 ms. Allocated memory is still 1.0 GB. Free memory was 932.6 MB in the beginning and 927.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 103.56 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 927.2 MB in the beginning and 1.1 GB in the end (delta: -204.6 MB). Peak memory consumption was 13.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 608.24 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: 26.4 MB). Peak memory consumption was 26.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4934.75 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 72.4 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -45.1 MB). Peak memory consumption was 27.3 MB. Max. memory is 11.5 GB. * Witness Printer took 6.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~loopctr13-aux + unknown-size-unknown and consists of 3 locations. One deterministic module has affine ranking function -1 * aux-#t~loopctr16-aux + unknown-size-unknown and consists of 2 locations. 1 modules have a trivial ranking function, the largest among these consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.8s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 4.3s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 8 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 13 SDtfs, 14 SDslu, 1 SDs, 0 SdLazy, 11 SolverSat, 2 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT1 lasso1 LassoPreprocessingBenchmarks: Lassos: inital74 mio100 ax100 hnf100 lsp99 ukn88 mio100 lsp76 div100 bol100 ite100 ukn100 eq175 hnf89 smp100 dnf100 smp100 tf108 neg100 sie108 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 10ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...