./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/ldv-memsafety-bitfields/test-bitfields-2.1_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2e94e6aa 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-2.1_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 6cbc2f8335eda1137ed277d7eb74d7775ef6f777 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-02 00:23:22,150 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-02 00:23:22,151 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-02 00:23:22,164 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-02 00:23:22,164 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-02 00:23:22,165 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-02 00:23:22,166 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-02 00:23:22,169 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-02 00:23:22,170 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-02 00:23:22,171 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-02 00:23:22,173 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-02 00:23:22,173 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-02 00:23:22,174 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-02 00:23:22,175 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-02 00:23:22,176 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-02 00:23:22,177 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-02 00:23:22,178 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-02 00:23:22,180 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-02 00:23:22,182 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-02 00:23:22,184 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-02 00:23:22,185 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-02 00:23:22,187 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-02 00:23:22,190 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-02 00:23:22,190 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-02 00:23:22,190 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-02 00:23:22,192 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-02 00:23:22,193 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-02 00:23:22,194 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-02 00:23:22,195 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-02 00:23:22,196 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-02 00:23:22,196 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-02 00:23:22,197 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-02 00:23:22,197 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-02 00:23:22,198 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-02 00:23:22,199 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-02 00:23:22,200 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-02 00:23:22,200 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-02 00:23:22,219 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-02 00:23:22,219 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-02 00:23:22,223 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-02 00:23:22,223 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-02 00:23:22,223 INFO L133 SettingsManager]: * Use SBE=true [2019-01-02 00:23:22,224 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-02 00:23:22,224 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-02 00:23:22,224 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-02 00:23:22,224 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-02 00:23:22,224 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-02 00:23:22,225 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-02 00:23:22,225 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-02 00:23:22,225 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-02 00:23:22,225 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-02 00:23:22,226 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-02 00:23:22,226 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-02 00:23:22,226 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-02 00:23:22,226 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-02 00:23:22,226 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-02 00:23:22,227 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-02 00:23:22,227 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-02 00:23:22,227 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-02 00:23:22,227 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-02 00:23:22,227 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-02 00:23:22,228 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-02 00:23:22,228 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-02 00:23:22,228 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-02 00:23:22,228 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-02 00:23:22,233 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-02 00:23:22,233 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-02 00:23:22,233 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-02 00:23:22,235 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-02 00:23:22,235 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 -> 6cbc2f8335eda1137ed277d7eb74d7775ef6f777 [2019-01-02 00:23:22,279 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-02 00:23:22,292 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-02 00:23:22,295 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-02 00:23:22,297 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-02 00:23:22,297 INFO L276 PluginConnector]: CDTParser initialized [2019-01-02 00:23:22,298 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/ldv-memsafety-bitfields/test-bitfields-2.1_true-valid-memsafety_true-termination.i [2019-01-02 00:23:22,363 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76237819a/262e5da3675e4db497f4d5d1c847f011/FLAG571f02a93 [2019-01-02 00:23:22,894 INFO L307 CDTParser]: Found 1 translation units. [2019-01-02 00:23:22,895 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/ldv-memsafety-bitfields/test-bitfields-2.1_true-valid-memsafety_true-termination.i [2019-01-02 00:23:22,901 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76237819a/262e5da3675e4db497f4d5d1c847f011/FLAG571f02a93 [2019-01-02 00:23:23,237 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76237819a/262e5da3675e4db497f4d5d1c847f011 [2019-01-02 00:23:23,241 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-02 00:23:23,242 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-02 00:23:23,244 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-02 00:23:23,244 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-02 00:23:23,248 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-02 00:23:23,249 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.01 12:23:23" (1/1) ... [2019-01-02 00:23:23,254 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29f4e2f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:23:23, skipping insertion in model container [2019-01-02 00:23:23,254 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.01 12:23:23" (1/1) ... [2019-01-02 00:23:23,264 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-02 00:23:23,285 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-02 00:23:23,504 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-02 00:23:23,533 INFO L191 MainTranslator]: Completed pre-run [2019-01-02 00:23:23,562 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-02 00:23:23,590 INFO L195 MainTranslator]: Completed translation [2019-01-02 00:23:23,591 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:23:23 WrapperNode [2019-01-02 00:23:23,591 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-02 00:23:23,592 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-02 00:23:23,593 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-02 00:23:23,593 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-02 00:23:23,605 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:23:23" (1/1) ... [2019-01-02 00:23:23,624 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:23:23" (1/1) ... [2019-01-02 00:23:23,650 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-02 00:23:23,650 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-02 00:23:23,650 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-02 00:23:23,651 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-02 00:23:23,662 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:23:23" (1/1) ... [2019-01-02 00:23:23,662 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:23:23" (1/1) ... [2019-01-02 00:23:23,666 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:23:23" (1/1) ... [2019-01-02 00:23:23,667 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:23:23" (1/1) ... [2019-01-02 00:23:23,676 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:23:23" (1/1) ... [2019-01-02 00:23:23,682 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:23:23" (1/1) ... [2019-01-02 00:23:23,684 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:23:23" (1/1) ... [2019-01-02 00:23:23,687 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-02 00:23:23,688 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-02 00:23:23,688 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-02 00:23:23,688 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-02 00:23:23,689 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:23:23" (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 [2019-01-02 00:23:23,846 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-01-02 00:23:23,846 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-01-02 00:23:23,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-02 00:23:23,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2019-01-02 00:23:23,846 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-02 00:23:23,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-02 00:23:23,847 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-02 00:23:23,847 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2019-01-02 00:23:23,847 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-02 00:23:23,847 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-02 00:23:23,847 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-02 00:23:23,847 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-02 00:23:24,224 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-01-02 00:23:24,311 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-02 00:23:24,312 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2019-01-02 00:23:24,312 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.01 12:23:24 BoogieIcfgContainer [2019-01-02 00:23:24,312 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-02 00:23:24,313 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-02 00:23:24,313 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-02 00:23:24,317 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-02 00:23:24,318 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-02 00:23:24,318 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 02.01 12:23:23" (1/3) ... [2019-01-02 00:23:24,320 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2385f22a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.01 12:23:24, skipping insertion in model container [2019-01-02 00:23:24,320 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-02 00:23:24,320 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:23:23" (2/3) ... [2019-01-02 00:23:24,320 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2385f22a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.01 12:23:24, skipping insertion in model container [2019-01-02 00:23:24,320 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-02 00:23:24,321 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.01 12:23:24" (3/3) ... [2019-01-02 00:23:24,322 INFO L375 chiAutomizerObserver]: Analyzing ICFG test-bitfields-2.1_true-valid-memsafety_true-termination.i [2019-01-02 00:23:24,383 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-02 00:23:24,383 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-02 00:23:24,384 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-02 00:23:24,384 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-02 00:23:24,384 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-02 00:23:24,384 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-02 00:23:24,384 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-02 00:23:24,385 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-02 00:23:24,385 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-02 00:23:24,402 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2019-01-02 00:23:24,429 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2019-01-02 00:23:24,429 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:23:24,430 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:23:24,437 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-02 00:23:24,438 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-01-02 00:23:24,438 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-02 00:23:24,438 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2019-01-02 00:23:24,441 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2019-01-02 00:23:24,441 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:23:24,441 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:23:24,442 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-02 00:23:24,442 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-01-02 00:23:24,450 INFO L794 eck$LassoCheckResult]: Stem: 13#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#d~0.base, ~#d~0.offset := #Ultimate.allocOnStack(5);call write~init~int(0, ~#d~0.base, ~#d~0.offset, 1);call write~init~int(0, ~#d~0.base, 1 + ~#d~0.offset, 1);call write~init~int(0, ~#d~0.base, 2 + ~#d~0.offset, 1);call write~init~int(0, ~#d~0.base, 3 + ~#d~0.offset, 1);call write~init~int(0, ~#d~0.base, 4 + ~#d~0.offset, 1); 11#L-1true havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~memcpy~res1.base, main_#t~memcpy~res1.offset, main_#t~mem2, main_#t~mem3, main_#t~mem4, main_#t~mem5, main_~p~0.base, main_~p~0.offset;havoc main_~p~0.base, main_~p~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.allocOnHeap(3);main_~p~0.base, main_~p~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;call write~int(1, ~#d~0.base, ~#d~0.offset, 1);call write~int(2, ~#d~0.base, 1 + ~#d~0.offset, 1);call write~int(3, ~#d~0.base, 2 + ~#d~0.offset, 1);call write~int(4, ~#d~0.base, 3 + ~#d~0.offset, 1);call write~int(5, ~#d~0.base, 4 + ~#d~0.offset, 1); 12#L31true call main_#t~memcpy~res1.base, main_#t~memcpy~res1.offset := #Ultimate.C_memcpy(main_~p~0.base, main_~p~0.offset, ~#d~0.base, ~#d~0.offset, 3);< 17##Ultimate.C_memcpyENTRYtrue assume 1 == #valid[dest.base];assume 1 == #valid[src.base];assume size + dest.offset <= #length[dest.base] && 0 <= dest.offset;assume size + src.offset <= #length[src.base] && 0 <= src.offset; 3#$Ultimate##0true #t~loopctr7 := 0; 9#L-1-1true [2019-01-02 00:23:24,450 INFO L796 eck$LassoCheckResult]: Loop: 9#L-1-1true assume #t~loopctr7 < size;call #t~mem8 := read~unchecked~int(src.base, src.offset + #t~loopctr7, 1);call write~unchecked~int(#t~mem8, dest.base, dest.offset + #t~loopctr7, 1);#t~loopctr7 := 1 + #t~loopctr7; 9#L-1-1true [2019-01-02 00:23:24,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:23:24,457 INFO L82 PathProgramCache]: Analyzing trace with hash 28738897, now seen corresponding path program 1 times [2019-01-02 00:23:24,459 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:23:24,460 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:23:24,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:23:24,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:23:24,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:23:24,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:23:24,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:23:24,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:23:24,656 INFO L82 PathProgramCache]: Analyzing trace with hash 72, now seen corresponding path program 1 times [2019-01-02 00:23:24,656 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:23:24,656 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:23:24,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:23:24,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:23:24,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:23:24,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:23:24,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:23:24,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:23:24,673 INFO L82 PathProgramCache]: Analyzing trace with hash 890905848, now seen corresponding path program 1 times [2019-01-02 00:23:24,673 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:23:24,674 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:23:24,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:23:24,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:23:24,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:23:24,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:23:24,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:23:25,062 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2019-01-02 00:23:25,878 WARN L181 SmtUtils]: Spent 811.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 83 [2019-01-02 00:23:26,296 WARN L181 SmtUtils]: Spent 408.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-01-02 00:23:26,710 WARN L181 SmtUtils]: Spent 363.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 86 [2019-01-02 00:23:26,880 WARN L181 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2019-01-02 00:23:26,891 INFO L216 LassoAnalysis]: Preferences: [2019-01-02 00:23:26,892 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-02 00:23:26,892 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-02 00:23:26,892 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-02 00:23:26,892 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-02 00:23:26,893 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:23:26,893 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-02 00:23:26,893 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-02 00:23:26,893 INFO L131 ssoRankerPreferences]: Filename of dumped script: test-bitfields-2.1_true-valid-memsafety_true-termination.i_Iteration1_Lasso [2019-01-02 00:23:26,893 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-02 00:23:26,894 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-02 00:23:26,923 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:23:27,411 WARN L181 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 59 [2019-01-02 00:23:27,558 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:23:27,566 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:23:27,568 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:23:27,572 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:23:27,575 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:23:27,583 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:23:27,585 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:23:27,590 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:23:27,594 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:23:27,614 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:23:27,619 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:23:27,621 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:23:27,624 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:23:27,627 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:23:27,637 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:23:27,641 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:23:27,652 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:23:27,654 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:23:27,656 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:23:27,659 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:23:28,164 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 21 [2019-01-02 00:23:28,357 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-02 00:23:28,364 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-02 00:23:28,366 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 [2019-01-02 00:23:28,368 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:23:28,369 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:23:28,369 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:23:28,369 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:23:28,380 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:23:28,382 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:23:28,390 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:23:28,391 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:23:28,391 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:23:28,392 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:23:28,392 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:23:28,392 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:23:28,395 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:23:28,395 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:23:28,403 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:23:28,404 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:23:28,404 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:23:28,405 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:23:28,405 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:23:28,405 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:23:28,408 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:23:28,408 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:23:28,413 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:23:28,414 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 [2019-01-02 00:23:28,414 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:23:28,415 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:23:28,415 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:23:28,415 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:23:28,418 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:23:28,418 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:23:28,424 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:23:28,424 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 [2019-01-02 00:23:28,425 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:23:28,425 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:23:28,425 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:23:28,426 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:23:28,428 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:23:28,428 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:23:28,432 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:23:28,433 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 [2019-01-02 00:23:28,434 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:23:28,434 INFO L205 nArgumentSynthesizer]: 3 stem disjuncts [2019-01-02 00:23:28,434 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:23:28,435 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:23:28,439 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-01-02 00:23:28,439 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:23:28,461 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:23:28,462 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 [2019-01-02 00:23:28,462 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:23:28,463 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:23:28,463 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:23:28,463 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:23:28,465 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:23:28,465 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:23:28,468 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:23:28,468 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 [2019-01-02 00:23:28,469 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:23:28,469 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:23:28,469 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:23:28,470 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:23:28,471 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:23:28,472 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:23:28,477 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:23:28,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 [2019-01-02 00:23:28,478 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:23:28,479 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:23:28,479 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:23:28,479 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:23:28,481 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:23:28,481 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:23:28,487 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:23:28,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 [2019-01-02 00:23:28,488 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:23:28,488 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:23:28,488 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:23:28,489 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:23:28,491 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:23:28,492 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:23:28,529 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-02 00:23:28,561 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-02 00:23:28,561 INFO L444 ModelExtractionUtils]: 15 out of 19 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-02 00:23:28,565 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-02 00:23:28,567 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-02 00:23:28,567 INFO L518 LassoAnalysis]: Proved termination. [2019-01-02 00:23:28,568 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(#Ultimate.C_memcpy_#t~loopctr7, #Ultimate.C_memcpy_size) = -1*#Ultimate.C_memcpy_#t~loopctr7 + 1*#Ultimate.C_memcpy_size Supporting invariants [] [2019-01-02 00:23:28,780 INFO L297 tatePredicateManager]: 16 out of 16 supporting invariants were superfluous and have been removed [2019-01-02 00:23:28,788 WARN L1298 BoogieBacktranslator]: unknown boogie variable size [2019-01-02 00:23:28,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:23:28,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:23:28,864 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:23:28,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:23:28,884 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:23:28,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:23:28,900 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 [2019-01-02 00:23:28,901 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states. Second operand 2 states. [2019-01-02 00:23:28,980 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states.. Second operand 2 states. Result 26 states and 35 transitions. Complement of second has 6 states. [2019-01-02 00:23:28,983 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 [2019-01-02 00:23:28,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2019-01-02 00:23:28,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2019-01-02 00:23:28,989 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 5 letters. Loop has 1 letters. [2019-01-02 00:23:28,994 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:23:28,994 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 6 letters. Loop has 1 letters. [2019-01-02 00:23:28,995 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:23:28,995 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 5 letters. Loop has 2 letters. [2019-01-02 00:23:28,995 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:23:28,997 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 35 transitions. [2019-01-02 00:23:29,000 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-01-02 00:23:29,006 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 9 states and 11 transitions. [2019-01-02 00:23:29,007 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-01-02 00:23:29,008 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-01-02 00:23:29,008 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 11 transitions. [2019-01-02 00:23:29,010 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:23:29,010 INFO L705 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2019-01-02 00:23:29,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 11 transitions. [2019-01-02 00:23:29,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2019-01-02 00:23:29,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-02 00:23:29,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2019-01-02 00:23:29,044 INFO L728 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2019-01-02 00:23:29,045 INFO L608 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2019-01-02 00:23:29,045 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-02 00:23:29,046 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 10 transitions. [2019-01-02 00:23:29,046 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-01-02 00:23:29,047 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:23:29,047 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:23:29,047 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-02 00:23:29,047 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-01-02 00:23:29,048 INFO L794 eck$LassoCheckResult]: Stem: 156#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#d~0.base, ~#d~0.offset := #Ultimate.allocOnStack(5);call write~init~int(0, ~#d~0.base, ~#d~0.offset, 1);call write~init~int(0, ~#d~0.base, 1 + ~#d~0.offset, 1);call write~init~int(0, ~#d~0.base, 2 + ~#d~0.offset, 1);call write~init~int(0, ~#d~0.base, 3 + ~#d~0.offset, 1);call write~init~int(0, ~#d~0.base, 4 + ~#d~0.offset, 1); 153#L-1 havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~memcpy~res1.base, main_#t~memcpy~res1.offset, main_#t~mem2, main_#t~mem3, main_#t~mem4, main_#t~mem5, main_~p~0.base, main_~p~0.offset;havoc main_~p~0.base, main_~p~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.allocOnHeap(3);main_~p~0.base, main_~p~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;call write~int(1, ~#d~0.base, ~#d~0.offset, 1);call write~int(2, ~#d~0.base, 1 + ~#d~0.offset, 1);call write~int(3, ~#d~0.base, 2 + ~#d~0.offset, 1);call write~int(4, ~#d~0.base, 3 + ~#d~0.offset, 1);call write~int(5, ~#d~0.base, 4 + ~#d~0.offset, 1); 154#L31 call main_#t~memcpy~res1.base, main_#t~memcpy~res1.offset := #Ultimate.C_memcpy(main_~p~0.base, main_~p~0.offset, ~#d~0.base, ~#d~0.offset, 3);< 155##Ultimate.C_memcpyENTRY assume 1 == #valid[dest.base];assume 1 == #valid[src.base];assume size + dest.offset <= #length[dest.base] && 0 <= dest.offset;assume size + src.offset <= #length[src.base] && 0 <= src.offset; 157#$Ultimate##0 #t~loopctr7 := 0; 158#L-1-1 assume !(#t~loopctr7 < size);#t~loopctr9 := 0; 159#L-1-3 [2019-01-02 00:23:29,048 INFO L796 eck$LassoCheckResult]: Loop: 159#L-1-3 assume #t~loopctr9 < size;#t~loopctr9 := 4 + #t~loopctr9; 159#L-1-3 [2019-01-02 00:23:29,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:23:29,048 INFO L82 PathProgramCache]: Analyzing trace with hash 890905850, now seen corresponding path program 1 times [2019-01-02 00:23:29,048 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:23:29,049 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:23:29,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:23:29,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:23:29,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:23:29,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:23:29,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:23:29,149 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-02 00:23:29,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-02 00:23:29,150 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-02 00:23:29,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:23:29,151 INFO L82 PathProgramCache]: Analyzing trace with hash 78, now seen corresponding path program 1 times [2019-01-02 00:23:29,151 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:23:29,151 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:23:29,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:23:29,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:23:29,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:23:29,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:23:29,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:23:29,210 INFO L216 LassoAnalysis]: Preferences: [2019-01-02 00:23:29,210 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-02 00:23:29,211 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-02 00:23:29,211 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-02 00:23:29,211 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-02 00:23:29,211 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:23:29,211 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-02 00:23:29,212 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-02 00:23:29,212 INFO L131 ssoRankerPreferences]: Filename of dumped script: test-bitfields-2.1_true-valid-memsafety_true-termination.i_Iteration2_Loop [2019-01-02 00:23:29,212 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-02 00:23:29,212 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-02 00:23:29,213 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:23:29,260 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-02 00:23:29,261 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 [2019-01-02 00:23:29,266 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:23:29,266 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 [2019-01-02 00:23:29,291 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-02 00:23:29,291 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-02 00:23:29,409 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-02 00:23:29,411 INFO L216 LassoAnalysis]: Preferences: [2019-01-02 00:23:29,411 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-02 00:23:29,412 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-02 00:23:29,412 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-02 00:23:29,412 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-02 00:23:29,412 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:23:29,412 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-02 00:23:29,412 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-02 00:23:29,412 INFO L131 ssoRankerPreferences]: Filename of dumped script: test-bitfields-2.1_true-valid-memsafety_true-termination.i_Iteration2_Loop [2019-01-02 00:23:29,412 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-02 00:23:29,413 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-02 00:23:29,413 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:23:29,481 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-02 00:23:29,481 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-02 00:23:29,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 [2019-01-02 00:23:29,483 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:23:29,483 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:23:29,483 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:23:29,483 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:23:29,484 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:23:29,484 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:23:29,484 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:23:29,487 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-02 00:23:29,491 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-02 00:23:29,491 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-02 00:23:29,491 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-02 00:23:29,492 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-02 00:23:29,492 INFO L518 LassoAnalysis]: Proved termination. [2019-01-02 00:23:29,492 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(#Ultimate.C_memcpy_size, #Ultimate.C_memcpy_#t~loopctr9) = 1*#Ultimate.C_memcpy_size - 1*#Ultimate.C_memcpy_#t~loopctr9 Supporting invariants [] [2019-01-02 00:23:29,492 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-02 00:23:29,518 WARN L1298 BoogieBacktranslator]: unknown boogie variable size [2019-01-02 00:23:29,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:23:29,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:23:29,642 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:23:29,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:23:29,655 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:23:29,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:23:29,656 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 [2019-01-02 00:23:29,656 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 10 transitions. cyclomatic complexity: 4 Second operand 2 states. [2019-01-02 00:23:29,685 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. [2019-01-02 00:23:29,685 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 [2019-01-02 00:23:29,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2019-01-02 00:23:29,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 8 transitions. [2019-01-02 00:23:29,687 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 8 transitions. Stem has 6 letters. Loop has 1 letters. [2019-01-02 00:23:29,687 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:23:29,687 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 8 transitions. Stem has 7 letters. Loop has 1 letters. [2019-01-02 00:23:29,687 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:23:29,687 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 8 transitions. Stem has 6 letters. Loop has 2 letters. [2019-01-02 00:23:29,688 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:23:29,688 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 11 transitions. [2019-01-02 00:23:29,689 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-02 00:23:29,689 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 0 states and 0 transitions. [2019-01-02 00:23:29,689 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-02 00:23:29,689 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-02 00:23:29,689 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-02 00:23:29,689 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:23:29,689 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-02 00:23:29,689 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-02 00:23:29,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-02 00:23:29,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-02 00:23:29,694 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 4 states. [2019-01-02 00:23:29,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:23:29,698 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-01-02 00:23:29,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-02 00:23:29,698 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2019-01-02 00:23:29,698 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-02 00:23:29,698 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2019-01-02 00:23:29,699 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-02 00:23:29,699 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-02 00:23:29,699 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-02 00:23:29,699 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:23:29,699 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-02 00:23:29,699 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-02 00:23:29,699 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-02 00:23:29,699 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-02 00:23:29,699 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-02 00:23:29,700 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-02 00:23:29,700 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-02 00:23:29,707 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 02.01 12:23:29 BoogieIcfgContainer [2019-01-02 00:23:29,707 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-02 00:23:29,708 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-02 00:23:29,708 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-02 00:23:29,709 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-02 00:23:29,709 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.01 12:23:24" (3/4) ... [2019-01-02 00:23:29,714 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-02 00:23:29,714 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-02 00:23:29,715 INFO L168 Benchmark]: Toolchain (without parser) took 6473.69 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 200.3 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -193.7 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-01-02 00:23:29,717 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-02 00:23:29,718 INFO L168 Benchmark]: CACSL2BoogieTranslator took 348.04 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 942.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-02 00:23:29,720 INFO L168 Benchmark]: Boogie Procedure Inliner took 57.62 ms. Allocated memory is still 1.0 GB. Free memory is still 942.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-02 00:23:29,720 INFO L168 Benchmark]: Boogie Preprocessor took 37.19 ms. Allocated memory is still 1.0 GB. Free memory was 942.0 MB in the beginning and 936.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-01-02 00:23:29,721 INFO L168 Benchmark]: RCFGBuilder took 624.70 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.8 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -150.2 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. [2019-01-02 00:23:29,723 INFO L168 Benchmark]: BuchiAutomizer took 5394.13 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 75.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -59.6 MB). Peak memory consumption was 15.9 MB. Max. memory is 11.5 GB. [2019-01-02 00:23:29,725 INFO L168 Benchmark]: Witness Printer took 6.07 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-02 00:23:29,731 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 348.04 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 942.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 57.62 ms. Allocated memory is still 1.0 GB. Free memory is still 942.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 37.19 ms. Allocated memory is still 1.0 GB. Free memory was 942.0 MB in the beginning and 936.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 624.70 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.8 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -150.2 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5394.13 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 75.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -59.6 MB). Peak memory consumption was 15.9 MB. Max. memory is 11.5 GB. * Witness Printer took 6.07 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable size - GenericResult: Unfinished Backtranslation unknown boogie variable size * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (1 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * aux-#t~loopctr7-aux + unknown-size-unknown and consists of 3 locations. One deterministic module has affine ranking function unknown-size-unknown + -1 * aux-#t~loopctr9-aux and consists of 2 locations. 1 modules have a trivial ranking function, the largest among these consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.3s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 4.8s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. 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: inital71 mio100 ax100 hnf100 lsp98 ukn86 mio100 lsp76 div100 bol100 ite100 ukn100 eq175 hnf88 smp100 dnf122 smp89 tf108 neg97 sie119 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 28ms VariablesStem: 4 VariablesLoop: 2 DisjunctsStem: 3 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 10 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...