./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/product-lines/email_spec7_product28_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_spec7_product28_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 7c2cb3a13a9a17f32fb5c2fee33321c25b1f2f51 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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:10:38,726 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 04:10:38,727 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 04:10:38,744 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 04:10:38,744 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 04:10:38,745 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 04:10:38,747 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 04:10:38,750 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 04:10:38,752 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 04:10:38,753 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 04:10:38,761 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 04:10:38,761 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 04:10:38,763 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 04:10:38,764 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 04:10:38,767 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 04:10:38,768 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 04:10:38,769 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 04:10:38,772 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 04:10:38,775 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 04:10:38,778 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 04:10:38,778 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 04:10:38,780 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 04:10:38,782 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 04:10:38,782 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 04:10:38,783 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 04:10:38,787 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 04:10:38,788 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 04:10:38,789 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 04:10:38,789 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 04:10:38,795 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 04:10:38,795 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 04:10:38,796 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 04:10:38,796 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 04:10:38,796 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 04:10:38,799 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 04:10:38,800 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 04:10:38,800 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:10:38,825 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 04:10:38,826 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 04:10:38,828 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 04:10:38,830 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 04:10:38,830 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 04:10:38,830 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 04:10:38,830 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 04:10:38,830 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 04:10:38,833 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 04:10:38,833 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 04:10:38,833 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 04:10:38,833 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 04:10:38,834 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 04:10:38,834 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 04:10:38,834 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 04:10:38,834 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 04:10:38,834 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 04:10:38,834 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 04:10:38,835 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 04:10:38,835 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 04:10:38,835 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 04:10:38,835 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 04:10:38,835 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 04:10:38,835 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 04:10:38,839 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 04:10:38,839 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 04:10:38,839 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 04:10:38,839 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 04:10:38,840 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 04:10:38,840 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 04:10:38,840 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 04:10:38,845 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 04:10:38,846 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 -> 7c2cb3a13a9a17f32fb5c2fee33321c25b1f2f51 [2019-01-14 04:10:38,914 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 04:10:38,930 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 04:10:38,935 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 04:10:38,937 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 04:10:38,940 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 04:10:38,940 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/email_spec7_product28_false-unreach-call_true-termination.cil.c [2019-01-14 04:10:38,987 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/540d4d8f6/eff50b3e6f574ac5abb168e64691d68f/FLAGf6ee4c3ae [2019-01-14 04:10:39,575 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 04:10:39,577 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/email_spec7_product28_false-unreach-call_true-termination.cil.c [2019-01-14 04:10:39,603 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/540d4d8f6/eff50b3e6f574ac5abb168e64691d68f/FLAGf6ee4c3ae [2019-01-14 04:10:39,768 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/540d4d8f6/eff50b3e6f574ac5abb168e64691d68f [2019-01-14 04:10:39,772 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 04:10:39,773 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 04:10:39,774 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 04:10:39,774 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 04:10:39,779 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 04:10:39,780 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:10:39" (1/1) ... [2019-01-14 04:10:39,783 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bbae27e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:10:39, skipping insertion in model container [2019-01-14 04:10:39,783 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:10:39" (1/1) ... [2019-01-14 04:10:39,792 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 04:10:39,887 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 04:10:40,537 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:10:40,572 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 04:10:40,841 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:10:40,927 INFO L195 MainTranslator]: Completed translation [2019-01-14 04:10:40,927 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:10:40 WrapperNode [2019-01-14 04:10:40,928 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 04:10:40,928 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 04:10:40,929 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 04:10:40,929 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 04:10:40,939 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:10:40" (1/1) ... [2019-01-14 04:10:40,986 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:10:40" (1/1) ... [2019-01-14 04:10:41,088 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 04:10:41,090 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 04:10:41,090 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 04:10:41,090 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 04:10:41,103 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:10:40" (1/1) ... [2019-01-14 04:10:41,103 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:10:40" (1/1) ... [2019-01-14 04:10:41,125 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:10:40" (1/1) ... [2019-01-14 04:10:41,125 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:10:40" (1/1) ... [2019-01-14 04:10:41,165 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:10:40" (1/1) ... [2019-01-14 04:10:41,214 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:10:40" (1/1) ... [2019-01-14 04:10:41,228 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:10:40" (1/1) ... [2019-01-14 04:10:41,245 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 04:10:41,246 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 04:10:41,246 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 04:10:41,246 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 04:10:41,247 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:10:40" (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:10:41,326 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-01-14 04:10:41,327 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 04:10:41,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-14 04:10:41,327 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 04:10:41,327 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 04:10:44,412 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 04:10:44,412 INFO L286 CfgBuilder]: Removed 295 assue(true) statements. [2019-01-14 04:10:44,414 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:10:44 BoogieIcfgContainer [2019-01-14 04:10:44,414 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 04:10:44,415 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 04:10:44,415 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 04:10:44,419 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 04:10:44,420 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:10:44,420 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 04:10:39" (1/3) ... [2019-01-14 04:10:44,421 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6db1655a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:10:44, skipping insertion in model container [2019-01-14 04:10:44,421 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:10:44,421 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:10:40" (2/3) ... [2019-01-14 04:10:44,422 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6db1655a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:10:44, skipping insertion in model container [2019-01-14 04:10:44,422 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:10:44,422 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:10:44" (3/3) ... [2019-01-14 04:10:44,424 INFO L375 chiAutomizerObserver]: Analyzing ICFG email_spec7_product28_false-unreach-call_true-termination.cil.c [2019-01-14 04:10:44,472 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 04:10:44,472 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 04:10:44,472 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 04:10:44,472 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 04:10:44,473 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 04:10:44,473 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 04:10:44,473 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 04:10:44,473 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 04:10:44,473 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 04:10:44,501 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 471 states. [2019-01-14 04:10:44,561 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 208 [2019-01-14 04:10:44,562 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:10:44,562 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:10:44,573 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:10:44,573 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-14 04:10:44,573 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 04:10:44,574 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 471 states. [2019-01-14 04:10:44,591 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 208 [2019-01-14 04:10:44,591 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:10:44,591 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:10:44,593 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:10:44,593 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-14 04:10:44,601 INFO L794 eck$LassoCheckResult]: Stem: 322#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;call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10);call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(12);call #t~string7.base, #t~string7.offset := #Ultimate.allocOnStack(10);call #t~string10.base, #t~string10.offset := #Ultimate.allocOnStack(18);call #t~string13.base, #t~string13.offset := #Ultimate.allocOnStack(16);call #t~string16.base, #t~string16.offset := #Ultimate.allocOnStack(21);call #t~string19.base, #t~string19.offset := #Ultimate.allocOnStack(13);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(16);call #t~string25.base, #t~string25.offset := #Ultimate.allocOnStack(25);~queue_empty~0 := 1;~queued_message~0 := 0;~queued_client~0 := 0;call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(10);call #t~string36.base, #t~string36.offset := #Ultimate.allocOnStack(16);call #t~string44.base, #t~string44.offset := #Ultimate.allocOnStack(20);~bob~0 := 0;~rjh~0 := 0;~chuck~0 := 0;call #t~string53.base, #t~string53.offset := #Ultimate.allocOnStack(44);call #t~string58.base, #t~string58.offset := #Ultimate.allocOnStack(44);call #t~string60.base, #t~string60.offset := #Ultimate.allocOnStack(9);call #t~string62.base, #t~string62.offset := #Ultimate.allocOnStack(9);call #t~string64.base, #t~string64.offset := #Ultimate.allocOnStack(11);call #t~string68.base, #t~string68.offset := #Ultimate.allocOnStack(19);call #t~string71.base, #t~string71.offset := #Ultimate.allocOnStack(4);call write~init~int(37, #t~string71.base, #t~string71.offset, 1);call write~init~int(100, #t~string71.base, 1 + #t~string71.offset, 1);call write~init~int(10, #t~string71.base, 2 + #t~string71.offset, 1);call write~init~int(0, #t~string71.base, 3 + #t~string71.offset, 1);call #t~string74.base, #t~string74.offset := #Ultimate.allocOnStack(4);call write~init~int(37, #t~string74.base, #t~string74.offset, 1);call write~init~int(100, #t~string74.base, 1 + #t~string74.offset, 1);call write~init~int(10, #t~string74.base, 2 + #t~string74.offset, 1);call write~init~int(0, #t~string74.base, 3 + #t~string74.offset, 1);~head~0.base, ~head~0.offset := 0, 0;call #t~string111.base, #t~string111.offset := #Ultimate.allocOnStack(30);call #t~string112.base, #t~string112.offset := #Ultimate.allocOnStack(9);call #t~string113.base, #t~string113.offset := #Ultimate.allocOnStack(21);call #t~string114.base, #t~string114.offset := #Ultimate.allocOnStack(30);call #t~string115.base, #t~string115.offset := #Ultimate.allocOnStack(9);call #t~string116.base, #t~string116.offset := #Ultimate.allocOnStack(21);call #t~string120.base, #t~string120.offset := #Ultimate.allocOnStack(30);call #t~string121.base, #t~string121.offset := #Ultimate.allocOnStack(9);call #t~string122.base, #t~string122.offset := #Ultimate.allocOnStack(25);call #t~string123.base, #t~string123.offset := #Ultimate.allocOnStack(30);call #t~string124.base, #t~string124.offset := #Ultimate.allocOnStack(9);call #t~string125.base, #t~string125.offset := #Ultimate.allocOnStack(25);call #t~string128.base, #t~string128.offset := #Ultimate.allocOnStack(4);call write~init~int(37, #t~string128.base, #t~string128.offset, 1);call write~init~int(115, #t~string128.base, 1 + #t~string128.offset, 1);call write~init~int(10, #t~string128.base, 2 + #t~string128.offset, 1);call write~init~int(0, #t~string128.base, 3 + #t~string128.offset, 1);~__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;~__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; 228#L-1true havoc main_#res;havoc main_#t~ret66, main_~retValue_acc~11, main_~tmp~14;havoc main_~retValue_acc~11;havoc main_~tmp~14; 189#L233true havoc valid_product_#res;havoc valid_product_~retValue_acc~5;havoc valid_product_~retValue_acc~5;valid_product_~retValue_acc~5 := 1;valid_product_#res := valid_product_~retValue_acc~5; 219#L241true main_#t~ret66 := valid_product_#res;main_~tmp~14 := main_#t~ret66;havoc main_#t~ret66; 310#L738true assume 0 != main_~tmp~14;havoc setup_#t~nondet61, setup_#t~nondet63, setup_#t~nondet65, setup_~__cil_tmp1~0.base, setup_~__cil_tmp1~0.offset, setup_~__cil_tmp2~0.base, setup_~__cil_tmp2~0.offset, setup_~__cil_tmp3~1.base, setup_~__cil_tmp3~1.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~1.base, setup_~__cil_tmp3~1.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; 403#L2528true assume 1 == setClientId_~handle;~__ste_client_idCounter0~0 := setClientId_~value; 74#L2534-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; 102#L2093true assume 1 == setClientPrivateKey_~handle;~__ste_client_privateKey0~0 := setClientPrivateKey_~value; 380#L2099-2true setup_~__cil_tmp1~0.base, setup_~__cil_tmp1~0.offset := #t~string60.base, #t~string60.offset;havoc setup_#t~nondet61;~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; 389#L2528-2true assume 1 == setClientId_~handle;~__ste_client_idCounter0~0 := setClientId_~value; 79#L2534-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; 104#L2093-2true assume 1 == setClientPrivateKey_~handle;~__ste_client_privateKey0~0 := setClientPrivateKey_~value; 363#L2099-5true setup_~__cil_tmp2~0.base, setup_~__cil_tmp2~0.offset := #t~string62.base, #t~string62.offset;havoc setup_#t~nondet63;~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; 392#L2528-4true assume 1 == setClientId_~handle;~__ste_client_idCounter0~0 := setClientId_~value; 196#L2534-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; 98#L2093-4true assume 1 == setClientPrivateKey_~handle;~__ste_client_privateKey0~0 := setClientPrivateKey_~value; 367#L2099-8true setup_~__cil_tmp3~1.base, setup_~__cil_tmp3~1.offset := #t~string64.base, #t~string64.offset;havoc setup_#t~nondet65; 271#L725true havoc test_#t~nondet81, test_#t~nondet82, test_#t~nondet83, test_#t~nondet84, test_#t~nondet85, test_#t~nondet86, test_#t~nondet87, test_#t~nondet88, test_#t~nondet89, test_#t~nondet90, test_#t~nondet91, 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~16, test_~tmp___0~8, test_~tmp___1~4, test_~tmp___2~3, test_~tmp___3~1, test_~tmp___4~1, 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~16;havoc test_~tmp___0~8;havoc test_~tmp___1~4;havoc test_~tmp___2~3;havoc test_~tmp___3~1;havoc test_~tmp___4~1;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; 276#L1044-1true [2019-01-14 04:10:44,601 INFO L796 eck$LassoCheckResult]: Loop: 276#L1044-1true assume !false; 359#L902true assume test_~splverifierCounter~0 < 4; 315#L903true test_~splverifierCounter~0 := 1 + test_~splverifierCounter~0; 417#L909true assume !(0 == test_~op1~0); 460#L922true assume 0 == test_~op2~0;test_~tmp___8~0 := test_#t~nondet82;havoc test_#t~nondet82; 192#L927true assume 0 != test_~tmp___8~0;test_~op2~0 := 1; 276#L1044-1true [2019-01-14 04:10:44,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:10:44,614 INFO L82 PathProgramCache]: Analyzing trace with hash 1291925977, now seen corresponding path program 1 times [2019-01-14 04:10:44,616 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:10:44,617 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:10:44,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:10:44,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:10:44,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:10:44,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:10:44,966 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:10:44,969 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:10:44,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:10:44,974 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:10:44,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:10:44,974 INFO L82 PathProgramCache]: Analyzing trace with hash 590492675, now seen corresponding path program 1 times [2019-01-14 04:10:44,975 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:10:44,975 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:10:44,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:10:44,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:10:44,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:10:44,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:10:44,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:10:45,218 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-01-14 04:10:45,230 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:10:45,231 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:10:45,231 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:10:45,231 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:10:45,231 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 04:10:45,232 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:10:45,232 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:10:45,232 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:10:45,232 INFO L131 ssoRankerPreferences]: Filename of dumped script: email_spec7_product28_false-unreach-call_true-termination.cil.c_Iteration1_Loop [2019-01-14 04:10:45,232 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:10:45,233 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:10:45,251 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:10:45,264 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:10:45,278 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:10:45,299 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:10:45,592 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-01-14 04:10:45,705 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-01-14 04:10:45,988 WARN L181 SmtUtils]: Spent 193.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-01-14 04:10:45,994 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:10:45,995 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:10:46,000 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:10:46,000 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:10:46,028 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 04:10:46,028 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:10:46,038 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 04:10:46,056 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:10:46,056 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:10:46,056 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:10:46,056 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:10:46,056 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:10:46,057 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:10:46,057 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:10:46,057 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:10:46,057 INFO L131 ssoRankerPreferences]: Filename of dumped script: email_spec7_product28_false-unreach-call_true-termination.cil.c_Iteration1_Loop [2019-01-14 04:10:46,057 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:10:46,057 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:10:46,059 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:10:46,105 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:10:46,161 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:10:46,170 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:10:46,390 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:10:46,395 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:10:46,397 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:10:46,399 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:10:46,399 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:10:46,400 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:10:46,400 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:10:46,400 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:10:46,402 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:10:46,402 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:10:46,406 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:10:46,412 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 04:10:46,413 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-14 04:10:46,415 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:10:46,415 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 04:10:46,416 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:10:46,417 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:10:46,419 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 04:10:46,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:10:46,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:10:46,786 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:10:46,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:10:46,845 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:10:46,959 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:10:46,972 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:10:46,973 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 471 states. Second operand 4 states. [2019-01-14 04:10:47,332 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 471 states.. Second operand 4 states. Result 2032 states and 3544 transitions. Complement of second has 7 states. [2019-01-14 04:10:47,334 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:10:47,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 04:10:47,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1996 transitions. [2019-01-14 04:10:47,342 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 1996 transitions. Stem has 18 letters. Loop has 6 letters. [2019-01-14 04:10:47,345 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:10:47,345 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 1996 transitions. Stem has 24 letters. Loop has 6 letters. [2019-01-14 04:10:47,345 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:10:47,345 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 1996 transitions. Stem has 18 letters. Loop has 12 letters. [2019-01-14 04:10:47,346 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:10:47,347 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2032 states and 3544 transitions. [2019-01-14 04:10:47,382 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 415 [2019-01-14 04:10:47,410 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2032 states to 863 states and 1568 transitions. [2019-01-14 04:10:47,412 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 446 [2019-01-14 04:10:47,415 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 447 [2019-01-14 04:10:47,418 INFO L73 IsDeterministic]: Start isDeterministic. Operand 863 states and 1568 transitions. [2019-01-14 04:10:47,419 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:10:47,420 INFO L706 BuchiCegarLoop]: Abstraction has 863 states and 1568 transitions. [2019-01-14 04:10:47,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 863 states and 1568 transitions. [2019-01-14 04:10:47,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 863 to 448. [2019-01-14 04:10:47,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2019-01-14 04:10:47,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 811 transitions. [2019-01-14 04:10:47,509 INFO L729 BuchiCegarLoop]: Abstraction has 448 states and 811 transitions. [2019-01-14 04:10:47,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 04:10:47,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 04:10:47,515 INFO L87 Difference]: Start difference. First operand 448 states and 811 transitions. Second operand 3 states. [2019-01-14 04:10:47,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:10:47,717 INFO L93 Difference]: Finished difference Result 876 states and 1587 transitions. [2019-01-14 04:10:47,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 04:10:47,722 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 876 states and 1587 transitions. [2019-01-14 04:10:47,730 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 416 [2019-01-14 04:10:47,739 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 876 states to 876 states and 1587 transitions. [2019-01-14 04:10:47,739 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 458 [2019-01-14 04:10:47,741 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 458 [2019-01-14 04:10:47,741 INFO L73 IsDeterministic]: Start isDeterministic. Operand 876 states and 1587 transitions. [2019-01-14 04:10:47,741 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:10:47,741 INFO L706 BuchiCegarLoop]: Abstraction has 876 states and 1587 transitions. [2019-01-14 04:10:47,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 876 states and 1587 transitions. [2019-01-14 04:10:47,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 876 to 447. [2019-01-14 04:10:47,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 447 states. [2019-01-14 04:10:47,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 807 transitions. [2019-01-14 04:10:47,780 INFO L729 BuchiCegarLoop]: Abstraction has 447 states and 807 transitions. [2019-01-14 04:10:47,780 INFO L609 BuchiCegarLoop]: Abstraction has 447 states and 807 transitions. [2019-01-14 04:10:47,780 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 04:10:47,780 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 447 states and 807 transitions. [2019-01-14 04:10:47,783 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 208 [2019-01-14 04:10:47,783 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:10:47,783 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:10:47,788 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:10:47,788 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:10:47,788 INFO L794 eck$LassoCheckResult]: Stem: 4220#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;call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10);call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(12);call #t~string7.base, #t~string7.offset := #Ultimate.allocOnStack(10);call #t~string10.base, #t~string10.offset := #Ultimate.allocOnStack(18);call #t~string13.base, #t~string13.offset := #Ultimate.allocOnStack(16);call #t~string16.base, #t~string16.offset := #Ultimate.allocOnStack(21);call #t~string19.base, #t~string19.offset := #Ultimate.allocOnStack(13);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(16);call #t~string25.base, #t~string25.offset := #Ultimate.allocOnStack(25);~queue_empty~0 := 1;~queued_message~0 := 0;~queued_client~0 := 0;call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(10);call #t~string36.base, #t~string36.offset := #Ultimate.allocOnStack(16);call #t~string44.base, #t~string44.offset := #Ultimate.allocOnStack(20);~bob~0 := 0;~rjh~0 := 0;~chuck~0 := 0;call #t~string53.base, #t~string53.offset := #Ultimate.allocOnStack(44);call #t~string58.base, #t~string58.offset := #Ultimate.allocOnStack(44);call #t~string60.base, #t~string60.offset := #Ultimate.allocOnStack(9);call #t~string62.base, #t~string62.offset := #Ultimate.allocOnStack(9);call #t~string64.base, #t~string64.offset := #Ultimate.allocOnStack(11);call #t~string68.base, #t~string68.offset := #Ultimate.allocOnStack(19);call #t~string71.base, #t~string71.offset := #Ultimate.allocOnStack(4);call write~init~int(37, #t~string71.base, #t~string71.offset, 1);call write~init~int(100, #t~string71.base, 1 + #t~string71.offset, 1);call write~init~int(10, #t~string71.base, 2 + #t~string71.offset, 1);call write~init~int(0, #t~string71.base, 3 + #t~string71.offset, 1);call #t~string74.base, #t~string74.offset := #Ultimate.allocOnStack(4);call write~init~int(37, #t~string74.base, #t~string74.offset, 1);call write~init~int(100, #t~string74.base, 1 + #t~string74.offset, 1);call write~init~int(10, #t~string74.base, 2 + #t~string74.offset, 1);call write~init~int(0, #t~string74.base, 3 + #t~string74.offset, 1);~head~0.base, ~head~0.offset := 0, 0;call #t~string111.base, #t~string111.offset := #Ultimate.allocOnStack(30);call #t~string112.base, #t~string112.offset := #Ultimate.allocOnStack(9);call #t~string113.base, #t~string113.offset := #Ultimate.allocOnStack(21);call #t~string114.base, #t~string114.offset := #Ultimate.allocOnStack(30);call #t~string115.base, #t~string115.offset := #Ultimate.allocOnStack(9);call #t~string116.base, #t~string116.offset := #Ultimate.allocOnStack(21);call #t~string120.base, #t~string120.offset := #Ultimate.allocOnStack(30);call #t~string121.base, #t~string121.offset := #Ultimate.allocOnStack(9);call #t~string122.base, #t~string122.offset := #Ultimate.allocOnStack(25);call #t~string123.base, #t~string123.offset := #Ultimate.allocOnStack(30);call #t~string124.base, #t~string124.offset := #Ultimate.allocOnStack(9);call #t~string125.base, #t~string125.offset := #Ultimate.allocOnStack(25);call #t~string128.base, #t~string128.offset := #Ultimate.allocOnStack(4);call write~init~int(37, #t~string128.base, #t~string128.offset, 1);call write~init~int(115, #t~string128.base, 1 + #t~string128.offset, 1);call write~init~int(10, #t~string128.base, 2 + #t~string128.offset, 1);call write~init~int(0, #t~string128.base, 3 + #t~string128.offset, 1);~__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;~__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; 3970#L-1 havoc main_#res;havoc main_#t~ret66, main_~retValue_acc~11, main_~tmp~14;havoc main_~retValue_acc~11;havoc main_~tmp~14; 3971#L233 havoc valid_product_#res;havoc valid_product_~retValue_acc~5;havoc valid_product_~retValue_acc~5;valid_product_~retValue_acc~5 := 1;valid_product_#res := valid_product_~retValue_acc~5; 3942#L241 main_#t~ret66 := valid_product_#res;main_~tmp~14 := main_#t~ret66;havoc main_#t~ret66; 3943#L738 assume 0 != main_~tmp~14;havoc setup_#t~nondet61, setup_#t~nondet63, setup_#t~nondet65, setup_~__cil_tmp1~0.base, setup_~__cil_tmp1~0.offset, setup_~__cil_tmp2~0.base, setup_~__cil_tmp2~0.offset, setup_~__cil_tmp3~1.base, setup_~__cil_tmp3~1.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~1.base, setup_~__cil_tmp3~1.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; 4189#L2528 assume 1 == setClientId_~handle;~__ste_client_idCounter0~0 := setClientId_~value; 4037#L2534-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; 4250#L2093 assume 1 == setClientPrivateKey_~handle;~__ste_client_privateKey0~0 := setClientPrivateKey_~value; 4107#L2099-2 setup_~__cil_tmp1~0.base, setup_~__cil_tmp1~0.offset := #t~string60.base, #t~string60.offset;havoc setup_#t~nondet61;~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; 4258#L2528-2 assume !(1 == setClientId_~handle); 4062#L2531-2 assume 2 == setClientId_~handle;~__ste_client_idCounter1~0 := setClientId_~value; 4063#L2534-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; 4251#L2093-2 assume 1 == setClientPrivateKey_~handle;~__ste_client_privateKey0~0 := setClientPrivateKey_~value; 4040#L2099-5 setup_~__cil_tmp2~0.base, setup_~__cil_tmp2~0.offset := #t~string62.base, #t~string62.offset;havoc setup_#t~nondet63;~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; 4249#L2528-4 assume 1 == setClientId_~handle;~__ste_client_idCounter0~0 := setClientId_~value; 4069#L2534-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; 4265#L2093-4 assume 1 == setClientPrivateKey_~handle;~__ste_client_privateKey0~0 := setClientPrivateKey_~value; 4065#L2099-8 setup_~__cil_tmp3~1.base, setup_~__cil_tmp3~1.offset := #t~string64.base, #t~string64.offset;havoc setup_#t~nondet65; 4119#L725 havoc test_#t~nondet81, test_#t~nondet82, test_#t~nondet83, test_#t~nondet84, test_#t~nondet85, test_#t~nondet86, test_#t~nondet87, test_#t~nondet88, test_#t~nondet89, test_#t~nondet90, test_#t~nondet91, 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~16, test_~tmp___0~8, test_~tmp___1~4, test_~tmp___2~3, test_~tmp___3~1, test_~tmp___4~1, 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~16;havoc test_~tmp___0~8;havoc test_~tmp___1~4;havoc test_~tmp___2~3;havoc test_~tmp___3~1;havoc test_~tmp___4~1;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; 4120#L1044-1 assume !false; 4126#L902 [2019-01-14 04:10:47,789 INFO L796 eck$LassoCheckResult]: Loop: 4126#L902 assume test_~splverifierCounter~0 < 4; 4210#L903 test_~splverifierCounter~0 := 1 + test_~splverifierCounter~0; 4211#L909 assume !(0 == test_~op1~0); 4243#L922 assume !(0 == test_~op2~0); 4346#L933 assume 0 == test_~op3~0;test_~tmp___7~0 := test_#t~nondet83;havoc test_#t~nondet83; 4347#L938 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; 4266#L2093-6 assume 1 == setClientPrivateKey_~handle;~__ste_client_privateKey0~0 := setClientPrivateKey_~value; 4071#L2099-11 test_~op3~0 := 1; 4125#L1044-1 assume !false; 4126#L902 [2019-01-14 04:10:47,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:10:47,789 INFO L82 PathProgramCache]: Analyzing trace with hash -953559564, now seen corresponding path program 1 times [2019-01-14 04:10:47,789 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:10:47,789 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:10:47,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:10:47,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:10:47,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:10:47,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:10:47,958 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:10:47,958 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:10:47,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 04:10:47,959 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:10:47,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:10:47,959 INFO L82 PathProgramCache]: Analyzing trace with hash -1296812605, now seen corresponding path program 1 times [2019-01-14 04:10:47,959 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:10:47,959 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:10:47,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:10:47,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:10:47,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:10:47,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:10:47,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:10:48,107 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2019-01-14 04:10:48,144 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:10:48,144 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:10:48,144 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:10:48,144 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:10:48,145 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 04:10:48,145 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:10:48,145 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:10:48,145 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:10:48,145 INFO L131 ssoRankerPreferences]: Filename of dumped script: email_spec7_product28_false-unreach-call_true-termination.cil.c_Iteration2_Loop [2019-01-14 04:10:48,146 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:10:48,146 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:10:48,147 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:10:48,159 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:10:48,162 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:10:48,170 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:10:48,176 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:10:48,180 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:10:48,190 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:10:48,394 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:10:48,394 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:10:48,397 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:10:48,397 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:10:48,429 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 04:10:48,429 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:10:48,451 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 04:10:48,453 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:10:48,453 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:10:48,453 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:10:48,453 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:10:48,454 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:10:48,454 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:10:48,454 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:10:48,454 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:10:48,454 INFO L131 ssoRankerPreferences]: Filename of dumped script: email_spec7_product28_false-unreach-call_true-termination.cil.c_Iteration2_Loop [2019-01-14 04:10:48,454 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:10:48,454 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:10:48,457 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:10:48,499 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:10:48,505 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:10:48,514 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:10:48,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:10:48,523 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:10:48,546 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:10:48,703 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:10:48,708 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:10:48,708 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:10:48,709 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:10:48,709 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:10:48,709 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:10:48,709 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:10:48,710 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:10:48,713 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:10:48,713 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:10:48,717 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:10:48,729 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 04:10:48,729 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-14 04:10:48,729 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:10:48,730 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 04:10:48,731 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:10:48,731 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:10:48,731 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 04:10:48,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:10:48,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:10:48,888 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:10:48,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:10:48,926 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:10:49,134 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:10:49,134 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:10:49,135 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 447 states and 807 transitions. cyclomatic complexity: 362 Second operand 4 states. [2019-01-14 04:10:49,203 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 447 states and 807 transitions. cyclomatic complexity: 362. Second operand 4 states. Result 867 states and 1573 transitions. Complement of second has 6 states. [2019-01-14 04:10:49,204 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:10:49,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 04:10:49,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 426 transitions. [2019-01-14 04:10:49,205 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 426 transitions. Stem has 20 letters. Loop has 9 letters. [2019-01-14 04:10:49,206 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:10:49,206 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 426 transitions. Stem has 29 letters. Loop has 9 letters. [2019-01-14 04:10:49,206 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:10:49,207 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 426 transitions. Stem has 20 letters. Loop has 18 letters. [2019-01-14 04:10:49,207 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:10:49,207 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 867 states and 1573 transitions. [2019-01-14 04:10:49,218 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 04:10:49,219 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 867 states to 0 states and 0 transitions. [2019-01-14 04:10:49,219 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 04:10:49,219 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 04:10:49,219 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 04:10:49,219 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:10:49,219 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:10:49,219 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:10:49,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 04:10:49,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 04:10:49,220 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 5 states. [2019-01-14 04:10:49,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:10:49,220 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-01-14 04:10:49,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-14 04:10:49,220 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2019-01-14 04:10:49,221 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 04:10:49,224 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2019-01-14 04:10:49,224 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 04:10:49,224 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 04:10:49,224 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 04:10:49,224 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:10:49,224 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:10:49,224 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:10:49,224 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:10:49,225 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 04:10:49,227 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 04:10:49,227 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 04:10:49,227 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 04:10:49,236 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 04:10:49 BoogieIcfgContainer [2019-01-14 04:10:49,236 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 04:10:49,236 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 04:10:49,236 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 04:10:49,237 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 04:10:49,237 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:10:44" (3/4) ... [2019-01-14 04:10:49,243 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 04:10:49,243 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 04:10:49,244 INFO L168 Benchmark]: Toolchain (without parser) took 9471.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 216.5 MB). Free memory was 943.3 MB in the beginning and 937.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 221.9 MB. Max. memory is 11.5 GB. [2019-01-14 04:10:49,245 INFO L168 Benchmark]: CDTParser took 0.15 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:10:49,247 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1154.09 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.7 MB). Free memory was 943.3 MB in the beginning and 1.1 GB in the end (delta: -137.3 MB). Peak memory consumption was 59.3 MB. Max. memory is 11.5 GB. [2019-01-14 04:10:49,248 INFO L168 Benchmark]: Boogie Procedure Inliner took 161.27 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.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-01-14 04:10:49,250 INFO L168 Benchmark]: Boogie Preprocessor took 155.36 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.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-01-14 04:10:49,250 INFO L168 Benchmark]: RCFGBuilder took 3168.76 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 862.4 MB in the end (delta: 204.5 MB). Peak memory consumption was 204.5 MB. Max. memory is 11.5 GB. [2019-01-14 04:10:49,252 INFO L168 Benchmark]: BuchiAutomizer took 4820.94 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 93.8 MB). Free memory was 862.4 MB in the beginning and 937.9 MB in the end (delta: -75.6 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2019-01-14 04:10:49,254 INFO L168 Benchmark]: Witness Printer took 6.82 ms. Allocated memory is still 1.2 GB. Free memory is still 937.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:10:49,260 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1154.09 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.7 MB). Free memory was 943.3 MB in the beginning and 1.1 GB in the end (delta: -137.3 MB). Peak memory consumption was 59.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 161.27 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.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 155.36 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.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 3168.76 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 862.4 MB in the end (delta: 204.5 MB). Peak memory consumption was 204.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4820.94 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 93.8 MB). Free memory was 862.4 MB in the beginning and 937.9 MB in the end (delta: -75.6 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * Witness Printer took 6.82 ms. Allocated memory is still 1.2 GB. Free memory is still 937.9 MB. 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 4.7s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 2.8s. 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.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 844 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 447 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 2832 SDtfs, 2420 SDslu, 3461 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: sat Degree: 0 Time: 20ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...