./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/product-lines/email_spec6_product34_false-unreach-call_true-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/product-lines/email_spec6_product34_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 754ab4b20430f6f6bdf24c9c2f614868f5398c9c .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 04:10:22,330 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 04:10:22,333 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 04:10:22,355 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 04:10:22,355 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 04:10:22,356 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 04:10:22,358 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 04:10:22,360 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 04:10:22,361 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 04:10:22,362 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 04:10:22,363 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 04:10:22,363 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 04:10:22,364 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 04:10:22,365 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 04:10:22,366 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 04:10:22,367 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 04:10:22,368 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 04:10:22,370 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 04:10:22,372 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 04:10:22,374 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 04:10:22,375 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 04:10:22,376 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 04:10:22,379 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 04:10:22,379 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 04:10:22,379 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 04:10:22,380 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 04:10:22,381 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 04:10:22,382 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 04:10:22,383 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 04:10:22,384 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 04:10:22,385 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 04:10:22,385 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 04:10:22,386 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 04:10:22,386 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 04:10:22,387 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 04:10:22,388 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 04:10:22,388 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-14 04:10:22,420 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 04:10:22,421 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 04:10:22,422 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 04:10:22,423 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 04:10:22,423 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 04:10:22,423 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 04:10:22,423 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 04:10:22,423 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 04:10:22,424 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 04:10:22,424 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 04:10:22,425 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 04:10:22,425 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 04:10:22,425 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 04:10:22,425 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 04:10:22,425 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 04:10:22,425 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 04:10:22,426 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 04:10:22,426 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 04:10:22,426 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 04:10:22,426 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 04:10:22,426 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 04:10:22,426 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 04:10:22,427 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 04:10:22,428 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 04:10:22,429 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 04:10:22,429 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 04:10:22,429 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 04:10:22,429 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 04:10:22,429 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 04:10:22,429 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 04:10:22,430 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 04:10:22,431 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 04:10:22,432 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 -> 754ab4b20430f6f6bdf24c9c2f614868f5398c9c [2019-01-14 04:10:22,468 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 04:10:22,484 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 04:10:22,490 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 04:10:22,492 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 04:10:22,492 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 04:10:22,493 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/email_spec6_product34_false-unreach-call_true-termination.cil.c [2019-01-14 04:10:22,558 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ec74081f/748f5ed21a8a4f25b0b966bfd54ca30a/FLAGa1d4f441d [2019-01-14 04:10:23,121 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 04:10:23,122 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/email_spec6_product34_false-unreach-call_true-termination.cil.c [2019-01-14 04:10:23,145 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ec74081f/748f5ed21a8a4f25b0b966bfd54ca30a/FLAGa1d4f441d [2019-01-14 04:10:23,354 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ec74081f/748f5ed21a8a4f25b0b966bfd54ca30a [2019-01-14 04:10:23,359 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 04:10:23,361 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 04:10:23,362 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 04:10:23,363 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 04:10:23,368 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 04:10:23,369 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:10:23" (1/1) ... [2019-01-14 04:10:23,372 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23e32109 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:10:23, skipping insertion in model container [2019-01-14 04:10:23,372 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:10:23" (1/1) ... [2019-01-14 04:10:23,381 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 04:10:23,496 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 04:10:24,298 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:10:24,316 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 04:10:24,554 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:10:24,673 INFO L195 MainTranslator]: Completed translation [2019-01-14 04:10:24,674 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:10:24 WrapperNode [2019-01-14 04:10:24,674 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 04:10:24,675 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 04:10:24,675 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 04:10:24,676 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 04:10:24,686 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:10:24" (1/1) ... [2019-01-14 04:10:24,722 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:10:24" (1/1) ... [2019-01-14 04:10:24,936 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 04:10:24,937 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 04:10:24,937 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 04:10:24,937 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 04:10:24,948 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:10:24" (1/1) ... [2019-01-14 04:10:24,948 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:10:24" (1/1) ... [2019-01-14 04:10:24,967 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:10:24" (1/1) ... [2019-01-14 04:10:24,968 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:10:24" (1/1) ... [2019-01-14 04:10:25,029 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:10:24" (1/1) ... [2019-01-14 04:10:25,075 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:10:24" (1/1) ... [2019-01-14 04:10:25,094 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:10:24" (1/1) ... [2019-01-14 04:10:25,112 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 04:10:25,113 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 04:10:25,113 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 04:10:25,113 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 04:10:25,114 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:10:24" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:10:25,180 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-01-14 04:10:25,181 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 04:10:25,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-14 04:10:25,181 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 04:10:25,181 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 04:10:31,784 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 04:10:31,785 INFO L286 CfgBuilder]: Removed 885 assue(true) statements. [2019-01-14 04:10:31,787 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:10:31 BoogieIcfgContainer [2019-01-14 04:10:31,787 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 04:10:31,788 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 04:10:31,788 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 04:10:31,792 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 04:10:31,793 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:10:31,793 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 04:10:23" (1/3) ... [2019-01-14 04:10:31,794 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@8274a19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:10:31, skipping insertion in model container [2019-01-14 04:10:31,794 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:10:31,795 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:10:24" (2/3) ... [2019-01-14 04:10:31,795 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@8274a19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:10:31, skipping insertion in model container [2019-01-14 04:10:31,795 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:10:31,795 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:10:31" (3/3) ... [2019-01-14 04:10:31,798 INFO L375 chiAutomizerObserver]: Analyzing ICFG email_spec6_product34_false-unreach-call_true-termination.cil.c [2019-01-14 04:10:31,852 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 04:10:31,853 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 04:10:31,853 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 04:10:31,853 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 04:10:31,853 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 04:10:31,853 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 04:10:31,853 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 04:10:31,854 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 04:10:31,854 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 04:10:31,903 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1302 states. [2019-01-14 04:10:32,017 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 255 [2019-01-14 04:10:32,017 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:10:32,017 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:10:32,028 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:10:32,029 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-14 04:10:32,029 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 04:10:32,029 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1302 states. [2019-01-14 04:10:32,045 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 255 [2019-01-14 04:10:32,046 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:10:32,046 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:10:32,048 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:10:32,049 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-14 04:10:32,059 INFO L794 eck$LassoCheckResult]: Stem: 448#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;~sent_encrypted~0 := -1;call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(13);call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(19);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(16);call #t~string8.base, #t~string8.offset := #Ultimate.allocOnStack(19);~queue_empty~0 := 1;~queued_message~0 := 0;~queued_client~0 := 0;call #t~string13.base, #t~string13.offset := #Ultimate.allocOnStack(10);call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(34);call #t~string23.base, #t~string23.offset := #Ultimate.allocOnStack(30);call #t~string27.base, #t~string27.offset := #Ultimate.allocOnStack(16);call #t~string36.base, #t~string36.offset := #Ultimate.allocOnStack(20);call #t~string39.base, #t~string39.offset := #Ultimate.allocOnStack(21);call #t~string47.base, #t~string47.offset := #Ultimate.allocOnStack(4);call write~init~int(37, #t~string47.base, #t~string47.offset, 1);call write~init~int(115, #t~string47.base, 1 + #t~string47.offset, 1);call write~init~int(10, #t~string47.base, 2 + #t~string47.offset, 1);call write~init~int(0, #t~string47.base, 3 + #t~string47.offset, 1);~head~0.base, ~head~0.offset := 0, 0;call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(30);call #t~string68.base, #t~string68.offset := #Ultimate.allocOnStack(9);call #t~string69.base, #t~string69.offset := #Ultimate.allocOnStack(21);call #t~string70.base, #t~string70.offset := #Ultimate.allocOnStack(30);call #t~string71.base, #t~string71.offset := #Ultimate.allocOnStack(9);call #t~string72.base, #t~string72.offset := #Ultimate.allocOnStack(21);call #t~string76.base, #t~string76.offset := #Ultimate.allocOnStack(30);call #t~string77.base, #t~string77.offset := #Ultimate.allocOnStack(9);call #t~string78.base, #t~string78.offset := #Ultimate.allocOnStack(25);call #t~string79.base, #t~string79.offset := #Ultimate.allocOnStack(30);call #t~string80.base, #t~string80.offset := #Ultimate.allocOnStack(9);call #t~string81.base, #t~string81.offset := #Ultimate.allocOnStack(25);~__ste_Email_counter~0 := 0;~__ste_email_id0~0 := 0;~__ste_email_id1~0 := 0;~__ste_email_from0~0 := 0;~__ste_email_from1~0 := 0;~__ste_email_to0~0 := 0;~__ste_email_to1~0 := 0;~__ste_email_subject0~0.base, ~__ste_email_subject0~0.offset := 0, 0;~__ste_email_subject1~0.base, ~__ste_email_subject1~0.offset := 0, 0;~__ste_email_body0~0.base, ~__ste_email_body0~0.offset := 0, 0;~__ste_email_body1~0.base, ~__ste_email_body1~0.offset := 0, 0;~__ste_email_isEncrypted0~0 := 0;~__ste_email_isEncrypted1~0 := 0;~__ste_email_encryptionKey0~0 := 0;~__ste_email_encryptionKey1~0 := 0;~__ste_email_isSigned0~0 := 0;~__ste_email_isSigned1~0 := 0;~__ste_email_signKey0~0 := 0;~__ste_email_signKey1~0 := 0;~__ste_email_isSignatureVerified0~0 := 0;~__ste_email_isSignatureVerified1~0 := 0;call #t~string85.base, #t~string85.offset := #Ultimate.allocOnStack(10);call #t~string88.base, #t~string88.offset := #Ultimate.allocOnStack(12);call #t~string91.base, #t~string91.offset := #Ultimate.allocOnStack(10);call #t~string94.base, #t~string94.offset := #Ultimate.allocOnStack(18);call #t~string97.base, #t~string97.offset := #Ultimate.allocOnStack(16);call #t~string100.base, #t~string100.offset := #Ultimate.allocOnStack(21);call #t~string103.base, #t~string103.offset := #Ultimate.allocOnStack(13);call #t~string106.base, #t~string106.offset := #Ultimate.allocOnStack(16);call #t~string109.base, #t~string109.offset := #Ultimate.allocOnStack(25);~__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;~bob~0 := 0;~rjh~0 := 0;~chuck~0 := 0;call #t~string115.base, #t~string115.offset := #Ultimate.allocOnStack(44);call #t~string120.base, #t~string120.offset := #Ultimate.allocOnStack(44);call #t~string122.base, #t~string122.offset := #Ultimate.allocOnStack(9);call #t~string124.base, #t~string124.offset := #Ultimate.allocOnStack(9);call #t~string126.base, #t~string126.offset := #Ultimate.allocOnStack(11);call #t~string130.base, #t~string130.offset := #Ultimate.allocOnStack(19);call #t~string133.base, #t~string133.offset := #Ultimate.allocOnStack(4);call write~init~int(37, #t~string133.base, #t~string133.offset, 1);call write~init~int(100, #t~string133.base, 1 + #t~string133.offset, 1);call write~init~int(10, #t~string133.base, 2 + #t~string133.offset, 1);call write~init~int(0, #t~string133.base, 3 + #t~string133.offset, 1);call #t~string136.base, #t~string136.offset := #Ultimate.allocOnStack(4);call write~init~int(37, #t~string136.base, #t~string136.offset, 1);call write~init~int(100, #t~string136.base, 1 + #t~string136.offset, 1);call write~init~int(10, #t~string136.base, 2 + #t~string136.offset, 1);call write~init~int(0, #t~string136.base, 3 + #t~string136.offset, 1); 338#L-1true havoc main_#res;havoc main_#t~ret128, main_~retValue_acc~43, main_~tmp~22;havoc main_~retValue_acc~43;havoc main_~tmp~22; 1052#L75true havoc valid_product_#res;havoc valid_product_~retValue_acc~1;havoc valid_product_~retValue_acc~1;valid_product_~retValue_acc~1 := 1;valid_product_#res := valid_product_~retValue_acc~1; 619#L83true main_#t~ret128 := valid_product_#res;main_~tmp~22 := main_#t~ret128;havoc main_#t~ret128; 1108#L2719true assume 0 != main_~tmp~22;havoc setup_#t~nondet123, setup_#t~nondet125, setup_#t~nondet127, setup_~__cil_tmp1~0.base, setup_~__cil_tmp1~0.offset, setup_~__cil_tmp2~1.base, setup_~__cil_tmp2~1.offset, setup_~__cil_tmp3~4.base, setup_~__cil_tmp3~4.offset;havoc setup_~__cil_tmp1~0.base, setup_~__cil_tmp1~0.offset;havoc setup_~__cil_tmp2~1.base, setup_~__cil_tmp2~1.offset;havoc setup_~__cil_tmp3~4.base, setup_~__cil_tmp3~4.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; 581#L2550true assume 1 == setClientId_~handle;~__ste_client_idCounter0~0 := setClientId_~value; 179#L2556-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; 191#L2115true assume 1 == setClientPrivateKey_~handle;~__ste_client_privateKey0~0 := setClientPrivateKey_~value; 1147#L2121-2true setup_~__cil_tmp1~0.base, setup_~__cil_tmp1~0.offset := #t~string122.base, #t~string122.offset;havoc setup_#t~nondet123;~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; 553#L2550-2true assume 1 == setClientId_~handle;~__ste_client_idCounter0~0 := setClientId_~value; 172#L2556-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; 196#L2115-2true assume 1 == setClientPrivateKey_~handle;~__ste_client_privateKey0~0 := setClientPrivateKey_~value; 1133#L2121-5true setup_~__cil_tmp2~1.base, setup_~__cil_tmp2~1.offset := #t~string124.base, #t~string124.offset;havoc setup_#t~nondet125;~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; 556#L2550-4true assume 1 == setClientId_~handle;~__ste_client_idCounter0~0 := setClientId_~value; 304#L2556-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; 197#L2115-4true assume 1 == setClientPrivateKey_~handle;~__ste_client_privateKey0~0 := setClientPrivateKey_~value; 1139#L2121-8true setup_~__cil_tmp3~4.base, setup_~__cil_tmp3~4.offset := #t~string126.base, #t~string126.offset;havoc setup_#t~nondet127; 643#L2706true havoc test_#t~nondet143, test_#t~nondet144, test_#t~nondet145, test_#t~nondet146, test_#t~nondet147, test_#t~nondet148, test_#t~nondet149, test_#t~nondet150, test_#t~nondet151, test_#t~nondet152, test_#t~nondet153, 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~24, test_~tmp___0~10, test_~tmp___1~6, test_~tmp___2~4, test_~tmp___3~1, test_~tmp___4~1, test_~tmp___5~0, test_~tmp___6~0, test_~tmp___7~0, test_~tmp___8~0, test_~tmp___9~0;havoc test_~op1~0;havoc test_~op2~0;havoc test_~op3~0;havoc test_~op4~0;havoc test_~op5~0;havoc test_~op6~0;havoc test_~op7~0;havoc test_~op8~0;havoc test_~op9~0;havoc test_~op10~0;havoc test_~op11~0;havoc test_~splverifierCounter~0;havoc test_~tmp~24;havoc test_~tmp___0~10;havoc test_~tmp___1~6;havoc test_~tmp___2~4;havoc test_~tmp___3~1;havoc test_~tmp___4~1;havoc test_~tmp___5~0;havoc test_~tmp___6~0;havoc test_~tmp___7~0;havoc test_~tmp___8~0;havoc test_~tmp___9~0;test_~op1~0 := 0;test_~op2~0 := 0;test_~op3~0 := 0;test_~op4~0 := 0;test_~op5~0 := 0;test_~op6~0 := 0;test_~op7~0 := 0;test_~op8~0 := 0;test_~op9~0 := 0;test_~op10~0 := 0;test_~op11~0 := 0;test_~splverifierCounter~0 := 0; 697#L3054-1true [2019-01-14 04:10:32,063 INFO L796 eck$LassoCheckResult]: Loop: 697#L3054-1true assume !false; 493#L2906true assume test_~splverifierCounter~0 < 4; 419#L2907true test_~splverifierCounter~0 := 1 + test_~splverifierCounter~0; 1205#L2913true assume !(0 == test_~op1~0); 646#L2926true assume 0 == test_~op2~0;test_~tmp___8~0 := test_#t~nondet144;havoc test_#t~nondet144; 277#L2931true assume 0 != test_~tmp___8~0;test_~op2~0 := 1; 697#L3054-1true [2019-01-14 04:10:32,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:10:32,074 INFO L82 PathProgramCache]: Analyzing trace with hash 1291925977, now seen corresponding path program 1 times [2019-01-14 04:10:32,076 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:10:32,077 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:10:32,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:10:32,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:10:32,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:10:32,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:10:32,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:10:32,451 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:10:32,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:10:32,455 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:10:32,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:10:32,455 INFO L82 PathProgramCache]: Analyzing trace with hash 590492675, now seen corresponding path program 1 times [2019-01-14 04:10:32,455 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:10:32,455 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:10:32,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:10:32,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:10:32,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:10:32,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:10:32,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:10:32,640 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-01-14 04:10:32,756 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-01-14 04:10:32,768 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:10:32,770 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:10:32,770 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:10:32,770 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:10:32,770 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 04:10:32,770 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:10:32,770 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:10:32,771 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:10:32,772 INFO L131 ssoRankerPreferences]: Filename of dumped script: email_spec6_product34_false-unreach-call_true-termination.cil.c_Iteration1_Loop [2019-01-14 04:10:32,772 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:10:32,772 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:10:32,799 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:10:32,892 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:10:32,915 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:10:32,920 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:10:33,058 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-01-14 04:10:33,316 WARN L181 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2019-01-14 04:10:33,518 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-01-14 04:10:33,641 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:10:33,641 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:10:33,646 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:10:33,647 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:10:33,696 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 04:10:33,696 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:10:33,718 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 04:10:33,752 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:10:33,752 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:10:33,752 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:10:33,753 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:10:33,753 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:10:33,753 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:10:33,753 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:10:33,753 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:10:33,753 INFO L131 ssoRankerPreferences]: Filename of dumped script: email_spec6_product34_false-unreach-call_true-termination.cil.c_Iteration1_Loop [2019-01-14 04:10:33,753 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:10:33,754 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:10:33,756 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:10:33,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-14 04:10:33,933 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:10:34,018 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:10:34,198 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-01-14 04:10:34,476 WARN L181 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2019-01-14 04:10:34,703 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-01-14 04:10:35,050 WARN L181 SmtUtils]: Spent 225.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-01-14 04:10:35,076 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:10:35,081 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:10:35,082 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:10:35,084 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:10:35,084 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:10:35,085 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:10:35,085 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:10:35,085 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:10:35,088 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:10:35,088 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:10:35,092 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:10:35,097 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 04:10:35,098 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-14 04:10:35,100 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:10:35,100 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 04:10:35,101 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:10:35,101 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_test_~op2~0) = -2*ULTIMATE.start_test_~op2~0 + 1 Supporting invariants [] [2019-01-14 04:10:35,102 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 04:10:35,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:10:35,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:10:35,338 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:10:35,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:10:35,384 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:10:35,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:10:35,543 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-14 04:10:35,544 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1302 states. Second operand 4 states. [2019-01-14 04:10:36,381 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1302 states.. Second operand 4 states. Result 6140 states and 10492 transitions. Complement of second has 7 states. [2019-01-14 04:10:36,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-14 04:10:36,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 04:10:36,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 6134 transitions. [2019-01-14 04:10:36,396 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 6134 transitions. Stem has 18 letters. Loop has 6 letters. [2019-01-14 04:10:36,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:10:36,398 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 6134 transitions. Stem has 24 letters. Loop has 6 letters. [2019-01-14 04:10:36,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:10:36,399 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 6134 transitions. Stem has 18 letters. Loop has 12 letters. [2019-01-14 04:10:36,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:10:36,400 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 6140 states and 10492 transitions. [2019-01-14 04:10:36,567 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 509 [2019-01-14 04:10:36,584 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 6140 states to 1051 states and 1924 transitions. [2019-01-14 04:10:36,585 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 540 [2019-01-14 04:10:36,587 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 541 [2019-01-14 04:10:36,588 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1051 states and 1924 transitions. [2019-01-14 04:10:36,592 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:10:36,593 INFO L706 BuchiCegarLoop]: Abstraction has 1051 states and 1924 transitions. [2019-01-14 04:10:36,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1051 states and 1924 transitions. [2019-01-14 04:10:36,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1051 to 542. [2019-01-14 04:10:36,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 542 states. [2019-01-14 04:10:36,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 989 transitions. [2019-01-14 04:10:36,685 INFO L729 BuchiCegarLoop]: Abstraction has 542 states and 989 transitions. [2019-01-14 04:10:36,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 04:10:36,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 04:10:36,691 INFO L87 Difference]: Start difference. First operand 542 states and 989 transitions. Second operand 3 states. [2019-01-14 04:10:36,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:10:36,929 INFO L93 Difference]: Finished difference Result 1064 states and 1943 transitions. [2019-01-14 04:10:36,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 04:10:36,931 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1064 states and 1943 transitions. [2019-01-14 04:10:36,940 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 510 [2019-01-14 04:10:36,951 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1064 states to 1064 states and 1943 transitions. [2019-01-14 04:10:36,952 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 552 [2019-01-14 04:10:36,953 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 552 [2019-01-14 04:10:36,955 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1064 states and 1943 transitions. [2019-01-14 04:10:36,960 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:10:36,961 INFO L706 BuchiCegarLoop]: Abstraction has 1064 states and 1943 transitions. [2019-01-14 04:10:36,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1064 states and 1943 transitions. [2019-01-14 04:10:36,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1064 to 541. [2019-01-14 04:10:36,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 541 states. [2019-01-14 04:10:36,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 985 transitions. [2019-01-14 04:10:36,979 INFO L729 BuchiCegarLoop]: Abstraction has 541 states and 985 transitions. [2019-01-14 04:10:36,979 INFO L609 BuchiCegarLoop]: Abstraction has 541 states and 985 transitions. [2019-01-14 04:10:36,979 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 04:10:36,979 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 541 states and 985 transitions. [2019-01-14 04:10:36,983 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 255 [2019-01-14 04:10:36,983 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:10:36,983 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:10:36,985 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:10:36,985 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:10:36,985 INFO L794 eck$LassoCheckResult]: Stem: 9497#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;~sent_encrypted~0 := -1;call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(13);call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(19);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(16);call #t~string8.base, #t~string8.offset := #Ultimate.allocOnStack(19);~queue_empty~0 := 1;~queued_message~0 := 0;~queued_client~0 := 0;call #t~string13.base, #t~string13.offset := #Ultimate.allocOnStack(10);call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(34);call #t~string23.base, #t~string23.offset := #Ultimate.allocOnStack(30);call #t~string27.base, #t~string27.offset := #Ultimate.allocOnStack(16);call #t~string36.base, #t~string36.offset := #Ultimate.allocOnStack(20);call #t~string39.base, #t~string39.offset := #Ultimate.allocOnStack(21);call #t~string47.base, #t~string47.offset := #Ultimate.allocOnStack(4);call write~init~int(37, #t~string47.base, #t~string47.offset, 1);call write~init~int(115, #t~string47.base, 1 + #t~string47.offset, 1);call write~init~int(10, #t~string47.base, 2 + #t~string47.offset, 1);call write~init~int(0, #t~string47.base, 3 + #t~string47.offset, 1);~head~0.base, ~head~0.offset := 0, 0;call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(30);call #t~string68.base, #t~string68.offset := #Ultimate.allocOnStack(9);call #t~string69.base, #t~string69.offset := #Ultimate.allocOnStack(21);call #t~string70.base, #t~string70.offset := #Ultimate.allocOnStack(30);call #t~string71.base, #t~string71.offset := #Ultimate.allocOnStack(9);call #t~string72.base, #t~string72.offset := #Ultimate.allocOnStack(21);call #t~string76.base, #t~string76.offset := #Ultimate.allocOnStack(30);call #t~string77.base, #t~string77.offset := #Ultimate.allocOnStack(9);call #t~string78.base, #t~string78.offset := #Ultimate.allocOnStack(25);call #t~string79.base, #t~string79.offset := #Ultimate.allocOnStack(30);call #t~string80.base, #t~string80.offset := #Ultimate.allocOnStack(9);call #t~string81.base, #t~string81.offset := #Ultimate.allocOnStack(25);~__ste_Email_counter~0 := 0;~__ste_email_id0~0 := 0;~__ste_email_id1~0 := 0;~__ste_email_from0~0 := 0;~__ste_email_from1~0 := 0;~__ste_email_to0~0 := 0;~__ste_email_to1~0 := 0;~__ste_email_subject0~0.base, ~__ste_email_subject0~0.offset := 0, 0;~__ste_email_subject1~0.base, ~__ste_email_subject1~0.offset := 0, 0;~__ste_email_body0~0.base, ~__ste_email_body0~0.offset := 0, 0;~__ste_email_body1~0.base, ~__ste_email_body1~0.offset := 0, 0;~__ste_email_isEncrypted0~0 := 0;~__ste_email_isEncrypted1~0 := 0;~__ste_email_encryptionKey0~0 := 0;~__ste_email_encryptionKey1~0 := 0;~__ste_email_isSigned0~0 := 0;~__ste_email_isSigned1~0 := 0;~__ste_email_signKey0~0 := 0;~__ste_email_signKey1~0 := 0;~__ste_email_isSignatureVerified0~0 := 0;~__ste_email_isSignatureVerified1~0 := 0;call #t~string85.base, #t~string85.offset := #Ultimate.allocOnStack(10);call #t~string88.base, #t~string88.offset := #Ultimate.allocOnStack(12);call #t~string91.base, #t~string91.offset := #Ultimate.allocOnStack(10);call #t~string94.base, #t~string94.offset := #Ultimate.allocOnStack(18);call #t~string97.base, #t~string97.offset := #Ultimate.allocOnStack(16);call #t~string100.base, #t~string100.offset := #Ultimate.allocOnStack(21);call #t~string103.base, #t~string103.offset := #Ultimate.allocOnStack(13);call #t~string106.base, #t~string106.offset := #Ultimate.allocOnStack(16);call #t~string109.base, #t~string109.offset := #Ultimate.allocOnStack(25);~__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;~bob~0 := 0;~rjh~0 := 0;~chuck~0 := 0;call #t~string115.base, #t~string115.offset := #Ultimate.allocOnStack(44);call #t~string120.base, #t~string120.offset := #Ultimate.allocOnStack(44);call #t~string122.base, #t~string122.offset := #Ultimate.allocOnStack(9);call #t~string124.base, #t~string124.offset := #Ultimate.allocOnStack(9);call #t~string126.base, #t~string126.offset := #Ultimate.allocOnStack(11);call #t~string130.base, #t~string130.offset := #Ultimate.allocOnStack(19);call #t~string133.base, #t~string133.offset := #Ultimate.allocOnStack(4);call write~init~int(37, #t~string133.base, #t~string133.offset, 1);call write~init~int(100, #t~string133.base, 1 + #t~string133.offset, 1);call write~init~int(10, #t~string133.base, 2 + #t~string133.offset, 1);call write~init~int(0, #t~string133.base, 3 + #t~string133.offset, 1);call #t~string136.base, #t~string136.offset := #Ultimate.allocOnStack(4);call write~init~int(37, #t~string136.base, #t~string136.offset, 1);call write~init~int(100, #t~string136.base, 1 + #t~string136.offset, 1);call write~init~int(10, #t~string136.base, 2 + #t~string136.offset, 1);call write~init~int(0, #t~string136.base, 3 + #t~string136.offset, 1); 9197#L-1 havoc main_#res;havoc main_#t~ret128, main_~retValue_acc~43, main_~tmp~22;havoc main_~retValue_acc~43;havoc main_~tmp~22; 9198#L75 havoc valid_product_#res;havoc valid_product_~retValue_acc~1;havoc valid_product_~retValue_acc~1;valid_product_~retValue_acc~1 := 1;valid_product_#res := valid_product_~retValue_acc~1; 9424#L83 main_#t~ret128 := valid_product_#res;main_~tmp~22 := main_#t~ret128;havoc main_#t~ret128; 9522#L2719 assume 0 != main_~tmp~22;havoc setup_#t~nondet123, setup_#t~nondet125, setup_#t~nondet127, setup_~__cil_tmp1~0.base, setup_~__cil_tmp1~0.offset, setup_~__cil_tmp2~1.base, setup_~__cil_tmp2~1.offset, setup_~__cil_tmp3~4.base, setup_~__cil_tmp3~4.offset;havoc setup_~__cil_tmp1~0.base, setup_~__cil_tmp1~0.offset;havoc setup_~__cil_tmp2~1.base, setup_~__cil_tmp2~1.offset;havoc setup_~__cil_tmp3~4.base, setup_~__cil_tmp3~4.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; 9523#L2550 assume 1 == setClientId_~handle;~__ste_client_idCounter0~0 := setClientId_~value; 9276#L2556-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; 9560#L2115 assume 1 == setClientPrivateKey_~handle;~__ste_client_privateKey0~0 := setClientPrivateKey_~value; 9362#L2121-2 setup_~__cil_tmp1~0.base, setup_~__cil_tmp1~0.offset := #t~string122.base, #t~string122.offset;havoc setup_#t~nondet123;~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; 9553#L2550-2 assume !(1 == setClientId_~handle); 9285#L2553-2 assume 2 == setClientId_~handle;~__ste_client_idCounter1~0 := setClientId_~value; 9286#L2556-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; 9545#L2115-2 assume 1 == setClientPrivateKey_~handle;~__ste_client_privateKey0~0 := setClientPrivateKey_~value; 9279#L2121-5 setup_~__cil_tmp2~1.base, setup_~__cil_tmp2~1.offset := #t~string124.base, #t~string124.offset;havoc setup_#t~nondet125;~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; 9544#L2550-4 assume 1 == setClientId_~handle;~__ste_client_idCounter0~0 := setClientId_~value; 9344#L2556-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; 9581#L2115-4 assume 1 == setClientPrivateKey_~handle;~__ste_client_privateKey0~0 := setClientPrivateKey_~value; 9288#L2121-8 setup_~__cil_tmp3~4.base, setup_~__cil_tmp3~4.offset := #t~string126.base, #t~string126.offset;havoc setup_#t~nondet127; 9546#L2706 havoc test_#t~nondet143, test_#t~nondet144, test_#t~nondet145, test_#t~nondet146, test_#t~nondet147, test_#t~nondet148, test_#t~nondet149, test_#t~nondet150, test_#t~nondet151, test_#t~nondet152, test_#t~nondet153, 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~24, test_~tmp___0~10, test_~tmp___1~6, test_~tmp___2~4, test_~tmp___3~1, test_~tmp___4~1, test_~tmp___5~0, test_~tmp___6~0, test_~tmp___7~0, test_~tmp___8~0, test_~tmp___9~0;havoc test_~op1~0;havoc test_~op2~0;havoc test_~op3~0;havoc test_~op4~0;havoc test_~op5~0;havoc test_~op6~0;havoc test_~op7~0;havoc test_~op8~0;havoc test_~op9~0;havoc test_~op10~0;havoc test_~op11~0;havoc test_~splverifierCounter~0;havoc test_~tmp~24;havoc test_~tmp___0~10;havoc test_~tmp___1~6;havoc test_~tmp___2~4;havoc test_~tmp___3~1;havoc test_~tmp___4~1;havoc test_~tmp___5~0;havoc test_~tmp___6~0;havoc test_~tmp___7~0;havoc test_~tmp___8~0;havoc test_~tmp___9~0;test_~op1~0 := 0;test_~op2~0 := 0;test_~op3~0 := 0;test_~op4~0 := 0;test_~op5~0 := 0;test_~op6~0 := 0;test_~op7~0 := 0;test_~op8~0 := 0;test_~op9~0 := 0;test_~op10~0 := 0;test_~op11~0 := 0;test_~splverifierCounter~0 := 0; 9640#L3054-1 assume !false; 9291#L2906 [2019-01-14 04:10:36,986 INFO L796 eck$LassoCheckResult]: Loop: 9291#L2906 assume test_~splverifierCounter~0 < 4; 9477#L2907 test_~splverifierCounter~0 := 1 + test_~splverifierCounter~0; 9478#L2913 assume !(0 == test_~op1~0); 9538#L2926 assume !(0 == test_~op2~0); 9653#L2937 assume 0 == test_~op3~0;test_~tmp___7~0 := test_#t~nondet145;havoc test_#t~nondet145; 9657#L2942 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; 9571#L2115-6 assume 1 == setClientPrivateKey_~handle;~__ste_client_privateKey0~0 := setClientPrivateKey_~value; 9333#L2121-11 test_~op3~0 := 1; 9290#L3054-1 assume !false; 9291#L2906 [2019-01-14 04:10:36,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:10:36,988 INFO L82 PathProgramCache]: Analyzing trace with hash -953559564, now seen corresponding path program 1 times [2019-01-14 04:10:36,988 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:10:36,988 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:10:36,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:10:36,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:10:36,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:10:37,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:10:37,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:10:37,251 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:10:37,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 04:10:37,252 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:10:37,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:10:37,252 INFO L82 PathProgramCache]: Analyzing trace with hash -1296812605, now seen corresponding path program 1 times [2019-01-14 04:10:37,252 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:10:37,252 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:10:37,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:10:37,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:10:37,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:10:37,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:10:37,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:10:37,440 WARN L181 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2019-01-14 04:10:37,497 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:10:37,497 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:10:37,497 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:10:37,497 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:10:37,497 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 04:10:37,498 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:10:37,498 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:10:37,498 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:10:37,498 INFO L131 ssoRankerPreferences]: Filename of dumped script: email_spec6_product34_false-unreach-call_true-termination.cil.c_Iteration2_Loop [2019-01-14 04:10:37,498 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:10:37,499 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:10:37,501 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:10:37,524 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:10:37,526 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:10:37,532 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:10:37,540 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:10:37,546 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:10:37,548 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:10:37,705 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:10:37,705 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:10:37,710 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:10:37,710 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:10:37,734 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 04:10:37,734 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:10:37,763 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 04:10:37,765 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:10:37,765 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:10:37,766 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:10:37,766 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:10:37,766 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:10:37,766 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:10:37,766 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:10:37,766 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:10:37,766 INFO L131 ssoRankerPreferences]: Filename of dumped script: email_spec6_product34_false-unreach-call_true-termination.cil.c_Iteration2_Loop [2019-01-14 04:10:37,766 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:10:37,767 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:10:37,769 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:10:37,785 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:10:37,794 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:10:37,797 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:10:37,800 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:10:37,811 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:10:37,821 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:10:38,002 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:10:38,002 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:10:38,003 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:10:38,006 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:10:38,006 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:10:38,006 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:10:38,006 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 04:10:38,006 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:10:38,008 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:10:38,008 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:10:38,013 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:10:38,013 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:10:38,014 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:10:38,014 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:10:38,014 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:10:38,014 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:10:38,015 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:10:38,015 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:10:38,015 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:10:38,021 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:10:38,023 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 04:10:38,023 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-14 04:10:38,024 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:10:38,024 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 04:10:38,024 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:10:38,024 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_test_~splverifierCounter~0) = -2*ULTIMATE.start_test_~splverifierCounter~0 + 7 Supporting invariants [] [2019-01-14 04:10:38,025 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 04:10:38,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:10:38,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:10:38,211 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:10:38,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:10:38,256 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:10:38,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:10:38,503 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-01-14 04:10:38,503 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 541 states and 985 transitions. cyclomatic complexity: 446 Second operand 4 states. [2019-01-14 04:10:38,606 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 541 states and 985 transitions. cyclomatic complexity: 446. Second operand 4 states. Result 1055 states and 1929 transitions. Complement of second has 6 states. [2019-01-14 04:10:38,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-14 04:10:38,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 04:10:38,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 515 transitions. [2019-01-14 04:10:38,609 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 515 transitions. Stem has 20 letters. Loop has 9 letters. [2019-01-14 04:10:38,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:10:38,611 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 515 transitions. Stem has 29 letters. Loop has 9 letters. [2019-01-14 04:10:38,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:10:38,612 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 515 transitions. Stem has 20 letters. Loop has 18 letters. [2019-01-14 04:10:38,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:10:38,616 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1055 states and 1929 transitions. [2019-01-14 04:10:38,625 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 04:10:38,625 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1055 states to 0 states and 0 transitions. [2019-01-14 04:10:38,626 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 04:10:38,626 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 04:10:38,626 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 04:10:38,626 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:10:38,626 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:10:38,626 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:10:38,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 04:10:38,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 04:10:38,629 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 5 states. [2019-01-14 04:10:38,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:10:38,629 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-01-14 04:10:38,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-14 04:10:38,629 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2019-01-14 04:10:38,629 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 04:10:38,630 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2019-01-14 04:10:38,632 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 04:10:38,632 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 04:10:38,632 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 04:10:38,632 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:10:38,632 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:10:38,632 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:10:38,633 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:10:38,633 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 04:10:38,634 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 04:10:38,634 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 04:10:38,635 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 04:10:38,643 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 04:10:38 BoogieIcfgContainer [2019-01-14 04:10:38,643 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 04:10:38,644 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 04:10:38,644 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 04:10:38,644 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 04:10:38,644 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:10:31" (3/4) ... [2019-01-14 04:10:38,652 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 04:10:38,653 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 04:10:38,655 INFO L168 Benchmark]: Toolchain (without parser) took 15295.11 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 288.9 MB). Free memory was 945.8 MB in the beginning and 1.0 GB in the end (delta: -97.3 MB). Peak memory consumption was 191.5 MB. Max. memory is 11.5 GB. [2019-01-14 04:10:38,658 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:10:38,659 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1312.38 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.2 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -116.7 MB). Peak memory consumption was 56.9 MB. Max. memory is 11.5 GB. [2019-01-14 04:10:38,661 INFO L168 Benchmark]: Boogie Procedure Inliner took 261.25 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 20.8 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. [2019-01-14 04:10:38,662 INFO L168 Benchmark]: Boogie Preprocessor took 175.87 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 13.8 MB). Peak memory consumption was 13.8 MB. Max. memory is 11.5 GB. [2019-01-14 04:10:38,663 INFO L168 Benchmark]: RCFGBuilder took 6674.44 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 115.9 MB). Free memory was 1.0 GB in the beginning and 989.5 MB in the end (delta: 38.5 MB). Peak memory consumption was 283.3 MB. Max. memory is 11.5 GB. [2019-01-14 04:10:38,665 INFO L168 Benchmark]: BuchiAutomizer took 6855.25 ms. Allocated memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 60.8 MB). Free memory was 989.5 MB in the beginning and 1.0 GB in the end (delta: -53.7 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. [2019-01-14 04:10:38,667 INFO L168 Benchmark]: Witness Printer took 10.45 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:10:38,676 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1312.38 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.2 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -116.7 MB). Peak memory consumption was 56.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 261.25 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 20.8 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 175.87 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 13.8 MB). Peak memory consumption was 13.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 6674.44 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 115.9 MB). Free memory was 1.0 GB in the beginning and 989.5 MB in the end (delta: 38.5 MB). Peak memory consumption was 283.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6855.25 ms. Allocated memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 60.8 MB). Free memory was 989.5 MB in the beginning and 1.0 GB in the end (delta: -53.7 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. * Witness Printer took 10.45 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (2 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * op2 + 1 and consists of 5 locations. One deterministic module has affine ranking function -2 * splverifierCounter + 7 and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.8s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 4.1s. Construction of modules took 0.3s. Büchi inclusion checks took 1.7s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 1032 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.2s Buchi closure took 0.0s. Biggest automaton had 541 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 5909 SDtfs, 5408 SDslu, 7943 SDs, 0 SdLazy, 26 SolverSat, 7 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT2 lasso0 LassoPreprocessingBenchmarks: Lassos: inital38 mio100 ax100 hnf100 lsp29 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq189 hnf90 smp100 dnf134 smp100 tf108 neg92 sie116 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 10ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 4 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...