./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/product-lines/email_spec3_product31_false-unreach-call_true-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/product-lines/email_spec3_product31_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 4c150255f8a1e762fd9c62ae945d63ba0fb5878d ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 04:09:27,814 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 04:09:27,816 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 04:09:27,828 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 04:09:27,829 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 04:09:27,830 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 04:09:27,831 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 04:09:27,834 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 04:09:27,836 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 04:09:27,837 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 04:09:27,838 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 04:09:27,838 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 04:09:27,840 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 04:09:27,841 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 04:09:27,842 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 04:09:27,843 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 04:09:27,844 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 04:09:27,846 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 04:09:27,848 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 04:09:27,850 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 04:09:27,852 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 04:09:27,853 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 04:09:27,855 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 04:09:27,856 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 04:09:27,856 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 04:09:27,857 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 04:09:27,858 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 04:09:27,859 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 04:09:27,860 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 04:09:27,861 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 04:09:27,861 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 04:09:27,863 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 04:09:27,863 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 04:09:27,863 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 04:09:27,866 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 04:09:27,867 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 04:09:27,868 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-14 04:09:27,900 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 04:09:27,901 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 04:09:27,902 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 04:09:27,902 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 04:09:27,903 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 04:09:27,903 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 04:09:27,903 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 04:09:27,903 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 04:09:27,903 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 04:09:27,904 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 04:09:27,905 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 04:09:27,906 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 04:09:27,906 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 04:09:27,906 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 04:09:27,907 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 04:09:27,907 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 04:09:27,907 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 04:09:27,907 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 04:09:27,907 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 04:09:27,908 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 04:09:27,908 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 04:09:27,908 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 04:09:27,908 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 04:09:27,908 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 04:09:27,908 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 04:09:27,909 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 04:09:27,911 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 04:09:27,912 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 04:09:27,912 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 04:09:27,912 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 04:09:27,912 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 04:09:27,913 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 04:09:27,917 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 -> 4c150255f8a1e762fd9c62ae945d63ba0fb5878d [2019-01-14 04:09:27,985 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 04:09:28,000 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 04:09:28,006 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 04:09:28,008 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 04:09:28,008 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 04:09:28,009 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/email_spec3_product31_false-unreach-call_true-termination.cil.c [2019-01-14 04:09:28,072 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb834129a/94ac8c83f8ec4c3a936b0f9d0e987402/FLAGe9aa91d52 [2019-01-14 04:09:28,672 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 04:09:28,676 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/email_spec3_product31_false-unreach-call_true-termination.cil.c [2019-01-14 04:09:28,706 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb834129a/94ac8c83f8ec4c3a936b0f9d0e987402/FLAGe9aa91d52 [2019-01-14 04:09:28,877 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb834129a/94ac8c83f8ec4c3a936b0f9d0e987402 [2019-01-14 04:09:28,883 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 04:09:28,885 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 04:09:28,886 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 04:09:28,886 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 04:09:28,890 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 04:09:28,891 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:09:28" (1/1) ... [2019-01-14 04:09:28,895 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56746068 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:09:28, skipping insertion in model container [2019-01-14 04:09:28,895 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:09:28" (1/1) ... [2019-01-14 04:09:28,904 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 04:09:28,986 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 04:09:29,755 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:09:29,867 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 04:09:30,010 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:09:30,124 INFO L195 MainTranslator]: Completed translation [2019-01-14 04:09:30,125 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:09:30 WrapperNode [2019-01-14 04:09:30,125 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 04:09:30,126 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 04:09:30,126 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 04:09:30,126 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 04:09:30,135 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:09:30" (1/1) ... [2019-01-14 04:09:30,189 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:09:30" (1/1) ... [2019-01-14 04:09:30,321 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 04:09:30,323 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 04:09:30,323 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 04:09:30,323 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 04:09:30,335 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:09:30" (1/1) ... [2019-01-14 04:09:30,336 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:09:30" (1/1) ... [2019-01-14 04:09:30,356 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:09:30" (1/1) ... [2019-01-14 04:09:30,357 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:09:30" (1/1) ... [2019-01-14 04:09:30,425 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:09:30" (1/1) ... [2019-01-14 04:09:30,466 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:09:30" (1/1) ... [2019-01-14 04:09:30,476 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:09:30" (1/1) ... [2019-01-14 04:09:30,507 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 04:09:30,508 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 04:09:30,508 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 04:09:30,508 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 04:09:30,509 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:09:30" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:09:30,568 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-01-14 04:09:30,568 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 04:09:30,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-14 04:09:30,569 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 04:09:30,569 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 04:09:34,107 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 04:09:34,108 INFO L286 CfgBuilder]: Removed 395 assue(true) statements. [2019-01-14 04:09:34,110 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:09:34 BoogieIcfgContainer [2019-01-14 04:09:34,110 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 04:09:34,111 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 04:09:34,111 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 04:09:34,116 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 04:09:34,117 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:09:34,117 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 04:09:28" (1/3) ... [2019-01-14 04:09:34,119 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@659ddab9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:09:34, skipping insertion in model container [2019-01-14 04:09:34,119 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:09:34,119 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:09:30" (2/3) ... [2019-01-14 04:09:34,120 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@659ddab9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:09:34, skipping insertion in model container [2019-01-14 04:09:34,120 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:09:34,120 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:09:34" (3/3) ... [2019-01-14 04:09:34,123 INFO L375 chiAutomizerObserver]: Analyzing ICFG email_spec3_product31_false-unreach-call_true-termination.cil.c [2019-01-14 04:09:34,185 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 04:09:34,186 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 04:09:34,186 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 04:09:34,186 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 04:09:34,186 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 04:09:34,186 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 04:09:34,187 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 04:09:34,187 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 04:09:34,187 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 04:09:34,220 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 601 states. [2019-01-14 04:09:34,290 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 212 [2019-01-14 04:09:34,290 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:09:34,291 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:09:34,301 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:09:34,301 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-14 04:09:34,302 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 04:09:34,302 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 601 states. [2019-01-14 04:09:34,323 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 212 [2019-01-14 04:09:34,324 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:09:34,324 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:09:34,331 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:09:34,332 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-14 04:09:34,346 INFO L794 eck$LassoCheckResult]: Stem: 379#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~__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;~__SELECTED_FEATURE_Base~0 := 0;~__SELECTED_FEATURE_Keys~0 := 0;~__SELECTED_FEATURE_Encrypt~0 := 0;~__SELECTED_FEATURE_AutoResponder~0 := 0;~__SELECTED_FEATURE_AddressBook~0 := 0;~__SELECTED_FEATURE_Sign~0 := 0;~__SELECTED_FEATURE_Forward~0 := 0;~__SELECTED_FEATURE_Verify~0 := 0;~__SELECTED_FEATURE_Decrypt~0 := 0;~__GUIDSL_ROOT_PRODUCTION~0 := 0;~__GUIDSL_NON_TERMINAL_main~0 := 0;~bob~0 := 0;~rjh~0 := 0;~chuck~0 := 0;call #t~string2.base, #t~string2.offset := #Ultimate.allocOnStack(44);call #t~string7.base, #t~string7.offset := #Ultimate.allocOnStack(44);call #t~string9.base, #t~string9.offset := #Ultimate.allocOnStack(9);call #t~string11.base, #t~string11.offset := #Ultimate.allocOnStack(9);call #t~string13.base, #t~string13.offset := #Ultimate.allocOnStack(11);call #t~string17.base, #t~string17.offset := #Ultimate.allocOnStack(19);call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(4);call write~init~int(37, #t~string20.base, #t~string20.offset, 1);call write~init~int(100, #t~string20.base, 1 + #t~string20.offset, 1);call write~init~int(10, #t~string20.base, 2 + #t~string20.offset, 1);call write~init~int(0, #t~string20.base, 3 + #t~string20.offset, 1);call #t~string23.base, #t~string23.offset := #Ultimate.allocOnStack(4);call write~init~int(37, #t~string23.base, #t~string23.offset, 1);call write~init~int(100, #t~string23.base, 1 + #t~string23.offset, 1);call write~init~int(10, #t~string23.base, 2 + #t~string23.offset, 1);call write~init~int(0, #t~string23.base, 3 + #t~string23.offset, 1);~head~0.base, ~head~0.offset := 0, 0;call #t~string48.base, #t~string48.offset := #Ultimate.allocOnStack(30);call #t~string49.base, #t~string49.offset := #Ultimate.allocOnStack(9);call #t~string50.base, #t~string50.offset := #Ultimate.allocOnStack(21);call #t~string51.base, #t~string51.offset := #Ultimate.allocOnStack(30);call #t~string52.base, #t~string52.offset := #Ultimate.allocOnStack(9);call #t~string53.base, #t~string53.offset := #Ultimate.allocOnStack(21);call #t~string57.base, #t~string57.offset := #Ultimate.allocOnStack(30);call #t~string58.base, #t~string58.offset := #Ultimate.allocOnStack(9);call #t~string59.base, #t~string59.offset := #Ultimate.allocOnStack(25);call #t~string60.base, #t~string60.offset := #Ultimate.allocOnStack(30);call #t~string61.base, #t~string61.offset := #Ultimate.allocOnStack(9);call #t~string62.base, #t~string62.offset := #Ultimate.allocOnStack(25);~queue_empty~0 := 1;~queued_message~0 := 0;~queued_client~0 := 0;call #t~string77.base, #t~string77.offset := #Ultimate.allocOnStack(10);call #t~string83.base, #t~string83.offset := #Ultimate.allocOnStack(16);call #t~string92.base, #t~string92.offset := #Ultimate.allocOnStack(20);call #t~string95.base, #t~string95.offset := #Ultimate.allocOnStack(21);~sent_signed~0 := -1;call #t~string103.base, #t~string103.offset := #Ultimate.allocOnStack(13);call #t~string106.base, #t~string106.offset := #Ultimate.allocOnStack(16);call #t~string108.base, #t~string108.offset := #Ultimate.allocOnStack(15);call #t~string110.base, #t~string110.offset := #Ultimate.allocOnStack(16);~__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;call #t~string117.base, #t~string117.offset := #Ultimate.allocOnStack(10);call #t~string120.base, #t~string120.offset := #Ultimate.allocOnStack(12);call #t~string123.base, #t~string123.offset := #Ultimate.allocOnStack(10);call #t~string126.base, #t~string126.offset := #Ultimate.allocOnStack(18);call #t~string129.base, #t~string129.offset := #Ultimate.allocOnStack(16);call #t~string132.base, #t~string132.offset := #Ultimate.allocOnStack(21);call #t~string135.base, #t~string135.offset := #Ultimate.allocOnStack(13);call #t~string138.base, #t~string138.offset := #Ultimate.allocOnStack(16);call #t~string141.base, #t~string141.offset := #Ultimate.allocOnStack(25);call #t~string145.base, #t~string145.offset := #Ultimate.allocOnStack(4);call write~init~int(37, #t~string145.base, #t~string145.offset, 1);call write~init~int(115, #t~string145.base, 1 + #t~string145.offset, 1);call write~init~int(10, #t~string145.base, 2 + #t~string145.offset, 1);call write~init~int(0, #t~string145.base, 3 + #t~string145.offset, 1); 296#L-1true havoc main_#res;havoc main_#t~ret15, main_~retValue_acc~17, main_~tmp~3;havoc main_~retValue_acc~17;havoc main_~tmp~3; 540#L1814true havoc valid_product_#res;havoc valid_product_~retValue_acc~22;havoc valid_product_~retValue_acc~22;valid_product_~retValue_acc~22 := 1;valid_product_#res := valid_product_~retValue_acc~22; 128#L1822true main_#t~ret15 := valid_product_#res;main_~tmp~3 := main_#t~ret15;havoc main_#t~ret15; 65#L1292true assume 0 != main_~tmp~3;havoc setup_#t~nondet10, setup_#t~nondet12, setup_#t~nondet14, 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; 231#L1102true assume 1 == setClientId_~handle;~__ste_client_idCounter0~0 := setClientId_~value; 450#L1108-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; 486#L667true assume 1 == setClientPrivateKey_~handle;~__ste_client_privateKey0~0 := setClientPrivateKey_~value; 218#L673-2true setup_~__cil_tmp1~0.base, setup_~__cil_tmp1~0.offset := #t~string9.base, #t~string9.offset;havoc setup_#t~nondet10;~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; 234#L1102-2true assume 1 == setClientId_~handle;~__ste_client_idCounter0~0 := setClientId_~value; 457#L1108-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; 470#L667-2true assume 1 == setClientPrivateKey_~handle;~__ste_client_privateKey0~0 := setClientPrivateKey_~value; 193#L673-5true setup_~__cil_tmp2~0.base, setup_~__cil_tmp2~0.offset := #t~string11.base, #t~string11.offset;havoc setup_#t~nondet12;~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; 236#L1102-4true assume 1 == setClientId_~handle;~__ste_client_idCounter0~0 := setClientId_~value; 426#L1108-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; 475#L667-4true assume 1 == setClientPrivateKey_~handle;~__ste_client_privateKey0~0 := setClientPrivateKey_~value; 167#L673-8true setup_~__cil_tmp3~1.base, setup_~__cil_tmp3~1.offset := #t~string13.base, #t~string13.offset;havoc setup_#t~nondet14; 183#L1279true havoc test_#t~nondet66, test_#t~nondet67, test_#t~nondet68, test_#t~nondet69, test_#t~nondet70, test_#t~nondet71, test_#t~nondet72, test_#t~nondet73, test_#t~nondet74, test_#t~nondet75, test_#t~nondet76, 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~8, test_~tmp___0~2, test_~tmp___1~1, test_~tmp___2~0, test_~tmp___3~0, test_~tmp___4~0, test_~tmp___5~0, test_~tmp___6~0, test_~tmp___7~0, test_~tmp___8~0, test_~tmp___9~0;havoc test_~op1~0;havoc test_~op2~0;havoc test_~op3~0;havoc test_~op4~0;havoc test_~op5~0;havoc test_~op6~0;havoc test_~op7~0;havoc test_~op8~0;havoc test_~op9~0;havoc test_~op10~0;havoc test_~op11~0;havoc test_~splverifierCounter~0;havoc test_~tmp~8;havoc test_~tmp___0~2;havoc test_~tmp___1~1;havoc test_~tmp___2~0;havoc test_~tmp___3~0;havoc test_~tmp___4~0;havoc test_~tmp___5~0;havoc test_~tmp___6~0;havoc test_~tmp___7~0;havoc test_~tmp___8~0;havoc test_~tmp___9~0;test_~op1~0 := 0;test_~op2~0 := 0;test_~op3~0 := 0;test_~op4~0 := 0;test_~op5~0 := 0;test_~op6~0 := 0;test_~op7~0 := 0;test_~op8~0 := 0;test_~op9~0 := 0;test_~op10~0 := 0;test_~op11~0 := 0;test_~splverifierCounter~0 := 0; 491#L2021-1true [2019-01-14 04:09:34,354 INFO L796 eck$LassoCheckResult]: Loop: 491#L2021-1true assume !false; 21#L1876true assume test_~splverifierCounter~0 < 4; 147#L1877true test_~splverifierCounter~0 := 1 + test_~splverifierCounter~0; 367#L1883true assume !(0 == test_~op1~0); 284#L1896true assume 0 == test_~op2~0;test_~tmp___8~0 := test_#t~nondet67;havoc test_#t~nondet67; 423#L1901true assume 0 != test_~tmp___8~0;test_~op2~0 := 1; 491#L2021-1true [2019-01-14 04:09:34,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:09:34,365 INFO L82 PathProgramCache]: Analyzing trace with hash 1291925977, now seen corresponding path program 1 times [2019-01-14 04:09:34,368 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:09:34,369 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:09:34,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:09:34,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:09:34,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:09:34,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:09:34,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:09:34,767 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:09:34,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:09:34,770 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:09:34,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:09:34,771 INFO L82 PathProgramCache]: Analyzing trace with hash 590492675, now seen corresponding path program 1 times [2019-01-14 04:09:34,771 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:09:34,771 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:09:34,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:09:34,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:09:34,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:09:34,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:09:34,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:09:34,994 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-01-14 04:09:35,023 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:09:35,024 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:09:35,024 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:09:35,024 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:09:35,025 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 04:09:35,025 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:09:35,025 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:09:35,025 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:09:35,026 INFO L131 ssoRankerPreferences]: Filename of dumped script: email_spec3_product31_false-unreach-call_true-termination.cil.c_Iteration1_Loop [2019-01-14 04:09:35,026 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:09:35,026 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:09:35,052 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:09:35,132 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:09:35,221 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:09:35,304 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:09:35,479 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:09:35,480 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:09:35,485 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:09:35,486 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:09:35,513 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 04:09:35,513 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:09:35,525 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 04:09:35,542 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:09:35,542 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:09:35,543 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:09:35,543 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:09:35,543 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:09:35,543 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:09:35,543 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:09:35,543 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:09:35,543 INFO L131 ssoRankerPreferences]: Filename of dumped script: email_spec3_product31_false-unreach-call_true-termination.cil.c_Iteration1_Loop [2019-01-14 04:09:35,544 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:09:35,544 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:09:35,545 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:09:35,585 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:09:35,594 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:09:35,610 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:09:35,798 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:09:35,804 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:09:35,805 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:09:35,807 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:09:35,807 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:09:35,808 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:09:35,808 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:09:35,808 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:09:35,810 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:09:35,810 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:09:35,814 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:09:35,820 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 04:09:35,820 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-14 04:09:35,822 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:09:35,822 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 04:09:35,823 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:09:35,824 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_test_~op2~0) = -2*ULTIMATE.start_test_~op2~0 + 1 Supporting invariants [] [2019-01-14 04:09:35,825 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 04:09:35,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:09:36,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:09:36,107 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:09:36,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:09:36,156 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:09:36,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:09:36,319 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-14 04:09:36,321 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 601 states. Second operand 4 states. [2019-01-14 04:09:36,866 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 601 states.. Second operand 4 states. Result 2678 states and 4608 transitions. Complement of second has 7 states. [2019-01-14 04:09:36,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-14 04:09:36,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 04:09:36,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2634 transitions. [2019-01-14 04:09:36,875 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 2634 transitions. Stem has 18 letters. Loop has 6 letters. [2019-01-14 04:09:36,877 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:09:36,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 2634 transitions. Stem has 24 letters. Loop has 6 letters. [2019-01-14 04:09:36,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:09:36,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 2634 transitions. Stem has 18 letters. Loop has 12 letters. [2019-01-14 04:09:36,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:09:36,880 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2678 states and 4608 transitions. [2019-01-14 04:09:36,912 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 423 [2019-01-14 04:09:36,930 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2678 states to 879 states and 1596 transitions. [2019-01-14 04:09:36,932 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 454 [2019-01-14 04:09:36,934 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 455 [2019-01-14 04:09:36,936 INFO L73 IsDeterministic]: Start isDeterministic. Operand 879 states and 1596 transitions. [2019-01-14 04:09:36,936 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:09:36,936 INFO L706 BuchiCegarLoop]: Abstraction has 879 states and 1596 transitions. [2019-01-14 04:09:36,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states and 1596 transitions. [2019-01-14 04:09:36,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 456. [2019-01-14 04:09:36,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2019-01-14 04:09:37,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 825 transitions. [2019-01-14 04:09:37,003 INFO L729 BuchiCegarLoop]: Abstraction has 456 states and 825 transitions. [2019-01-14 04:09:37,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 04:09:37,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 04:09:37,009 INFO L87 Difference]: Start difference. First operand 456 states and 825 transitions. Second operand 3 states. [2019-01-14 04:09:37,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:09:37,122 INFO L93 Difference]: Finished difference Result 892 states and 1615 transitions. [2019-01-14 04:09:37,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 04:09:37,124 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 892 states and 1615 transitions. [2019-01-14 04:09:37,133 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 424 [2019-01-14 04:09:37,141 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 892 states to 892 states and 1615 transitions. [2019-01-14 04:09:37,142 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 466 [2019-01-14 04:09:37,143 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 466 [2019-01-14 04:09:37,143 INFO L73 IsDeterministic]: Start isDeterministic. Operand 892 states and 1615 transitions. [2019-01-14 04:09:37,153 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:09:37,154 INFO L706 BuchiCegarLoop]: Abstraction has 892 states and 1615 transitions. [2019-01-14 04:09:37,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 892 states and 1615 transitions. [2019-01-14 04:09:37,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 892 to 455. [2019-01-14 04:09:37,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 455 states. [2019-01-14 04:09:37,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 821 transitions. [2019-01-14 04:09:37,185 INFO L729 BuchiCegarLoop]: Abstraction has 455 states and 821 transitions. [2019-01-14 04:09:37,185 INFO L609 BuchiCegarLoop]: Abstraction has 455 states and 821 transitions. [2019-01-14 04:09:37,185 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 04:09:37,185 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 455 states and 821 transitions. [2019-01-14 04:09:37,189 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 212 [2019-01-14 04:09:37,189 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:09:37,189 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:09:37,191 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:09:37,191 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:09:37,191 INFO L794 eck$LassoCheckResult]: Stem: 5024#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~__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;~__SELECTED_FEATURE_Base~0 := 0;~__SELECTED_FEATURE_Keys~0 := 0;~__SELECTED_FEATURE_Encrypt~0 := 0;~__SELECTED_FEATURE_AutoResponder~0 := 0;~__SELECTED_FEATURE_AddressBook~0 := 0;~__SELECTED_FEATURE_Sign~0 := 0;~__SELECTED_FEATURE_Forward~0 := 0;~__SELECTED_FEATURE_Verify~0 := 0;~__SELECTED_FEATURE_Decrypt~0 := 0;~__GUIDSL_ROOT_PRODUCTION~0 := 0;~__GUIDSL_NON_TERMINAL_main~0 := 0;~bob~0 := 0;~rjh~0 := 0;~chuck~0 := 0;call #t~string2.base, #t~string2.offset := #Ultimate.allocOnStack(44);call #t~string7.base, #t~string7.offset := #Ultimate.allocOnStack(44);call #t~string9.base, #t~string9.offset := #Ultimate.allocOnStack(9);call #t~string11.base, #t~string11.offset := #Ultimate.allocOnStack(9);call #t~string13.base, #t~string13.offset := #Ultimate.allocOnStack(11);call #t~string17.base, #t~string17.offset := #Ultimate.allocOnStack(19);call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(4);call write~init~int(37, #t~string20.base, #t~string20.offset, 1);call write~init~int(100, #t~string20.base, 1 + #t~string20.offset, 1);call write~init~int(10, #t~string20.base, 2 + #t~string20.offset, 1);call write~init~int(0, #t~string20.base, 3 + #t~string20.offset, 1);call #t~string23.base, #t~string23.offset := #Ultimate.allocOnStack(4);call write~init~int(37, #t~string23.base, #t~string23.offset, 1);call write~init~int(100, #t~string23.base, 1 + #t~string23.offset, 1);call write~init~int(10, #t~string23.base, 2 + #t~string23.offset, 1);call write~init~int(0, #t~string23.base, 3 + #t~string23.offset, 1);~head~0.base, ~head~0.offset := 0, 0;call #t~string48.base, #t~string48.offset := #Ultimate.allocOnStack(30);call #t~string49.base, #t~string49.offset := #Ultimate.allocOnStack(9);call #t~string50.base, #t~string50.offset := #Ultimate.allocOnStack(21);call #t~string51.base, #t~string51.offset := #Ultimate.allocOnStack(30);call #t~string52.base, #t~string52.offset := #Ultimate.allocOnStack(9);call #t~string53.base, #t~string53.offset := #Ultimate.allocOnStack(21);call #t~string57.base, #t~string57.offset := #Ultimate.allocOnStack(30);call #t~string58.base, #t~string58.offset := #Ultimate.allocOnStack(9);call #t~string59.base, #t~string59.offset := #Ultimate.allocOnStack(25);call #t~string60.base, #t~string60.offset := #Ultimate.allocOnStack(30);call #t~string61.base, #t~string61.offset := #Ultimate.allocOnStack(9);call #t~string62.base, #t~string62.offset := #Ultimate.allocOnStack(25);~queue_empty~0 := 1;~queued_message~0 := 0;~queued_client~0 := 0;call #t~string77.base, #t~string77.offset := #Ultimate.allocOnStack(10);call #t~string83.base, #t~string83.offset := #Ultimate.allocOnStack(16);call #t~string92.base, #t~string92.offset := #Ultimate.allocOnStack(20);call #t~string95.base, #t~string95.offset := #Ultimate.allocOnStack(21);~sent_signed~0 := -1;call #t~string103.base, #t~string103.offset := #Ultimate.allocOnStack(13);call #t~string106.base, #t~string106.offset := #Ultimate.allocOnStack(16);call #t~string108.base, #t~string108.offset := #Ultimate.allocOnStack(15);call #t~string110.base, #t~string110.offset := #Ultimate.allocOnStack(16);~__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;call #t~string117.base, #t~string117.offset := #Ultimate.allocOnStack(10);call #t~string120.base, #t~string120.offset := #Ultimate.allocOnStack(12);call #t~string123.base, #t~string123.offset := #Ultimate.allocOnStack(10);call #t~string126.base, #t~string126.offset := #Ultimate.allocOnStack(18);call #t~string129.base, #t~string129.offset := #Ultimate.allocOnStack(16);call #t~string132.base, #t~string132.offset := #Ultimate.allocOnStack(21);call #t~string135.base, #t~string135.offset := #Ultimate.allocOnStack(13);call #t~string138.base, #t~string138.offset := #Ultimate.allocOnStack(16);call #t~string141.base, #t~string141.offset := #Ultimate.allocOnStack(25);call #t~string145.base, #t~string145.offset := #Ultimate.allocOnStack(4);call write~init~int(37, #t~string145.base, #t~string145.offset, 1);call write~init~int(115, #t~string145.base, 1 + #t~string145.offset, 1);call write~init~int(10, #t~string145.base, 2 + #t~string145.offset, 1);call write~init~int(0, #t~string145.base, 3 + #t~string145.offset, 1); 4768#L-1 havoc main_#res;havoc main_#t~ret15, main_~retValue_acc~17, main_~tmp~3;havoc main_~retValue_acc~17;havoc main_~tmp~3; 4769#L1814 havoc valid_product_#res;havoc valid_product_~retValue_acc~22;havoc valid_product_~retValue_acc~22;valid_product_~retValue_acc~22 := 1;valid_product_#res := valid_product_~retValue_acc~22; 5021#L1822 main_#t~ret15 := valid_product_#res;main_~tmp~3 := main_#t~ret15;havoc main_#t~ret15; 4927#L1292 assume 0 != main_~tmp~3;havoc setup_#t~nondet10, setup_#t~nondet12, setup_#t~nondet14, 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; 4928#L1102 assume 1 == setClientId_~handle;~__ste_client_idCounter0~0 := setClientId_~value; 4905#L1108-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; 5091#L667 assume 1 == setClientPrivateKey_~handle;~__ste_client_privateKey0~0 := setClientPrivateKey_~value; 4892#L673-2 setup_~__cil_tmp1~0.base, setup_~__cil_tmp1~0.offset := #t~string9.base, #t~string9.offset;havoc setup_#t~nondet10;~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; 5100#L1102-2 assume !(1 == setClientId_~handle); 4918#L1105-2 assume 2 == setClientId_~handle;~__ste_client_idCounter1~0 := setClientId_~value; 4919#L1108-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; 5093#L667-2 assume 1 == setClientPrivateKey_~handle;~__ste_client_privateKey0~0 := setClientPrivateKey_~value; 4908#L673-5 setup_~__cil_tmp2~0.base, setup_~__cil_tmp2~0.offset := #t~string11.base, #t~string11.offset;havoc setup_#t~nondet12;~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; 5092#L1102-4 assume 1 == setClientId_~handle;~__ste_client_idCounter0~0 := setClientId_~value; 4840#L1108-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; 5061#L667-4 assume 1 == setClientPrivateKey_~handle;~__ste_client_privateKey0~0 := setClientPrivateKey_~value; 4921#L673-8 setup_~__cil_tmp3~1.base, setup_~__cil_tmp3~1.offset := #t~string13.base, #t~string13.offset;havoc setup_#t~nondet14; 5047#L1279 havoc test_#t~nondet66, test_#t~nondet67, test_#t~nondet68, test_#t~nondet69, test_#t~nondet70, test_#t~nondet71, test_#t~nondet72, test_#t~nondet73, test_#t~nondet74, test_#t~nondet75, test_#t~nondet76, 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~8, test_~tmp___0~2, test_~tmp___1~1, test_~tmp___2~0, test_~tmp___3~0, test_~tmp___4~0, test_~tmp___5~0, test_~tmp___6~0, test_~tmp___7~0, test_~tmp___8~0, test_~tmp___9~0;havoc test_~op1~0;havoc test_~op2~0;havoc test_~op3~0;havoc test_~op4~0;havoc test_~op5~0;havoc test_~op6~0;havoc test_~op7~0;havoc test_~op8~0;havoc test_~op9~0;havoc test_~op10~0;havoc test_~op11~0;havoc test_~splverifierCounter~0;havoc test_~tmp~8;havoc test_~tmp___0~2;havoc test_~tmp___1~1;havoc test_~tmp___2~0;havoc test_~tmp___3~0;havoc test_~tmp___4~0;havoc test_~tmp___5~0;havoc test_~tmp___6~0;havoc test_~tmp___7~0;havoc test_~tmp___8~0;havoc test_~tmp___9~0;test_~op1~0 := 0;test_~op2~0 := 0;test_~op3~0 := 0;test_~op4~0 := 0;test_~op5~0 := 0;test_~op6~0 := 0;test_~op7~0 := 0;test_~op8~0 := 0;test_~op9~0 := 0;test_~op10~0 := 0;test_~op11~0 := 0;test_~splverifierCounter~0 := 0; 5084#L2021-1 assume !false; 4770#L1876 [2019-01-14 04:09:37,191 INFO L796 eck$LassoCheckResult]: Loop: 4770#L1876 assume test_~splverifierCounter~0 < 4; 4771#L1877 test_~splverifierCounter~0 := 1 + test_~splverifierCounter~0; 5011#L1883 assume !(0 == test_~op1~0); 4879#L1896 assume !(0 == test_~op2~0); 5053#L1907 assume 0 == test_~op3~0;test_~tmp___7~0 := test_#t~nondet68;havoc test_#t~nondet68; 5048#L1912 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; 5049#L667-6 assume 1 == setClientPrivateKey_~handle;~__ste_client_privateKey0~0 := setClientPrivateKey_~value; 4842#L673-11 test_~op3~0 := 1; 4821#L2021-1 assume !false; 4770#L1876 [2019-01-14 04:09:37,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:09:37,195 INFO L82 PathProgramCache]: Analyzing trace with hash -953559564, now seen corresponding path program 1 times [2019-01-14 04:09:37,195 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:09:37,195 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:09:37,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:09:37,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:09:37,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:09:37,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:09:37,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:09:37,418 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:09:37,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 04:09:37,419 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:09:37,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:09:37,419 INFO L82 PathProgramCache]: Analyzing trace with hash -1296812605, now seen corresponding path program 1 times [2019-01-14 04:09:37,419 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:09:37,420 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:09:37,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:09:37,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:09:37,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:09:37,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:09:37,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:09:37,554 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2019-01-14 04:09:37,610 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:09:37,611 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:09:37,611 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:09:37,611 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:09:37,611 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 04:09:37,611 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:09:37,612 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:09:37,612 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:09:37,612 INFO L131 ssoRankerPreferences]: Filename of dumped script: email_spec3_product31_false-unreach-call_true-termination.cil.c_Iteration2_Loop [2019-01-14 04:09:37,612 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:09:37,613 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:09:37,615 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:09:37,625 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:09:37,634 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:09:37,636 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:09:37,644 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:09:37,648 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:09:37,655 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:09:37,850 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:09:37,850 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:09:37,855 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:09:37,855 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:09:37,861 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:09:37,862 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_test_#t~nondet68=7, ULTIMATE.start_test_~tmp___7~0=7} Honda state: {ULTIMATE.start_test_#t~nondet68=7, ULTIMATE.start_test_~tmp___7~0=7} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:09:37,894 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:09:37,895 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-14 04:09:37,953 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 04:09:37,953 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:09:38,003 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 04:09:38,006 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:09:38,006 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:09:38,007 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:09:38,007 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:09:38,007 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:09:38,007 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:09:38,007 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:09:38,008 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:09:38,009 INFO L131 ssoRankerPreferences]: Filename of dumped script: email_spec3_product31_false-unreach-call_true-termination.cil.c_Iteration2_Loop [2019-01-14 04:09:38,009 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:09:38,009 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:09:38,018 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:09:38,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:09:38,166 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:09:38,169 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:09:38,178 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:09:38,181 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:09:38,189 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:09:38,647 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:09:38,647 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:09:38,647 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:09:38,648 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:09:38,648 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:09:38,649 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:09:38,649 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 04:09:38,649 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:09:38,653 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:09:38,653 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:09:38,658 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:09:38,659 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:09:38,659 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:09:38,659 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:09:38,660 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:09:38,660 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:09:38,660 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:09:38,661 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:09:38,663 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:09:38,667 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:09:38,671 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 04:09:38,671 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-14 04:09:38,672 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:09:38,672 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 04:09:38,672 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:09:38,673 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_test_~splverifierCounter~0) = -2*ULTIMATE.start_test_~splverifierCounter~0 + 7 Supporting invariants [] [2019-01-14 04:09:38,673 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 04:09:38,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:09:39,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:09:39,012 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:09:39,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:09:39,054 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:09:39,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:09:39,405 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-01-14 04:09:39,406 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 455 states and 821 transitions. cyclomatic complexity: 368 Second operand 4 states. [2019-01-14 04:09:39,495 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 455 states and 821 transitions. cyclomatic complexity: 368. Second operand 4 states. Result 883 states and 1601 transitions. Complement of second has 6 states. [2019-01-14 04:09:39,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-14 04:09:39,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 04:09:39,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 433 transitions. [2019-01-14 04:09:39,498 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 433 transitions. Stem has 20 letters. Loop has 9 letters. [2019-01-14 04:09:39,499 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:09:39,500 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 433 transitions. Stem has 29 letters. Loop has 9 letters. [2019-01-14 04:09:39,500 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:09:39,500 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 433 transitions. Stem has 20 letters. Loop has 18 letters. [2019-01-14 04:09:39,501 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:09:39,504 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 883 states and 1601 transitions. [2019-01-14 04:09:39,512 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 04:09:39,512 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 883 states to 0 states and 0 transitions. [2019-01-14 04:09:39,513 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 04:09:39,513 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 04:09:39,513 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 04:09:39,513 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:09:39,513 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:09:39,513 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:09:39,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 04:09:39,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 04:09:39,516 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 5 states. [2019-01-14 04:09:39,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:09:39,516 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-01-14 04:09:39,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-14 04:09:39,516 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2019-01-14 04:09:39,518 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 04:09:39,519 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2019-01-14 04:09:39,519 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 04:09:39,519 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 04:09:39,519 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 04:09:39,519 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:09:39,519 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:09:39,519 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:09:39,519 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:09:39,519 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 04:09:39,520 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 04:09:39,522 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 04:09:39,522 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 04:09:39,530 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 04:09:39 BoogieIcfgContainer [2019-01-14 04:09:39,530 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 04:09:39,531 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 04:09:39,531 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 04:09:39,532 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 04:09:39,532 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:09:34" (3/4) ... [2019-01-14 04:09:39,538 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 04:09:39,538 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 04:09:39,539 INFO L168 Benchmark]: Toolchain (without parser) took 10655.44 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 194.0 MB). Free memory was 948.7 MB in the beginning and 837.6 MB in the end (delta: 111.1 MB). Peak memory consumption was 305.1 MB. Max. memory is 11.5 GB. [2019-01-14 04:09:39,542 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:09:39,543 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1239.37 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 86.5 MB). Free memory was 948.7 MB in the beginning and 1.0 GB in the end (delta: -95.4 MB). Peak memory consumption was 52.4 MB. Max. memory is 11.5 GB. [2019-01-14 04:09:39,546 INFO L168 Benchmark]: Boogie Procedure Inliner took 196.79 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-01-14 04:09:39,547 INFO L168 Benchmark]: Boogie Preprocessor took 184.48 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-01-14 04:09:39,548 INFO L168 Benchmark]: RCFGBuilder took 3602.25 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 774.4 MB in the end (delta: 249.0 MB). Peak memory consumption was 249.0 MB. Max. memory is 11.5 GB. [2019-01-14 04:09:39,550 INFO L168 Benchmark]: BuchiAutomizer took 5419.56 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 107.5 MB). Free memory was 774.4 MB in the beginning and 837.6 MB in the end (delta: -63.2 MB). Peak memory consumption was 44.3 MB. Max. memory is 11.5 GB. [2019-01-14 04:09:39,552 INFO L168 Benchmark]: Witness Printer took 7.43 ms. Allocated memory is still 1.2 GB. Free memory is still 837.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:09:39,559 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1239.37 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 86.5 MB). Free memory was 948.7 MB in the beginning and 1.0 GB in the end (delta: -95.4 MB). Peak memory consumption was 52.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 196.79 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 184.48 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 3602.25 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 774.4 MB in the end (delta: 249.0 MB). Peak memory consumption was 249.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5419.56 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 107.5 MB). Free memory was 774.4 MB in the beginning and 837.6 MB in the end (delta: -63.2 MB). Peak memory consumption was 44.3 MB. Max. memory is 11.5 GB. * Witness Printer took 7.43 ms. Allocated memory is still 1.2 GB. Free memory is still 837.6 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 5.3s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 3.0s. Construction of modules took 0.2s. Büchi inclusion checks took 1.7s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 860 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 455 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 3279 SDtfs, 2860 SDslu, 4121 SDs, 0 SdLazy, 26 SolverSat, 7 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT2 lasso0 LassoPreprocessingBenchmarks: Lassos: inital38 mio100 ax100 hnf100 lsp29 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq189 hnf90 smp100 dnf134 smp100 tf108 neg92 sie116 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 10ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 4 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 1 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...