./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/product-lines/email_spec8_product28_true-unreach-call_true-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/product-lines/email_spec8_product28_true-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 305a50bda12d169f081444c4c552f1d03e30aa2d ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 23:29:52,454 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 23:29:52,456 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 23:29:52,468 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 23:29:52,469 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 23:29:52,470 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 23:29:52,472 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 23:29:52,474 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 23:29:52,476 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 23:29:52,477 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 23:29:52,478 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 23:29:52,478 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 23:29:52,479 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 23:29:52,481 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 23:29:52,482 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 23:29:52,483 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 23:29:52,484 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 23:29:52,486 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 23:29:52,489 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 23:29:52,490 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 23:29:52,492 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 23:29:52,493 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 23:29:52,496 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 23:29:52,497 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 23:29:52,497 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 23:29:52,498 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 23:29:52,499 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 23:29:52,502 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 23:29:52,503 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 23:29:52,506 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 23:29:52,506 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 23:29:52,509 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 23:29:52,509 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 23:29:52,509 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 23:29:52,510 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 23:29:52,511 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 23:29:52,511 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-01 23:29:52,544 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 23:29:52,544 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 23:29:52,547 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 23:29:52,547 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 23:29:52,547 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 23:29:52,547 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 23:29:52,547 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 23:29:52,547 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 23:29:52,548 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 23:29:52,548 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 23:29:52,548 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 23:29:52,548 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 23:29:52,548 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 23:29:52,548 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 23:29:52,549 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 23:29:52,550 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 23:29:52,550 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 23:29:52,550 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 23:29:52,550 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 23:29:52,550 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 23:29:52,550 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 23:29:52,551 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 23:29:52,551 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 23:29:52,551 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 23:29:52,551 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 23:29:52,551 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 23:29:52,551 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 23:29:52,553 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 23:29:52,553 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 23:29:52,553 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 23:29:52,553 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 23:29:52,554 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 23:29:52,555 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 -> 305a50bda12d169f081444c4c552f1d03e30aa2d [2019-01-01 23:29:52,610 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 23:29:52,626 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 23:29:52,633 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 23:29:52,635 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 23:29:52,635 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 23:29:52,636 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/email_spec8_product28_true-unreach-call_true-termination.cil.c [2019-01-01 23:29:52,697 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/daafad642/b2bf93daa6da4ab3a4cc59daa7bfe878/FLAG05764d2c3 [2019-01-01 23:29:53,319 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 23:29:53,320 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/email_spec8_product28_true-unreach-call_true-termination.cil.c [2019-01-01 23:29:53,343 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/daafad642/b2bf93daa6da4ab3a4cc59daa7bfe878/FLAG05764d2c3 [2019-01-01 23:29:53,523 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/daafad642/b2bf93daa6da4ab3a4cc59daa7bfe878 [2019-01-01 23:29:53,528 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 23:29:53,530 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 23:29:53,531 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 23:29:53,531 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 23:29:53,535 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 23:29:53,537 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 11:29:53" (1/1) ... [2019-01-01 23:29:53,540 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e2f0de4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:29:53, skipping insertion in model container [2019-01-01 23:29:53,540 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 11:29:53" (1/1) ... [2019-01-01 23:29:53,549 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 23:29:53,637 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 23:29:54,384 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 23:29:54,421 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 23:29:54,713 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 23:29:54,804 INFO L195 MainTranslator]: Completed translation [2019-01-01 23:29:54,805 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:29:54 WrapperNode [2019-01-01 23:29:54,806 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 23:29:54,807 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 23:29:54,808 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 23:29:54,808 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 23:29:54,820 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:29:54" (1/1) ... [2019-01-01 23:29:54,852 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:29:54" (1/1) ... [2019-01-01 23:29:54,964 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 23:29:54,966 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 23:29:54,967 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 23:29:54,967 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 23:29:54,979 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:29:54" (1/1) ... [2019-01-01 23:29:54,979 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:29:54" (1/1) ... [2019-01-01 23:29:55,003 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:29:54" (1/1) ... [2019-01-01 23:29:55,004 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:29:54" (1/1) ... [2019-01-01 23:29:55,051 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:29:54" (1/1) ... [2019-01-01 23:29:55,075 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:29:54" (1/1) ... [2019-01-01 23:29:55,083 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:29:54" (1/1) ... [2019-01-01 23:29:55,096 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 23:29:55,096 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 23:29:55,096 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 23:29:55,096 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 23:29:55,097 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:29:54" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:29:55,188 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-01-01 23:29:55,188 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 23:29:55,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-01 23:29:55,189 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 23:29:55,189 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 23:29:58,940 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 23:29:58,941 INFO L280 CfgBuilder]: Removed 295 assue(true) statements. [2019-01-01 23:29:58,942 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:29:58 BoogieIcfgContainer [2019-01-01 23:29:58,942 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 23:29:58,942 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 23:29:58,943 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 23:29:58,947 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 23:29:58,949 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:29:58,949 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 11:29:53" (1/3) ... [2019-01-01 23:29:58,950 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@34446b69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 11:29:58, skipping insertion in model container [2019-01-01 23:29:58,951 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:29:58,952 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:29:54" (2/3) ... [2019-01-01 23:29:58,952 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@34446b69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 11:29:58, skipping insertion in model container [2019-01-01 23:29:58,952 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:29:58,952 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:29:58" (3/3) ... [2019-01-01 23:29:58,956 INFO L375 chiAutomizerObserver]: Analyzing ICFG email_spec8_product28_true-unreach-call_true-termination.cil.c [2019-01-01 23:29:59,023 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 23:29:59,024 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 23:29:59,024 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 23:29:59,024 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 23:29:59,024 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 23:29:59,024 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 23:29:59,025 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 23:29:59,025 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 23:29:59,025 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 23:29:59,064 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 475 states. [2019-01-01 23:29:59,120 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 208 [2019-01-01 23:29:59,120 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:29:59,120 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:29:59,131 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:29:59,131 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-01 23:29:59,131 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 23:29:59,131 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 475 states. [2019-01-01 23:29:59,150 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 208 [2019-01-01 23:29:59,150 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:29:59,150 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:29:59,153 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:29:59,153 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-01 23:29:59,167 INFO L794 eck$LassoCheckResult]: Stem: 296#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~__SELECTED_FEATURE_Base~0 := 0;~__SELECTED_FEATURE_Keys~0 := 0;~__SELECTED_FEATURE_Encrypt~0 := 0;~__SELECTED_FEATURE_AutoResponder~0 := 0;~__SELECTED_FEATURE_AddressBook~0 := 0;~__SELECTED_FEATURE_Sign~0 := 0;~__SELECTED_FEATURE_Forward~0 := 0;~__SELECTED_FEATURE_Verify~0 := 0;~__SELECTED_FEATURE_Decrypt~0 := 0;~__GUIDSL_ROOT_PRODUCTION~0 := 0;~__GUIDSL_NON_TERMINAL_main~0 := 0;call #t~string13.base, #t~string13.offset := #Ultimate.allocOnStack(10);call #t~string16.base, #t~string16.offset := #Ultimate.allocOnStack(12);call #t~string19.base, #t~string19.offset := #Ultimate.allocOnStack(10);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(18);call #t~string25.base, #t~string25.offset := #Ultimate.allocOnStack(16);call #t~string28.base, #t~string28.offset := #Ultimate.allocOnStack(21);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(13);call #t~string34.base, #t~string34.offset := #Ultimate.allocOnStack(16);call #t~string37.base, #t~string37.offset := #Ultimate.allocOnStack(25);call #t~string41.base, #t~string41.offset := #Ultimate.allocOnStack(4);call write~init~int(37, #t~string41.base, #t~string41.offset, 1);call write~init~int(115, #t~string41.base, 1 + #t~string41.offset, 1);call write~init~int(10, #t~string41.base, 2 + #t~string41.offset, 1);call write~init~int(0, #t~string41.base, 3 + #t~string41.offset, 1);~in_encrypted~0 := 0;call #t~string43.base, #t~string43.offset := #Ultimate.allocOnStack(17);call #t~string46.base, #t~string46.offset := #Ultimate.allocOnStack(17);call #t~string48.base, #t~string48.offset := #Ultimate.allocOnStack(13);call #t~string50.base, #t~string50.offset := #Ultimate.allocOnStack(17);~__ste_Email_counter~0 := 0;~__ste_email_id0~0 := 0;~__ste_email_id1~0 := 0;~__ste_email_from0~0 := 0;~__ste_email_from1~0 := 0;~__ste_email_to0~0 := 0;~__ste_email_to1~0 := 0;~__ste_email_subject0~0.base, ~__ste_email_subject0~0.offset := 0, 0;~__ste_email_subject1~0.base, ~__ste_email_subject1~0.offset := 0, 0;~__ste_email_body0~0.base, ~__ste_email_body0~0.offset := 0, 0;~__ste_email_body1~0.base, ~__ste_email_body1~0.offset := 0, 0;~__ste_email_isEncrypted0~0 := 0;~__ste_email_isEncrypted1~0 := 0;~__ste_email_encryptionKey0~0 := 0;~__ste_email_encryptionKey1~0 := 0;~__ste_email_isSigned0~0 := 0;~__ste_email_isSigned1~0 := 0;~__ste_email_signKey0~0 := 0;~__ste_email_signKey1~0 := 0;~__ste_email_isSignatureVerified0~0 := 0;~__ste_email_isSignatureVerified1~0 := 0;~head~0.base, ~head~0.offset := 0, 0;call #t~string71.base, #t~string71.offset := #Ultimate.allocOnStack(30);call #t~string72.base, #t~string72.offset := #Ultimate.allocOnStack(9);call #t~string73.base, #t~string73.offset := #Ultimate.allocOnStack(21);call #t~string74.base, #t~string74.offset := #Ultimate.allocOnStack(30);call #t~string75.base, #t~string75.offset := #Ultimate.allocOnStack(9);call #t~string76.base, #t~string76.offset := #Ultimate.allocOnStack(21);call #t~string80.base, #t~string80.offset := #Ultimate.allocOnStack(30);call #t~string81.base, #t~string81.offset := #Ultimate.allocOnStack(9);call #t~string82.base, #t~string82.offset := #Ultimate.allocOnStack(25);call #t~string83.base, #t~string83.offset := #Ultimate.allocOnStack(30);call #t~string84.base, #t~string84.offset := #Ultimate.allocOnStack(9);call #t~string85.base, #t~string85.offset := #Ultimate.allocOnStack(25);~bob~0 := 0;~rjh~0 := 0;~chuck~0 := 0;call #t~string88.base, #t~string88.offset := #Ultimate.allocOnStack(44);call #t~string93.base, #t~string93.offset := #Ultimate.allocOnStack(44);call #t~string95.base, #t~string95.offset := #Ultimate.allocOnStack(9);call #t~string97.base, #t~string97.offset := #Ultimate.allocOnStack(9);call #t~string99.base, #t~string99.offset := #Ultimate.allocOnStack(11);call #t~string104.base, #t~string104.offset := #Ultimate.allocOnStack(19);call #t~string107.base, #t~string107.offset := #Ultimate.allocOnStack(4);call write~init~int(37, #t~string107.base, #t~string107.offset, 1);call write~init~int(100, #t~string107.base, 1 + #t~string107.offset, 1);call write~init~int(10, #t~string107.base, 2 + #t~string107.offset, 1);call write~init~int(0, #t~string107.base, 3 + #t~string107.offset, 1);call #t~string110.base, #t~string110.offset := #Ultimate.allocOnStack(4);call write~init~int(37, #t~string110.base, #t~string110.offset, 1);call write~init~int(100, #t~string110.base, 1 + #t~string110.offset, 1);call write~init~int(10, #t~string110.base, 2 + #t~string110.offset, 1);call write~init~int(0, #t~string110.base, 3 + #t~string110.offset, 1);~queue_empty~0 := 1;~queued_message~0 := 0;~queued_client~0 := 0;call #t~string117.base, #t~string117.offset := #Ultimate.allocOnStack(10);call #t~string123.base, #t~string123.offset := #Ultimate.allocOnStack(16);call #t~string131.base, #t~string131.offset := #Ultimate.allocOnStack(20);~__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; 236#L-1true havoc main_#res;havoc main_#t~nondet101, main_#t~ret102, main_~retValue_acc~21, main_~tmp~11;main_~retValue_acc~21 := main_#t~nondet101;havoc main_#t~nondet101;havoc main_~tmp~11; 267#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; 390#L83true main_#t~ret102 := valid_product_#res;main_~tmp~11 := main_#t~ret102;havoc main_#t~ret102; 455#L1450true assume 0 != main_~tmp~11;havoc setup_#t~nondet96, setup_#t~nondet98, setup_#t~nondet100, 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; 286#L2951true assume 1 == setClientId_~handle;~__ste_client_idCounter0~0 := setClientId_~value; 387#L2957-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; 98#L2516true assume 1 == setClientPrivateKey_~handle;~__ste_client_privateKey0~0 := setClientPrivateKey_~value; 163#L2522-2true setup_~__cil_tmp1~0.base, setup_~__cil_tmp1~0.offset := #t~string95.base, #t~string95.offset;havoc setup_#t~nondet96;~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; 290#L2951-2true assume 1 == setClientId_~handle;~__ste_client_idCounter0~0 := setClientId_~value; 374#L2957-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; 102#L2516-2true assume 1 == setClientPrivateKey_~handle;~__ste_client_privateKey0~0 := setClientPrivateKey_~value; 165#L2522-5true setup_~__cil_tmp2~1.base, setup_~__cil_tmp2~1.offset := #t~string97.base, #t~string97.offset;havoc setup_#t~nondet98;~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; 272#L2951-4true assume 1 == setClientId_~handle;~__ste_client_idCounter0~0 := setClientId_~value; 382#L2957-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; 109#L2516-4true assume 1 == setClientPrivateKey_~handle;~__ste_client_privateKey0~0 := setClientPrivateKey_~value; 152#L2522-8true setup_~__cil_tmp3~4.base, setup_~__cil_tmp3~4.offset := #t~string99.base, #t~string99.offset;havoc setup_#t~nondet100; 100#L1437true havoc test_#t~nondet1, test_#t~nondet2, test_#t~nondet3, test_#t~nondet4, test_#t~nondet5, test_#t~nondet6, test_#t~nondet7, test_#t~nondet8, test_#t~nondet9, test_#t~nondet10, test_#t~nondet11, 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~0, test_~tmp___0~0, test_~tmp___1~0, test_~tmp___2~0, test_~tmp___3~0, test_~tmp___4~0, test_~tmp___5~0, test_~tmp___6~0, test_~tmp___7~0, test_~tmp___8~0, test_~tmp___9~0;havoc test_~op1~0;havoc test_~op2~0;havoc test_~op3~0;havoc test_~op4~0;havoc test_~op5~0;havoc test_~op6~0;havoc test_~op7~0;havoc test_~op8~0;havoc test_~op9~0;havoc test_~op10~0;havoc test_~op11~0;havoc test_~splverifierCounter~0;havoc test_~tmp~0;havoc test_~tmp___0~0;havoc test_~tmp___1~0;havoc test_~tmp___2~0;havoc test_~tmp___3~0;havoc test_~tmp___4~0;havoc test_~tmp___5~0;havoc test_~tmp___6~0;havoc test_~tmp___7~0;havoc test_~tmp___8~0;havoc test_~tmp___9~0;test_~op1~0 := 0;test_~op2~0 := 0;test_~op3~0 := 0;test_~op4~0 := 0;test_~op5~0 := 0;test_~op6~0 := 0;test_~op7~0 := 0;test_~op8~0 := 0;test_~op9~0 := 0;test_~op10~0 := 0;test_~op11~0 := 0;test_~splverifierCounter~0 := 0; 183#L278-1true [2019-01-01 23:29:59,173 INFO L796 eck$LassoCheckResult]: Loop: 183#L278-1true assume !false; 25#L136true assume test_~splverifierCounter~0 < 4; 120#L137true test_~splverifierCounter~0 := 1 + test_~splverifierCounter~0; 292#L143true assume !(0 == test_~op1~0); 232#L156true assume 0 == test_~op2~0;test_~tmp___8~0 := test_#t~nondet2;havoc test_#t~nondet2; 337#L161true assume 0 != test_~tmp___8~0;test_~op2~0 := 1; 183#L278-1true [2019-01-01 23:29:59,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:29:59,182 INFO L82 PathProgramCache]: Analyzing trace with hash 1291925977, now seen corresponding path program 1 times [2019-01-01 23:29:59,184 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:29:59,184 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:29:59,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:29:59,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:29:59,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:29:59,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:29:59,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:29:59,642 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:29:59,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 23:29:59,647 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 23:29:59,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:29:59,648 INFO L82 PathProgramCache]: Analyzing trace with hash 590492675, now seen corresponding path program 1 times [2019-01-01 23:29:59,648 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:29:59,648 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:29:59,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:29:59,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:29:59,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:29:59,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:29:59,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:29:59,827 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:29:59,828 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:29:59,828 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:29:59,828 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:29:59,828 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 23:29:59,829 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:29:59,829 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:29:59,829 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:29:59,829 INFO L131 ssoRankerPreferences]: Filename of dumped script: email_spec8_product28_true-unreach-call_true-termination.cil.c_Iteration1_Loop [2019-01-01 23:29:59,829 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:29:59,830 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:29:59,856 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:29:59,868 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:29:59,885 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:29:59,893 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:30:00,068 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2019-01-01 23:30:00,376 WARN L181 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-01-01 23:30:00,426 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:30:00,427 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:30:00,433 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:30:00,433 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:30:00,458 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:30:00,458 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_test_#t~nondet2=7, ULTIMATE.start_test_~tmp___8~0=7} Honda state: {ULTIMATE.start_test_#t~nondet2=7, ULTIMATE.start_test_~tmp___8~0=7} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:30:00,491 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:30:00,491 INFO L163 nArgumentSynthesizer]: Using integer mode. 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) [2019-01-01 23:30:00,524 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 23:30:00,524 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:30:00,545 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 23:30:00,576 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:30:00,576 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:30:00,576 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:30:00,578 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:30:00,578 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 23:30:00,579 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:30:00,579 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:30:00,579 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:30:00,581 INFO L131 ssoRankerPreferences]: Filename of dumped script: email_spec8_product28_true-unreach-call_true-termination.cil.c_Iteration1_Loop [2019-01-01 23:30:00,581 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:30:00,582 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:30:00,585 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:30:00,672 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:30:00,689 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:30:00,760 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:30:00,900 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-01-01 23:30:01,088 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:30:01,093 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 23:30:01,094 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:30:01,096 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:30:01,096 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:30:01,097 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:30:01,097 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:30:01,097 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:30:01,100 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:30:01,100 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:30:01,105 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 23:30:01,109 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 23:30:01,110 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-01 23:30:01,112 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 23:30:01,112 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 23:30:01,114 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 23:30:01,114 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_test_~op2~0) = -2*ULTIMATE.start_test_~op2~0 + 1 Supporting invariants [] [2019-01-01 23:30:01,116 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 23:30:01,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:30:01,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:30:01,449 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:30:01,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:30:01,502 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:30:01,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:30:01,673 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-01 23:30:01,676 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 475 states. Second operand 4 states. [2019-01-01 23:30:02,192 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 475 states.. Second operand 4 states. Result 2052 states and 3584 transitions. Complement of second has 7 states. [2019-01-01 23:30:02,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-01 23:30:02,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 23:30:02,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2020 transitions. [2019-01-01 23:30:02,209 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 2020 transitions. Stem has 18 letters. Loop has 6 letters. [2019-01-01 23:30:02,212 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:30:02,212 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 2020 transitions. Stem has 24 letters. Loop has 6 letters. [2019-01-01 23:30:02,213 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:30:02,214 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 2020 transitions. Stem has 18 letters. Loop has 12 letters. [2019-01-01 23:30:02,214 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:30:02,216 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2052 states and 3584 transitions. [2019-01-01 23:30:02,254 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 415 [2019-01-01 23:30:02,278 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2052 states to 863 states and 1568 transitions. [2019-01-01 23:30:02,280 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 446 [2019-01-01 23:30:02,282 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 447 [2019-01-01 23:30:02,282 INFO L73 IsDeterministic]: Start isDeterministic. Operand 863 states and 1568 transitions. [2019-01-01 23:30:02,284 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:30:02,284 INFO L705 BuchiCegarLoop]: Abstraction has 863 states and 1568 transitions. [2019-01-01 23:30:02,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 863 states and 1568 transitions. [2019-01-01 23:30:02,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 863 to 448. [2019-01-01 23:30:02,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2019-01-01 23:30:02,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 811 transitions. [2019-01-01 23:30:02,351 INFO L728 BuchiCegarLoop]: Abstraction has 448 states and 811 transitions. [2019-01-01 23:30:02,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 23:30:02,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 23:30:02,357 INFO L87 Difference]: Start difference. First operand 448 states and 811 transitions. Second operand 3 states. [2019-01-01 23:30:02,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:30:02,609 INFO L93 Difference]: Finished difference Result 876 states and 1587 transitions. [2019-01-01 23:30:02,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 23:30:02,611 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 876 states and 1587 transitions. [2019-01-01 23:30:02,619 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 416 [2019-01-01 23:30:02,627 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 876 states to 876 states and 1587 transitions. [2019-01-01 23:30:02,628 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 458 [2019-01-01 23:30:02,629 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 458 [2019-01-01 23:30:02,629 INFO L73 IsDeterministic]: Start isDeterministic. Operand 876 states and 1587 transitions. [2019-01-01 23:30:02,629 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:30:02,629 INFO L705 BuchiCegarLoop]: Abstraction has 876 states and 1587 transitions. [2019-01-01 23:30:02,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 876 states and 1587 transitions. [2019-01-01 23:30:02,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 876 to 447. [2019-01-01 23:30:02,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 447 states. [2019-01-01 23:30:02,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 807 transitions. [2019-01-01 23:30:02,648 INFO L728 BuchiCegarLoop]: Abstraction has 447 states and 807 transitions. [2019-01-01 23:30:02,648 INFO L608 BuchiCegarLoop]: Abstraction has 447 states and 807 transitions. [2019-01-01 23:30:02,648 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 23:30:02,648 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 447 states and 807 transitions. [2019-01-01 23:30:02,653 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 208 [2019-01-01 23:30:02,653 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:30:02,653 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:30:02,654 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:30:02,655 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:30:02,656 INFO L794 eck$LassoCheckResult]: Stem: 4189#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~__SELECTED_FEATURE_Base~0 := 0;~__SELECTED_FEATURE_Keys~0 := 0;~__SELECTED_FEATURE_Encrypt~0 := 0;~__SELECTED_FEATURE_AutoResponder~0 := 0;~__SELECTED_FEATURE_AddressBook~0 := 0;~__SELECTED_FEATURE_Sign~0 := 0;~__SELECTED_FEATURE_Forward~0 := 0;~__SELECTED_FEATURE_Verify~0 := 0;~__SELECTED_FEATURE_Decrypt~0 := 0;~__GUIDSL_ROOT_PRODUCTION~0 := 0;~__GUIDSL_NON_TERMINAL_main~0 := 0;call #t~string13.base, #t~string13.offset := #Ultimate.allocOnStack(10);call #t~string16.base, #t~string16.offset := #Ultimate.allocOnStack(12);call #t~string19.base, #t~string19.offset := #Ultimate.allocOnStack(10);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(18);call #t~string25.base, #t~string25.offset := #Ultimate.allocOnStack(16);call #t~string28.base, #t~string28.offset := #Ultimate.allocOnStack(21);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(13);call #t~string34.base, #t~string34.offset := #Ultimate.allocOnStack(16);call #t~string37.base, #t~string37.offset := #Ultimate.allocOnStack(25);call #t~string41.base, #t~string41.offset := #Ultimate.allocOnStack(4);call write~init~int(37, #t~string41.base, #t~string41.offset, 1);call write~init~int(115, #t~string41.base, 1 + #t~string41.offset, 1);call write~init~int(10, #t~string41.base, 2 + #t~string41.offset, 1);call write~init~int(0, #t~string41.base, 3 + #t~string41.offset, 1);~in_encrypted~0 := 0;call #t~string43.base, #t~string43.offset := #Ultimate.allocOnStack(17);call #t~string46.base, #t~string46.offset := #Ultimate.allocOnStack(17);call #t~string48.base, #t~string48.offset := #Ultimate.allocOnStack(13);call #t~string50.base, #t~string50.offset := #Ultimate.allocOnStack(17);~__ste_Email_counter~0 := 0;~__ste_email_id0~0 := 0;~__ste_email_id1~0 := 0;~__ste_email_from0~0 := 0;~__ste_email_from1~0 := 0;~__ste_email_to0~0 := 0;~__ste_email_to1~0 := 0;~__ste_email_subject0~0.base, ~__ste_email_subject0~0.offset := 0, 0;~__ste_email_subject1~0.base, ~__ste_email_subject1~0.offset := 0, 0;~__ste_email_body0~0.base, ~__ste_email_body0~0.offset := 0, 0;~__ste_email_body1~0.base, ~__ste_email_body1~0.offset := 0, 0;~__ste_email_isEncrypted0~0 := 0;~__ste_email_isEncrypted1~0 := 0;~__ste_email_encryptionKey0~0 := 0;~__ste_email_encryptionKey1~0 := 0;~__ste_email_isSigned0~0 := 0;~__ste_email_isSigned1~0 := 0;~__ste_email_signKey0~0 := 0;~__ste_email_signKey1~0 := 0;~__ste_email_isSignatureVerified0~0 := 0;~__ste_email_isSignatureVerified1~0 := 0;~head~0.base, ~head~0.offset := 0, 0;call #t~string71.base, #t~string71.offset := #Ultimate.allocOnStack(30);call #t~string72.base, #t~string72.offset := #Ultimate.allocOnStack(9);call #t~string73.base, #t~string73.offset := #Ultimate.allocOnStack(21);call #t~string74.base, #t~string74.offset := #Ultimate.allocOnStack(30);call #t~string75.base, #t~string75.offset := #Ultimate.allocOnStack(9);call #t~string76.base, #t~string76.offset := #Ultimate.allocOnStack(21);call #t~string80.base, #t~string80.offset := #Ultimate.allocOnStack(30);call #t~string81.base, #t~string81.offset := #Ultimate.allocOnStack(9);call #t~string82.base, #t~string82.offset := #Ultimate.allocOnStack(25);call #t~string83.base, #t~string83.offset := #Ultimate.allocOnStack(30);call #t~string84.base, #t~string84.offset := #Ultimate.allocOnStack(9);call #t~string85.base, #t~string85.offset := #Ultimate.allocOnStack(25);~bob~0 := 0;~rjh~0 := 0;~chuck~0 := 0;call #t~string88.base, #t~string88.offset := #Ultimate.allocOnStack(44);call #t~string93.base, #t~string93.offset := #Ultimate.allocOnStack(44);call #t~string95.base, #t~string95.offset := #Ultimate.allocOnStack(9);call #t~string97.base, #t~string97.offset := #Ultimate.allocOnStack(9);call #t~string99.base, #t~string99.offset := #Ultimate.allocOnStack(11);call #t~string104.base, #t~string104.offset := #Ultimate.allocOnStack(19);call #t~string107.base, #t~string107.offset := #Ultimate.allocOnStack(4);call write~init~int(37, #t~string107.base, #t~string107.offset, 1);call write~init~int(100, #t~string107.base, 1 + #t~string107.offset, 1);call write~init~int(10, #t~string107.base, 2 + #t~string107.offset, 1);call write~init~int(0, #t~string107.base, 3 + #t~string107.offset, 1);call #t~string110.base, #t~string110.offset := #Ultimate.allocOnStack(4);call write~init~int(37, #t~string110.base, #t~string110.offset, 1);call write~init~int(100, #t~string110.base, 1 + #t~string110.offset, 1);call write~init~int(10, #t~string110.base, 2 + #t~string110.offset, 1);call write~init~int(0, #t~string110.base, 3 + #t~string110.offset, 1);~queue_empty~0 := 1;~queued_message~0 := 0;~queued_client~0 := 0;call #t~string117.base, #t~string117.offset := #Ultimate.allocOnStack(10);call #t~string123.base, #t~string123.offset := #Ultimate.allocOnStack(16);call #t~string131.base, #t~string131.offset := #Ultimate.allocOnStack(20);~__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; 3966#L-1 havoc main_#res;havoc main_#t~nondet101, main_#t~ret102, main_~retValue_acc~21, main_~tmp~11;main_~retValue_acc~21 := main_#t~nondet101;havoc main_#t~nondet101;havoc main_~tmp~11; 3967#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; 4095#L83 main_#t~ret102 := valid_product_#res;main_~tmp~11 := main_#t~ret102;havoc main_#t~ret102; 4345#L1450 assume 0 != main_~tmp~11;havoc setup_#t~nondet96, setup_#t~nondet98, setup_#t~nondet100, 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; 4163#L2951 assume 1 == setClientId_~handle;~__ste_client_idCounter0~0 := setClientId_~value; 4164#L2957-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; 4160#L2516 assume 1 == setClientPrivateKey_~handle;~__ste_client_privateKey0~0 := setClientPrivateKey_~value; 4161#L2522-2 setup_~__cil_tmp1~0.base, setup_~__cil_tmp1~0.offset := #t~string95.base, #t~string95.offset;havoc setup_#t~nondet96;~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; 4175#L2951-2 assume !(1 == setClientId_~handle); 4106#L2954-2 assume 2 == setClientId_~handle;~__ste_client_idCounter1~0 := setClientId_~value; 4107#L2957-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; 4168#L2516-2 assume 1 == setClientPrivateKey_~handle;~__ste_client_privateKey0~0 := setClientPrivateKey_~value; 4169#L2522-5 setup_~__cil_tmp2~1.base, setup_~__cil_tmp2~1.offset := #t~string97.base, #t~string97.offset;havoc setup_#t~nondet98;~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; 4151#L2951-4 assume 1 == setClientId_~handle;~__ste_client_idCounter0~0 := setClientId_~value; 4114#L2957-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; 4176#L2516-4 assume 1 == setClientPrivateKey_~handle;~__ste_client_privateKey0~0 := setClientPrivateKey_~value; 4091#L2522-8 setup_~__cil_tmp3~4.base, setup_~__cil_tmp3~4.offset := #t~string99.base, #t~string99.offset;havoc setup_#t~nondet100; 4166#L1437 havoc test_#t~nondet1, test_#t~nondet2, test_#t~nondet3, test_#t~nondet4, test_#t~nondet5, test_#t~nondet6, test_#t~nondet7, test_#t~nondet8, test_#t~nondet9, test_#t~nondet10, test_#t~nondet11, 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~0, test_~tmp___0~0, test_~tmp___1~0, test_~tmp___2~0, test_~tmp___3~0, test_~tmp___4~0, test_~tmp___5~0, test_~tmp___6~0, test_~tmp___7~0, test_~tmp___8~0, test_~tmp___9~0;havoc test_~op1~0;havoc test_~op2~0;havoc test_~op3~0;havoc test_~op4~0;havoc test_~op5~0;havoc test_~op6~0;havoc test_~op7~0;havoc test_~op8~0;havoc test_~op9~0;havoc test_~op10~0;havoc test_~op11~0;havoc test_~splverifierCounter~0;havoc test_~tmp~0;havoc test_~tmp___0~0;havoc test_~tmp___1~0;havoc test_~tmp___2~0;havoc test_~tmp___3~0;havoc test_~tmp___4~0;havoc test_~tmp___5~0;havoc test_~tmp___6~0;havoc test_~tmp___7~0;havoc test_~tmp___8~0;havoc test_~tmp___9~0;test_~op1~0 := 0;test_~op2~0 := 0;test_~op3~0 := 0;test_~op4~0 := 0;test_~op5~0 := 0;test_~op6~0 := 0;test_~op7~0 := 0;test_~op8~0 := 0;test_~op9~0 := 0;test_~op10~0 := 0;test_~op11~0 := 0;test_~splverifierCounter~0 := 0; 4167#L278-1 assume !false; 3972#L136 [2019-01-01 23:30:02,656 INFO L796 eck$LassoCheckResult]: Loop: 3972#L136 assume test_~splverifierCounter~0 < 4; 3973#L137 test_~splverifierCounter~0 := 1 + test_~splverifierCounter~0; 4177#L143 assume !(0 == test_~op1~0); 3978#L156 assume !(0 == test_~op2~0); 4263#L167 assume 0 == test_~op3~0;test_~tmp___7~0 := test_#t~nondet3;havoc test_#t~nondet3; 4271#L172 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; 4152#L2516-6 assume 1 == setClientPrivateKey_~handle;~__ste_client_privateKey0~0 := setClientPrivateKey_~value; 4116#L2522-11 test_~op3~0 := 1; 4250#L278-1 assume !false; 3972#L136 [2019-01-01 23:30:02,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:30:02,656 INFO L82 PathProgramCache]: Analyzing trace with hash -953559564, now seen corresponding path program 1 times [2019-01-01 23:30:02,656 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:30:02,657 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:30:02,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:30:02,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:30:02,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:30:02,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:30:02,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:30:02,985 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:30:02,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 23:30:02,985 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 23:30:02,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:30:02,986 INFO L82 PathProgramCache]: Analyzing trace with hash -1296812605, now seen corresponding path program 1 times [2019-01-01 23:30:02,986 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:30:02,986 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:30:02,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:30:02,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:30:02,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:30:02,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:30:02,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:30:03,302 WARN L181 SmtUtils]: Spent 293.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2019-01-01 23:30:03,379 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:30:03,379 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:30:03,380 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:30:03,380 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:30:03,380 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 23:30:03,380 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:30:03,381 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:30:03,381 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:30:03,381 INFO L131 ssoRankerPreferences]: Filename of dumped script: email_spec8_product28_true-unreach-call_true-termination.cil.c_Iteration2_Loop [2019-01-01 23:30:03,381 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:30:03,381 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:30:03,384 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:30:03,411 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:30:03,414 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:30:03,437 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:30:03,442 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:30:03,446 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:30:03,453 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:30:03,771 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:30:03,771 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:30:03,779 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:30:03,779 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:30:03,825 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 23:30:03,825 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:30:03,846 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 23:30:03,849 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:30:03,849 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:30:03,849 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:30:03,849 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:30:03,849 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 23:30:03,850 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:30:03,850 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:30:03,850 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:30:03,850 INFO L131 ssoRankerPreferences]: Filename of dumped script: email_spec8_product28_true-unreach-call_true-termination.cil.c_Iteration2_Loop [2019-01-01 23:30:03,850 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:30:03,850 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:30:03,852 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:30:03,877 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:30:03,976 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:30:04,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-01 23:30:04,083 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:30:04,087 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:30:04,094 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:30:04,249 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:30:04,250 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 23:30:04,250 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:30:04,252 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:30:04,252 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:30:04,253 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:30:04,253 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:30:04,253 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:30:04,254 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:30:04,255 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:30:04,258 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 23:30:04,261 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 23:30:04,262 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-01 23:30:04,262 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 23:30:04,262 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 23:30:04,262 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 23:30:04,263 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_test_~splverifierCounter~0) = -2*ULTIMATE.start_test_~splverifierCounter~0 + 7 Supporting invariants [] [2019-01-01 23:30:04,263 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 23:30:04,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:30:04,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:30:04,498 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:30:04,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:30:04,535 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:30:04,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:30:04,722 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-01-01 23:30:04,722 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 447 states and 807 transitions. cyclomatic complexity: 362 Second operand 4 states. [2019-01-01 23:30:04,809 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 447 states and 807 transitions. cyclomatic complexity: 362. Second operand 4 states. Result 867 states and 1573 transitions. Complement of second has 6 states. [2019-01-01 23:30:04,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-01 23:30:04,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 23:30:04,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 426 transitions. [2019-01-01 23:30:04,812 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 426 transitions. Stem has 20 letters. Loop has 9 letters. [2019-01-01 23:30:04,813 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:30:04,813 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 426 transitions. Stem has 29 letters. Loop has 9 letters. [2019-01-01 23:30:04,813 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:30:04,814 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 426 transitions. Stem has 20 letters. Loop has 18 letters. [2019-01-01 23:30:04,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:30:04,815 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 867 states and 1573 transitions. [2019-01-01 23:30:04,824 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 23:30:04,824 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 867 states to 0 states and 0 transitions. [2019-01-01 23:30:04,824 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 23:30:04,824 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 23:30:04,825 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 23:30:04,826 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:30:04,826 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 23:30:04,826 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 23:30:04,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 23:30:04,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 23:30:04,826 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 5 states. [2019-01-01 23:30:04,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:30:04,828 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-01-01 23:30:04,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-01 23:30:04,828 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2019-01-01 23:30:04,828 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 23:30:04,829 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2019-01-01 23:30:04,829 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 23:30:04,829 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 23:30:04,829 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 23:30:04,829 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:30:04,829 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 23:30:04,829 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 23:30:04,829 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 23:30:04,830 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 23:30:04,832 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-01 23:30:04,832 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 23:30:04,833 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-01 23:30:04,841 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 11:30:04 BoogieIcfgContainer [2019-01-01 23:30:04,841 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 23:30:04,842 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 23:30:04,842 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 23:30:04,842 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 23:30:04,842 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:29:58" (3/4) ... [2019-01-01 23:30:04,848 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-01 23:30:04,848 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 23:30:04,850 INFO L168 Benchmark]: Toolchain (without parser) took 11320.43 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 242.7 MB). Free memory was 946.0 MB in the beginning and 941.9 MB in the end (delta: 4.1 MB). Peak memory consumption was 246.8 MB. Max. memory is 11.5 GB. [2019-01-01 23:30:04,853 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 23:30:04,853 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1275.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.1 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -165.9 MB). Peak memory consumption was 45.7 MB. Max. memory is 11.5 GB. [2019-01-01 23:30:04,855 INFO L168 Benchmark]: Boogie Procedure Inliner took 159.22 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-01-01 23:30:04,856 INFO L168 Benchmark]: Boogie Preprocessor took 129.44 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-01-01 23:30:04,857 INFO L168 Benchmark]: RCFGBuilder took 3845.91 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 884.8 MB in the end (delta: 213.4 MB). Peak memory consumption was 213.4 MB. Max. memory is 11.5 GB. [2019-01-01 23:30:04,858 INFO L168 Benchmark]: BuchiAutomizer took 5898.90 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 88.6 MB). Free memory was 884.8 MB in the beginning and 949.9 MB in the end (delta: -65.2 MB). Peak memory consumption was 23.4 MB. Max. memory is 11.5 GB. [2019-01-01 23:30:04,860 INFO L168 Benchmark]: Witness Printer took 6.21 ms. Allocated memory is still 1.3 GB. Free memory is still 941.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 23:30:04,865 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1275.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.1 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -165.9 MB). Peak memory consumption was 45.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 159.22 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 129.44 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 3845.91 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 884.8 MB in the end (delta: 213.4 MB). Peak memory consumption was 213.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5898.90 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 88.6 MB). Free memory was 884.8 MB in the beginning and 949.9 MB in the end (delta: -65.2 MB). Peak memory consumption was 23.4 MB. Max. memory is 11.5 GB. * Witness Printer took 6.21 ms. Allocated memory is still 1.3 GB. Free memory is still 941.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (2 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * op2 + 1 and consists of 5 locations. One deterministic module has affine ranking function -2 * splverifierCounter + 7 and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.8s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 3.6s. Construction of modules took 0.3s. Büchi inclusion checks took 1.5s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 844 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 447 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 2848 SDtfs, 2436 SDslu, 3485 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: sat Degree: 0 Time: 19ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 1 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...