./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/product-lines/email_spec6_product16_false-unreach-call_true-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/product-lines/email_spec6_product16_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 51a0f12650c08bf2f0cd35f3935c25c9b265d220 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 23:28:54,730 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 23:28:54,732 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 23:28:54,744 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 23:28:54,745 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 23:28:54,746 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 23:28:54,748 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 23:28:54,749 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 23:28:54,751 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 23:28:54,752 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 23:28:54,753 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 23:28:54,754 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 23:28:54,755 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 23:28:54,756 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 23:28:54,757 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 23:28:54,758 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 23:28:54,759 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 23:28:54,761 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 23:28:54,763 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 23:28:54,765 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 23:28:54,766 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 23:28:54,767 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 23:28:54,770 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 23:28:54,770 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 23:28:54,771 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 23:28:54,772 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 23:28:54,773 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 23:28:54,774 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 23:28:54,775 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 23:28:54,776 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 23:28:54,777 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 23:28:54,777 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 23:28:54,778 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 23:28:54,778 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 23:28:54,779 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 23:28:54,780 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 23:28:54,780 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-01 23:28:54,798 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 23:28:54,798 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 23:28:54,799 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 23:28:54,800 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 23:28:54,800 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 23:28:54,800 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 23:28:54,801 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 23:28:54,801 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 23:28:54,801 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 23:28:54,801 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 23:28:54,801 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 23:28:54,802 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 23:28:54,802 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 23:28:54,802 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 23:28:54,802 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 23:28:54,802 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 23:28:54,802 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 23:28:54,804 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 23:28:54,804 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 23:28:54,804 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 23:28:54,805 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 23:28:54,805 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 23:28:54,805 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 23:28:54,805 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 23:28:54,805 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 23:28:54,806 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 23:28:54,807 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 23:28:54,807 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 23:28:54,807 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 23:28:54,807 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 23:28:54,807 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 23:28:54,808 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 23:28:54,809 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 -> 51a0f12650c08bf2f0cd35f3935c25c9b265d220 [2019-01-01 23:28:54,845 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 23:28:54,858 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 23:28:54,862 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 23:28:54,864 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 23:28:54,864 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 23:28:54,865 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/email_spec6_product16_false-unreach-call_true-termination.cil.c [2019-01-01 23:28:54,929 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da371878f/dfcb5856a92a4333bd6108e40ae97ed6/FLAGbccf87831 [2019-01-01 23:28:55,563 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 23:28:55,564 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/email_spec6_product16_false-unreach-call_true-termination.cil.c [2019-01-01 23:28:55,591 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da371878f/dfcb5856a92a4333bd6108e40ae97ed6/FLAGbccf87831 [2019-01-01 23:28:55,767 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da371878f/dfcb5856a92a4333bd6108e40ae97ed6 [2019-01-01 23:28:55,770 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 23:28:55,771 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 23:28:55,772 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 23:28:55,772 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 23:28:55,776 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 23:28:55,777 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 11:28:55" (1/1) ... [2019-01-01 23:28:55,782 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12cef936 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:28:55, skipping insertion in model container [2019-01-01 23:28:55,782 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 11:28:55" (1/1) ... [2019-01-01 23:28:55,791 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 23:28:55,868 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 23:28:56,598 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 23:28:56,632 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 23:28:56,863 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 23:28:56,952 INFO L195 MainTranslator]: Completed translation [2019-01-01 23:28:56,952 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:28:56 WrapperNode [2019-01-01 23:28:56,952 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 23:28:56,954 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 23:28:56,954 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 23:28:56,954 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 23:28:56,964 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:28:56" (1/1) ... [2019-01-01 23:28:57,003 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:28:56" (1/1) ... [2019-01-01 23:28:57,119 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 23:28:57,120 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 23:28:57,120 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 23:28:57,120 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 23:28:57,132 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:28:56" (1/1) ... [2019-01-01 23:28:57,132 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:28:56" (1/1) ... [2019-01-01 23:28:57,141 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:28:56" (1/1) ... [2019-01-01 23:28:57,141 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:28:56" (1/1) ... [2019-01-01 23:28:57,176 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:28:56" (1/1) ... [2019-01-01 23:28:57,210 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:28:56" (1/1) ... [2019-01-01 23:28:57,227 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:28:56" (1/1) ... [2019-01-01 23:28:57,240 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 23:28:57,241 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 23:28:57,241 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 23:28:57,241 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 23:28:57,243 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:28:56" (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-01 23:28:57,315 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-01-01 23:28:57,315 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 23:28:57,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-01 23:28:57,315 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 23:28:57,316 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 23:29:00,931 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 23:29:00,931 INFO L280 CfgBuilder]: Removed 303 assue(true) statements. [2019-01-01 23:29:00,932 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:29:00 BoogieIcfgContainer [2019-01-01 23:29:00,932 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 23:29:00,932 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 23:29:00,933 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 23:29:00,938 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 23:29:00,939 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:29:00,939 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 11:28:55" (1/3) ... [2019-01-01 23:29:00,941 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2cc11d56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 11:29:00, skipping insertion in model container [2019-01-01 23:29:00,941 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:29:00,941 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:28:56" (2/3) ... [2019-01-01 23:29:00,942 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2cc11d56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 11:29:00, skipping insertion in model container [2019-01-01 23:29:00,942 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:29:00,942 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:29:00" (3/3) ... [2019-01-01 23:29:00,945 INFO L375 chiAutomizerObserver]: Analyzing ICFG email_spec6_product16_false-unreach-call_true-termination.cil.c [2019-01-01 23:29:01,009 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 23:29:01,009 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 23:29:01,009 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 23:29:01,010 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 23:29:01,010 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 23:29:01,010 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 23:29:01,010 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 23:29:01,010 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 23:29:01,010 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 23:29:01,049 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 463 states. [2019-01-01 23:29:01,106 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 212 [2019-01-01 23:29:01,106 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:29:01,107 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:29:01,118 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:29:01,118 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-01 23:29:01,119 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 23:29:01,119 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 463 states. [2019-01-01 23:29:01,136 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 212 [2019-01-01 23:29:01,137 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:29:01,137 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:29:01,139 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:29:01,139 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-01 23:29:01,147 INFO L794 eck$LassoCheckResult]: Stem: 266#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~__SELECTED_FEATURE_Base~0 := 0;~__SELECTED_FEATURE_Keys~0 := 0;~__SELECTED_FEATURE_Encrypt~0 := 0;~__SELECTED_FEATURE_AutoResponder~0 := 0;~__SELECTED_FEATURE_AddressBook~0 := 0;~__SELECTED_FEATURE_Sign~0 := 0;~__SELECTED_FEATURE_Forward~0 := 0;~__SELECTED_FEATURE_Verify~0 := 0;~__SELECTED_FEATURE_Decrypt~0 := 0;~__GUIDSL_ROOT_PRODUCTION~0 := 0;~__GUIDSL_NON_TERMINAL_main~0 := 0;~bob~0 := 0;~rjh~0 := 0;~chuck~0 := 0;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(44);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(44);call #t~string7.base, #t~string7.offset := #Ultimate.allocOnStack(9);call #t~string9.base, #t~string9.offset := #Ultimate.allocOnStack(9);call #t~string11.base, #t~string11.offset := #Ultimate.allocOnStack(11);call #t~string15.base, #t~string15.offset := #Ultimate.allocOnStack(19);call #t~string18.base, #t~string18.offset := #Ultimate.allocOnStack(4);call write~init~int(37, #t~string18.base, #t~string18.offset, 1);call write~init~int(100, #t~string18.base, 1 + #t~string18.offset, 1);call write~init~int(10, #t~string18.base, 2 + #t~string18.offset, 1);call write~init~int(0, #t~string18.base, 3 + #t~string18.offset, 1);call #t~string21.base, #t~string21.offset := #Ultimate.allocOnStack(4);call write~init~int(37, #t~string21.base, #t~string21.offset, 1);call write~init~int(100, #t~string21.base, 1 + #t~string21.offset, 1);call write~init~int(10, #t~string21.base, 2 + #t~string21.offset, 1);call write~init~int(0, #t~string21.base, 3 + #t~string21.offset, 1);~__ste_Client_counter~0 := 0;~__ste_client_name0~0.base, ~__ste_client_name0~0.offset := 0, 0;~__ste_client_name1~0.base, ~__ste_client_name1~0.offset := 0, 0;~__ste_client_name2~0.base, ~__ste_client_name2~0.offset := 0, 0;~__ste_client_outbuffer0~0 := 0;~__ste_client_outbuffer1~0 := 0;~__ste_client_outbuffer2~0 := 0;~__ste_client_outbuffer3~0 := 0;~__ste_ClientAddressBook_size0~0 := 0;~__ste_ClientAddressBook_size1~0 := 0;~__ste_ClientAddressBook_size2~0 := 0;~__ste_Client_AddressBook0_Alias0~0 := 0;~__ste_Client_AddressBook0_Alias1~0 := 0;~__ste_Client_AddressBook0_Alias2~0 := 0;~__ste_Client_AddressBook1_Alias0~0 := 0;~__ste_Client_AddressBook1_Alias1~0 := 0;~__ste_Client_AddressBook1_Alias2~0 := 0;~__ste_Client_AddressBook2_Alias0~0 := 0;~__ste_Client_AddressBook2_Alias1~0 := 0;~__ste_Client_AddressBook2_Alias2~0 := 0;~__ste_Client_AddressBook0_Address0~0 := 0;~__ste_Client_AddressBook0_Address1~0 := 0;~__ste_Client_AddressBook0_Address2~0 := 0;~__ste_Client_AddressBook1_Address0~0 := 0;~__ste_Client_AddressBook1_Address1~0 := 0;~__ste_Client_AddressBook1_Address2~0 := 0;~__ste_Client_AddressBook2_Address0~0 := 0;~__ste_Client_AddressBook2_Address1~0 := 0;~__ste_Client_AddressBook2_Address2~0 := 0;~__ste_client_autoResponse0~0 := 0;~__ste_client_autoResponse1~0 := 0;~__ste_client_autoResponse2~0 := 0;~__ste_client_privateKey0~0 := 0;~__ste_client_privateKey1~0 := 0;~__ste_client_privateKey2~0 := 0;~__ste_ClientKeyring_size0~0 := 0;~__ste_ClientKeyring_size1~0 := 0;~__ste_ClientKeyring_size2~0 := 0;~__ste_Client_Keyring0_User0~0 := 0;~__ste_Client_Keyring0_User1~0 := 0;~__ste_Client_Keyring0_User2~0 := 0;~__ste_Client_Keyring1_User0~0 := 0;~__ste_Client_Keyring1_User1~0 := 0;~__ste_Client_Keyring1_User2~0 := 0;~__ste_Client_Keyring2_User0~0 := 0;~__ste_Client_Keyring2_User1~0 := 0;~__ste_Client_Keyring2_User2~0 := 0;~__ste_Client_Keyring0_PublicKey0~0 := 0;~__ste_Client_Keyring0_PublicKey1~0 := 0;~__ste_Client_Keyring0_PublicKey2~0 := 0;~__ste_Client_Keyring1_PublicKey0~0 := 0;~__ste_Client_Keyring1_PublicKey1~0 := 0;~__ste_Client_Keyring1_PublicKey2~0 := 0;~__ste_Client_Keyring2_PublicKey0~0 := 0;~__ste_Client_Keyring2_PublicKey1~0 := 0;~__ste_Client_Keyring2_PublicKey2~0 := 0;~__ste_client_forwardReceiver0~0 := 0;~__ste_client_forwardReceiver1~0 := 0;~__ste_client_forwardReceiver2~0 := 0;~__ste_client_forwardReceiver3~0 := 0;~__ste_client_idCounter0~0 := 0;~__ste_client_idCounter1~0 := 0;~__ste_client_idCounter2~0 := 0;~__ste_Email_counter~0 := 0;~__ste_email_id0~0 := 0;~__ste_email_id1~0 := 0;~__ste_email_from0~0 := 0;~__ste_email_from1~0 := 0;~__ste_email_to0~0 := 0;~__ste_email_to1~0 := 0;~__ste_email_subject0~0.base, ~__ste_email_subject0~0.offset := 0, 0;~__ste_email_subject1~0.base, ~__ste_email_subject1~0.offset := 0, 0;~__ste_email_body0~0.base, ~__ste_email_body0~0.offset := 0, 0;~__ste_email_body1~0.base, ~__ste_email_body1~0.offset := 0, 0;~__ste_email_isEncrypted0~0 := 0;~__ste_email_isEncrypted1~0 := 0;~__ste_email_encryptionKey0~0 := 0;~__ste_email_encryptionKey1~0 := 0;~__ste_email_isSigned0~0 := 0;~__ste_email_isSigned1~0 := 0;~__ste_email_signKey0~0 := 0;~__ste_email_signKey1~0 := 0;~__ste_email_isSignatureVerified0~0 := 0;~__ste_email_isSignatureVerified1~0 := 0;~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);call #t~string78.base, #t~string78.offset := #Ultimate.allocOnStack(10);call #t~string81.base, #t~string81.offset := #Ultimate.allocOnStack(12);call #t~string84.base, #t~string84.offset := #Ultimate.allocOnStack(10);call #t~string87.base, #t~string87.offset := #Ultimate.allocOnStack(18);call #t~string90.base, #t~string90.offset := #Ultimate.allocOnStack(16);call #t~string93.base, #t~string93.offset := #Ultimate.allocOnStack(21);call #t~string97.base, #t~string97.offset := #Ultimate.allocOnStack(4);call write~init~int(37, #t~string97.base, #t~string97.offset, 1);call write~init~int(115, #t~string97.base, 1 + #t~string97.offset, 1);call write~init~int(10, #t~string97.base, 2 + #t~string97.offset, 1);call write~init~int(0, #t~string97.base, 3 + #t~string97.offset, 1);~sent_encrypted~0 := -1;call #t~string99.base, #t~string99.offset := #Ultimate.allocOnStack(13);call #t~string102.base, #t~string102.offset := #Ultimate.allocOnStack(19);call #t~string104.base, #t~string104.offset := #Ultimate.allocOnStack(16);call #t~string106.base, #t~string106.offset := #Ultimate.allocOnStack(19);~queue_empty~0 := 1;~queued_message~0 := 0;~queued_client~0 := 0;call #t~string111.base, #t~string111.offset := #Ultimate.allocOnStack(10);call #t~string117.base, #t~string117.offset := #Ultimate.allocOnStack(16);call #t~string126.base, #t~string126.offset := #Ultimate.allocOnStack(20);call #t~string128.base, #t~string128.offset := #Ultimate.allocOnStack(21); 209#L-1true havoc main_#res;havoc main_#t~ret13, main_~retValue_acc~0, main_~tmp~1;havoc main_~retValue_acc~0;havoc main_~tmp~1; 269#L2235true havoc valid_product_#res;havoc valid_product_~retValue_acc~33;havoc valid_product_~retValue_acc~33;valid_product_~retValue_acc~33 := 1;valid_product_#res := valid_product_~retValue_acc~33; 452#L2243true main_#t~ret13 := valid_product_#res;main_~tmp~1 := main_#t~ret13;havoc main_#t~ret13; 260#L220true assume 0 != main_~tmp~1;havoc setup_#t~nondet8, setup_#t~nondet10, setup_#t~nondet12, setup_~__cil_tmp1~0.base, setup_~__cil_tmp1~0.offset, setup_~__cil_tmp2~0.base, setup_~__cil_tmp2~0.offset, setup_~__cil_tmp3~0.base, setup_~__cil_tmp3~0.offset;havoc setup_~__cil_tmp1~0.base, setup_~__cil_tmp1~0.offset;havoc setup_~__cil_tmp2~0.base, setup_~__cil_tmp2~0.offset;havoc setup_~__cil_tmp3~0.base, setup_~__cil_tmp3~0.offset;~bob~0 := 1;setup_bob_#in~bob___0 := ~bob~0;havoc setup_bob_~bob___0;setup_bob_~bob___0 := setup_bob_#in~bob___0;setup_bob__wrappee__Base_#in~bob___0 := setup_bob_~bob___0;havoc setup_bob__wrappee__Base_~bob___0;setup_bob__wrappee__Base_~bob___0 := setup_bob__wrappee__Base_#in~bob___0;setClientId_#in~handle, setClientId_#in~value := setup_bob__wrappee__Base_~bob___0, setup_bob__wrappee__Base_~bob___0;havoc setClientId_~handle, setClientId_~value;setClientId_~handle := setClientId_#in~handle;setClientId_~value := setClientId_#in~value; 281#L1409true assume 1 == setClientId_~handle;~__ste_client_idCounter0~0 := setClientId_~value; 64#L1415-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; 82#L974true assume 1 == setClientPrivateKey_~handle;~__ste_client_privateKey0~0 := setClientPrivateKey_~value; 252#L980-2true setup_~__cil_tmp1~0.base, setup_~__cil_tmp1~0.offset := #t~string7.base, #t~string7.offset;havoc setup_#t~nondet8;~rjh~0 := 2;setup_rjh_#in~rjh___0 := ~rjh~0;havoc setup_rjh_~rjh___0;setup_rjh_~rjh___0 := setup_rjh_#in~rjh___0;setup_rjh__wrappee__Base_#in~rjh___0 := setup_rjh_~rjh___0;havoc setup_rjh__wrappee__Base_~rjh___0;setup_rjh__wrappee__Base_~rjh___0 := setup_rjh__wrappee__Base_#in~rjh___0;setClientId_#in~handle, setClientId_#in~value := setup_rjh__wrappee__Base_~rjh___0, setup_rjh__wrappee__Base_~rjh___0;havoc setClientId_~handle, setClientId_~value;setClientId_~handle := setClientId_#in~handle;setClientId_~value := setClientId_#in~value; 289#L1409-2true assume 1 == setClientId_~handle;~__ste_client_idCounter0~0 := setClientId_~value; 46#L1415-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; 85#L974-2true assume 1 == setClientPrivateKey_~handle;~__ste_client_privateKey0~0 := setClientPrivateKey_~value; 257#L980-5true setup_~__cil_tmp2~0.base, setup_~__cil_tmp2~0.offset := #t~string9.base, #t~string9.offset;havoc setup_#t~nondet10;~chuck~0 := 3;setup_chuck_#in~chuck___0 := ~chuck~0;havoc setup_chuck_~chuck___0;setup_chuck_~chuck___0 := setup_chuck_#in~chuck___0;setup_chuck__wrappee__Base_#in~chuck___0 := setup_chuck_~chuck___0;havoc setup_chuck__wrappee__Base_~chuck___0;setup_chuck__wrappee__Base_~chuck___0 := setup_chuck__wrappee__Base_#in~chuck___0;setClientId_#in~handle, setClientId_#in~value := setup_chuck__wrappee__Base_~chuck___0, setup_chuck__wrappee__Base_~chuck___0;havoc setClientId_~handle, setClientId_~value;setClientId_~handle := setClientId_#in~handle;setClientId_~value := setClientId_#in~value; 267#L1409-4true assume 1 == setClientId_~handle;~__ste_client_idCounter0~0 := setClientId_~value; 53#L1415-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; 88#L974-4true assume 1 == setClientPrivateKey_~handle;~__ste_client_privateKey0~0 := setClientPrivateKey_~value; 244#L980-8true setup_~__cil_tmp3~0.base, setup_~__cil_tmp3~0.offset := #t~string11.base, #t~string11.offset;havoc setup_#t~nondet12; 231#L207true 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; 291#L2433-1true [2019-01-01 23:29:01,148 INFO L796 eck$LassoCheckResult]: Loop: 291#L2433-1true assume !false; 240#L2288true assume test_~splverifierCounter~0 < 4; 215#L2289true test_~splverifierCounter~0 := 1 + test_~splverifierCounter~0; 90#L2295true assume !(0 == test_~op1~0); 347#L2308true assume 0 == test_~op2~0;test_~tmp___8~0 := test_#t~nondet67;havoc test_#t~nondet67; 132#L2313true assume 0 != test_~tmp___8~0;test_~op2~0 := 1; 291#L2433-1true [2019-01-01 23:29:01,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:29:01,160 INFO L82 PathProgramCache]: Analyzing trace with hash 1291925977, now seen corresponding path program 1 times [2019-01-01 23:29:01,164 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:29:01,164 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:29:01,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:29:01,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:29:01,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:29:01,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:29:01,511 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-01 23:29:01,513 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:29:01,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 23:29:01,518 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 23:29:01,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:29:01,518 INFO L82 PathProgramCache]: Analyzing trace with hash 590492675, now seen corresponding path program 1 times [2019-01-01 23:29:01,519 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:29:01,519 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:29:01,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:29:01,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:29:01,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:29:01,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:29:01,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:29:01,774 WARN L181 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-01-01 23:29:01,832 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:29:01,833 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:29:01,833 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:29:01,833 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:29:01,834 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 23:29:01,834 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:29:01,834 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:29:01,834 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:29:01,834 INFO L131 ssoRankerPreferences]: Filename of dumped script: email_spec6_product16_false-unreach-call_true-termination.cil.c_Iteration1_Loop [2019-01-01 23:29:01,835 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:29:01,836 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:29:01,862 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-01 23:29:01,955 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-01 23:29:01,984 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-01 23:29:02,001 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-01 23:29:02,225 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-01-01 23:29:02,238 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:29:02,238 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-01 23:29:02,252 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:29:02,252 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-01 23:29:02,294 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 23:29:02,294 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:29:02,313 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 23:29:02,334 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:29:02,335 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:29:02,335 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:29:02,335 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:29:02,335 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 23:29:02,335 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:29:02,335 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:29:02,336 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:29:02,336 INFO L131 ssoRankerPreferences]: Filename of dumped script: email_spec6_product16_false-unreach-call_true-termination.cil.c_Iteration1_Loop [2019-01-01 23:29:02,336 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:29:02,336 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:29:02,338 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-01 23:29:02,355 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-01 23:29:02,365 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-01 23:29:02,375 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-01 23:29:02,517 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:29:02,524 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 23:29:02,526 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-01 23:29:02,528 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:29:02,529 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:29:02,529 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:29:02,529 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:29:02,530 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:29:02,532 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:29:02,533 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:29:02,538 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 23:29:02,544 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 23:29:02,544 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-01 23:29:02,549 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 23:29:02,550 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 23:29:02,551 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 23:29:02,552 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-01 23:29:02,553 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 23:29:02,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:29:02,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:29:02,823 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:29:02,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:29:02,886 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:29:02,984 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-01 23:29:03,000 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-01 23:29:03,001 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 463 states. Second operand 4 states. [2019-01-01 23:29:03,344 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 463 states.. Second operand 4 states. Result 1988 states and 3432 transitions. Complement of second has 7 states. [2019-01-01 23:29:03,346 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-01 23:29:03,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 23:29:03,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1926 transitions. [2019-01-01 23:29:03,354 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 1926 transitions. Stem has 18 letters. Loop has 6 letters. [2019-01-01 23:29:03,356 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:29:03,356 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 1926 transitions. Stem has 24 letters. Loop has 6 letters. [2019-01-01 23:29:03,356 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:29:03,357 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 1926 transitions. Stem has 18 letters. Loop has 12 letters. [2019-01-01 23:29:03,357 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:29:03,359 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1988 states and 3432 transitions. [2019-01-01 23:29:03,385 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 423 [2019-01-01 23:29:03,402 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1988 states to 879 states and 1596 transitions. [2019-01-01 23:29:03,404 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 454 [2019-01-01 23:29:03,406 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 455 [2019-01-01 23:29:03,407 INFO L73 IsDeterministic]: Start isDeterministic. Operand 879 states and 1596 transitions. [2019-01-01 23:29:03,408 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:29:03,408 INFO L705 BuchiCegarLoop]: Abstraction has 879 states and 1596 transitions. [2019-01-01 23:29:03,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states and 1596 transitions. [2019-01-01 23:29:03,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 456. [2019-01-01 23:29:03,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2019-01-01 23:29:03,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 825 transitions. [2019-01-01 23:29:03,472 INFO L728 BuchiCegarLoop]: Abstraction has 456 states and 825 transitions. [2019-01-01 23:29:03,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 23:29:03,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 23:29:03,478 INFO L87 Difference]: Start difference. First operand 456 states and 825 transitions. Second operand 3 states. [2019-01-01 23:29:03,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:29:03,681 INFO L93 Difference]: Finished difference Result 892 states and 1615 transitions. [2019-01-01 23:29:03,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 23:29:03,684 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 892 states and 1615 transitions. [2019-01-01 23:29:03,692 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 424 [2019-01-01 23:29:03,701 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 892 states to 892 states and 1615 transitions. [2019-01-01 23:29:03,701 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 466 [2019-01-01 23:29:03,702 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 466 [2019-01-01 23:29:03,704 INFO L73 IsDeterministic]: Start isDeterministic. Operand 892 states and 1615 transitions. [2019-01-01 23:29:03,704 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:29:03,704 INFO L705 BuchiCegarLoop]: Abstraction has 892 states and 1615 transitions. [2019-01-01 23:29:03,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 892 states and 1615 transitions. [2019-01-01 23:29:03,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 892 to 455. [2019-01-01 23:29:03,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 455 states. [2019-01-01 23:29:03,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 821 transitions. [2019-01-01 23:29:03,735 INFO L728 BuchiCegarLoop]: Abstraction has 455 states and 821 transitions. [2019-01-01 23:29:03,735 INFO L608 BuchiCegarLoop]: Abstraction has 455 states and 821 transitions. [2019-01-01 23:29:03,735 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 23:29:03,735 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 455 states and 821 transitions. [2019-01-01 23:29:03,739 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 212 [2019-01-01 23:29:03,739 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:29:03,739 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:29:03,741 INFO L866 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-01 23:29:03,744 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:29:03,745 INFO L794 eck$LassoCheckResult]: Stem: 4076#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~__SELECTED_FEATURE_Base~0 := 0;~__SELECTED_FEATURE_Keys~0 := 0;~__SELECTED_FEATURE_Encrypt~0 := 0;~__SELECTED_FEATURE_AutoResponder~0 := 0;~__SELECTED_FEATURE_AddressBook~0 := 0;~__SELECTED_FEATURE_Sign~0 := 0;~__SELECTED_FEATURE_Forward~0 := 0;~__SELECTED_FEATURE_Verify~0 := 0;~__SELECTED_FEATURE_Decrypt~0 := 0;~__GUIDSL_ROOT_PRODUCTION~0 := 0;~__GUIDSL_NON_TERMINAL_main~0 := 0;~bob~0 := 0;~rjh~0 := 0;~chuck~0 := 0;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(44);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(44);call #t~string7.base, #t~string7.offset := #Ultimate.allocOnStack(9);call #t~string9.base, #t~string9.offset := #Ultimate.allocOnStack(9);call #t~string11.base, #t~string11.offset := #Ultimate.allocOnStack(11);call #t~string15.base, #t~string15.offset := #Ultimate.allocOnStack(19);call #t~string18.base, #t~string18.offset := #Ultimate.allocOnStack(4);call write~init~int(37, #t~string18.base, #t~string18.offset, 1);call write~init~int(100, #t~string18.base, 1 + #t~string18.offset, 1);call write~init~int(10, #t~string18.base, 2 + #t~string18.offset, 1);call write~init~int(0, #t~string18.base, 3 + #t~string18.offset, 1);call #t~string21.base, #t~string21.offset := #Ultimate.allocOnStack(4);call write~init~int(37, #t~string21.base, #t~string21.offset, 1);call write~init~int(100, #t~string21.base, 1 + #t~string21.offset, 1);call write~init~int(10, #t~string21.base, 2 + #t~string21.offset, 1);call write~init~int(0, #t~string21.base, 3 + #t~string21.offset, 1);~__ste_Client_counter~0 := 0;~__ste_client_name0~0.base, ~__ste_client_name0~0.offset := 0, 0;~__ste_client_name1~0.base, ~__ste_client_name1~0.offset := 0, 0;~__ste_client_name2~0.base, ~__ste_client_name2~0.offset := 0, 0;~__ste_client_outbuffer0~0 := 0;~__ste_client_outbuffer1~0 := 0;~__ste_client_outbuffer2~0 := 0;~__ste_client_outbuffer3~0 := 0;~__ste_ClientAddressBook_size0~0 := 0;~__ste_ClientAddressBook_size1~0 := 0;~__ste_ClientAddressBook_size2~0 := 0;~__ste_Client_AddressBook0_Alias0~0 := 0;~__ste_Client_AddressBook0_Alias1~0 := 0;~__ste_Client_AddressBook0_Alias2~0 := 0;~__ste_Client_AddressBook1_Alias0~0 := 0;~__ste_Client_AddressBook1_Alias1~0 := 0;~__ste_Client_AddressBook1_Alias2~0 := 0;~__ste_Client_AddressBook2_Alias0~0 := 0;~__ste_Client_AddressBook2_Alias1~0 := 0;~__ste_Client_AddressBook2_Alias2~0 := 0;~__ste_Client_AddressBook0_Address0~0 := 0;~__ste_Client_AddressBook0_Address1~0 := 0;~__ste_Client_AddressBook0_Address2~0 := 0;~__ste_Client_AddressBook1_Address0~0 := 0;~__ste_Client_AddressBook1_Address1~0 := 0;~__ste_Client_AddressBook1_Address2~0 := 0;~__ste_Client_AddressBook2_Address0~0 := 0;~__ste_Client_AddressBook2_Address1~0 := 0;~__ste_Client_AddressBook2_Address2~0 := 0;~__ste_client_autoResponse0~0 := 0;~__ste_client_autoResponse1~0 := 0;~__ste_client_autoResponse2~0 := 0;~__ste_client_privateKey0~0 := 0;~__ste_client_privateKey1~0 := 0;~__ste_client_privateKey2~0 := 0;~__ste_ClientKeyring_size0~0 := 0;~__ste_ClientKeyring_size1~0 := 0;~__ste_ClientKeyring_size2~0 := 0;~__ste_Client_Keyring0_User0~0 := 0;~__ste_Client_Keyring0_User1~0 := 0;~__ste_Client_Keyring0_User2~0 := 0;~__ste_Client_Keyring1_User0~0 := 0;~__ste_Client_Keyring1_User1~0 := 0;~__ste_Client_Keyring1_User2~0 := 0;~__ste_Client_Keyring2_User0~0 := 0;~__ste_Client_Keyring2_User1~0 := 0;~__ste_Client_Keyring2_User2~0 := 0;~__ste_Client_Keyring0_PublicKey0~0 := 0;~__ste_Client_Keyring0_PublicKey1~0 := 0;~__ste_Client_Keyring0_PublicKey2~0 := 0;~__ste_Client_Keyring1_PublicKey0~0 := 0;~__ste_Client_Keyring1_PublicKey1~0 := 0;~__ste_Client_Keyring1_PublicKey2~0 := 0;~__ste_Client_Keyring2_PublicKey0~0 := 0;~__ste_Client_Keyring2_PublicKey1~0 := 0;~__ste_Client_Keyring2_PublicKey2~0 := 0;~__ste_client_forwardReceiver0~0 := 0;~__ste_client_forwardReceiver1~0 := 0;~__ste_client_forwardReceiver2~0 := 0;~__ste_client_forwardReceiver3~0 := 0;~__ste_client_idCounter0~0 := 0;~__ste_client_idCounter1~0 := 0;~__ste_client_idCounter2~0 := 0;~__ste_Email_counter~0 := 0;~__ste_email_id0~0 := 0;~__ste_email_id1~0 := 0;~__ste_email_from0~0 := 0;~__ste_email_from1~0 := 0;~__ste_email_to0~0 := 0;~__ste_email_to1~0 := 0;~__ste_email_subject0~0.base, ~__ste_email_subject0~0.offset := 0, 0;~__ste_email_subject1~0.base, ~__ste_email_subject1~0.offset := 0, 0;~__ste_email_body0~0.base, ~__ste_email_body0~0.offset := 0, 0;~__ste_email_body1~0.base, ~__ste_email_body1~0.offset := 0, 0;~__ste_email_isEncrypted0~0 := 0;~__ste_email_isEncrypted1~0 := 0;~__ste_email_encryptionKey0~0 := 0;~__ste_email_encryptionKey1~0 := 0;~__ste_email_isSigned0~0 := 0;~__ste_email_isSigned1~0 := 0;~__ste_email_signKey0~0 := 0;~__ste_email_signKey1~0 := 0;~__ste_email_isSignatureVerified0~0 := 0;~__ste_email_isSignatureVerified1~0 := 0;~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);call #t~string78.base, #t~string78.offset := #Ultimate.allocOnStack(10);call #t~string81.base, #t~string81.offset := #Ultimate.allocOnStack(12);call #t~string84.base, #t~string84.offset := #Ultimate.allocOnStack(10);call #t~string87.base, #t~string87.offset := #Ultimate.allocOnStack(18);call #t~string90.base, #t~string90.offset := #Ultimate.allocOnStack(16);call #t~string93.base, #t~string93.offset := #Ultimate.allocOnStack(21);call #t~string97.base, #t~string97.offset := #Ultimate.allocOnStack(4);call write~init~int(37, #t~string97.base, #t~string97.offset, 1);call write~init~int(115, #t~string97.base, 1 + #t~string97.offset, 1);call write~init~int(10, #t~string97.base, 2 + #t~string97.offset, 1);call write~init~int(0, #t~string97.base, 3 + #t~string97.offset, 1);~sent_encrypted~0 := -1;call #t~string99.base, #t~string99.offset := #Ultimate.allocOnStack(13);call #t~string102.base, #t~string102.offset := #Ultimate.allocOnStack(19);call #t~string104.base, #t~string104.offset := #Ultimate.allocOnStack(16);call #t~string106.base, #t~string106.offset := #Ultimate.allocOnStack(19);~queue_empty~0 := 1;~queued_message~0 := 0;~queued_client~0 := 0;call #t~string111.base, #t~string111.offset := #Ultimate.allocOnStack(10);call #t~string117.base, #t~string117.offset := #Ultimate.allocOnStack(16);call #t~string126.base, #t~string126.offset := #Ultimate.allocOnStack(20);call #t~string128.base, #t~string128.offset := #Ultimate.allocOnStack(21); 3920#L-1 havoc main_#res;havoc main_#t~ret13, main_~retValue_acc~0, main_~tmp~1;havoc main_~retValue_acc~0;havoc main_~tmp~1; 3921#L2235 havoc valid_product_#res;havoc valid_product_~retValue_acc~33;havoc valid_product_~retValue_acc~33;valid_product_~retValue_acc~33 := 1;valid_product_#res := valid_product_~retValue_acc~33; 4082#L2243 main_#t~ret13 := valid_product_#res;main_~tmp~1 := main_#t~ret13;havoc main_#t~ret13; 4060#L220 assume 0 != main_~tmp~1;havoc setup_#t~nondet8, setup_#t~nondet10, setup_#t~nondet12, setup_~__cil_tmp1~0.base, setup_~__cil_tmp1~0.offset, setup_~__cil_tmp2~0.base, setup_~__cil_tmp2~0.offset, setup_~__cil_tmp3~0.base, setup_~__cil_tmp3~0.offset;havoc setup_~__cil_tmp1~0.base, setup_~__cil_tmp1~0.offset;havoc setup_~__cil_tmp2~0.base, setup_~__cil_tmp2~0.offset;havoc setup_~__cil_tmp3~0.base, setup_~__cil_tmp3~0.offset;~bob~0 := 1;setup_bob_#in~bob___0 := ~bob~0;havoc setup_bob_~bob___0;setup_bob_~bob___0 := setup_bob_#in~bob___0;setup_bob__wrappee__Base_#in~bob___0 := setup_bob_~bob___0;havoc setup_bob__wrappee__Base_~bob___0;setup_bob__wrappee__Base_~bob___0 := setup_bob__wrappee__Base_#in~bob___0;setClientId_#in~handle, setClientId_#in~value := setup_bob__wrappee__Base_~bob___0, setup_bob__wrappee__Base_~bob___0;havoc setClientId_~handle, setClientId_~value;setClientId_~handle := setClientId_#in~handle;setClientId_~value := setClientId_#in~value; 4061#L1409 assume 1 == setClientId_~handle;~__ste_client_idCounter0~0 := setClientId_~value; 4040#L1415-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; 4050#L974 assume 1 == setClientPrivateKey_~handle;~__ste_client_privateKey0~0 := setClientPrivateKey_~value; 4030#L980-2 setup_~__cil_tmp1~0.base, setup_~__cil_tmp1~0.offset := #t~string7.base, #t~string7.offset;havoc setup_#t~nondet8;~rjh~0 := 2;setup_rjh_#in~rjh___0 := ~rjh~0;havoc setup_rjh_~rjh___0;setup_rjh_~rjh___0 := setup_rjh_#in~rjh___0;setup_rjh__wrappee__Base_#in~rjh___0 := setup_rjh_~rjh___0;havoc setup_rjh__wrappee__Base_~rjh___0;setup_rjh__wrappee__Base_~rjh___0 := setup_rjh__wrappee__Base_#in~rjh___0;setClientId_#in~handle, setClientId_#in~value := setup_rjh__wrappee__Base_~rjh___0, setup_rjh__wrappee__Base_~rjh___0;havoc setClientId_~handle, setClientId_~value;setClientId_~handle := setClientId_#in~handle;setClientId_~value := setClientId_#in~value; 4041#L1409-2 assume !(1 == setClientId_~handle); 4100#L1412-2 assume 2 == setClientId_~handle;~__ste_client_idCounter1~0 := setClientId_~value; 4008#L1415-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; 4009#L974-2 assume 1 == setClientPrivateKey_~handle;~__ste_client_privateKey0~0 := setClientPrivateKey_~value; 4043#L980-5 setup_~__cil_tmp2~0.base, setup_~__cil_tmp2~0.offset := #t~string9.base, #t~string9.offset;havoc setup_#t~nondet10;~chuck~0 := 3;setup_chuck_#in~chuck___0 := ~chuck~0;havoc setup_chuck_~chuck___0;setup_chuck_~chuck___0 := setup_chuck_#in~chuck___0;setup_chuck__wrappee__Base_#in~chuck___0 := setup_chuck_~chuck___0;havoc setup_chuck__wrappee__Base_~chuck___0;setup_chuck__wrappee__Base_~chuck___0 := setup_chuck__wrappee__Base_#in~chuck___0;setClientId_#in~handle, setClientId_#in~value := setup_chuck__wrappee__Base_~chuck___0, setup_chuck__wrappee__Base_~chuck___0;havoc setClientId_~handle, setClientId_~value;setClientId_~handle := setClientId_#in~handle;setClientId_~value := setClientId_#in~value; 4051#L1409-4 assume 1 == setClientId_~handle;~__ste_client_idCounter0~0 := setClientId_~value; 4011#L1415-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; 4024#L974-4 assume 1 == setClientPrivateKey_~handle;~__ste_client_privateKey0~0 := setClientPrivateKey_~value; 4003#L980-8 setup_~__cil_tmp3~0.base, setup_~__cil_tmp3~0.offset := #t~string11.base, #t~string11.offset;havoc setup_#t~nondet12; 3958#L207 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; 3959#L2433-1 assume !false; 3992#L2288 [2019-01-01 23:29:03,751 INFO L796 eck$LassoCheckResult]: Loop: 3992#L2288 assume test_~splverifierCounter~0 < 4; 3934#L2289 test_~splverifierCounter~0 := 1 + test_~splverifierCounter~0; 3935#L2295 assume !(0 == test_~op1~0); 3986#L2308 assume !(0 == test_~op2~0); 4214#L2319 assume 0 == test_~op3~0;test_~tmp___7~0 := test_#t~nondet68;havoc test_#t~nondet68; 4224#L2324 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; 4078#L974-6 assume 1 == setClientPrivateKey_~handle;~__ste_client_privateKey0~0 := setClientPrivateKey_~value; 4019#L980-11 test_~op3~0 := 1; 4108#L2433-1 assume !false; 3992#L2288 [2019-01-01 23:29:03,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:29:03,751 INFO L82 PathProgramCache]: Analyzing trace with hash -953559564, now seen corresponding path program 1 times [2019-01-01 23:29:03,751 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:29:03,751 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:29:03,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:29:03,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:29:03,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:29:03,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:29:04,085 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-01 23:29:04,085 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:29:04,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 23:29:04,086 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 23:29:04,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:29:04,086 INFO L82 PathProgramCache]: Analyzing trace with hash -1296812605, now seen corresponding path program 1 times [2019-01-01 23:29:04,086 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:29:04,087 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:29:04,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:29:04,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:29:04,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:29:04,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:29:04,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:29:04,236 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:29:04,237 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:29:04,237 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:29:04,237 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:29:04,237 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 23:29:04,239 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:29:04,239 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:29:04,239 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:29:04,239 INFO L131 ssoRankerPreferences]: Filename of dumped script: email_spec6_product16_false-unreach-call_true-termination.cil.c_Iteration2_Loop [2019-01-01 23:29:04,239 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:29:04,239 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:29:04,241 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-01 23:29:04,246 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-01 23:29:04,255 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-01 23:29:04,258 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-01 23:29:04,266 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-01 23:29:04,270 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-01 23:29:04,278 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:29:04,494 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-01-01 23:29:04,563 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:29:04,563 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-01 23:29:04,566 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:29:04,567 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:29:04,587 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:29:04,588 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-01 23:29:04,631 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:29:04,631 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-01 23:29:04,673 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 23:29:04,673 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-01 23:29:04,735 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 23:29:04,739 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:29:04,739 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:29:04,739 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:29:04,739 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:29:04,739 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 23:29:04,740 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:29:04,740 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:29:04,740 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:29:04,740 INFO L131 ssoRankerPreferences]: Filename of dumped script: email_spec6_product16_false-unreach-call_true-termination.cil.c_Iteration2_Loop [2019-01-01 23:29:04,740 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:29:04,740 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:29:04,744 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-01 23:29:04,845 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-01 23:29:04,919 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-01 23:29:04,923 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:29:04,950 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-01 23:29:04,952 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-01 23:29:04,965 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:29:05,231 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-01-01 23:29:05,317 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:29:05,317 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 23:29:05,317 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-01 23:29:05,318 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:29:05,318 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:29:05,319 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:29:05,319 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 23:29:05,319 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:29:05,320 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:29:05,320 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:29:05,325 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:29:05,326 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-01 23:29:05,326 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:29:05,326 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:29:05,326 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:29:05,326 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:29:05,329 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:29:05,329 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:29:05,329 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:29:05,333 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 23:29:05,336 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 23:29:05,336 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-01 23:29:05,337 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 23:29:05,337 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 23:29:05,337 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 23:29:05,337 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-01 23:29:05,339 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 23:29:05,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:29:05,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:29:05,557 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:29:05,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:29:05,596 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:29:05,944 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-01 23:29:05,945 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-01 23:29:05,945 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 455 states and 821 transitions. cyclomatic complexity: 368 Second operand 4 states. [2019-01-01 23:29:06,043 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-01 23:29:06,044 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-01 23:29:06,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 23:29:06,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 433 transitions. [2019-01-01 23:29:06,045 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 433 transitions. Stem has 20 letters. Loop has 9 letters. [2019-01-01 23:29:06,047 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:29:06,047 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 433 transitions. Stem has 29 letters. Loop has 9 letters. [2019-01-01 23:29:06,048 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:29:06,048 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 433 transitions. Stem has 20 letters. Loop has 18 letters. [2019-01-01 23:29:06,049 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:29:06,049 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 883 states and 1601 transitions. [2019-01-01 23:29:06,058 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 23:29:06,059 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 883 states to 0 states and 0 transitions. [2019-01-01 23:29:06,059 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 23:29:06,059 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 23:29:06,059 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 23:29:06,059 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:29:06,059 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 23:29:06,059 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 23:29:06,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 23:29:06,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 23:29:06,062 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 5 states. [2019-01-01 23:29:06,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:29:06,062 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-01-01 23:29:06,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-01 23:29:06,062 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2019-01-01 23:29:06,062 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 23:29:06,062 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2019-01-01 23:29:06,065 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 23:29:06,065 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 23:29:06,065 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 23:29:06,065 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:29:06,065 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 23:29:06,065 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 23:29:06,065 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 23:29:06,065 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 23:29:06,066 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-01 23:29:06,067 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 23:29:06,068 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-01 23:29:06,076 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 11:29:06 BoogieIcfgContainer [2019-01-01 23:29:06,077 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 23:29:06,077 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 23:29:06,077 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 23:29:06,077 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 23:29:06,079 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:29:00" (3/4) ... [2019-01-01 23:29:06,084 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-01 23:29:06,084 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 23:29:06,085 INFO L168 Benchmark]: Toolchain (without parser) took 10314.16 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 225.4 MB). Free memory was 947.3 MB in the beginning and 927.8 MB in the end (delta: 19.5 MB). Peak memory consumption was 244.9 MB. Max. memory is 11.5 GB. [2019-01-01 23:29:06,087 INFO L168 Benchmark]: CDTParser took 0.20 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-01 23:29:06,087 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1181.02 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -156.6 MB). Peak memory consumption was 45.8 MB. Max. memory is 11.5 GB. [2019-01-01 23:29:06,088 INFO L168 Benchmark]: Boogie Procedure Inliner took 166.02 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-01-01 23:29:06,090 INFO L168 Benchmark]: Boogie Preprocessor took 120.45 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-01-01 23:29:06,092 INFO L168 Benchmark]: RCFGBuilder took 3690.95 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 893.1 MB in the end (delta: 197.7 MB). Peak memory consumption was 197.7 MB. Max. memory is 11.5 GB. [2019-01-01 23:29:06,093 INFO L168 Benchmark]: BuchiAutomizer took 5144.24 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 81.3 MB). Free memory was 893.1 MB in the beginning and 935.4 MB in the end (delta: -42.3 MB). Peak memory consumption was 39.0 MB. Max. memory is 11.5 GB. [2019-01-01 23:29:06,094 INFO L168 Benchmark]: Witness Printer took 6.80 ms. Allocated memory is still 1.3 GB. Free memory is still 927.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 23:29:06,101 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.20 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 1181.02 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -156.6 MB). Peak memory consumption was 45.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 166.02 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 120.45 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 3690.95 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 893.1 MB in the end (delta: 197.7 MB). Peak memory consumption was 197.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5144.24 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 81.3 MB). Free memory was 893.1 MB in the beginning and 935.4 MB in the end (delta: -42.3 MB). Peak memory consumption was 39.0 MB. Max. memory is 11.5 GB. * Witness Printer took 6.80 ms. Allocated memory is still 1.3 GB. Free memory is still 927.8 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.0s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 3.0s. Construction of modules took 0.2s. Büchi inclusion checks took 1.4s. 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: 2811 SDtfs, 2392 SDslu, 3419 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: 7ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 4 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 1 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.2s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...