./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/product-lines/email_spec3_product17_false-unreach-call_true-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0ed9222f 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/product-lines/email_spec3_product17_false-unreach-call_true-termination.cil.c -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 af87be0bb092380f7eb91f81e607efc1a03a6fa9 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 04:09:09,587 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 04:09:09,588 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 04:09:09,600 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 04:09:09,600 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 04:09:09,601 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 04:09:09,603 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 04:09:09,605 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 04:09:09,607 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 04:09:09,608 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 04:09:09,609 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 04:09:09,609 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 04:09:09,610 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 04:09:09,611 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 04:09:09,612 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 04:09:09,613 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 04:09:09,614 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 04:09:09,616 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 04:09:09,618 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 04:09:09,619 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 04:09:09,621 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 04:09:09,622 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 04:09:09,625 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 04:09:09,625 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 04:09:09,625 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 04:09:09,626 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 04:09:09,627 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 04:09:09,628 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 04:09:09,629 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 04:09:09,630 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 04:09:09,631 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 04:09:09,631 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 04:09:09,632 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 04:09:09,632 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 04:09:09,633 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 04:09:09,634 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 04:09:09,634 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-14 04:09:09,652 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 04:09:09,652 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 04:09:09,653 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 04:09:09,654 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 04:09:09,654 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 04:09:09,654 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 04:09:09,654 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 04:09:09,654 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 04:09:09,655 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 04:09:09,655 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 04:09:09,655 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 04:09:09,655 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 04:09:09,655 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 04:09:09,656 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 04:09:09,656 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 04:09:09,656 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 04:09:09,656 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 04:09:09,656 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 04:09:09,657 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 04:09:09,657 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 04:09:09,657 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 04:09:09,657 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 04:09:09,657 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 04:09:09,658 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 04:09:09,658 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 04:09:09,658 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 04:09:09,658 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 04:09:09,658 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 04:09:09,659 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 04:09:09,659 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 04:09:09,659 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 04:09:09,660 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 04:09:09,660 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 -> af87be0bb092380f7eb91f81e607efc1a03a6fa9 [2019-01-14 04:09:09,695 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 04:09:09,712 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 04:09:09,715 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 04:09:09,716 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 04:09:09,716 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 04:09:09,717 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/email_spec3_product17_false-unreach-call_true-termination.cil.c [2019-01-14 04:09:09,772 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e443afd0/7ff52229480a4f7c959f15e4c5451f93/FLAG255575104 [2019-01-14 04:09:10,408 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 04:09:10,409 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/email_spec3_product17_false-unreach-call_true-termination.cil.c [2019-01-14 04:09:10,443 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e443afd0/7ff52229480a4f7c959f15e4c5451f93/FLAG255575104 [2019-01-14 04:09:10,607 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e443afd0/7ff52229480a4f7c959f15e4c5451f93 [2019-01-14 04:09:10,612 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 04:09:10,613 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 04:09:10,614 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 04:09:10,615 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 04:09:10,619 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 04:09:10,620 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:09:10" (1/1) ... [2019-01-14 04:09:10,623 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ac8430a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:09:10, skipping insertion in model container [2019-01-14 04:09:10,623 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:09:10" (1/1) ... [2019-01-14 04:09:10,632 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 04:09:10,731 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 04:09:11,419 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:09:11,445 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 04:09:11,727 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:09:11,852 INFO L195 MainTranslator]: Completed translation [2019-01-14 04:09:11,853 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:09:11 WrapperNode [2019-01-14 04:09:11,853 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 04:09:11,855 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 04:09:11,855 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 04:09:11,855 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 04:09:11,870 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:09:11" (1/1) ... [2019-01-14 04:09:11,942 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:09:11" (1/1) ... [2019-01-14 04:09:12,074 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 04:09:12,075 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 04:09:12,075 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 04:09:12,076 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 04:09:12,092 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:09:11" (1/1) ... [2019-01-14 04:09:12,092 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:09:11" (1/1) ... [2019-01-14 04:09:12,104 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:09:11" (1/1) ... [2019-01-14 04:09:12,104 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:09:11" (1/1) ... [2019-01-14 04:09:12,167 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:09:11" (1/1) ... [2019-01-14 04:09:12,237 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:09:11" (1/1) ... [2019-01-14 04:09:12,252 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:09:11" (1/1) ... [2019-01-14 04:09:12,285 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 04:09:12,286 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 04:09:12,286 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 04:09:12,287 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 04:09:12,290 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:09:11" (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-14 04:09:12,385 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-01-14 04:09:12,385 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 04:09:12,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-14 04:09:12,386 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 04:09:12,386 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 04:09:17,265 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 04:09:17,265 INFO L286 CfgBuilder]: Removed 497 assue(true) statements. [2019-01-14 04:09:17,267 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:09:17 BoogieIcfgContainer [2019-01-14 04:09:17,267 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 04:09:17,268 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 04:09:17,268 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 04:09:17,271 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 04:09:17,272 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:09:17,273 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 04:09:10" (1/3) ... [2019-01-14 04:09:17,274 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7961ac20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:09:17, skipping insertion in model container [2019-01-14 04:09:17,274 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:09:17,274 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:09:11" (2/3) ... [2019-01-14 04:09:17,275 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7961ac20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:09:17, skipping insertion in model container [2019-01-14 04:09:17,275 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:09:17,275 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:09:17" (3/3) ... [2019-01-14 04:09:17,277 INFO L375 chiAutomizerObserver]: Analyzing ICFG email_spec3_product17_false-unreach-call_true-termination.cil.c [2019-01-14 04:09:17,336 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 04:09:17,336 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 04:09:17,337 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 04:09:17,337 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 04:09:17,337 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 04:09:17,337 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 04:09:17,337 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 04:09:17,337 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 04:09:17,337 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 04:09:17,381 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 824 states. [2019-01-14 04:09:17,487 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 251 [2019-01-14 04:09:17,487 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:09:17,488 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:09:17,497 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:09:17,498 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-14 04:09:17,498 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 04:09:17,498 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 824 states. [2019-01-14 04:09:17,510 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 251 [2019-01-14 04:09:17,510 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:09:17,510 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:09:17,512 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:09:17,513 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-14 04:09:17,519 INFO L794 eck$LassoCheckResult]: Stem: 325#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~__SELECTED_FEATURE_Base~0 := 0;~__SELECTED_FEATURE_Keys~0 := 0;~__SELECTED_FEATURE_Encrypt~0 := 0;~__SELECTED_FEATURE_AutoResponder~0 := 0;~__SELECTED_FEATURE_AddressBook~0 := 0;~__SELECTED_FEATURE_Sign~0 := 0;~__SELECTED_FEATURE_Forward~0 := 0;~__SELECTED_FEATURE_Verify~0 := 0;~__SELECTED_FEATURE_Decrypt~0 := 0;~__GUIDSL_ROOT_PRODUCTION~0 := 0;~__GUIDSL_NON_TERMINAL_main~0 := 0;~bob~0 := 0;~rjh~0 := 0;~chuck~0 := 0;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(44);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(44);call #t~string7.base, #t~string7.offset := #Ultimate.allocOnStack(9);call #t~string9.base, #t~string9.offset := #Ultimate.allocOnStack(9);call #t~string11.base, #t~string11.offset := #Ultimate.allocOnStack(11);call #t~string15.base, #t~string15.offset := #Ultimate.allocOnStack(19);call #t~string18.base, #t~string18.offset := #Ultimate.allocOnStack(4);call write~init~int(37, #t~string18.base, #t~string18.offset, 1);call write~init~int(100, #t~string18.base, 1 + #t~string18.offset, 1);call write~init~int(10, #t~string18.base, 2 + #t~string18.offset, 1);call write~init~int(0, #t~string18.base, 3 + #t~string18.offset, 1);call #t~string21.base, #t~string21.offset := #Ultimate.allocOnStack(4);call write~init~int(37, #t~string21.base, #t~string21.offset, 1);call write~init~int(100, #t~string21.base, 1 + #t~string21.offset, 1);call write~init~int(10, #t~string21.base, 2 + #t~string21.offset, 1);call write~init~int(0, #t~string21.base, 3 + #t~string21.offset, 1);~head~0.base, ~head~0.offset := 0, 0;call #t~string47.base, #t~string47.offset := #Ultimate.allocOnStack(30);call #t~string48.base, #t~string48.offset := #Ultimate.allocOnStack(9);call #t~string49.base, #t~string49.offset := #Ultimate.allocOnStack(21);call #t~string50.base, #t~string50.offset := #Ultimate.allocOnStack(30);call #t~string51.base, #t~string51.offset := #Ultimate.allocOnStack(9);call #t~string52.base, #t~string52.offset := #Ultimate.allocOnStack(21);call #t~string56.base, #t~string56.offset := #Ultimate.allocOnStack(30);call #t~string57.base, #t~string57.offset := #Ultimate.allocOnStack(9);call #t~string58.base, #t~string58.offset := #Ultimate.allocOnStack(25);call #t~string59.base, #t~string59.offset := #Ultimate.allocOnStack(30);call #t~string60.base, #t~string60.offset := #Ultimate.allocOnStack(9);call #t~string61.base, #t~string61.offset := #Ultimate.allocOnStack(25);~queue_empty~0 := 1;~queued_message~0 := 0;~queued_client~0 := 0;call #t~string75.base, #t~string75.offset := #Ultimate.allocOnStack(10);call #t~string80.base, #t~string80.offset := #Ultimate.allocOnStack(34);call #t~string83.base, #t~string83.offset := #Ultimate.allocOnStack(30);call #t~string87.base, #t~string87.offset := #Ultimate.allocOnStack(16);call #t~string91.base, #t~string91.offset := #Ultimate.allocOnStack(20);call #t~string100.base, #t~string100.offset := #Ultimate.allocOnStack(4);call write~init~int(37, #t~string100.base, #t~string100.offset, 1);call write~init~int(115, #t~string100.base, 1 + #t~string100.offset, 1);call write~init~int(10, #t~string100.base, 2 + #t~string100.offset, 1);call write~init~int(0, #t~string100.base, 3 + #t~string100.offset, 1);~sent_signed~0 := -1;call #t~string102.base, #t~string102.offset := #Ultimate.allocOnStack(13);call #t~string105.base, #t~string105.offset := #Ultimate.allocOnStack(16);call #t~string107.base, #t~string107.offset := #Ultimate.allocOnStack(15);call #t~string109.base, #t~string109.offset := #Ultimate.allocOnStack(16);~__ste_Client_counter~0 := 0;~__ste_client_name0~0.base, ~__ste_client_name0~0.offset := 0, 0;~__ste_client_name1~0.base, ~__ste_client_name1~0.offset := 0, 0;~__ste_client_name2~0.base, ~__ste_client_name2~0.offset := 0, 0;~__ste_client_outbuffer0~0 := 0;~__ste_client_outbuffer1~0 := 0;~__ste_client_outbuffer2~0 := 0;~__ste_client_outbuffer3~0 := 0;~__ste_ClientAddressBook_size0~0 := 0;~__ste_ClientAddressBook_size1~0 := 0;~__ste_ClientAddressBook_size2~0 := 0;~__ste_Client_AddressBook0_Alias0~0 := 0;~__ste_Client_AddressBook0_Alias1~0 := 0;~__ste_Client_AddressBook0_Alias2~0 := 0;~__ste_Client_AddressBook1_Alias0~0 := 0;~__ste_Client_AddressBook1_Alias1~0 := 0;~__ste_Client_AddressBook1_Alias2~0 := 0;~__ste_Client_AddressBook2_Alias0~0 := 0;~__ste_Client_AddressBook2_Alias1~0 := 0;~__ste_Client_AddressBook2_Alias2~0 := 0;~__ste_Client_AddressBook0_Address0~0 := 0;~__ste_Client_AddressBook0_Address1~0 := 0;~__ste_Client_AddressBook0_Address2~0 := 0;~__ste_Client_AddressBook1_Address0~0 := 0;~__ste_Client_AddressBook1_Address1~0 := 0;~__ste_Client_AddressBook1_Address2~0 := 0;~__ste_Client_AddressBook2_Address0~0 := 0;~__ste_Client_AddressBook2_Address1~0 := 0;~__ste_Client_AddressBook2_Address2~0 := 0;~__ste_client_autoResponse0~0 := 0;~__ste_client_autoResponse1~0 := 0;~__ste_client_autoResponse2~0 := 0;~__ste_client_privateKey0~0 := 0;~__ste_client_privateKey1~0 := 0;~__ste_client_privateKey2~0 := 0;~__ste_ClientKeyring_size0~0 := 0;~__ste_ClientKeyring_size1~0 := 0;~__ste_ClientKeyring_size2~0 := 0;~__ste_Client_Keyring0_User0~0 := 0;~__ste_Client_Keyring0_User1~0 := 0;~__ste_Client_Keyring0_User2~0 := 0;~__ste_Client_Keyring1_User0~0 := 0;~__ste_Client_Keyring1_User1~0 := 0;~__ste_Client_Keyring1_User2~0 := 0;~__ste_Client_Keyring2_User0~0 := 0;~__ste_Client_Keyring2_User1~0 := 0;~__ste_Client_Keyring2_User2~0 := 0;~__ste_Client_Keyring0_PublicKey0~0 := 0;~__ste_Client_Keyring0_PublicKey1~0 := 0;~__ste_Client_Keyring0_PublicKey2~0 := 0;~__ste_Client_Keyring1_PublicKey0~0 := 0;~__ste_Client_Keyring1_PublicKey1~0 := 0;~__ste_Client_Keyring1_PublicKey2~0 := 0;~__ste_Client_Keyring2_PublicKey0~0 := 0;~__ste_Client_Keyring2_PublicKey1~0 := 0;~__ste_Client_Keyring2_PublicKey2~0 := 0;~__ste_client_forwardReceiver0~0 := 0;~__ste_client_forwardReceiver1~0 := 0;~__ste_client_forwardReceiver2~0 := 0;~__ste_client_forwardReceiver3~0 := 0;~__ste_client_idCounter0~0 := 0;~__ste_client_idCounter1~0 := 0;~__ste_client_idCounter2~0 := 0;call #t~string118.base, #t~string118.offset := #Ultimate.allocOnStack(10);call #t~string121.base, #t~string121.offset := #Ultimate.allocOnStack(12);call #t~string124.base, #t~string124.offset := #Ultimate.allocOnStack(10);call #t~string127.base, #t~string127.offset := #Ultimate.allocOnStack(18);call #t~string130.base, #t~string130.offset := #Ultimate.allocOnStack(13);call #t~string133.base, #t~string133.offset := #Ultimate.allocOnStack(16);call #t~string136.base, #t~string136.offset := #Ultimate.allocOnStack(25);~__ste_Email_counter~0 := 0;~__ste_email_id0~0 := 0;~__ste_email_id1~0 := 0;~__ste_email_from0~0 := 0;~__ste_email_from1~0 := 0;~__ste_email_to0~0 := 0;~__ste_email_to1~0 := 0;~__ste_email_subject0~0.base, ~__ste_email_subject0~0.offset := 0, 0;~__ste_email_subject1~0.base, ~__ste_email_subject1~0.offset := 0, 0;~__ste_email_body0~0.base, ~__ste_email_body0~0.offset := 0, 0;~__ste_email_body1~0.base, ~__ste_email_body1~0.offset := 0, 0;~__ste_email_isEncrypted0~0 := 0;~__ste_email_isEncrypted1~0 := 0;~__ste_email_encryptionKey0~0 := 0;~__ste_email_encryptionKey1~0 := 0;~__ste_email_isSigned0~0 := 0;~__ste_email_isSigned1~0 := 0;~__ste_email_signKey0~0 := 0;~__ste_email_signKey1~0 := 0;~__ste_email_isSignatureVerified0~0 := 0;~__ste_email_isSignatureVerified1~0 := 0; 245#L-1true havoc main_#res;havoc main_#t~ret13, main_~retValue_acc~0, main_~tmp~1;havoc main_~retValue_acc~0;havoc main_~tmp~1; 744#L381true havoc valid_product_#res;havoc valid_product_~retValue_acc~2;havoc valid_product_~retValue_acc~2;valid_product_~retValue_acc~2 := 1;valid_product_#res := valid_product_~retValue_acc~2; 456#L389true main_#t~ret13 := valid_product_#res;main_~tmp~1 := main_#t~ret13;havoc main_#t~ret13; 217#L222true assume 0 != main_~tmp~1;havoc setup_#t~nondet8, setup_#t~nondet10, setup_#t~nondet12, setup_~__cil_tmp1~0.base, setup_~__cil_tmp1~0.offset, setup_~__cil_tmp2~0.base, setup_~__cil_tmp2~0.offset, setup_~__cil_tmp3~0.base, setup_~__cil_tmp3~0.offset;havoc setup_~__cil_tmp1~0.base, setup_~__cil_tmp1~0.offset;havoc setup_~__cil_tmp2~0.base, setup_~__cil_tmp2~0.offset;havoc setup_~__cil_tmp3~0.base, setup_~__cil_tmp3~0.offset;~bob~0 := 1;setup_bob_#in~bob___0 := ~bob~0;havoc setup_bob_~bob___0;setup_bob_~bob___0 := setup_bob_#in~bob___0;setup_bob__wrappee__Base_#in~bob___0 := setup_bob_~bob___0;havoc setup_bob__wrappee__Base_~bob___0;setup_bob__wrappee__Base_~bob___0 := setup_bob__wrappee__Base_#in~bob___0;setClientId_#in~handle, setClientId_#in~value := setup_bob__wrappee__Base_~bob___0, setup_bob__wrappee__Base_~bob___0;havoc setClientId_~handle, setClientId_~value;setClientId_~handle := setClientId_#in~handle;setClientId_~value := setClientId_#in~value; 371#L2418true assume 1 == setClientId_~handle;~__ste_client_idCounter0~0 := setClientId_~value; 133#L2424-2true setClientPrivateKey_#in~handle, setClientPrivateKey_#in~value := setup_bob_~bob___0, 123;havoc setClientPrivateKey_~handle, setClientPrivateKey_~value;setClientPrivateKey_~handle := setClientPrivateKey_#in~handle;setClientPrivateKey_~value := setClientPrivateKey_#in~value; 169#L1983true assume 1 == setClientPrivateKey_~handle;~__ste_client_privateKey0~0 := setClientPrivateKey_~value; 722#L1989-2true setup_~__cil_tmp1~0.base, setup_~__cil_tmp1~0.offset := #t~string7.base, #t~string7.offset;havoc setup_#t~nondet8;~rjh~0 := 2;setup_rjh_#in~rjh___0 := ~rjh~0;havoc setup_rjh_~rjh___0;setup_rjh_~rjh___0 := setup_rjh_#in~rjh___0;setup_rjh__wrappee__Base_#in~rjh___0 := setup_rjh_~rjh___0;havoc setup_rjh__wrappee__Base_~rjh___0;setup_rjh__wrappee__Base_~rjh___0 := setup_rjh__wrappee__Base_#in~rjh___0;setClientId_#in~handle, setClientId_#in~value := setup_rjh__wrappee__Base_~rjh___0, setup_rjh__wrappee__Base_~rjh___0;havoc setClientId_~handle, setClientId_~value;setClientId_~handle := setClientId_#in~handle;setClientId_~value := setClientId_#in~value; 372#L2418-2true assume 1 == setClientId_~handle;~__ste_client_idCounter0~0 := setClientId_~value; 219#L2424-5true setClientPrivateKey_#in~handle, setClientPrivateKey_#in~value := setup_rjh_~rjh___0, 456;havoc setClientPrivateKey_~handle, setClientPrivateKey_~value;setClientPrivateKey_~handle := setClientPrivateKey_#in~handle;setClientPrivateKey_~value := setClientPrivateKey_#in~value; 161#L1983-2true assume 1 == setClientPrivateKey_~handle;~__ste_client_privateKey0~0 := setClientPrivateKey_~value; 731#L1989-5true setup_~__cil_tmp2~0.base, setup_~__cil_tmp2~0.offset := #t~string9.base, #t~string9.offset;havoc setup_#t~nondet10;~chuck~0 := 3;setup_chuck_#in~chuck___0 := ~chuck~0;havoc setup_chuck_~chuck___0;setup_chuck_~chuck___0 := setup_chuck_#in~chuck___0;setup_chuck__wrappee__Base_#in~chuck___0 := setup_chuck_~chuck___0;havoc setup_chuck__wrappee__Base_~chuck___0;setup_chuck__wrappee__Base_~chuck___0 := setup_chuck__wrappee__Base_#in~chuck___0;setClientId_#in~handle, setClientId_#in~value := setup_chuck__wrappee__Base_~chuck___0, setup_chuck__wrappee__Base_~chuck___0;havoc setClientId_~handle, setClientId_~value;setClientId_~handle := setClientId_#in~handle;setClientId_~value := setClientId_#in~value; 365#L2418-4true assume 1 == setClientId_~handle;~__ste_client_idCounter0~0 := setClientId_~value; 229#L2424-8true setClientPrivateKey_#in~handle, setClientPrivateKey_#in~value := setup_chuck_~chuck___0, 789;havoc setClientPrivateKey_~handle, setClientPrivateKey_~value;setClientPrivateKey_~handle := setClientPrivateKey_#in~handle;setClientPrivateKey_~value := setClientPrivateKey_#in~value; 162#L1983-4true assume 1 == setClientPrivateKey_~handle;~__ste_client_privateKey0~0 := setClientPrivateKey_~value; 821#L1989-8true setup_~__cil_tmp3~0.base, setup_~__cil_tmp3~0.offset := #t~string11.base, #t~string11.offset;havoc setup_#t~nondet12; 666#L209true havoc test_#t~nondet64, test_#t~nondet65, test_#t~nondet66, test_#t~nondet67, test_#t~nondet68, test_#t~nondet69, test_#t~nondet70, test_#t~nondet71, test_#t~nondet72, test_#t~nondet73, test_#t~nondet74, test_~op1~0, test_~op2~0, test_~op3~0, test_~op4~0, test_~op5~0, test_~op6~0, test_~op7~0, test_~op8~0, test_~op9~0, test_~op10~0, test_~op11~0, test_~splverifierCounter~0, test_~tmp~6, test_~tmp___0~2, test_~tmp___1~1, test_~tmp___2~0, test_~tmp___3~0, test_~tmp___4~0, test_~tmp___5~0, test_~tmp___6~0, test_~tmp___7~0, test_~tmp___8~0, test_~tmp___9~0;havoc test_~op1~0;havoc test_~op2~0;havoc test_~op3~0;havoc test_~op4~0;havoc test_~op5~0;havoc test_~op6~0;havoc test_~op7~0;havoc test_~op8~0;havoc test_~op9~0;havoc test_~op10~0;havoc test_~op11~0;havoc test_~splverifierCounter~0;havoc test_~tmp~6;havoc test_~tmp___0~2;havoc test_~tmp___1~1;havoc test_~tmp___2~0;havoc test_~tmp___3~0;havoc test_~tmp___4~0;havoc test_~tmp___5~0;havoc test_~tmp___6~0;havoc test_~tmp___7~0;havoc test_~tmp___8~0;havoc test_~tmp___9~0;test_~op1~0 := 0;test_~op2~0 := 0;test_~op3~0 := 0;test_~op4~0 := 0;test_~op5~0 := 0;test_~op6~0 := 0;test_~op7~0 := 0;test_~op8~0 := 0;test_~op9~0 := 0;test_~op10~0 := 0;test_~op11~0 := 0;test_~splverifierCounter~0 := 0; 269#L945-1true [2019-01-14 04:09:17,520 INFO L796 eck$LassoCheckResult]: Loop: 269#L945-1true assume !false; 728#L800true assume test_~splverifierCounter~0 < 4; 794#L801true test_~splverifierCounter~0 := 1 + test_~splverifierCounter~0; 466#L807true assume !(0 == test_~op1~0); 85#L820true assume 0 == test_~op2~0;test_~tmp___8~0 := test_#t~nondet65;havoc test_#t~nondet65; 688#L825true assume 0 != test_~tmp___8~0;test_~op2~0 := 1; 269#L945-1true [2019-01-14 04:09:17,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:09:17,526 INFO L82 PathProgramCache]: Analyzing trace with hash 1291925977, now seen corresponding path program 1 times [2019-01-14 04:09:17,528 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:09:17,529 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:09:17,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:09:17,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:09:17,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:09:17,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:09:17,950 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-14 04:09:17,953 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:09:17,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:09:17,958 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:09:17,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:09:17,959 INFO L82 PathProgramCache]: Analyzing trace with hash 590492675, now seen corresponding path program 1 times [2019-01-14 04:09:17,959 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:09:17,959 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:09:17,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:09:17,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:09:17,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:09:17,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:09:17,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:09:18,126 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:09:18,127 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:09:18,128 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:09:18,128 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:09:18,128 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 04:09:18,128 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:09:18,129 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:09:18,129 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:09:18,129 INFO L131 ssoRankerPreferences]: Filename of dumped script: email_spec3_product17_false-unreach-call_true-termination.cil.c_Iteration1_Loop [2019-01-14 04:09:18,129 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:09:18,129 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:09:18,154 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-14 04:09:18,193 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-14 04:09:18,215 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-14 04:09:18,227 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-14 04:09:18,366 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-01-14 04:09:18,629 WARN L181 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2019-01-14 04:09:18,769 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:09:18,769 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-14 04:09:18,781 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:09:18,782 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-14 04:09:18,819 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 04:09:18,820 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:09:18,844 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 04:09:18,871 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:09:18,872 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:09:18,872 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:09:18,872 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:09:18,872 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:09:18,872 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:09:18,872 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:09:18,872 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:09:18,872 INFO L131 ssoRankerPreferences]: Filename of dumped script: email_spec3_product17_false-unreach-call_true-termination.cil.c_Iteration1_Loop [2019-01-14 04:09:18,873 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:09:18,874 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:09:18,876 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-14 04:09:18,891 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-14 04:09:18,901 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-14 04:09:18,913 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-14 04:09:19,060 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-01-14 04:09:19,155 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:09:19,160 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:09:19,161 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-14 04:09:19,162 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:09:19,163 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:09:19,163 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:09:19,163 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:09:19,164 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:09:19,165 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:09:19,166 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:09:19,171 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:09:19,176 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 04:09:19,176 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-14 04:09:19,178 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:09:19,178 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 04:09:19,179 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:09:19,180 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_test_~op2~0) = -2*ULTIMATE.start_test_~op2~0 + 1 Supporting invariants [] [2019-01-14 04:09:19,181 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 04:09:19,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:09:19,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:09:19,411 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:09:19,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:09:19,463 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:09:19,594 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-14 04:09:19,610 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-14 04:09:19,611 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 824 states. Second operand 4 states. [2019-01-14 04:09:20,058 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 824 states.. Second operand 4 states. Result 3754 states and 6552 transitions. Complement of second has 7 states. [2019-01-14 04:09:20,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-14 04:09:20,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 04:09:20,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 3780 transitions. [2019-01-14 04:09:20,069 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 3780 transitions. Stem has 18 letters. Loop has 6 letters. [2019-01-14 04:09:20,071 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:09:20,071 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 3780 transitions. Stem has 24 letters. Loop has 6 letters. [2019-01-14 04:09:20,072 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:09:20,072 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 3780 transitions. Stem has 18 letters. Loop has 12 letters. [2019-01-14 04:09:20,072 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:09:20,073 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3754 states and 6552 transitions. [2019-01-14 04:09:20,118 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 501 [2019-01-14 04:09:20,142 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3754 states to 1035 states and 1896 transitions. [2019-01-14 04:09:20,144 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 532 [2019-01-14 04:09:20,147 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 533 [2019-01-14 04:09:20,148 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1035 states and 1896 transitions. [2019-01-14 04:09:20,150 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:09:20,150 INFO L706 BuchiCegarLoop]: Abstraction has 1035 states and 1896 transitions. [2019-01-14 04:09:20,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1035 states and 1896 transitions. [2019-01-14 04:09:20,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1035 to 534. [2019-01-14 04:09:20,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 534 states. [2019-01-14 04:09:20,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 975 transitions. [2019-01-14 04:09:20,224 INFO L729 BuchiCegarLoop]: Abstraction has 534 states and 975 transitions. [2019-01-14 04:09:20,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 04:09:20,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 04:09:20,230 INFO L87 Difference]: Start difference. First operand 534 states and 975 transitions. Second operand 3 states. [2019-01-14 04:09:20,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:09:20,412 INFO L93 Difference]: Finished difference Result 1048 states and 1915 transitions. [2019-01-14 04:09:20,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 04:09:20,414 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1048 states and 1915 transitions. [2019-01-14 04:09:20,423 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 502 [2019-01-14 04:09:20,432 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1048 states to 1048 states and 1915 transitions. [2019-01-14 04:09:20,432 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 544 [2019-01-14 04:09:20,433 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 544 [2019-01-14 04:09:20,434 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1048 states and 1915 transitions. [2019-01-14 04:09:20,435 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:09:20,436 INFO L706 BuchiCegarLoop]: Abstraction has 1048 states and 1915 transitions. [2019-01-14 04:09:20,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1048 states and 1915 transitions. [2019-01-14 04:09:20,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1048 to 533. [2019-01-14 04:09:20,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 533 states. [2019-01-14 04:09:20,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 971 transitions. [2019-01-14 04:09:20,454 INFO L729 BuchiCegarLoop]: Abstraction has 533 states and 971 transitions. [2019-01-14 04:09:20,454 INFO L609 BuchiCegarLoop]: Abstraction has 533 states and 971 transitions. [2019-01-14 04:09:20,454 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 04:09:20,454 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 533 states and 971 transitions. [2019-01-14 04:09:20,458 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 251 [2019-01-14 04:09:20,459 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:09:20,459 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:09:20,460 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:09:20,460 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:09:20,461 INFO L794 eck$LassoCheckResult]: Stem: 6598#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~__SELECTED_FEATURE_Base~0 := 0;~__SELECTED_FEATURE_Keys~0 := 0;~__SELECTED_FEATURE_Encrypt~0 := 0;~__SELECTED_FEATURE_AutoResponder~0 := 0;~__SELECTED_FEATURE_AddressBook~0 := 0;~__SELECTED_FEATURE_Sign~0 := 0;~__SELECTED_FEATURE_Forward~0 := 0;~__SELECTED_FEATURE_Verify~0 := 0;~__SELECTED_FEATURE_Decrypt~0 := 0;~__GUIDSL_ROOT_PRODUCTION~0 := 0;~__GUIDSL_NON_TERMINAL_main~0 := 0;~bob~0 := 0;~rjh~0 := 0;~chuck~0 := 0;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(44);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(44);call #t~string7.base, #t~string7.offset := #Ultimate.allocOnStack(9);call #t~string9.base, #t~string9.offset := #Ultimate.allocOnStack(9);call #t~string11.base, #t~string11.offset := #Ultimate.allocOnStack(11);call #t~string15.base, #t~string15.offset := #Ultimate.allocOnStack(19);call #t~string18.base, #t~string18.offset := #Ultimate.allocOnStack(4);call write~init~int(37, #t~string18.base, #t~string18.offset, 1);call write~init~int(100, #t~string18.base, 1 + #t~string18.offset, 1);call write~init~int(10, #t~string18.base, 2 + #t~string18.offset, 1);call write~init~int(0, #t~string18.base, 3 + #t~string18.offset, 1);call #t~string21.base, #t~string21.offset := #Ultimate.allocOnStack(4);call write~init~int(37, #t~string21.base, #t~string21.offset, 1);call write~init~int(100, #t~string21.base, 1 + #t~string21.offset, 1);call write~init~int(10, #t~string21.base, 2 + #t~string21.offset, 1);call write~init~int(0, #t~string21.base, 3 + #t~string21.offset, 1);~head~0.base, ~head~0.offset := 0, 0;call #t~string47.base, #t~string47.offset := #Ultimate.allocOnStack(30);call #t~string48.base, #t~string48.offset := #Ultimate.allocOnStack(9);call #t~string49.base, #t~string49.offset := #Ultimate.allocOnStack(21);call #t~string50.base, #t~string50.offset := #Ultimate.allocOnStack(30);call #t~string51.base, #t~string51.offset := #Ultimate.allocOnStack(9);call #t~string52.base, #t~string52.offset := #Ultimate.allocOnStack(21);call #t~string56.base, #t~string56.offset := #Ultimate.allocOnStack(30);call #t~string57.base, #t~string57.offset := #Ultimate.allocOnStack(9);call #t~string58.base, #t~string58.offset := #Ultimate.allocOnStack(25);call #t~string59.base, #t~string59.offset := #Ultimate.allocOnStack(30);call #t~string60.base, #t~string60.offset := #Ultimate.allocOnStack(9);call #t~string61.base, #t~string61.offset := #Ultimate.allocOnStack(25);~queue_empty~0 := 1;~queued_message~0 := 0;~queued_client~0 := 0;call #t~string75.base, #t~string75.offset := #Ultimate.allocOnStack(10);call #t~string80.base, #t~string80.offset := #Ultimate.allocOnStack(34);call #t~string83.base, #t~string83.offset := #Ultimate.allocOnStack(30);call #t~string87.base, #t~string87.offset := #Ultimate.allocOnStack(16);call #t~string91.base, #t~string91.offset := #Ultimate.allocOnStack(20);call #t~string100.base, #t~string100.offset := #Ultimate.allocOnStack(4);call write~init~int(37, #t~string100.base, #t~string100.offset, 1);call write~init~int(115, #t~string100.base, 1 + #t~string100.offset, 1);call write~init~int(10, #t~string100.base, 2 + #t~string100.offset, 1);call write~init~int(0, #t~string100.base, 3 + #t~string100.offset, 1);~sent_signed~0 := -1;call #t~string102.base, #t~string102.offset := #Ultimate.allocOnStack(13);call #t~string105.base, #t~string105.offset := #Ultimate.allocOnStack(16);call #t~string107.base, #t~string107.offset := #Ultimate.allocOnStack(15);call #t~string109.base, #t~string109.offset := #Ultimate.allocOnStack(16);~__ste_Client_counter~0 := 0;~__ste_client_name0~0.base, ~__ste_client_name0~0.offset := 0, 0;~__ste_client_name1~0.base, ~__ste_client_name1~0.offset := 0, 0;~__ste_client_name2~0.base, ~__ste_client_name2~0.offset := 0, 0;~__ste_client_outbuffer0~0 := 0;~__ste_client_outbuffer1~0 := 0;~__ste_client_outbuffer2~0 := 0;~__ste_client_outbuffer3~0 := 0;~__ste_ClientAddressBook_size0~0 := 0;~__ste_ClientAddressBook_size1~0 := 0;~__ste_ClientAddressBook_size2~0 := 0;~__ste_Client_AddressBook0_Alias0~0 := 0;~__ste_Client_AddressBook0_Alias1~0 := 0;~__ste_Client_AddressBook0_Alias2~0 := 0;~__ste_Client_AddressBook1_Alias0~0 := 0;~__ste_Client_AddressBook1_Alias1~0 := 0;~__ste_Client_AddressBook1_Alias2~0 := 0;~__ste_Client_AddressBook2_Alias0~0 := 0;~__ste_Client_AddressBook2_Alias1~0 := 0;~__ste_Client_AddressBook2_Alias2~0 := 0;~__ste_Client_AddressBook0_Address0~0 := 0;~__ste_Client_AddressBook0_Address1~0 := 0;~__ste_Client_AddressBook0_Address2~0 := 0;~__ste_Client_AddressBook1_Address0~0 := 0;~__ste_Client_AddressBook1_Address1~0 := 0;~__ste_Client_AddressBook1_Address2~0 := 0;~__ste_Client_AddressBook2_Address0~0 := 0;~__ste_Client_AddressBook2_Address1~0 := 0;~__ste_Client_AddressBook2_Address2~0 := 0;~__ste_client_autoResponse0~0 := 0;~__ste_client_autoResponse1~0 := 0;~__ste_client_autoResponse2~0 := 0;~__ste_client_privateKey0~0 := 0;~__ste_client_privateKey1~0 := 0;~__ste_client_privateKey2~0 := 0;~__ste_ClientKeyring_size0~0 := 0;~__ste_ClientKeyring_size1~0 := 0;~__ste_ClientKeyring_size2~0 := 0;~__ste_Client_Keyring0_User0~0 := 0;~__ste_Client_Keyring0_User1~0 := 0;~__ste_Client_Keyring0_User2~0 := 0;~__ste_Client_Keyring1_User0~0 := 0;~__ste_Client_Keyring1_User1~0 := 0;~__ste_Client_Keyring1_User2~0 := 0;~__ste_Client_Keyring2_User0~0 := 0;~__ste_Client_Keyring2_User1~0 := 0;~__ste_Client_Keyring2_User2~0 := 0;~__ste_Client_Keyring0_PublicKey0~0 := 0;~__ste_Client_Keyring0_PublicKey1~0 := 0;~__ste_Client_Keyring0_PublicKey2~0 := 0;~__ste_Client_Keyring1_PublicKey0~0 := 0;~__ste_Client_Keyring1_PublicKey1~0 := 0;~__ste_Client_Keyring1_PublicKey2~0 := 0;~__ste_Client_Keyring2_PublicKey0~0 := 0;~__ste_Client_Keyring2_PublicKey1~0 := 0;~__ste_Client_Keyring2_PublicKey2~0 := 0;~__ste_client_forwardReceiver0~0 := 0;~__ste_client_forwardReceiver1~0 := 0;~__ste_client_forwardReceiver2~0 := 0;~__ste_client_forwardReceiver3~0 := 0;~__ste_client_idCounter0~0 := 0;~__ste_client_idCounter1~0 := 0;~__ste_client_idCounter2~0 := 0;call #t~string118.base, #t~string118.offset := #Ultimate.allocOnStack(10);call #t~string121.base, #t~string121.offset := #Ultimate.allocOnStack(12);call #t~string124.base, #t~string124.offset := #Ultimate.allocOnStack(10);call #t~string127.base, #t~string127.offset := #Ultimate.allocOnStack(18);call #t~string130.base, #t~string130.offset := #Ultimate.allocOnStack(13);call #t~string133.base, #t~string133.offset := #Ultimate.allocOnStack(16);call #t~string136.base, #t~string136.offset := #Ultimate.allocOnStack(25);~__ste_Email_counter~0 := 0;~__ste_email_id0~0 := 0;~__ste_email_id1~0 := 0;~__ste_email_from0~0 := 0;~__ste_email_from1~0 := 0;~__ste_email_to0~0 := 0;~__ste_email_to1~0 := 0;~__ste_email_subject0~0.base, ~__ste_email_subject0~0.offset := 0, 0;~__ste_email_subject1~0.base, ~__ste_email_subject1~0.offset := 0, 0;~__ste_email_body0~0.base, ~__ste_email_body0~0.offset := 0, 0;~__ste_email_body1~0.base, ~__ste_email_body1~0.offset := 0, 0;~__ste_email_isEncrypted0~0 := 0;~__ste_email_isEncrypted1~0 := 0;~__ste_email_encryptionKey0~0 := 0;~__ste_email_encryptionKey1~0 := 0;~__ste_email_isSigned0~0 := 0;~__ste_email_isSigned1~0 := 0;~__ste_email_signKey0~0 := 0;~__ste_email_signKey1~0 := 0;~__ste_email_isSignatureVerified0~0 := 0;~__ste_email_isSignatureVerified1~0 := 0; 6313#L-1 havoc main_#res;havoc main_#t~ret13, main_~retValue_acc~0, main_~tmp~1;havoc main_~retValue_acc~0;havoc main_~tmp~1; 6314#L381 havoc valid_product_#res;havoc valid_product_~retValue_acc~2;havoc valid_product_~retValue_acc~2;valid_product_~retValue_acc~2 := 1;valid_product_#res := valid_product_~retValue_acc~2; 6488#L389 main_#t~ret13 := valid_product_#res;main_~tmp~1 := main_#t~ret13;havoc main_#t~ret13; 6489#L222 assume 0 != main_~tmp~1;havoc setup_#t~nondet8, setup_#t~nondet10, setup_#t~nondet12, setup_~__cil_tmp1~0.base, setup_~__cil_tmp1~0.offset, setup_~__cil_tmp2~0.base, setup_~__cil_tmp2~0.offset, setup_~__cil_tmp3~0.base, setup_~__cil_tmp3~0.offset;havoc setup_~__cil_tmp1~0.base, setup_~__cil_tmp1~0.offset;havoc setup_~__cil_tmp2~0.base, setup_~__cil_tmp2~0.offset;havoc setup_~__cil_tmp3~0.base, setup_~__cil_tmp3~0.offset;~bob~0 := 1;setup_bob_#in~bob___0 := ~bob~0;havoc setup_bob_~bob___0;setup_bob_~bob___0 := setup_bob_#in~bob___0;setup_bob__wrappee__Base_#in~bob___0 := setup_bob_~bob___0;havoc setup_bob__wrappee__Base_~bob___0;setup_bob__wrappee__Base_~bob___0 := setup_bob__wrappee__Base_#in~bob___0;setClientId_#in~handle, setClientId_#in~value := setup_bob__wrappee__Base_~bob___0, setup_bob__wrappee__Base_~bob___0;havoc setClientId_~handle, setClientId_~value;setClientId_~handle := setClientId_#in~handle;setClientId_~value := setClientId_#in~value; 6695#L2418 assume 1 == setClientId_~handle;~__ste_client_idCounter0~0 := setClientId_~value; 6439#L2424-2 setClientPrivateKey_#in~handle, setClientPrivateKey_#in~value := setup_bob_~bob___0, 123;havoc setClientPrivateKey_~handle, setClientPrivateKey_~value;setClientPrivateKey_~handle := setClientPrivateKey_#in~handle;setClientPrivateKey_~value := setClientPrivateKey_#in~value; 6667#L1983 assume 1 == setClientPrivateKey_~handle;~__ste_client_privateKey0~0 := setClientPrivateKey_~value; 6404#L1989-2 setup_~__cil_tmp1~0.base, setup_~__cil_tmp1~0.offset := #t~string7.base, #t~string7.offset;havoc setup_#t~nondet8;~rjh~0 := 2;setup_rjh_#in~rjh___0 := ~rjh~0;havoc setup_rjh_~rjh___0;setup_rjh_~rjh___0 := setup_rjh_#in~rjh___0;setup_rjh__wrappee__Base_#in~rjh___0 := setup_rjh_~rjh___0;havoc setup_rjh__wrappee__Base_~rjh___0;setup_rjh__wrappee__Base_~rjh___0 := setup_rjh__wrappee__Base_#in~rjh___0;setClientId_#in~handle, setClientId_#in~value := setup_rjh__wrappee__Base_~rjh___0, setup_rjh__wrappee__Base_~rjh___0;havoc setClientId_~handle, setClientId_~value;setClientId_~handle := setClientId_#in~handle;setClientId_~value := setClientId_#in~value; 6664#L2418-2 assume !(1 == setClientId_~handle); 6315#L2421-2 assume 2 == setClientId_~handle;~__ste_client_idCounter1~0 := setClientId_~value; 6316#L2424-5 setClientPrivateKey_#in~handle, setClientPrivateKey_#in~value := setup_rjh_~rjh___0, 456;havoc setClientPrivateKey_~handle, setClientPrivateKey_~value;setClientPrivateKey_~handle := setClientPrivateKey_#in~handle;setClientPrivateKey_~value := setClientPrivateKey_#in~value; 6696#L1983-2 assume 1 == setClientPrivateKey_~handle;~__ste_client_privateKey0~0 := setClientPrivateKey_~value; 6442#L1989-5 setup_~__cil_tmp2~0.base, setup_~__cil_tmp2~0.offset := #t~string9.base, #t~string9.offset;havoc setup_#t~nondet10;~chuck~0 := 3;setup_chuck_#in~chuck___0 := ~chuck~0;havoc setup_chuck_~chuck___0;setup_chuck_~chuck___0 := setup_chuck_#in~chuck___0;setup_chuck__wrappee__Base_#in~chuck___0 := setup_chuck_~chuck___0;havoc setup_chuck__wrappee__Base_~chuck___0;setup_chuck__wrappee__Base_~chuck___0 := setup_chuck__wrappee__Base_#in~chuck___0;setClientId_#in~handle, setClientId_#in~value := setup_chuck__wrappee__Base_~chuck___0, setup_chuck__wrappee__Base_~chuck___0;havoc setClientId_~handle, setClientId_~value;setClientId_~handle := setClientId_#in~handle;setClientId_~value := setClientId_#in~value; 6674#L2418-4 assume 1 == setClientId_~handle;~__ste_client_idCounter0~0 := setClientId_~value; 6360#L2424-8 setClientPrivateKey_#in~handle, setClientPrivateKey_#in~value := setup_chuck_~chuck___0, 789;havoc setClientPrivateKey_~handle, setClientPrivateKey_~value;setClientPrivateKey_~handle := setClientPrivateKey_#in~handle;setClientPrivateKey_~value := setClientPrivateKey_#in~value; 6697#L1983-4 assume 1 == setClientPrivateKey_~handle;~__ste_client_privateKey0~0 := setClientPrivateKey_~value; 6318#L1989-8 setup_~__cil_tmp3~0.base, setup_~__cil_tmp3~0.offset := #t~string11.base, #t~string11.offset;havoc setup_#t~nondet12; 6592#L209 havoc test_#t~nondet64, test_#t~nondet65, test_#t~nondet66, test_#t~nondet67, test_#t~nondet68, test_#t~nondet69, test_#t~nondet70, test_#t~nondet71, test_#t~nondet72, test_#t~nondet73, test_#t~nondet74, test_~op1~0, test_~op2~0, test_~op3~0, test_~op4~0, test_~op5~0, test_~op6~0, test_~op7~0, test_~op8~0, test_~op9~0, test_~op10~0, test_~op11~0, test_~splverifierCounter~0, test_~tmp~6, test_~tmp___0~2, test_~tmp___1~1, test_~tmp___2~0, test_~tmp___3~0, test_~tmp___4~0, test_~tmp___5~0, test_~tmp___6~0, test_~tmp___7~0, test_~tmp___8~0, test_~tmp___9~0;havoc test_~op1~0;havoc test_~op2~0;havoc test_~op3~0;havoc test_~op4~0;havoc test_~op5~0;havoc test_~op6~0;havoc test_~op7~0;havoc test_~op8~0;havoc test_~op9~0;havoc test_~op10~0;havoc test_~op11~0;havoc test_~splverifierCounter~0;havoc test_~tmp~6;havoc test_~tmp___0~2;havoc test_~tmp___1~1;havoc test_~tmp___2~0;havoc test_~tmp___3~0;havoc test_~tmp___4~0;havoc test_~tmp___5~0;havoc test_~tmp___6~0;havoc test_~tmp___7~0;havoc test_~tmp___8~0;havoc test_~tmp___9~0;test_~op1~0 := 0;test_~op2~0 := 0;test_~op3~0 := 0;test_~op4~0 := 0;test_~op5~0 := 0;test_~op6~0 := 0;test_~op7~0 := 0;test_~op8~0 := 0;test_~op9~0 := 0;test_~op10~0 := 0;test_~op11~0 := 0;test_~splverifierCounter~0 := 0; 6593#L945-1 assume !false; 6480#L800 [2019-01-14 04:09:20,461 INFO L796 eck$LassoCheckResult]: Loop: 6480#L800 assume test_~splverifierCounter~0 < 4; 6672#L801 test_~splverifierCounter~0 := 1 + test_~splverifierCounter~0; 6538#L807 assume !(0 == test_~op1~0); 6540#L820 assume !(0 == test_~op2~0); 6594#L831 assume 0 == test_~op3~0;test_~tmp___7~0 := test_#t~nondet66;havoc test_#t~nondet66; 6620#L836 assume 0 != test_~tmp___7~0;setClientPrivateKey_#in~handle, setClientPrivateKey_#in~value := ~rjh~0, 0;havoc setClientPrivateKey_~handle, setClientPrivateKey_~value;setClientPrivateKey_~handle := setClientPrivateKey_#in~handle;setClientPrivateKey_~value := setClientPrivateKey_#in~value; 6633#L1983-6 assume 1 == setClientPrivateKey_~handle;~__ste_client_privateKey0~0 := setClientPrivateKey_~value; 6362#L1989-11 test_~op3~0 := 1; 6280#L945-1 assume !false; 6480#L800 [2019-01-14 04:09:20,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:09:20,461 INFO L82 PathProgramCache]: Analyzing trace with hash -953559564, now seen corresponding path program 1 times [2019-01-14 04:09:20,462 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:09:20,462 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:09:20,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:09:20,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:09:20,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:09:20,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:09:20,690 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-14 04:09:20,690 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:09:20,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 04:09:20,690 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:09:20,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:09:20,691 INFO L82 PathProgramCache]: Analyzing trace with hash -1296812605, now seen corresponding path program 1 times [2019-01-14 04:09:20,691 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:09:20,691 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:09:20,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:09:20,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:09:20,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:09:20,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:09:20,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:09:20,848 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2019-01-14 04:09:20,900 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:09:20,900 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:09:20,900 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:09:20,900 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:09:20,900 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 04:09:20,901 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:09:20,901 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:09:20,901 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:09:20,901 INFO L131 ssoRankerPreferences]: Filename of dumped script: email_spec3_product17_false-unreach-call_true-termination.cil.c_Iteration2_Loop [2019-01-14 04:09:20,901 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:09:20,901 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:09:20,905 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-14 04:09:20,965 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-14 04:09:20,967 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-14 04:09:20,974 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-14 04:09:21,038 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-14 04:09:21,040 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-14 04:09:21,046 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-14 04:09:21,215 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:09:21,215 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 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 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:09:21,218 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:09:21,218 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 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 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:09:21,240 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 04:09:21,240 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:09:21,279 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 04:09:21,288 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:09:21,288 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:09:21,288 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:09:21,288 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:09:21,288 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:09:21,288 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:09:21,289 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:09:21,289 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:09:21,289 INFO L131 ssoRankerPreferences]: Filename of dumped script: email_spec3_product17_false-unreach-call_true-termination.cil.c_Iteration2_Loop [2019-01-14 04:09:21,289 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:09:21,289 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:09:21,297 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-14 04:09:21,391 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-14 04:09:21,484 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-14 04:09:21,520 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-14 04:09:21,634 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-14 04:09:21,676 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-14 04:09:21,714 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-14 04:09:21,876 WARN L181 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2019-01-14 04:09:22,163 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:09:22,163 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:09:22,164 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-14 04:09:22,164 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:09:22,165 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:09:22,165 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:09:22,165 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 04:09:22,165 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:09:22,166 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:09:22,167 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:09:22,171 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:09:22,172 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-14 04:09:22,173 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:09:22,173 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:09:22,173 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:09:22,173 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:09:22,173 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:09:22,174 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:09:22,174 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:09:22,177 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:09:22,180 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 04:09:22,180 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-14 04:09:22,181 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:09:22,181 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 04:09:22,181 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:09:22,181 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_test_~splverifierCounter~0) = -2*ULTIMATE.start_test_~splverifierCounter~0 + 7 Supporting invariants [] [2019-01-14 04:09:22,182 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 04:09:22,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:09:22,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:09:22,386 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:09:22,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:09:22,435 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:09:22,666 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-14 04:09:22,666 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-01-14 04:09:22,666 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 533 states and 971 transitions. cyclomatic complexity: 440 Second operand 4 states. [2019-01-14 04:09:22,766 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 533 states and 971 transitions. cyclomatic complexity: 440. Second operand 4 states. Result 1039 states and 1901 transitions. Complement of second has 6 states. [2019-01-14 04:09:22,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-14 04:09:22,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 04:09:22,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 508 transitions. [2019-01-14 04:09:22,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 508 transitions. Stem has 20 letters. Loop has 9 letters. [2019-01-14 04:09:22,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:09:22,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 508 transitions. Stem has 29 letters. Loop has 9 letters. [2019-01-14 04:09:22,769 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:09:22,769 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 508 transitions. Stem has 20 letters. Loop has 18 letters. [2019-01-14 04:09:22,769 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:09:22,770 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1039 states and 1901 transitions. [2019-01-14 04:09:22,780 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 04:09:22,781 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1039 states to 0 states and 0 transitions. [2019-01-14 04:09:22,781 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 04:09:22,781 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 04:09:22,781 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 04:09:22,781 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:09:22,781 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:09:22,781 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:09:22,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 04:09:22,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 04:09:22,782 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 5 states. [2019-01-14 04:09:22,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:09:22,782 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-01-14 04:09:22,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-14 04:09:22,783 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2019-01-14 04:09:22,783 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 04:09:22,783 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2019-01-14 04:09:22,783 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 04:09:22,783 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 04:09:22,783 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 04:09:22,783 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:09:22,783 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:09:22,783 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:09:22,783 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:09:22,784 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 04:09:22,784 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 04:09:22,784 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 04:09:22,784 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 04:09:22,791 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 04:09:22 BoogieIcfgContainer [2019-01-14 04:09:22,791 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 04:09:22,792 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 04:09:22,792 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 04:09:22,792 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 04:09:22,792 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:09:17" (3/4) ... [2019-01-14 04:09:22,797 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 04:09:22,798 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 04:09:22,799 INFO L168 Benchmark]: Toolchain (without parser) took 12186.35 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 335.0 MB). Free memory was 946.0 MB in the beginning and 1.3 GB in the end (delta: -338.8 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:09:22,802 INFO L168 Benchmark]: CDTParser took 0.14 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-14 04:09:22,803 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1238.92 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -153.6 MB). Peak memory consumption was 45.8 MB. Max. memory is 11.5 GB. [2019-01-14 04:09:22,805 INFO L168 Benchmark]: Boogie Procedure Inliner took 219.48 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: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2019-01-14 04:09:22,806 INFO L168 Benchmark]: Boogie Preprocessor took 210.59 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-01-14 04:09:22,806 INFO L168 Benchmark]: RCFGBuilder took 4980.84 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 87.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -90.8 MB). Peak memory consumption was 282.5 MB. Max. memory is 11.5 GB. [2019-01-14 04:09:22,808 INFO L168 Benchmark]: BuchiAutomizer took 5523.72 ms. Allocated memory was 1.3 GB in the beginning and 1.4 GB in the end (delta: 100.7 MB). Free memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: -114.4 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:09:22,811 INFO L168 Benchmark]: Witness Printer took 6.05 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:09:22,822 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.14 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 1238.92 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -153.6 MB). Peak memory consumption was 45.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 219.48 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: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 210.59 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 4980.84 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 87.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -90.8 MB). Peak memory consumption was 282.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5523.72 ms. Allocated memory was 1.3 GB in the beginning and 1.4 GB in the end (delta: 100.7 MB). Free memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: -114.4 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 6.05 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (2 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * op2 + 1 and consists of 5 locations. One deterministic module has affine ranking function -2 * splverifierCounter + 7 and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.4s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 3.4s. Construction of modules took 0.2s. Büchi inclusion checks took 1.3s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 1016 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 533 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 4302 SDtfs, 3808 SDslu, 5543 SDs, 0 SdLazy, 26 SolverSat, 7 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT2 lasso0 LassoPreprocessingBenchmarks: Lassos: inital38 mio100 ax100 hnf100 lsp29 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq189 hnf90 smp100 dnf134 smp100 tf108 neg92 sie116 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 8ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 4 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 2 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...