./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/product-lines/email_spec8_product12.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_82b3d1c6-00b3-4f1e-819f-a2c12e5f8b31/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_82b3d1c6-00b3-4f1e-819f-a2c12e5f8b31/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_82b3d1c6-00b3-4f1e-819f-a2c12e5f8b31/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_82b3d1c6-00b3-4f1e-819f-a2c12e5f8b31/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/product-lines/email_spec8_product12.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_82b3d1c6-00b3-4f1e-819f-a2c12e5f8b31/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_82b3d1c6-00b3-4f1e-819f-a2c12e5f8b31/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 68e1564ec6b4d8b9d1c0e23b5ae3619ad45b11fd ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 11:23:35,735 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 11:23:35,737 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 11:23:35,747 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 11:23:35,747 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 11:23:35,748 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 11:23:35,750 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 11:23:35,751 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 11:23:35,753 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 11:23:35,754 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 11:23:35,754 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 11:23:35,756 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 11:23:35,756 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 11:23:35,757 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 11:23:35,757 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 11:23:35,758 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 11:23:35,759 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 11:23:35,760 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 11:23:35,761 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 11:23:35,763 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 11:23:35,764 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 11:23:35,765 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 11:23:35,766 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 11:23:35,767 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 11:23:35,769 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 11:23:35,770 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 11:23:35,770 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 11:23:35,771 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 11:23:35,771 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 11:23:35,772 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 11:23:35,772 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 11:23:35,773 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 11:23:35,774 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 11:23:35,774 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 11:23:35,775 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 11:23:35,776 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 11:23:35,776 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 11:23:35,776 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 11:23:35,777 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 11:23:35,778 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 11:23:35,778 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 11:23:35,786 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_82b3d1c6-00b3-4f1e-819f-a2c12e5f8b31/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-10-22 11:23:35,799 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 11:23:35,799 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 11:23:35,800 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-22 11:23:35,800 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-22 11:23:35,800 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-22 11:23:35,801 INFO L138 SettingsManager]: * Explicit value domain=true [2019-10-22 11:23:35,801 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-10-22 11:23:35,801 INFO L138 SettingsManager]: * Octagon Domain=false [2019-10-22 11:23:35,801 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-10-22 11:23:35,801 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-10-22 11:23:35,801 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-10-22 11:23:35,802 INFO L138 SettingsManager]: * Interval Domain=false [2019-10-22 11:23:35,803 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 11:23:35,804 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 11:23:35,804 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 11:23:35,804 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 11:23:35,804 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 11:23:35,804 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 11:23:35,804 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 11:23:35,805 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 11:23:35,805 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 11:23:35,805 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 11:23:35,805 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 11:23:35,805 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 11:23:35,806 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 11:23:35,806 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 11:23:35,806 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 11:23:35,806 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:23:35,806 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 11:23:35,806 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 11:23:35,807 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 11:23:35,807 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-22 11:23:35,807 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 11:23:35,807 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 11:23:35,807 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-22 11:23:35,807 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_82b3d1c6-00b3-4f1e-819f-a2c12e5f8b31/bin/utaipan 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(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan 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 -> 68e1564ec6b4d8b9d1c0e23b5ae3619ad45b11fd [2019-10-22 11:23:35,849 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 11:23:35,864 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 11:23:35,869 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 11:23:35,872 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 11:23:35,872 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 11:23:35,873 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_82b3d1c6-00b3-4f1e-819f-a2c12e5f8b31/bin/utaipan/../../sv-benchmarks/c/product-lines/email_spec8_product12.cil.c [2019-10-22 11:23:35,929 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_82b3d1c6-00b3-4f1e-819f-a2c12e5f8b31/bin/utaipan/data/141cdec45/db311aac150e4084b20880b9850739dd/FLAG2b1de010e [2019-10-22 11:23:36,489 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 11:23:36,492 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_82b3d1c6-00b3-4f1e-819f-a2c12e5f8b31/sv-benchmarks/c/product-lines/email_spec8_product12.cil.c [2019-10-22 11:23:36,515 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_82b3d1c6-00b3-4f1e-819f-a2c12e5f8b31/bin/utaipan/data/141cdec45/db311aac150e4084b20880b9850739dd/FLAG2b1de010e [2019-10-22 11:23:36,666 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_82b3d1c6-00b3-4f1e-819f-a2c12e5f8b31/bin/utaipan/data/141cdec45/db311aac150e4084b20880b9850739dd [2019-10-22 11:23:36,668 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 11:23:36,669 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 11:23:36,670 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 11:23:36,670 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 11:23:36,674 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 11:23:36,675 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:23:36" (1/1) ... [2019-10-22 11:23:36,678 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@795d9d0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:36, skipping insertion in model container [2019-10-22 11:23:36,678 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:23:36" (1/1) ... [2019-10-22 11:23:36,685 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 11:23:36,751 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 11:23:37,281 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:23:37,312 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 11:23:37,443 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:23:37,503 INFO L192 MainTranslator]: Completed translation [2019-10-22 11:23:37,504 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:37 WrapperNode [2019-10-22 11:23:37,504 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 11:23:37,505 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 11:23:37,505 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 11:23:37,505 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 11:23:37,515 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:37" (1/1) ... [2019-10-22 11:23:37,540 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:37" (1/1) ... [2019-10-22 11:23:37,640 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 11:23:37,641 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 11:23:37,641 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 11:23:37,641 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 11:23:37,651 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:37" (1/1) ... [2019-10-22 11:23:37,652 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:37" (1/1) ... [2019-10-22 11:23:37,660 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:37" (1/1) ... [2019-10-22 11:23:37,666 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:37" (1/1) ... [2019-10-22 11:23:37,701 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:37" (1/1) ... [2019-10-22 11:23:37,741 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:37" (1/1) ... [2019-10-22 11:23:37,746 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:37" (1/1) ... [2019-10-22 11:23:37,762 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 11:23:37,763 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 11:23:37,763 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 11:23:37,763 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 11:23:37,764 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:37" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_82b3d1c6-00b3-4f1e-819f-a2c12e5f8b31/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:23:37,834 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-10-22 11:23:37,834 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 11:23:37,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-22 11:23:37,838 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 11:23:37,838 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 11:23:39,534 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 11:23:39,534 INFO L284 CfgBuilder]: Removed 231 assume(true) statements. [2019-10-22 11:23:39,535 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:23:39 BoogieIcfgContainer [2019-10-22 11:23:39,535 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 11:23:39,536 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 11:23:39,536 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 11:23:39,540 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 11:23:39,540 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 11:23:36" (1/3) ... [2019-10-22 11:23:39,541 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@298b8a72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:23:39, skipping insertion in model container [2019-10-22 11:23:39,542 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:37" (2/3) ... [2019-10-22 11:23:39,544 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@298b8a72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:23:39, skipping insertion in model container [2019-10-22 11:23:39,544 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:23:39" (3/3) ... [2019-10-22 11:23:39,545 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec8_product12.cil.c [2019-10-22 11:23:39,555 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 11:23:39,566 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-10-22 11:23:39,578 INFO L249 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-10-22 11:23:39,606 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 11:23:39,606 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 11:23:39,606 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 11:23:39,606 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 11:23:39,606 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 11:23:39,607 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 11:23:39,607 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 11:23:39,607 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 11:23:39,632 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states. [2019-10-22 11:23:39,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-22 11:23:39,646 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:39,647 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:23:39,649 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:39,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:39,654 INFO L82 PathProgramCache]: Analyzing trace with hash 1406579473, now seen corresponding path program 1 times [2019-10-22 11:23:39,662 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:39,663 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253218568] [2019-10-22 11:23:39,663 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:39,663 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:39,663 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:39,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:39,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:23:39,937 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253218568] [2019-10-22 11:23:39,937 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:39,938 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:23:39,938 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291025180] [2019-10-22 11:23:39,942 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:23:39,943 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:39,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:23:39,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:23:39,956 INFO L87 Difference]: Start difference. First operand 383 states. Second operand 3 states. [2019-10-22 11:23:40,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:40,114 INFO L93 Difference]: Finished difference Result 1114 states and 1961 transitions. [2019-10-22 11:23:40,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:23:40,115 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-10-22 11:23:40,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:40,137 INFO L225 Difference]: With dead ends: 1114 [2019-10-22 11:23:40,142 INFO L226 Difference]: Without dead ends: 678 [2019-10-22 11:23:40,150 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:23:40,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 678 states. [2019-10-22 11:23:40,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 678 to 348. [2019-10-22 11:23:40,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2019-10-22 11:23:40,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 608 transitions. [2019-10-22 11:23:40,223 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 608 transitions. Word has length 41 [2019-10-22 11:23:40,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:40,224 INFO L462 AbstractCegarLoop]: Abstraction has 348 states and 608 transitions. [2019-10-22 11:23:40,224 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:23:40,224 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 608 transitions. [2019-10-22 11:23:40,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-22 11:23:40,226 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:40,226 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:23:40,226 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:40,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:40,226 INFO L82 PathProgramCache]: Analyzing trace with hash 1229064159, now seen corresponding path program 1 times [2019-10-22 11:23:40,227 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:40,227 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860551080] [2019-10-22 11:23:40,227 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:40,227 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:40,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:40,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:40,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:23:40,371 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860551080] [2019-10-22 11:23:40,372 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:40,372 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:23:40,372 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054483367] [2019-10-22 11:23:40,373 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:23:40,373 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:40,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:23:40,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:23:40,376 INFO L87 Difference]: Start difference. First operand 348 states and 608 transitions. Second operand 5 states. [2019-10-22 11:23:40,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:40,545 INFO L93 Difference]: Finished difference Result 993 states and 1740 transitions. [2019-10-22 11:23:40,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 11:23:40,545 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2019-10-22 11:23:40,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:40,548 INFO L225 Difference]: With dead ends: 993 [2019-10-22 11:23:40,549 INFO L226 Difference]: Without dead ends: 664 [2019-10-22 11:23:40,550 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-22 11:23:40,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2019-10-22 11:23:40,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 348. [2019-10-22 11:23:40,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2019-10-22 11:23:40,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 607 transitions. [2019-10-22 11:23:40,570 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 607 transitions. Word has length 43 [2019-10-22 11:23:40,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:40,570 INFO L462 AbstractCegarLoop]: Abstraction has 348 states and 607 transitions. [2019-10-22 11:23:40,570 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:23:40,571 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 607 transitions. [2019-10-22 11:23:40,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-22 11:23:40,572 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:40,572 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:23:40,572 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:40,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:40,573 INFO L82 PathProgramCache]: Analyzing trace with hash 1119354482, now seen corresponding path program 1 times [2019-10-22 11:23:40,573 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:40,573 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786174821] [2019-10-22 11:23:40,573 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:40,573 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:40,573 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:40,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:40,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:23:40,687 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786174821] [2019-10-22 11:23:40,688 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:40,688 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:23:40,688 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213480902] [2019-10-22 11:23:40,688 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:23:40,688 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:40,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:23:40,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:23:40,689 INFO L87 Difference]: Start difference. First operand 348 states and 607 transitions. Second operand 3 states. [2019-10-22 11:23:40,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:40,736 INFO L93 Difference]: Finished difference Result 678 states and 1188 transitions. [2019-10-22 11:23:40,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:23:40,738 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-10-22 11:23:40,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:40,739 INFO L225 Difference]: With dead ends: 678 [2019-10-22 11:23:40,739 INFO L226 Difference]: Without dead ends: 353 [2019-10-22 11:23:40,740 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:23:40,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2019-10-22 11:23:40,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 348. [2019-10-22 11:23:40,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2019-10-22 11:23:40,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 606 transitions. [2019-10-22 11:23:40,777 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 606 transitions. Word has length 44 [2019-10-22 11:23:40,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:40,778 INFO L462 AbstractCegarLoop]: Abstraction has 348 states and 606 transitions. [2019-10-22 11:23:40,778 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:23:40,778 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 606 transitions. [2019-10-22 11:23:40,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-22 11:23:40,779 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:40,780 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:23:40,780 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:40,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:40,780 INFO L82 PathProgramCache]: Analyzing trace with hash 529516012, now seen corresponding path program 1 times [2019-10-22 11:23:40,780 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:40,780 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470361710] [2019-10-22 11:23:40,781 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:40,781 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:40,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:40,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:40,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:23:40,837 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470361710] [2019-10-22 11:23:40,837 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:40,837 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:23:40,838 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628520827] [2019-10-22 11:23:40,838 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:23:40,838 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:40,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:23:40,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:23:40,839 INFO L87 Difference]: Start difference. First operand 348 states and 606 transitions. Second operand 3 states. [2019-10-22 11:23:40,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:40,881 INFO L93 Difference]: Finished difference Result 688 states and 1201 transitions. [2019-10-22 11:23:40,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:23:40,882 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2019-10-22 11:23:40,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:40,883 INFO L225 Difference]: With dead ends: 688 [2019-10-22 11:23:40,883 INFO L226 Difference]: Without dead ends: 348 [2019-10-22 11:23:40,884 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:23:40,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2019-10-22 11:23:40,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 348. [2019-10-22 11:23:40,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2019-10-22 11:23:40,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 604 transitions. [2019-10-22 11:23:40,897 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 604 transitions. Word has length 45 [2019-10-22 11:23:40,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:40,898 INFO L462 AbstractCegarLoop]: Abstraction has 348 states and 604 transitions. [2019-10-22 11:23:40,898 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:23:40,898 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 604 transitions. [2019-10-22 11:23:40,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-22 11:23:40,900 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:40,900 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:23:40,900 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:40,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:40,900 INFO L82 PathProgramCache]: Analyzing trace with hash -1405066185, now seen corresponding path program 1 times [2019-10-22 11:23:40,900 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:40,901 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325927460] [2019-10-22 11:23:40,901 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:40,901 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:40,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:40,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:41,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:23:41,002 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325927460] [2019-10-22 11:23:41,002 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:41,002 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:23:41,003 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724807078] [2019-10-22 11:23:41,003 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:23:41,003 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:41,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:23:41,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:23:41,004 INFO L87 Difference]: Start difference. First operand 348 states and 604 transitions. Second operand 5 states. [2019-10-22 11:23:41,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:41,150 INFO L93 Difference]: Finished difference Result 983 states and 1720 transitions. [2019-10-22 11:23:41,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:23:41,151 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2019-10-22 11:23:41,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:41,153 INFO L225 Difference]: With dead ends: 983 [2019-10-22 11:23:41,153 INFO L226 Difference]: Without dead ends: 662 [2019-10-22 11:23:41,157 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-22 11:23:41,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2019-10-22 11:23:41,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 348. [2019-10-22 11:23:41,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2019-10-22 11:23:41,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 603 transitions. [2019-10-22 11:23:41,172 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 603 transitions. Word has length 46 [2019-10-22 11:23:41,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:41,172 INFO L462 AbstractCegarLoop]: Abstraction has 348 states and 603 transitions. [2019-10-22 11:23:41,172 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:23:41,173 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 603 transitions. [2019-10-22 11:23:41,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-22 11:23:41,174 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:41,174 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:23:41,177 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:41,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:41,177 INFO L82 PathProgramCache]: Analyzing trace with hash 2127825844, now seen corresponding path program 1 times [2019-10-22 11:23:41,177 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:41,178 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628566932] [2019-10-22 11:23:41,178 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:41,178 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:41,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:41,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:41,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:23:41,276 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628566932] [2019-10-22 11:23:41,276 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:41,276 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:23:41,277 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114673851] [2019-10-22 11:23:41,277 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:23:41,277 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:41,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:23:41,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:23:41,278 INFO L87 Difference]: Start difference. First operand 348 states and 603 transitions. Second operand 5 states. [2019-10-22 11:23:41,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:41,425 INFO L93 Difference]: Finished difference Result 988 states and 1725 transitions. [2019-10-22 11:23:41,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:23:41,426 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-10-22 11:23:41,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:41,428 INFO L225 Difference]: With dead ends: 988 [2019-10-22 11:23:41,429 INFO L226 Difference]: Without dead ends: 667 [2019-10-22 11:23:41,429 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-22 11:23:41,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2019-10-22 11:23:41,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 348. [2019-10-22 11:23:41,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2019-10-22 11:23:41,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 602 transitions. [2019-10-22 11:23:41,446 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 602 transitions. Word has length 47 [2019-10-22 11:23:41,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:41,447 INFO L462 AbstractCegarLoop]: Abstraction has 348 states and 602 transitions. [2019-10-22 11:23:41,447 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:23:41,447 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 602 transitions. [2019-10-22 11:23:41,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-10-22 11:23:41,448 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:41,448 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:23:41,448 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:41,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:41,449 INFO L82 PathProgramCache]: Analyzing trace with hash 491431836, now seen corresponding path program 1 times [2019-10-22 11:23:41,449 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:41,449 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149154601] [2019-10-22 11:23:41,449 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:41,449 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:41,449 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:41,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:41,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:23:41,505 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149154601] [2019-10-22 11:23:41,505 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:41,505 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:23:41,506 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782304853] [2019-10-22 11:23:41,506 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:23:41,506 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:41,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:23:41,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:23:41,507 INFO L87 Difference]: Start difference. First operand 348 states and 602 transitions. Second operand 3 states. [2019-10-22 11:23:41,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:41,528 INFO L93 Difference]: Finished difference Result 462 states and 787 transitions. [2019-10-22 11:23:41,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:23:41,528 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2019-10-22 11:23:41,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:41,531 INFO L225 Difference]: With dead ends: 462 [2019-10-22 11:23:41,532 INFO L226 Difference]: Without dead ends: 351 [2019-10-22 11:23:41,532 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:23:41,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2019-10-22 11:23:41,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 350. [2019-10-22 11:23:41,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2019-10-22 11:23:41,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 604 transitions. [2019-10-22 11:23:41,584 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 604 transitions. Word has length 48 [2019-10-22 11:23:41,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:41,585 INFO L462 AbstractCegarLoop]: Abstraction has 350 states and 604 transitions. [2019-10-22 11:23:41,585 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:23:41,585 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 604 transitions. [2019-10-22 11:23:41,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-22 11:23:41,586 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:41,586 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:23:41,587 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:41,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:41,587 INFO L82 PathProgramCache]: Analyzing trace with hash -1357482402, now seen corresponding path program 1 times [2019-10-22 11:23:41,588 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:41,588 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467688898] [2019-10-22 11:23:41,588 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:41,588 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:41,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:41,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:41,671 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:23:41,671 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467688898] [2019-10-22 11:23:41,671 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:41,672 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:23:41,672 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830857910] [2019-10-22 11:23:41,672 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:23:41,672 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:41,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:23:41,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:23:41,673 INFO L87 Difference]: Start difference. First operand 350 states and 604 transitions. Second operand 3 states. [2019-10-22 11:23:41,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:41,717 INFO L93 Difference]: Finished difference Result 936 states and 1636 transitions. [2019-10-22 11:23:41,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:23:41,718 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-10-22 11:23:41,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:41,721 INFO L225 Difference]: With dead ends: 936 [2019-10-22 11:23:41,722 INFO L226 Difference]: Without dead ends: 617 [2019-10-22 11:23:41,723 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:23:41,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2019-10-22 11:23:41,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 506. [2019-10-22 11:23:41,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 506 states. [2019-10-22 11:23:41,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 890 transitions. [2019-10-22 11:23:41,749 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 890 transitions. Word has length 54 [2019-10-22 11:23:41,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:41,750 INFO L462 AbstractCegarLoop]: Abstraction has 506 states and 890 transitions. [2019-10-22 11:23:41,750 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:23:41,751 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 890 transitions. [2019-10-22 11:23:41,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-22 11:23:41,752 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:41,753 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:23:41,753 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:41,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:41,753 INFO L82 PathProgramCache]: Analyzing trace with hash -1913867361, now seen corresponding path program 1 times [2019-10-22 11:23:41,753 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:41,754 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524263383] [2019-10-22 11:23:41,754 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:41,754 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:41,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:41,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:41,869 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-22 11:23:41,869 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524263383] [2019-10-22 11:23:41,869 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:41,869 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-22 11:23:41,869 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779694712] [2019-10-22 11:23:41,870 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-22 11:23:41,871 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:41,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-22 11:23:41,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-22 11:23:41,872 INFO L87 Difference]: Start difference. First operand 506 states and 890 transitions. Second operand 9 states. [2019-10-22 11:23:42,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:42,926 INFO L93 Difference]: Finished difference Result 1553 states and 2649 transitions. [2019-10-22 11:23:42,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-22 11:23:42,927 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2019-10-22 11:23:42,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:42,932 INFO L225 Difference]: With dead ends: 1553 [2019-10-22 11:23:42,932 INFO L226 Difference]: Without dead ends: 1462 [2019-10-22 11:23:42,933 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2019-10-22 11:23:42,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1462 states. [2019-10-22 11:23:42,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1462 to 951. [2019-10-22 11:23:42,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 951 states. [2019-10-22 11:23:42,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 951 states to 951 states and 1691 transitions. [2019-10-22 11:23:42,998 INFO L78 Accepts]: Start accepts. Automaton has 951 states and 1691 transitions. Word has length 55 [2019-10-22 11:23:42,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:42,999 INFO L462 AbstractCegarLoop]: Abstraction has 951 states and 1691 transitions. [2019-10-22 11:23:42,999 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-22 11:23:42,999 INFO L276 IsEmpty]: Start isEmpty. Operand 951 states and 1691 transitions. [2019-10-22 11:23:43,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-22 11:23:43,000 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:43,000 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:23:43,001 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:43,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:43,001 INFO L82 PathProgramCache]: Analyzing trace with hash 299135132, now seen corresponding path program 1 times [2019-10-22 11:23:43,001 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:43,001 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013957458] [2019-10-22 11:23:43,002 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:43,002 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:43,002 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:43,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:43,074 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-22 11:23:43,074 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013957458] [2019-10-22 11:23:43,075 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:43,075 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:23:43,075 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502084864] [2019-10-22 11:23:43,075 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:23:43,075 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:43,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:23:43,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:23:43,076 INFO L87 Difference]: Start difference. First operand 951 states and 1691 transitions. Second operand 4 states. [2019-10-22 11:23:43,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:43,299 INFO L93 Difference]: Finished difference Result 1930 states and 3346 transitions. [2019-10-22 11:23:43,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:23:43,300 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2019-10-22 11:23:43,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:43,307 INFO L225 Difference]: With dead ends: 1930 [2019-10-22 11:23:43,307 INFO L226 Difference]: Without dead ends: 1780 [2019-10-22 11:23:43,308 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:23:43,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1780 states. [2019-10-22 11:23:43,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1780 to 1472. [2019-10-22 11:23:43,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1472 states. [2019-10-22 11:23:43,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1472 states to 1472 states and 2616 transitions. [2019-10-22 11:23:43,401 INFO L78 Accepts]: Start accepts. Automaton has 1472 states and 2616 transitions. Word has length 56 [2019-10-22 11:23:43,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:43,402 INFO L462 AbstractCegarLoop]: Abstraction has 1472 states and 2616 transitions. [2019-10-22 11:23:43,402 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:23:43,402 INFO L276 IsEmpty]: Start isEmpty. Operand 1472 states and 2616 transitions. [2019-10-22 11:23:43,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-22 11:23:43,404 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:43,404 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:23:43,404 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:43,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:43,405 INFO L82 PathProgramCache]: Analyzing trace with hash -287670882, now seen corresponding path program 1 times [2019-10-22 11:23:43,405 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:43,405 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773993869] [2019-10-22 11:23:43,405 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:43,405 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:43,406 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:43,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:43,481 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-22 11:23:43,481 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773993869] [2019-10-22 11:23:43,481 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:43,481 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:23:43,481 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192038425] [2019-10-22 11:23:43,482 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:23:43,482 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:43,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:23:43,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:23:43,482 INFO L87 Difference]: Start difference. First operand 1472 states and 2616 transitions. Second operand 3 states. [2019-10-22 11:23:43,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:43,589 INFO L93 Difference]: Finished difference Result 1660 states and 2914 transitions. [2019-10-22 11:23:43,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:23:43,589 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-10-22 11:23:43,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:43,595 INFO L225 Difference]: With dead ends: 1660 [2019-10-22 11:23:43,595 INFO L226 Difference]: Without dead ends: 1454 [2019-10-22 11:23:43,596 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:23:43,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1454 states. [2019-10-22 11:23:43,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1454 to 1454. [2019-10-22 11:23:43,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1454 states. [2019-10-22 11:23:43,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1454 states to 1454 states and 2583 transitions. [2019-10-22 11:23:43,669 INFO L78 Accepts]: Start accepts. Automaton has 1454 states and 2583 transitions. Word has length 56 [2019-10-22 11:23:43,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:43,670 INFO L462 AbstractCegarLoop]: Abstraction has 1454 states and 2583 transitions. [2019-10-22 11:23:43,670 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:23:43,670 INFO L276 IsEmpty]: Start isEmpty. Operand 1454 states and 2583 transitions. [2019-10-22 11:23:43,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-10-22 11:23:43,673 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:43,673 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:23:43,673 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:43,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:43,674 INFO L82 PathProgramCache]: Analyzing trace with hash 1551555458, now seen corresponding path program 1 times [2019-10-22 11:23:43,674 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:43,674 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018654306] [2019-10-22 11:23:43,676 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:43,677 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:43,677 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:43,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:43,735 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-22 11:23:43,736 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018654306] [2019-10-22 11:23:43,736 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:43,736 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:23:43,736 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784369494] [2019-10-22 11:23:43,736 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:23:43,737 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:43,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:23:43,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:23:43,737 INFO L87 Difference]: Start difference. First operand 1454 states and 2583 transitions. Second operand 4 states. [2019-10-22 11:23:43,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:43,801 INFO L93 Difference]: Finished difference Result 1558 states and 2753 transitions. [2019-10-22 11:23:43,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:23:43,801 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2019-10-22 11:23:43,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:43,806 INFO L225 Difference]: With dead ends: 1558 [2019-10-22 11:23:43,806 INFO L226 Difference]: Without dead ends: 1386 [2019-10-22 11:23:43,807 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:23:43,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1386 states. [2019-10-22 11:23:43,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1386 to 1386. [2019-10-22 11:23:43,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1386 states. [2019-10-22 11:23:43,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1386 states to 1386 states and 2469 transitions. [2019-10-22 11:23:43,877 INFO L78 Accepts]: Start accepts. Automaton has 1386 states and 2469 transitions. Word has length 83 [2019-10-22 11:23:43,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:43,877 INFO L462 AbstractCegarLoop]: Abstraction has 1386 states and 2469 transitions. [2019-10-22 11:23:43,878 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:23:43,878 INFO L276 IsEmpty]: Start isEmpty. Operand 1386 states and 2469 transitions. [2019-10-22 11:23:43,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-10-22 11:23:43,880 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:43,880 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:23:43,880 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:43,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:43,881 INFO L82 PathProgramCache]: Analyzing trace with hash 64522138, now seen corresponding path program 1 times [2019-10-22 11:23:43,881 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:43,881 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616506061] [2019-10-22 11:23:43,881 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:43,881 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:43,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:43,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:44,007 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-22 11:23:44,008 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616506061] [2019-10-22 11:23:44,008 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:44,008 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-22 11:23:44,008 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481413386] [2019-10-22 11:23:44,008 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-22 11:23:44,009 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:44,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-22 11:23:44,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-22 11:23:44,009 INFO L87 Difference]: Start difference. First operand 1386 states and 2469 transitions. Second operand 10 states. [2019-10-22 11:23:44,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:44,493 INFO L93 Difference]: Finished difference Result 1956 states and 3380 transitions. [2019-10-22 11:23:44,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-22 11:23:44,493 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 84 [2019-10-22 11:23:44,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:44,499 INFO L225 Difference]: With dead ends: 1956 [2019-10-22 11:23:44,499 INFO L226 Difference]: Without dead ends: 1837 [2019-10-22 11:23:44,502 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=115, Invalid=265, Unknown=0, NotChecked=0, Total=380 [2019-10-22 11:23:44,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1837 states. [2019-10-22 11:23:44,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1837 to 1404. [2019-10-22 11:23:44,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1404 states. [2019-10-22 11:23:44,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1404 states to 1404 states and 2493 transitions. [2019-10-22 11:23:44,587 INFO L78 Accepts]: Start accepts. Automaton has 1404 states and 2493 transitions. Word has length 84 [2019-10-22 11:23:44,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:44,587 INFO L462 AbstractCegarLoop]: Abstraction has 1404 states and 2493 transitions. [2019-10-22 11:23:44,587 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-22 11:23:44,587 INFO L276 IsEmpty]: Start isEmpty. Operand 1404 states and 2493 transitions. [2019-10-22 11:23:44,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-10-22 11:23:44,590 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:44,590 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:23:44,590 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:44,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:44,591 INFO L82 PathProgramCache]: Analyzing trace with hash -2096099641, now seen corresponding path program 1 times [2019-10-22 11:23:44,591 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:44,591 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983012004] [2019-10-22 11:23:44,591 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:44,591 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:44,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:44,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:44,740 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-22 11:23:44,740 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983012004] [2019-10-22 11:23:44,740 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:44,740 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 11:23:44,740 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279652701] [2019-10-22 11:23:44,741 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 11:23:44,741 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:44,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 11:23:44,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:23:44,741 INFO L87 Difference]: Start difference. First operand 1404 states and 2493 transitions. Second operand 6 states. [2019-10-22 11:23:45,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:45,028 INFO L93 Difference]: Finished difference Result 2973 states and 5241 transitions. [2019-10-22 11:23:45,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 11:23:45,029 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 85 [2019-10-22 11:23:45,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:45,039 INFO L225 Difference]: With dead ends: 2973 [2019-10-22 11:23:45,039 INFO L226 Difference]: Without dead ends: 2908 [2019-10-22 11:23:45,041 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-10-22 11:23:45,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2908 states. [2019-10-22 11:23:45,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2908 to 2673. [2019-10-22 11:23:45,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2673 states. [2019-10-22 11:23:45,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2673 states to 2673 states and 4773 transitions. [2019-10-22 11:23:45,172 INFO L78 Accepts]: Start accepts. Automaton has 2673 states and 4773 transitions. Word has length 85 [2019-10-22 11:23:45,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:45,173 INFO L462 AbstractCegarLoop]: Abstraction has 2673 states and 4773 transitions. [2019-10-22 11:23:45,173 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 11:23:45,173 INFO L276 IsEmpty]: Start isEmpty. Operand 2673 states and 4773 transitions. [2019-10-22 11:23:45,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-10-22 11:23:45,178 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:45,179 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:23:45,179 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:45,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:45,179 INFO L82 PathProgramCache]: Analyzing trace with hash -1065197571, now seen corresponding path program 1 times [2019-10-22 11:23:45,179 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:45,179 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431805831] [2019-10-22 11:23:45,180 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:45,180 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:45,180 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:45,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:45,272 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-22 11:23:45,273 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431805831] [2019-10-22 11:23:45,273 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:45,273 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-22 11:23:45,273 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148935995] [2019-10-22 11:23:45,273 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-22 11:23:45,274 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:45,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-22 11:23:45,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-22 11:23:45,274 INFO L87 Difference]: Start difference. First operand 2673 states and 4773 transitions. Second operand 7 states. [2019-10-22 11:23:45,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:45,590 INFO L93 Difference]: Finished difference Result 3386 states and 5896 transitions. [2019-10-22 11:23:45,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-22 11:23:45,591 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 85 [2019-10-22 11:23:45,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:45,601 INFO L225 Difference]: With dead ends: 3386 [2019-10-22 11:23:45,601 INFO L226 Difference]: Without dead ends: 3174 [2019-10-22 11:23:45,603 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2019-10-22 11:23:45,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3174 states. [2019-10-22 11:23:45,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3174 to 2829. [2019-10-22 11:23:45,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2829 states. [2019-10-22 11:23:45,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2829 states to 2829 states and 5033 transitions. [2019-10-22 11:23:45,789 INFO L78 Accepts]: Start accepts. Automaton has 2829 states and 5033 transitions. Word has length 85 [2019-10-22 11:23:45,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:45,789 INFO L462 AbstractCegarLoop]: Abstraction has 2829 states and 5033 transitions. [2019-10-22 11:23:45,789 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-22 11:23:45,789 INFO L276 IsEmpty]: Start isEmpty. Operand 2829 states and 5033 transitions. [2019-10-22 11:23:45,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-10-22 11:23:45,795 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:45,796 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:23:45,796 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:45,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:45,796 INFO L82 PathProgramCache]: Analyzing trace with hash -769812612, now seen corresponding path program 1 times [2019-10-22 11:23:45,796 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:45,797 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847151173] [2019-10-22 11:23:45,797 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:45,797 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:45,797 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:45,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:45,957 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-22 11:23:45,957 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847151173] [2019-10-22 11:23:45,957 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:45,957 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-22 11:23:45,957 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799026867] [2019-10-22 11:23:45,958 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-22 11:23:45,958 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:45,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-22 11:23:45,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-22 11:23:45,958 INFO L87 Difference]: Start difference. First operand 2829 states and 5033 transitions. Second operand 7 states. [2019-10-22 11:23:46,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:46,404 INFO L93 Difference]: Finished difference Result 3788 states and 6540 transitions. [2019-10-22 11:23:46,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-22 11:23:46,405 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 85 [2019-10-22 11:23:46,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:46,416 INFO L225 Difference]: With dead ends: 3788 [2019-10-22 11:23:46,416 INFO L226 Difference]: Without dead ends: 3552 [2019-10-22 11:23:46,418 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2019-10-22 11:23:46,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3552 states. [2019-10-22 11:23:46,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3552 to 2853. [2019-10-22 11:23:46,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2853 states. [2019-10-22 11:23:46,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2853 states to 2853 states and 5068 transitions. [2019-10-22 11:23:46,569 INFO L78 Accepts]: Start accepts. Automaton has 2853 states and 5068 transitions. Word has length 85 [2019-10-22 11:23:46,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:46,569 INFO L462 AbstractCegarLoop]: Abstraction has 2853 states and 5068 transitions. [2019-10-22 11:23:46,569 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-22 11:23:46,569 INFO L276 IsEmpty]: Start isEmpty. Operand 2853 states and 5068 transitions. [2019-10-22 11:23:46,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-10-22 11:23:46,574 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:46,575 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:23:46,575 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:46,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:46,575 INFO L82 PathProgramCache]: Analyzing trace with hash -200799019, now seen corresponding path program 1 times [2019-10-22 11:23:46,575 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:46,575 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726170112] [2019-10-22 11:23:46,576 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:46,576 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:46,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:46,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:46,666 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-22 11:23:46,666 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726170112] [2019-10-22 11:23:46,666 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:46,666 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-22 11:23:46,667 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789906042] [2019-10-22 11:23:46,667 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-22 11:23:46,667 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:46,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-22 11:23:46,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-22 11:23:46,667 INFO L87 Difference]: Start difference. First operand 2853 states and 5068 transitions. Second operand 9 states. [2019-10-22 11:23:47,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:47,170 INFO L93 Difference]: Finished difference Result 3360 states and 5857 transitions. [2019-10-22 11:23:47,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-22 11:23:47,170 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 86 [2019-10-22 11:23:47,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:47,181 INFO L225 Difference]: With dead ends: 3360 [2019-10-22 11:23:47,181 INFO L226 Difference]: Without dead ends: 3214 [2019-10-22 11:23:47,183 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=107, Invalid=199, Unknown=0, NotChecked=0, Total=306 [2019-10-22 11:23:47,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3214 states. [2019-10-22 11:23:47,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3214 to 2895. [2019-10-22 11:23:47,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2895 states. [2019-10-22 11:23:47,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2895 states to 2895 states and 5122 transitions. [2019-10-22 11:23:47,386 INFO L78 Accepts]: Start accepts. Automaton has 2895 states and 5122 transitions. Word has length 86 [2019-10-22 11:23:47,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:47,386 INFO L462 AbstractCegarLoop]: Abstraction has 2895 states and 5122 transitions. [2019-10-22 11:23:47,387 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-22 11:23:47,387 INFO L276 IsEmpty]: Start isEmpty. Operand 2895 states and 5122 transitions. [2019-10-22 11:23:47,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-10-22 11:23:47,392 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:47,392 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:23:47,392 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:47,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:47,392 INFO L82 PathProgramCache]: Analyzing trace with hash -292591510, now seen corresponding path program 1 times [2019-10-22 11:23:47,392 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:47,392 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472280170] [2019-10-22 11:23:47,393 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:47,393 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:47,393 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:47,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:47,469 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-22 11:23:47,470 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472280170] [2019-10-22 11:23:47,470 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:47,470 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-22 11:23:47,470 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424933376] [2019-10-22 11:23:47,470 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-22 11:23:47,471 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:47,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-22 11:23:47,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-22 11:23:47,471 INFO L87 Difference]: Start difference. First operand 2895 states and 5122 transitions. Second operand 8 states. [2019-10-22 11:23:47,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:47,997 INFO L93 Difference]: Finished difference Result 3606 states and 6185 transitions. [2019-10-22 11:23:47,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-22 11:23:47,998 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 86 [2019-10-22 11:23:47,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:48,008 INFO L225 Difference]: With dead ends: 3606 [2019-10-22 11:23:48,008 INFO L226 Difference]: Without dead ends: 3388 [2019-10-22 11:23:48,010 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=113, Invalid=307, Unknown=0, NotChecked=0, Total=420 [2019-10-22 11:23:48,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3388 states. [2019-10-22 11:23:48,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3388 to 2907. [2019-10-22 11:23:48,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2907 states. [2019-10-22 11:23:48,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2907 states to 2907 states and 5122 transitions. [2019-10-22 11:23:48,170 INFO L78 Accepts]: Start accepts. Automaton has 2907 states and 5122 transitions. Word has length 86 [2019-10-22 11:23:48,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:48,170 INFO L462 AbstractCegarLoop]: Abstraction has 2907 states and 5122 transitions. [2019-10-22 11:23:48,170 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-22 11:23:48,170 INFO L276 IsEmpty]: Start isEmpty. Operand 2907 states and 5122 transitions. [2019-10-22 11:23:48,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-10-22 11:23:48,176 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:48,176 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:23:48,176 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:48,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:48,176 INFO L82 PathProgramCache]: Analyzing trace with hash -356866571, now seen corresponding path program 1 times [2019-10-22 11:23:48,177 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:48,177 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466021692] [2019-10-22 11:23:48,177 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:48,177 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:48,177 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:48,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:48,225 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-22 11:23:48,225 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466021692] [2019-10-22 11:23:48,225 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:48,225 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:23:48,225 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028880678] [2019-10-22 11:23:48,226 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:23:48,227 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:48,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:23:48,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:23:48,227 INFO L87 Difference]: Start difference. First operand 2907 states and 5122 transitions. Second operand 4 states. [2019-10-22 11:23:48,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:48,491 INFO L93 Difference]: Finished difference Result 5861 states and 10314 transitions. [2019-10-22 11:23:48,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:23:48,491 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 86 [2019-10-22 11:23:48,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:48,502 INFO L225 Difference]: With dead ends: 5861 [2019-10-22 11:23:48,502 INFO L226 Difference]: Without dead ends: 4346 [2019-10-22 11:23:48,505 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:23:48,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4346 states. [2019-10-22 11:23:48,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4346 to 2894. [2019-10-22 11:23:48,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2894 states. [2019-10-22 11:23:48,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2894 states to 2894 states and 5105 transitions. [2019-10-22 11:23:48,748 INFO L78 Accepts]: Start accepts. Automaton has 2894 states and 5105 transitions. Word has length 86 [2019-10-22 11:23:48,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:48,748 INFO L462 AbstractCegarLoop]: Abstraction has 2894 states and 5105 transitions. [2019-10-22 11:23:48,748 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:23:48,748 INFO L276 IsEmpty]: Start isEmpty. Operand 2894 states and 5105 transitions. [2019-10-22 11:23:48,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-10-22 11:23:48,754 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:48,754 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:23:48,754 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:48,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:48,755 INFO L82 PathProgramCache]: Analyzing trace with hash 1104743187, now seen corresponding path program 1 times [2019-10-22 11:23:48,755 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:48,755 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690608033] [2019-10-22 11:23:48,755 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:48,755 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:48,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:48,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:48,824 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-22 11:23:48,825 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690608033] [2019-10-22 11:23:48,825 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:48,825 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:23:48,825 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808830596] [2019-10-22 11:23:48,826 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 11:23:48,826 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:48,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 11:23:48,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:23:48,826 INFO L87 Difference]: Start difference. First operand 2894 states and 5105 transitions. Second operand 6 states. [2019-10-22 11:23:49,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:49,034 INFO L93 Difference]: Finished difference Result 3204 states and 5589 transitions. [2019-10-22 11:23:49,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 11:23:49,034 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 87 [2019-10-22 11:23:49,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:49,040 INFO L225 Difference]: With dead ends: 3204 [2019-10-22 11:23:49,040 INFO L226 Difference]: Without dead ends: 3055 [2019-10-22 11:23:49,042 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-10-22 11:23:49,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3055 states. [2019-10-22 11:23:49,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3055 to 2834. [2019-10-22 11:23:49,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2834 states. [2019-10-22 11:23:49,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2834 states to 2834 states and 5018 transitions. [2019-10-22 11:23:49,180 INFO L78 Accepts]: Start accepts. Automaton has 2834 states and 5018 transitions. Word has length 87 [2019-10-22 11:23:49,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:49,180 INFO L462 AbstractCegarLoop]: Abstraction has 2834 states and 5018 transitions. [2019-10-22 11:23:49,180 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 11:23:49,180 INFO L276 IsEmpty]: Start isEmpty. Operand 2834 states and 5018 transitions. [2019-10-22 11:23:49,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-10-22 11:23:49,185 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:49,185 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:23:49,186 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:49,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:49,186 INFO L82 PathProgramCache]: Analyzing trace with hash 1071985214, now seen corresponding path program 1 times [2019-10-22 11:23:49,186 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:49,187 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177425848] [2019-10-22 11:23:49,187 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:49,187 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:49,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:49,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:49,252 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-22 11:23:49,252 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177425848] [2019-10-22 11:23:49,253 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:49,253 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:23:49,253 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222697056] [2019-10-22 11:23:49,253 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:23:49,253 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:49,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:23:49,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:23:49,254 INFO L87 Difference]: Start difference. First operand 2834 states and 5018 transitions. Second operand 5 states. [2019-10-22 11:23:49,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:49,379 INFO L93 Difference]: Finished difference Result 2834 states and 5018 transitions. [2019-10-22 11:23:49,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:23:49,380 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 88 [2019-10-22 11:23:49,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:49,380 INFO L225 Difference]: With dead ends: 2834 [2019-10-22 11:23:49,380 INFO L226 Difference]: Without dead ends: 0 [2019-10-22 11:23:49,383 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-22 11:23:49,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-22 11:23:49,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-22 11:23:49,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-22 11:23:49,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-22 11:23:49,383 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 88 [2019-10-22 11:23:49,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:49,384 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 11:23:49,384 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:23:49,384 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-22 11:23:49,384 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-22 11:23:49,388 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-22 11:23:49,673 WARN L191 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 191 DAG size of output: 185 [2019-10-22 11:23:50,136 WARN L191 SmtUtils]: Spent 460.00 ms on a formula simplification. DAG size of input: 245 DAG size of output: 239 [2019-10-22 11:23:50,450 WARN L191 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 219 DAG size of output: 213 [2019-10-22 11:23:50,754 WARN L191 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 219 DAG size of output: 213 [2019-10-22 11:23:51,128 WARN L191 SmtUtils]: Spent 372.00 ms on a formula simplification. DAG size of input: 253 DAG size of output: 247 [2019-10-22 11:23:51,314 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 170 [2019-10-22 11:23:51,655 WARN L191 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 219 DAG size of output: 213 [2019-10-22 11:23:52,160 WARN L191 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 219 DAG size of output: 213 [2019-10-22 11:23:52,288 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 188 DAG size of output: 178 [2019-10-22 11:23:52,770 WARN L191 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 228 DAG size of output: 222 [2019-10-22 11:23:52,942 WARN L191 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 221 DAG size of output: 215 [2019-10-22 11:23:53,454 WARN L191 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 219 DAG size of output: 213 [2019-10-22 11:23:53,803 WARN L191 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 243 DAG size of output: 237 [2019-10-22 11:23:54,012 WARN L191 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 219 DAG size of output: 213 [2019-10-22 11:23:54,492 WARN L191 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 34 [2019-10-22 11:23:55,005 WARN L191 SmtUtils]: Spent 509.00 ms on a formula simplification. DAG size of input: 184 DAG size of output: 57 [2019-10-22 11:23:55,906 WARN L191 SmtUtils]: Spent 889.00 ms on a formula simplification. DAG size of input: 238 DAG size of output: 65 [2019-10-22 11:23:56,752 WARN L191 SmtUtils]: Spent 844.00 ms on a formula simplification. DAG size of input: 212 DAG size of output: 34 [2019-10-22 11:23:57,651 WARN L191 SmtUtils]: Spent 823.00 ms on a formula simplification. DAG size of input: 212 DAG size of output: 34 [2019-10-22 11:23:58,678 WARN L191 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 246 DAG size of output: 34 [2019-10-22 11:23:59,242 WARN L191 SmtUtils]: Spent 399.00 ms on a formula simplification. DAG size of input: 169 DAG size of output: 60 [2019-10-22 11:24:00,252 WARN L191 SmtUtils]: Spent 854.00 ms on a formula simplification. DAG size of input: 212 DAG size of output: 34 [2019-10-22 11:24:01,468 WARN L191 SmtUtils]: Spent 764.00 ms on a formula simplification. DAG size of input: 212 DAG size of output: 34 [2019-10-22 11:24:01,890 WARN L191 SmtUtils]: Spent 420.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 56 [2019-10-22 11:24:02,917 WARN L191 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 54 [2019-10-22 11:24:03,842 WARN L191 SmtUtils]: Spent 845.00 ms on a formula simplification. DAG size of input: 221 DAG size of output: 58 [2019-10-22 11:24:04,620 WARN L191 SmtUtils]: Spent 777.00 ms on a formula simplification. DAG size of input: 214 DAG size of output: 36 [2019-10-22 11:24:05,027 WARN L191 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 56 [2019-10-22 11:24:05,967 WARN L191 SmtUtils]: Spent 424.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 56 [2019-10-22 11:24:06,294 WARN L191 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 34 [2019-10-22 11:24:07,182 WARN L191 SmtUtils]: Spent 809.00 ms on a formula simplification. DAG size of input: 212 DAG size of output: 34 [2019-10-22 11:24:08,338 WARN L191 SmtUtils]: Spent 785.00 ms on a formula simplification. DAG size of input: 236 DAG size of output: 63 [2019-10-22 11:24:08,632 WARN L191 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 31 [2019-10-22 11:24:09,464 WARN L191 SmtUtils]: Spent 830.00 ms on a formula simplification. DAG size of input: 212 DAG size of output: 34 [2019-10-22 11:24:10,159 WARN L191 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 59 [2019-10-22 11:24:10,240 INFO L443 ceAbstractionStarter]: For program point L828(lines 828 835) no Hoare annotation was computed. [2019-10-22 11:24:10,241 INFO L439 ceAbstractionStarter]: At program point L2678(lines 2631 2684) the Hoare annotation is: (let ((.cse7 (= 1 ~queue_empty~0)) (.cse8 (= ~__ste_email_to1~0 0)) (.cse0 (= ~__ste_email_to0~0 2)) (.cse1 (= 2 ULTIMATE.start_setup_rjh_~rjh___0)) (.cse2 (= 2 ULTIMATE.start_createEmail_~to)) (.cse4 (= ULTIMATE.start_setEmailTo_~value 2)) (.cse3 (and (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (not (= 1 ULTIMATE.start_setup_rjh_~rjh___0)) (not (= ULTIMATE.start_setClientId_~handle 2)) (not (= 1 ULTIMATE.start_setup_chuck_~chuck___0))) (= 1 ULTIMATE.start_setEmailTo_~handle) (= 0 ~in_encrypted~0) (not (= 1 ULTIMATE.start_createEmail_~to)) (not (= ULTIMATE.start_setEmailTo_~value 1)) (not (= ~__ste_email_to0~0 1)) (= 1 ULTIMATE.start_createEmail_~msg~0))) (.cse5 (= ULTIMATE.start_outgoing_~msg ULTIMATE.start_getEmailTo_~handle)) (.cse6 (= ~rjh~0 2))) (or (and (and .cse0 .cse1 (= 2 |ULTIMATE.start_getEmailTo_#res|) .cse2 (and (= 1 ULTIMATE.start_getEmailTo_~handle) .cse3) .cse4 .cse5 .cse6) .cse7 .cse8) (and .cse7 (= 0 |ULTIMATE.start_getEmailTo_#res|) .cse8 (and .cse0 .cse1 .cse2 .cse4 (and .cse3 (not (= 1 ULTIMATE.start_outgoing_~msg)) .cse5) .cse6)))) [2019-10-22 11:24:10,241 INFO L439 ceAbstractionStarter]: At program point L2678-1(lines 2631 2684) the Hoare annotation is: false [2019-10-22 11:24:10,241 INFO L443 ceAbstractionStarter]: For program point L895(lines 895 899) no Hoare annotation was computed. [2019-10-22 11:24:10,241 INFO L443 ceAbstractionStarter]: For program point L2811(lines 2811 2819) no Hoare annotation was computed. [2019-10-22 11:24:10,241 INFO L443 ceAbstractionStarter]: For program point L2811-2(lines 2811 2819) no Hoare annotation was computed. [2019-10-22 11:24:10,241 INFO L443 ceAbstractionStarter]: For program point L2811-4(lines 2811 2819) no Hoare annotation was computed. [2019-10-22 11:24:10,241 INFO L443 ceAbstractionStarter]: For program point L2349-1(lines 2349 2365) no Hoare annotation was computed. [2019-10-22 11:24:10,241 INFO L443 ceAbstractionStarter]: For program point L2349(lines 2349 2365) no Hoare annotation was computed. [2019-10-22 11:24:10,241 INFO L443 ceAbstractionStarter]: For program point L2614(lines 2614 2620) no Hoare annotation was computed. [2019-10-22 11:24:10,241 INFO L443 ceAbstractionStarter]: For program point L2814(lines 2814 2818) no Hoare annotation was computed. [2019-10-22 11:24:10,242 INFO L439 ceAbstractionStarter]: At program point L2814-2(lines 1 2840) the Hoare annotation is: (and (= ~__ste_Client_Keyring0_User0~0 ~__ste_Client_Keyring0_User1~0) (= 1 ~queue_empty~0) (not (= ~rjh~0 1)) (not (= ULTIMATE.start_setClientId_~handle 2)) (= ~__ste_email_to1~0 0) (= 0 ~in_encrypted~0) (= 0 ~__ste_Client_Keyring0_User0~0) (not (= ~__ste_email_to0~0 1))) [2019-10-22 11:24:10,242 INFO L443 ceAbstractionStarter]: For program point L2814-3(lines 2814 2818) no Hoare annotation was computed. [2019-10-22 11:24:10,242 INFO L443 ceAbstractionStarter]: For program point L2814-6(lines 2814 2818) no Hoare annotation was computed. [2019-10-22 11:24:10,242 INFO L439 ceAbstractionStarter]: At program point L2814-5(lines 1 2840) the Hoare annotation is: (and (= ~__ste_Client_Keyring0_User0~0 ~__ste_Client_Keyring0_User1~0) (= 1 ~queue_empty~0) (= ~__ste_email_to1~0 0) (= ~rjh~0 ULTIMATE.start_setClientId_~handle) (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_rjh_~rjh___0) (= 0 ~in_encrypted~0) (= 0 ~__ste_Client_Keyring0_User0~0) (not (= ~__ste_email_to0~0 1)) (= ~rjh~0 2)) [2019-10-22 11:24:10,242 INFO L439 ceAbstractionStarter]: At program point L2814-8(lines 1 2840) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 1 ~queue_empty~0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= ~__ste_email_to1~0 0) (= 456 ULTIMATE.start_setClientPrivateKey_~value) (= 0 ~in_encrypted~0) (= ULTIMATE.start_setClientPrivateKey_~handle 2) (not (= ~__ste_email_to0~0 1)) (not (= 1 ULTIMATE.start_setup_chuck_~chuck___0)) (= ~__ste_client_privateKey1~0 456) (= ~__ste_Client_Keyring0_User0~0 ~__ste_Client_Keyring0_User1~0) (not (= 2 ULTIMATE.start_setup_chuck_~chuck___0)) (= 0 ~__ste_Client_Keyring0_User0~0) (= ~rjh~0 2)) [2019-10-22 11:24:10,242 INFO L443 ceAbstractionStarter]: For program point L2550(lines 2550 2562) no Hoare annotation was computed. [2019-10-22 11:24:10,242 INFO L443 ceAbstractionStarter]: For program point L2550-2(lines 2550 2562) no Hoare annotation was computed. [2019-10-22 11:24:10,242 INFO L439 ceAbstractionStarter]: At program point L2550-1(lines 2524 2567) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 1 ~queue_empty~0) (= 0 ULTIMATE.start_test_~op1~0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= ~__ste_email_to1~0 0) (not (= ULTIMATE.start_setClientId_~handle 2)) (= 0 ~in_encrypted~0) (not (= ~__ste_email_to0~0 1)) (not (= 1 ULTIMATE.start_setup_chuck_~chuck___0)) (= ~rjh~0 2)) [2019-10-22 11:24:10,242 INFO L443 ceAbstractionStarter]: For program point L2550-4(lines 2550 2562) no Hoare annotation was computed. [2019-10-22 11:24:10,242 INFO L439 ceAbstractionStarter]: At program point L2550-3(lines 2524 2567) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 1 ~queue_empty~0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= ~__ste_email_to1~0 0) (not (= ULTIMATE.start_setClientId_~handle 2)) (= 0 ~in_encrypted~0) (not (= ~__ste_email_to0~0 1)) (not (= 1 ULTIMATE.start_setup_chuck_~chuck___0)) (= ~rjh~0 2)) [2019-10-22 11:24:10,242 INFO L443 ceAbstractionStarter]: For program point L2550-6(lines 2550 2562) no Hoare annotation was computed. [2019-10-22 11:24:10,242 INFO L439 ceAbstractionStarter]: At program point L2550-5(lines 2524 2567) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 1 ~queue_empty~0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= ~__ste_email_to1~0 0) (not (= ULTIMATE.start_setClientId_~handle 2)) (= 0 ~in_encrypted~0) (not (= ~__ste_email_to0~0 1)) (not (= 1 ULTIMATE.start_setup_chuck_~chuck___0)) (= ~rjh~0 2)) [2019-10-22 11:24:10,242 INFO L443 ceAbstractionStarter]: For program point L2550-8(lines 2550 2562) no Hoare annotation was computed. [2019-10-22 11:24:10,243 INFO L439 ceAbstractionStarter]: At program point L2550-7(lines 2524 2567) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 1 ~queue_empty~0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= ~__ste_email_to1~0 0) (not (= ULTIMATE.start_setClientId_~handle 2)) (= 0 ~in_encrypted~0) (not (= ~__ste_email_to0~0 1)) (not (= 1 ULTIMATE.start_setup_chuck_~chuck___0)) (= ~rjh~0 2)) [2019-10-22 11:24:10,243 INFO L439 ceAbstractionStarter]: At program point L2550-9(lines 2524 2567) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 1 ~queue_empty~0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= ~__ste_email_to1~0 0) (not (= ULTIMATE.start_setClientId_~handle 2)) (= 0 ~in_encrypted~0) (not (= ~__ste_email_to0~0 1)) (not (= 1 ULTIMATE.start_setup_chuck_~chuck___0)) (= ~rjh~0 2)) [2019-10-22 11:24:10,243 INFO L443 ceAbstractionStarter]: For program point L1626(lines 1626 1648) no Hoare annotation was computed. [2019-10-22 11:24:10,243 INFO L439 ceAbstractionStarter]: At program point L1626-1(lines 1626 1648) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= ~__ste_email_to0~0 2) (= 1 ~queue_empty~0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= ~__ste_email_to1~0 0) (not (= ULTIMATE.start_setClientId_~handle 2)) (= 1 ULTIMATE.start_setEmailTo_~handle) (= 2 ULTIMATE.start_createEmail_~to) (= ULTIMATE.start_setEmailTo_~value 2) (= 1 ULTIMATE.start_createEmail_~msg~0) (not (= 1 ULTIMATE.start_setup_chuck_~chuck___0)) (= ~rjh~0 2)) [2019-10-22 11:24:10,243 INFO L443 ceAbstractionStarter]: For program point L1626-2(lines 1626 1648) no Hoare annotation was computed. [2019-10-22 11:24:10,243 INFO L446 ceAbstractionStarter]: At program point L1626-3(lines 1626 1648) the Hoare annotation is: true [2019-10-22 11:24:10,243 INFO L443 ceAbstractionStarter]: For program point L2551(lines 2551 2559) no Hoare annotation was computed. [2019-10-22 11:24:10,243 INFO L443 ceAbstractionStarter]: For program point L2551-2(lines 2551 2559) no Hoare annotation was computed. [2019-10-22 11:24:10,243 INFO L443 ceAbstractionStarter]: For program point L2551-4(lines 2551 2559) no Hoare annotation was computed. [2019-10-22 11:24:10,243 INFO L443 ceAbstractionStarter]: For program point L2353-1(lines 2353 2364) no Hoare annotation was computed. [2019-10-22 11:24:10,243 INFO L443 ceAbstractionStarter]: For program point L2551-6(lines 2551 2559) no Hoare annotation was computed. [2019-10-22 11:24:10,243 INFO L443 ceAbstractionStarter]: For program point L2353(lines 2353 2364) no Hoare annotation was computed. [2019-10-22 11:24:10,243 INFO L443 ceAbstractionStarter]: For program point L2551-8(lines 2551 2559) no Hoare annotation was computed. [2019-10-22 11:24:10,243 INFO L443 ceAbstractionStarter]: For program point L2420(lines 2420 2432) no Hoare annotation was computed. [2019-10-22 11:24:10,243 INFO L443 ceAbstractionStarter]: For program point L2420-2(lines 2420 2432) no Hoare annotation was computed. [2019-10-22 11:24:10,243 INFO L443 ceAbstractionStarter]: For program point L2420-4(lines 2420 2432) no Hoare annotation was computed. [2019-10-22 11:24:10,243 INFO L443 ceAbstractionStarter]: For program point L2420-6(lines 2420 2432) no Hoare annotation was computed. [2019-10-22 11:24:10,243 INFO L443 ceAbstractionStarter]: For program point L2420-8(lines 2420 2432) no Hoare annotation was computed. [2019-10-22 11:24:10,243 INFO L439 ceAbstractionStarter]: At program point L901(lines 891 947) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 1 ~queue_empty~0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= ~__ste_email_to1~0 0) (not (= ULTIMATE.start_setClientId_~handle 2)) (= 0 ~in_encrypted~0) (not (= ~__ste_email_to0~0 1)) (not (= 1 ULTIMATE.start_setup_chuck_~chuck___0)) (= ~rjh~0 2)) [2019-10-22 11:24:10,243 INFO L439 ceAbstractionStarter]: At program point L571(lines 551 573) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 1 ~queue_empty~0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (not (= ULTIMATE.start_setClientPrivateKey_~handle 2)) (= ~__ste_email_to1~0 0) (= 0 ~in_encrypted~0) (not (= ~__ste_email_to0~0 1)) (not (= 1 ULTIMATE.start_setup_chuck_~chuck___0)) (= ~__ste_client_privateKey1~0 456) (= ~__ste_Client_Keyring0_User0~0 ~__ste_Client_Keyring0_User1~0) (not (= 2 ULTIMATE.start_setup_chuck_~chuck___0)) (not (= ULTIMATE.start_setClientPrivateKey_~handle 1)) (= 0 ~__ste_Client_Keyring0_User0~0) (= ~rjh~0 2)) [2019-10-22 11:24:10,244 INFO L443 ceAbstractionStarter]: For program point L2554(lines 2554 2558) no Hoare annotation was computed. [2019-10-22 11:24:10,244 INFO L443 ceAbstractionStarter]: For program point L2488(lines 2488 2519) no Hoare annotation was computed. [2019-10-22 11:24:10,244 INFO L443 ceAbstractionStarter]: For program point L2554-3(lines 2554 2558) no Hoare annotation was computed. [2019-10-22 11:24:10,244 INFO L443 ceAbstractionStarter]: For program point L2554-6(lines 2554 2558) no Hoare annotation was computed. [2019-10-22 11:24:10,244 INFO L443 ceAbstractionStarter]: For program point L2554-9(lines 2554 2558) no Hoare annotation was computed. [2019-10-22 11:24:10,244 INFO L443 ceAbstractionStarter]: For program point L2554-12(lines 2554 2558) no Hoare annotation was computed. [2019-10-22 11:24:10,244 INFO L443 ceAbstractionStarter]: For program point L1101(lines 1101 1109) no Hoare annotation was computed. [2019-10-22 11:24:10,244 INFO L439 ceAbstractionStarter]: At program point L837(lines 824 952) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 1 ~queue_empty~0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= ~__ste_email_to1~0 0) (not (= ULTIMATE.start_setClientId_~handle 2)) (= 0 ~in_encrypted~0) (not (= ~__ste_email_to0~0 1)) (not (= 1 ULTIMATE.start_setup_chuck_~chuck___0)) (= ~rjh~0 2)) [2019-10-22 11:24:10,244 INFO L443 ceAbstractionStarter]: For program point L1630(lines 1630 1645) no Hoare annotation was computed. [2019-10-22 11:24:10,244 INFO L443 ceAbstractionStarter]: For program point L1630-2(lines 1630 1645) no Hoare annotation was computed. [2019-10-22 11:24:10,244 INFO L443 ceAbstractionStarter]: For program point L2489(lines 2489 2500) no Hoare annotation was computed. [2019-10-22 11:24:10,244 INFO L443 ceAbstractionStarter]: For program point L2423(lines 2423 2431) no Hoare annotation was computed. [2019-10-22 11:24:10,244 INFO L443 ceAbstractionStarter]: For program point L2357-1(lines 2357 2363) no Hoare annotation was computed. [2019-10-22 11:24:10,244 INFO L443 ceAbstractionStarter]: For program point L2423-2(lines 2423 2431) no Hoare annotation was computed. [2019-10-22 11:24:10,244 INFO L443 ceAbstractionStarter]: For program point L2357(lines 2357 2363) no Hoare annotation was computed. [2019-10-22 11:24:10,244 INFO L443 ceAbstractionStarter]: For program point L2423-4(lines 2423 2431) no Hoare annotation was computed. [2019-10-22 11:24:10,244 INFO L443 ceAbstractionStarter]: For program point L1234(lines 1234 1245) no Hoare annotation was computed. [2019-10-22 11:24:10,244 INFO L443 ceAbstractionStarter]: For program point L1234-1(lines 1234 1245) no Hoare annotation was computed. [2019-10-22 11:24:10,245 INFO L443 ceAbstractionStarter]: For program point L2423-6(lines 2423 2431) no Hoare annotation was computed. [2019-10-22 11:24:10,245 INFO L443 ceAbstractionStarter]: For program point L2423-8(lines 2423 2431) no Hoare annotation was computed. [2019-10-22 11:24:10,245 INFO L439 ceAbstractionStarter]: At program point L1698(lines 1693 1701) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 1 ~queue_empty~0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= ~__ste_email_to1~0 0) (not (= ULTIMATE.start_setClientId_~handle 2)) (= 1 ULTIMATE.start_setEmailTo_~handle) (= ULTIMATE.start_setEmailTo_~value 2) (not (= 1 ULTIMATE.start_setup_chuck_~chuck___0)) (= ~__ste_email_to0~0 2) (= 1 |ULTIMATE.start_is_queue_empty_#res|) (= 2 ULTIMATE.start_createEmail_~to) (= 1 ULTIMATE.start_createEmail_~msg~0) (= ~rjh~0 2)) [2019-10-22 11:24:10,245 INFO L443 ceAbstractionStarter]: For program point L2689-1(lines 2689 2725) no Hoare annotation was computed. [2019-10-22 11:24:10,245 INFO L443 ceAbstractionStarter]: For program point L2689(lines 2689 2725) no Hoare annotation was computed. [2019-10-22 11:24:10,245 INFO L443 ceAbstractionStarter]: For program point L2689-3(lines 2689 2725) no Hoare annotation was computed. [2019-10-22 11:24:10,245 INFO L443 ceAbstractionStarter]: For program point L2689-2(lines 2689 2725) no Hoare annotation was computed. [2019-10-22 11:24:10,245 INFO L443 ceAbstractionStarter]: For program point L2689-4(lines 2689 2725) no Hoare annotation was computed. [2019-10-22 11:24:10,245 INFO L443 ceAbstractionStarter]: For program point L1104(lines 1104 1108) no Hoare annotation was computed. [2019-10-22 11:24:10,245 INFO L439 ceAbstractionStarter]: At program point L1104-2(lines 1097 1112) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 1 ~queue_empty~0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (not (= ULTIMATE.start_setClientId_~handle 2)) (= ~__ste_email_to1~0 0) (= 1 ULTIMATE.start_setEmailTo_~handle) (= 0 ~in_encrypted~0) (= ULTIMATE.start_setEmailTo_~value 2) (not (= 1 ULTIMATE.start_setup_chuck_~chuck___0)) (= ~__ste_email_to0~0 2) (= 2 ULTIMATE.start_createEmail_~to) (= 1 ULTIMATE.start_createEmail_~msg~0) (= ~rjh~0 2)) [2019-10-22 11:24:10,245 INFO L443 ceAbstractionStarter]: For program point L906(lines 906 913) no Hoare annotation was computed. [2019-10-22 11:24:10,245 INFO L443 ceAbstractionStarter]: For program point L2690(lines 2690 2698) no Hoare annotation was computed. [2019-10-22 11:24:10,246 INFO L439 ceAbstractionStarter]: At program point L2624(lines 2577 2630) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 1 ~queue_empty~0) (= 0 ULTIMATE.start_test_~op1~0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= ~__ste_email_to1~0 0) (not (= ULTIMATE.start_setClientId_~handle 2)) (= 0 ~in_encrypted~0) (not (= ~__ste_email_to0~0 1)) (not (= 1 ULTIMATE.start_setup_chuck_~chuck___0)) (= ~rjh~0 2)) [2019-10-22 11:24:10,246 INFO L443 ceAbstractionStarter]: For program point L2690-2(lines 2690 2698) no Hoare annotation was computed. [2019-10-22 11:24:10,246 INFO L443 ceAbstractionStarter]: For program point L2690-4(lines 2690 2698) no Hoare annotation was computed. [2019-10-22 11:24:10,246 INFO L443 ceAbstractionStarter]: For program point L2690-6(lines 2690 2698) no Hoare annotation was computed. [2019-10-22 11:24:10,246 INFO L443 ceAbstractionStarter]: For program point L2426(lines 2426 2430) no Hoare annotation was computed. [2019-10-22 11:24:10,247 INFO L443 ceAbstractionStarter]: For program point L2690-8(lines 2690 2698) no Hoare annotation was computed. [2019-10-22 11:24:10,247 INFO L439 ceAbstractionStarter]: At program point L2426-2(lines 2416 2435) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 1 ~queue_empty~0) (= 0 ULTIMATE.start_test_~op1~0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= ~__ste_email_to1~0 0) (not (= ULTIMATE.start_setClientId_~handle 2)) (= 0 ~in_encrypted~0) (not (= ~__ste_email_to0~0 1)) (not (= 1 ULTIMATE.start_setup_chuck_~chuck___0)) (= ~rjh~0 2)) [2019-10-22 11:24:10,247 INFO L443 ceAbstractionStarter]: For program point L2426-3(lines 2426 2430) no Hoare annotation was computed. [2019-10-22 11:24:10,247 INFO L443 ceAbstractionStarter]: For program point L2426-6(lines 2426 2430) no Hoare annotation was computed. [2019-10-22 11:24:10,247 INFO L439 ceAbstractionStarter]: At program point L2426-5(lines 2416 2435) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 1 ~queue_empty~0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= ~__ste_email_to1~0 0) (not (= ULTIMATE.start_setClientId_~handle 2)) (= 0 ~in_encrypted~0) (not (= ~__ste_email_to0~0 1)) (not (= 1 ULTIMATE.start_setup_chuck_~chuck___0)) (= ~rjh~0 2)) [2019-10-22 11:24:10,248 INFO L439 ceAbstractionStarter]: At program point L2426-8(lines 2416 2435) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 1 ~queue_empty~0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= ~__ste_email_to1~0 0) (not (= ULTIMATE.start_setClientId_~handle 2)) (= 0 ~in_encrypted~0) (not (= ~__ste_email_to0~0 1)) (not (= 1 ULTIMATE.start_setup_chuck_~chuck___0)) (= ~rjh~0 2)) [2019-10-22 11:24:10,248 INFO L443 ceAbstractionStarter]: For program point L2426-9(lines 2426 2430) no Hoare annotation was computed. [2019-10-22 11:24:10,248 INFO L443 ceAbstractionStarter]: For program point L2426-12(lines 2426 2430) no Hoare annotation was computed. [2019-10-22 11:24:10,248 INFO L439 ceAbstractionStarter]: At program point L2426-11(lines 2416 2435) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 1 ~queue_empty~0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= ~__ste_email_to1~0 0) (not (= ULTIMATE.start_setClientId_~handle 2)) (= 0 ~in_encrypted~0) (not (= ~__ste_email_to0~0 1)) (not (= 1 ULTIMATE.start_setup_chuck_~chuck___0)) (= ~rjh~0 2)) [2019-10-22 11:24:10,248 INFO L439 ceAbstractionStarter]: At program point L2426-14(lines 2416 2435) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 1 ~queue_empty~0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= ~__ste_email_to1~0 0) (not (= ULTIMATE.start_setClientId_~handle 2)) (= 0 ~in_encrypted~0) (not (= ~__ste_email_to0~0 1)) (not (= 1 ULTIMATE.start_setup_chuck_~chuck___0)) (= ~rjh~0 2)) [2019-10-22 11:24:10,248 INFO L443 ceAbstractionStarter]: For program point L2493(lines 2493 2499) no Hoare annotation was computed. [2019-10-22 11:24:10,248 INFO L443 ceAbstractionStarter]: For program point L1238(lines 1238 1244) no Hoare annotation was computed. [2019-10-22 11:24:10,248 INFO L443 ceAbstractionStarter]: For program point L1238-1(lines 1238 1244) no Hoare annotation was computed. [2019-10-22 11:24:10,248 INFO L443 ceAbstractionStarter]: For program point L842(lines 842 849) no Hoare annotation was computed. [2019-10-22 11:24:10,248 INFO L443 ceAbstractionStarter]: For program point L1635(lines 1635 1642) no Hoare annotation was computed. [2019-10-22 11:24:10,249 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 747) no Hoare annotation was computed. [2019-10-22 11:24:10,249 INFO L443 ceAbstractionStarter]: For program point L1635-2(lines 1635 1642) no Hoare annotation was computed. [2019-10-22 11:24:10,249 INFO L439 ceAbstractionStarter]: At program point L2362(lines 2345 2368) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= ~__ste_email_to0~0 2) (= 1 ~queue_empty~0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= ~__ste_email_to1~0 0) (not (= ULTIMATE.start_setClientId_~handle 2)) (= 1 ULTIMATE.start_setEmailTo_~handle) (= 2 ULTIMATE.start_createEmail_~to) (= ULTIMATE.start_setEmailTo_~value 2) (= 1 ULTIMATE.start_createEmail_~msg~0) (not (= 1 ULTIMATE.start_setup_chuck_~chuck___0)) (= ~rjh~0 2)) [2019-10-22 11:24:10,249 INFO L446 ceAbstractionStarter]: At program point L2362-1(lines 2345 2368) the Hoare annotation is: true [2019-10-22 11:24:10,249 INFO L443 ceAbstractionStarter]: For program point L2693(lines 2693 2697) no Hoare annotation was computed. [2019-10-22 11:24:10,249 INFO L443 ceAbstractionStarter]: For program point L2693-3(lines 2693 2697) no Hoare annotation was computed. [2019-10-22 11:24:10,249 INFO L443 ceAbstractionStarter]: For program point L2693-6(lines 2693 2697) no Hoare annotation was computed. [2019-10-22 11:24:10,249 INFO L443 ceAbstractionStarter]: For program point L2693-9(lines 2693 2697) no Hoare annotation was computed. [2019-10-22 11:24:10,249 INFO L443 ceAbstractionStarter]: For program point L2693-12(lines 2693 2697) no Hoare annotation was computed. [2019-10-22 11:24:10,249 INFO L439 ceAbstractionStarter]: At program point L1243(lines 1230 1248) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= ~__ste_email_to0~0 2) (= 1 ~queue_empty~0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= ~__ste_email_to1~0 0) (not (= ULTIMATE.start_setClientId_~handle 2)) (= 1 ULTIMATE.start_setEmailTo_~handle) (= 2 ULTIMATE.start_createEmail_~to) (= ULTIMATE.start_setEmailTo_~value 2) (= 1 ULTIMATE.start_createEmail_~msg~0) (not (= 1 ULTIMATE.start_setup_chuck_~chuck___0)) (= ~rjh~0 2)) [2019-10-22 11:24:10,249 INFO L446 ceAbstractionStarter]: At program point L1243-1(lines 1230 1248) the Hoare annotation is: true [2019-10-22 11:24:10,250 INFO L439 ceAbstractionStarter]: At program point L1707(lines 1702 1710) the Hoare annotation is: false [2019-10-22 11:24:10,250 INFO L443 ceAbstractionStarter]: For program point L584(lines 584 591) no Hoare annotation was computed. [2019-10-22 11:24:10,250 INFO L446 ceAbstractionStarter]: At program point L584-1(lines 584 591) the Hoare annotation is: true [2019-10-22 11:24:10,250 INFO L439 ceAbstractionStarter]: At program point L915(lines 902 946) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 1 ~queue_empty~0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= ~__ste_email_to1~0 0) (not (= ULTIMATE.start_setClientId_~handle 2)) (= 0 ~in_encrypted~0) (not (= ~__ste_email_to0~0 1)) (not (= 1 ULTIMATE.start_setup_chuck_~chuck___0)) (= ~rjh~0 2)) [2019-10-22 11:24:10,250 INFO L443 ceAbstractionStarter]: For program point L2700(lines 2700 2724) no Hoare annotation was computed. [2019-10-22 11:24:10,251 INFO L443 ceAbstractionStarter]: For program point L2700-2(lines 2700 2724) no Hoare annotation was computed. [2019-10-22 11:24:10,251 INFO L443 ceAbstractionStarter]: For program point L2700-1(lines 2700 2724) no Hoare annotation was computed. [2019-10-22 11:24:10,251 INFO L443 ceAbstractionStarter]: For program point L2700-4(lines 2700 2724) no Hoare annotation was computed. [2019-10-22 11:24:10,251 INFO L443 ceAbstractionStarter]: For program point L1577(lines 1577 1584) no Hoare annotation was computed. [2019-10-22 11:24:10,251 INFO L443 ceAbstractionStarter]: For program point L2700-3(lines 2700 2724) no Hoare annotation was computed. [2019-10-22 11:24:10,251 INFO L439 ceAbstractionStarter]: At program point L1577-1(lines 1577 1584) the Hoare annotation is: (let ((.cse7 (= 1 ~queue_empty~0)) (.cse8 (= ~__ste_email_to1~0 0)) (.cse0 (= ~__ste_email_to0~0 2)) (.cse1 (= 2 ULTIMATE.start_setup_rjh_~rjh___0)) (.cse2 (= 2 ULTIMATE.start_createEmail_~to)) (.cse4 (= ULTIMATE.start_setEmailTo_~value 2)) (.cse3 (and (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (not (= 1 ULTIMATE.start_setup_rjh_~rjh___0)) (not (= ULTIMATE.start_setClientId_~handle 2)) (not (= 1 ULTIMATE.start_setup_chuck_~chuck___0))) (= 1 ULTIMATE.start_setEmailTo_~handle) (= 0 ~in_encrypted~0) (not (= 1 ULTIMATE.start_createEmail_~to)) (not (= ULTIMATE.start_setEmailTo_~value 1)) (not (= ~__ste_email_to0~0 1)) (= 1 ULTIMATE.start_createEmail_~msg~0))) (.cse5 (= ULTIMATE.start_outgoing_~msg ULTIMATE.start_getEmailTo_~handle)) (.cse6 (= ~rjh~0 2))) (or (and (and .cse0 .cse1 (= 2 |ULTIMATE.start_getEmailTo_#res|) .cse2 (and (= 1 ULTIMATE.start_getEmailTo_~handle) .cse3) .cse4 .cse5 .cse6) .cse7 .cse8) (and .cse7 (= 0 |ULTIMATE.start_getEmailTo_#res|) .cse8 (and .cse0 .cse1 .cse2 .cse4 (and .cse3 (not (= 1 ULTIMATE.start_outgoing_~msg)) .cse5) .cse6)))) [2019-10-22 11:24:10,251 INFO L443 ceAbstractionStarter]: For program point L2502(lines 2502 2518) no Hoare annotation was computed. [2019-10-22 11:24:10,251 INFO L443 ceAbstractionStarter]: For program point L1577-2(lines 1577 1584) no Hoare annotation was computed. [2019-10-22 11:24:10,251 INFO L439 ceAbstractionStarter]: At program point L1577-3(lines 1577 1584) the Hoare annotation is: false [2019-10-22 11:24:10,252 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-22 11:24:10,252 INFO L439 ceAbstractionStarter]: At program point L851(lines 838 951) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 1 ~queue_empty~0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= ~__ste_email_to1~0 0) (not (= ULTIMATE.start_setClientId_~handle 2)) (= 0 ~in_encrypted~0) (not (= ~__ste_email_to0~0 1)) (not (= 1 ULTIMATE.start_setup_chuck_~chuck___0)) (= ~rjh~0 2)) [2019-10-22 11:24:10,252 INFO L443 ceAbstractionStarter]: For program point L2701(lines 2701 2709) no Hoare annotation was computed. [2019-10-22 11:24:10,252 INFO L443 ceAbstractionStarter]: For program point L2635-1(lines 2635 2681) no Hoare annotation was computed. [2019-10-22 11:24:10,252 INFO L443 ceAbstractionStarter]: For program point L2701-2(lines 2701 2709) no Hoare annotation was computed. [2019-10-22 11:24:10,252 INFO L443 ceAbstractionStarter]: For program point L2635(lines 2635 2681) no Hoare annotation was computed. [2019-10-22 11:24:10,252 INFO L443 ceAbstractionStarter]: For program point L2701-4(lines 2701 2709) no Hoare annotation was computed. [2019-10-22 11:24:10,252 INFO L443 ceAbstractionStarter]: For program point L2503(lines 2503 2514) no Hoare annotation was computed. [2019-10-22 11:24:10,252 INFO L443 ceAbstractionStarter]: For program point L2701-6(lines 2701 2709) no Hoare annotation was computed. [2019-10-22 11:24:10,252 INFO L443 ceAbstractionStarter]: For program point L2701-8(lines 2701 2709) no Hoare annotation was computed. [2019-10-22 11:24:10,252 INFO L443 ceAbstractionStarter]: For program point L2636(lines 2636 2647) no Hoare annotation was computed. [2019-10-22 11:24:10,252 INFO L443 ceAbstractionStarter]: For program point L2636-1(lines 2636 2647) no Hoare annotation was computed. [2019-10-22 11:24:10,253 INFO L443 ceAbstractionStarter]: For program point L2373(lines 2373 2385) no Hoare annotation was computed. [2019-10-22 11:24:10,253 INFO L443 ceAbstractionStarter]: For program point L2373-2(lines 2373 2385) no Hoare annotation was computed. [2019-10-22 11:24:10,253 INFO L443 ceAbstractionStarter]: For program point L2373-4(lines 2373 2385) no Hoare annotation was computed. [2019-10-22 11:24:10,253 INFO L443 ceAbstractionStarter]: For program point L2373-6(lines 2373 2385) no Hoare annotation was computed. [2019-10-22 11:24:10,253 INFO L443 ceAbstractionStarter]: For program point L2373-8(lines 2373 2385) no Hoare annotation was computed. [2019-10-22 11:24:10,253 INFO L443 ceAbstractionStarter]: For program point L2373-10(lines 2373 2385) no Hoare annotation was computed. [2019-10-22 11:24:10,253 INFO L443 ceAbstractionStarter]: For program point L920(lines 920 927) no Hoare annotation was computed. [2019-10-22 11:24:10,253 INFO L443 ceAbstractionStarter]: For program point L2704(lines 2704 2708) no Hoare annotation was computed. [2019-10-22 11:24:10,253 INFO L443 ceAbstractionStarter]: For program point L2704-3(lines 2704 2708) no Hoare annotation was computed. [2019-10-22 11:24:10,253 INFO L443 ceAbstractionStarter]: For program point L2704-6(lines 2704 2708) no Hoare annotation was computed. [2019-10-22 11:24:10,253 INFO L443 ceAbstractionStarter]: For program point L2704-9(lines 2704 2708) no Hoare annotation was computed. [2019-10-22 11:24:10,253 INFO L443 ceAbstractionStarter]: For program point L2704-12(lines 2704 2708) no Hoare annotation was computed. [2019-10-22 11:24:10,253 INFO L443 ceAbstractionStarter]: For program point L2507(lines 2507 2513) no Hoare annotation was computed. [2019-10-22 11:24:10,253 INFO L443 ceAbstractionStarter]: For program point L856(lines 856 863) no Hoare annotation was computed. [2019-10-22 11:24:10,254 INFO L443 ceAbstractionStarter]: For program point L2640(lines 2640 2646) no Hoare annotation was computed. [2019-10-22 11:24:10,254 INFO L446 ceAbstractionStarter]: At program point L592(lines 574 594) the Hoare annotation is: true [2019-10-22 11:24:10,254 INFO L443 ceAbstractionStarter]: For program point L2640-1(lines 2640 2646) no Hoare annotation was computed. [2019-10-22 11:24:10,254 INFO L443 ceAbstractionStarter]: For program point L2376(lines 2376 2384) no Hoare annotation was computed. [2019-10-22 11:24:10,255 INFO L443 ceAbstractionStarter]: For program point L2376-2(lines 2376 2384) no Hoare annotation was computed. [2019-10-22 11:24:10,255 INFO L443 ceAbstractionStarter]: For program point L2376-4(lines 2376 2384) no Hoare annotation was computed. [2019-10-22 11:24:10,255 INFO L443 ceAbstractionStarter]: For program point L1253(lines 1253 1261) no Hoare annotation was computed. [2019-10-22 11:24:10,255 INFO L443 ceAbstractionStarter]: For program point L2376-6(lines 2376 2384) no Hoare annotation was computed. [2019-10-22 11:24:10,255 INFO L443 ceAbstractionStarter]: For program point L1253-2(lines 1253 1261) no Hoare annotation was computed. [2019-10-22 11:24:10,255 INFO L443 ceAbstractionStarter]: For program point L2376-8(lines 2376 2384) no Hoare annotation was computed. [2019-10-22 11:24:10,255 INFO L443 ceAbstractionStarter]: For program point L1253-4(lines 1253 1261) no Hoare annotation was computed. [2019-10-22 11:24:10,255 INFO L443 ceAbstractionStarter]: For program point L2376-10(lines 2376 2384) no Hoare annotation was computed. [2019-10-22 11:24:10,255 INFO L443 ceAbstractionStarter]: For program point L1253-6(lines 1253 1261) no Hoare annotation was computed. [2019-10-22 11:24:10,255 INFO L439 ceAbstractionStarter]: At program point L1716(lines 1711 1719) the Hoare annotation is: false [2019-10-22 11:24:10,256 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-10-22 11:24:10,256 INFO L443 ceAbstractionStarter]: For program point L792(lines 791 955) no Hoare annotation was computed. [2019-10-22 11:24:10,256 INFO L443 ceAbstractionStarter]: For program point L528(lines 528 536) no Hoare annotation was computed. [2019-10-22 11:24:10,256 INFO L439 ceAbstractionStarter]: At program point L1519(lines 1508 1522) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 1 ~queue_empty~0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (not (= ULTIMATE.start_setClientId_~handle 2)) (= ~__ste_email_to1~0 0) (= 1 ULTIMATE.start_setEmailTo_~handle) (= 0 ~in_encrypted~0) (= ULTIMATE.start_setEmailTo_~value 2) (not (= 1 ULTIMATE.start_setup_chuck_~chuck___0)) (= ~__ste_email_to0~0 2) (= 2 ULTIMATE.start_createEmail_~to) (= 1 ULTIMATE.start_createEmail_~msg~0) (= ~rjh~0 2)) [2019-10-22 11:24:10,256 INFO L443 ceAbstractionStarter]: For program point L793(lines 793 797) no Hoare annotation was computed. [2019-10-22 11:24:10,256 INFO L439 ceAbstractionStarter]: At program point L1388(lines 1378 1390) the Hoare annotation is: (let ((.cse0 (= 1 ~queue_empty~0)) (.cse7 (= ~__ste_email_to1~0 0)) (.cse1 (= ~__ste_email_to0~0 2)) (.cse3 (and (not (= 1 ULTIMATE.start_incoming_~client)) (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (not (= 1 ULTIMATE.start_setup_rjh_~rjh___0)) (not (= ULTIMATE.start_setClientId_~handle 2)) (not (= 1 ULTIMATE.start_setup_chuck_~chuck___0))) (not (= 1 |ULTIMATE.start_getEmailTo_#res|)) (= 1 ULTIMATE.start_setEmailTo_~handle) (not (= ~__ste_email_to0~0 1)) (= 1 ULTIMATE.start_createEmail_~msg~0))) (.cse4 (= 2 ULTIMATE.start_createEmail_~to)) (.cse5 (= ULTIMATE.start_setEmailTo_~value 2)) (.cse6 (= ~rjh~0 2)) (.cse2 (= 2 ULTIMATE.start_setup_rjh_~rjh___0))) (or (and .cse0 (and (and .cse1 (not (= 1 ULTIMATE.start_outgoing__wrappee__Keys_~msg)) .cse2 .cse3 .cse4 (not (= ULTIMATE.start_mail_~msg 1)) (not (= ULTIMATE.start_isEncrypted_~handle 1)) .cse5 (not (= 1 ULTIMATE.start_outgoing_~msg)) .cse6) (= 0 |ULTIMATE.start_getEmailTo_#res|) .cse7 (= 0 ULTIMATE.start_incoming_~client))) (and .cse0 .cse7 (and (and .cse1 (= 2 |ULTIMATE.start_getEmailTo_#res|) .cse3 (= 2 ULTIMATE.start_incoming_~client) .cse4 .cse5 .cse6) .cse2)))) [2019-10-22 11:24:10,256 INFO L446 ceAbstractionStarter]: At program point L1388-1(lines 1378 1390) the Hoare annotation is: true [2019-10-22 11:24:10,256 INFO L443 ceAbstractionStarter]: For program point L2379(lines 2379 2383) no Hoare annotation was computed. [2019-10-22 11:24:10,256 INFO L443 ceAbstractionStarter]: For program point L2379-3(lines 2379 2383) no Hoare annotation was computed. [2019-10-22 11:24:10,256 INFO L439 ceAbstractionStarter]: At program point L2379-2(lines 1 2840) the Hoare annotation is: (and (= ~__ste_Client_Keyring0_User0~0 ~__ste_Client_Keyring0_User1~0) (= 1 ~queue_empty~0) (not (= ~rjh~0 1)) (not (= ULTIMATE.start_setClientId_~handle 2)) (= ~__ste_email_to1~0 0) (= 0 ~in_encrypted~0) (= 0 ~__ste_Client_Keyring0_User0~0) (not (= ~__ste_email_to0~0 1))) [2019-10-22 11:24:10,257 INFO L443 ceAbstractionStarter]: For program point L1256(lines 1256 1260) no Hoare annotation was computed. [2019-10-22 11:24:10,257 INFO L439 ceAbstractionStarter]: At program point L2379-5(lines 1 2840) the Hoare annotation is: (and (= ~__ste_client_privateKey1~0 456) (= ~__ste_Client_Keyring0_User0~0 ~__ste_Client_Keyring0_User1~0) (= 1 ~queue_empty~0) (= ~__ste_email_to1~0 0) (= ~rjh~0 ULTIMATE.start_setClientId_~handle) (= 456 ULTIMATE.start_setClientPrivateKey_~value) (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_rjh_~rjh___0) (= 0 ~in_encrypted~0) (= 0 ~__ste_Client_Keyring0_User0~0) (= ULTIMATE.start_setClientPrivateKey_~handle 2) (not (= ~__ste_email_to0~0 1)) (= ~rjh~0 2)) [2019-10-22 11:24:10,257 INFO L439 ceAbstractionStarter]: At program point L1256-2(lines 1249 1264) the Hoare annotation is: (let ((.cse7 (= 1 ~queue_empty~0)) (.cse8 (= ~__ste_email_to1~0 0)) (.cse0 (= ~__ste_email_to0~0 2)) (.cse1 (= 2 ULTIMATE.start_setup_rjh_~rjh___0)) (.cse2 (= 2 ULTIMATE.start_createEmail_~to)) (.cse4 (= ULTIMATE.start_setEmailTo_~value 2)) (.cse3 (and (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (not (= 1 ULTIMATE.start_setup_rjh_~rjh___0)) (not (= ULTIMATE.start_setClientId_~handle 2)) (not (= 1 ULTIMATE.start_setup_chuck_~chuck___0))) (= 1 ULTIMATE.start_setEmailTo_~handle) (= 0 ~in_encrypted~0) (not (= 1 ULTIMATE.start_createEmail_~to)) (not (= ULTIMATE.start_setEmailTo_~value 1)) (not (= ~__ste_email_to0~0 1)) (= 1 ULTIMATE.start_createEmail_~msg~0))) (.cse5 (= ULTIMATE.start_outgoing_~msg ULTIMATE.start_getEmailTo_~handle)) (.cse6 (= ~rjh~0 2))) (or (and (and .cse0 .cse1 (= 2 |ULTIMATE.start_getEmailTo_#res|) .cse2 (and (= 1 ULTIMATE.start_getEmailTo_~handle) .cse3) .cse4 .cse5 .cse6) .cse7 .cse8) (and .cse7 (= 0 |ULTIMATE.start_getEmailTo_#res|) .cse8 (and .cse0 .cse1 .cse2 .cse4 (and .cse3 (not (= 1 ULTIMATE.start_outgoing_~msg)) .cse5) .cse6)))) [2019-10-22 11:24:10,257 INFO L443 ceAbstractionStarter]: For program point L1256-3(lines 1256 1260) no Hoare annotation was computed. [2019-10-22 11:24:10,257 INFO L443 ceAbstractionStarter]: For program point L2379-6(lines 2379 2383) no Hoare annotation was computed. [2019-10-22 11:24:10,257 INFO L443 ceAbstractionStarter]: For program point L2379-9(lines 2379 2383) no Hoare annotation was computed. [2019-10-22 11:24:10,257 INFO L439 ceAbstractionStarter]: At program point L2379-8(lines 1 2840) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 1 ~queue_empty~0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (not (= ULTIMATE.start_setClientPrivateKey_~handle 2)) (= ~__ste_email_to1~0 0) (= 0 ~in_encrypted~0) (not (= ~__ste_email_to0~0 1)) (not (= 1 ULTIMATE.start_setup_chuck_~chuck___0)) (= ~__ste_client_privateKey1~0 456) (= ~__ste_Client_Keyring0_User0~0 ~__ste_Client_Keyring0_User1~0) (not (= 2 ULTIMATE.start_setup_chuck_~chuck___0)) (not (= ULTIMATE.start_setClientPrivateKey_~handle 1)) (= 0 ~__ste_Client_Keyring0_User0~0) (= ~rjh~0 2)) [2019-10-22 11:24:10,257 INFO L443 ceAbstractionStarter]: For program point L1256-6(lines 1256 1260) no Hoare annotation was computed. [2019-10-22 11:24:10,257 INFO L439 ceAbstractionStarter]: At program point L2379-11(lines 1 2840) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 1 ~queue_empty~0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= ~__ste_email_to1~0 0) (not (= ULTIMATE.start_setClientId_~handle 2)) (= 0 ~in_encrypted~0) (not (= ~__ste_email_to0~0 1)) (not (= 1 ULTIMATE.start_setup_chuck_~chuck___0)) (= ~rjh~0 2)) [2019-10-22 11:24:10,258 INFO L439 ceAbstractionStarter]: At program point L1256-8(lines 1249 1264) the Hoare annotation is: false [2019-10-22 11:24:10,258 INFO L443 ceAbstractionStarter]: For program point L1256-9(lines 1256 1260) no Hoare annotation was computed. [2019-10-22 11:24:10,258 INFO L443 ceAbstractionStarter]: For program point L2379-12(lines 2379 2383) no Hoare annotation was computed. [2019-10-22 11:24:10,258 INFO L443 ceAbstractionStarter]: For program point L2379-15(lines 2379 2383) no Hoare annotation was computed. [2019-10-22 11:24:10,258 INFO L439 ceAbstractionStarter]: At program point L2379-14(lines 697 706) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 1 ~queue_empty~0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= ~__ste_email_to1~0 0) (not (= ULTIMATE.start_setClientId_~handle 2)) (= 0 ~in_encrypted~0) (not (= ~__ste_email_to0~0 1)) (not (= 1 ULTIMATE.start_setup_chuck_~chuck___0)) (= ~rjh~0 2)) [2019-10-22 11:24:10,259 INFO L439 ceAbstractionStarter]: At program point L2379-17(lines 687 696) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 1 ~queue_empty~0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= ~__ste_email_to1~0 0) (not (= ULTIMATE.start_setClientId_~handle 2)) (= 0 ~in_encrypted~0) (not (= ~__ste_email_to0~0 1)) (not (= 1 ULTIMATE.start_setup_chuck_~chuck___0)) (= ~rjh~0 2)) [2019-10-22 11:24:10,259 INFO L439 ceAbstractionStarter]: At program point L2711-1(lines 2685 2728) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 1 ~queue_empty~0) (= 0 ULTIMATE.start_test_~op1~0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= ~__ste_email_to1~0 0) (not (= ULTIMATE.start_setClientId_~handle 2)) (= 0 ~in_encrypted~0) (not (= ~__ste_email_to0~0 1)) (not (= 1 ULTIMATE.start_setup_chuck_~chuck___0)) (= ~rjh~0 2)) [2019-10-22 11:24:10,259 INFO L443 ceAbstractionStarter]: For program point L2711(lines 2711 2723) no Hoare annotation was computed. [2019-10-22 11:24:10,259 INFO L439 ceAbstractionStarter]: At program point L2711-3(lines 1 2840) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 1 ~queue_empty~0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= ~__ste_email_to1~0 0) (not (= ULTIMATE.start_setClientId_~handle 2)) (= 0 ~in_encrypted~0) (not (= ~__ste_email_to0~0 1)) (not (= 1 ULTIMATE.start_setup_chuck_~chuck___0)) (= ~rjh~0 2)) [2019-10-22 11:24:10,259 INFO L443 ceAbstractionStarter]: For program point L2711-2(lines 2711 2723) no Hoare annotation was computed. [2019-10-22 11:24:10,259 INFO L439 ceAbstractionStarter]: At program point L2711-5(lines 1 2840) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 1 ~queue_empty~0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= ~__ste_email_to1~0 0) (not (= ULTIMATE.start_setClientId_~handle 2)) (= 0 ~in_encrypted~0) (not (= ~__ste_email_to0~0 1)) (not (= 1 ULTIMATE.start_setup_chuck_~chuck___0)) (= ~rjh~0 2)) [2019-10-22 11:24:10,259 INFO L443 ceAbstractionStarter]: For program point L2711-4(lines 2711 2723) no Hoare annotation was computed. [2019-10-22 11:24:10,260 INFO L439 ceAbstractionStarter]: At program point L2711-7(lines 1 2840) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 1 ~queue_empty~0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= ~__ste_email_to1~0 0) (not (= ULTIMATE.start_setClientId_~handle 2)) (= 0 ~in_encrypted~0) (not (= ~__ste_email_to0~0 1)) (not (= 1 ULTIMATE.start_setup_chuck_~chuck___0)) (= ~rjh~0 2)) [2019-10-22 11:24:10,260 INFO L443 ceAbstractionStarter]: For program point L2711-6(lines 2711 2723) no Hoare annotation was computed. [2019-10-22 11:24:10,260 INFO L443 ceAbstractionStarter]: For program point L2447-1(lines 2447 2457) no Hoare annotation was computed. [2019-10-22 11:24:10,260 INFO L439 ceAbstractionStarter]: At program point L2711-9(lines 1 2840) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 1 ~queue_empty~0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= ~__ste_email_to1~0 0) (not (= ULTIMATE.start_setClientId_~handle 2)) (= 0 ~in_encrypted~0) (not (= ~__ste_email_to0~0 1)) (not (= 1 ULTIMATE.start_setup_chuck_~chuck___0)) (= ~rjh~0 2)) [2019-10-22 11:24:10,260 INFO L443 ceAbstractionStarter]: For program point L2447(lines 2447 2457) no Hoare annotation was computed. [2019-10-22 11:24:10,260 INFO L443 ceAbstractionStarter]: For program point L2711-8(lines 2711 2723) no Hoare annotation was computed. [2019-10-22 11:24:10,260 INFO L443 ceAbstractionStarter]: For program point L2447-3(lines 2447 2457) no Hoare annotation was computed. [2019-10-22 11:24:10,260 INFO L443 ceAbstractionStarter]: For program point L2447-2(lines 2447 2457) no Hoare annotation was computed. [2019-10-22 11:24:10,260 INFO L443 ceAbstractionStarter]: For program point L2447-4(lines 2447 2457) no Hoare annotation was computed. [2019-10-22 11:24:10,260 INFO L439 ceAbstractionStarter]: At program point L730(lines 1 2840) the Hoare annotation is: (and (= ~__ste_Client_Keyring0_User0~0 ~__ste_Client_Keyring0_User1~0) (= 1 ~queue_empty~0) (not (= ~rjh~0 1)) (= ~__ste_email_to1~0 0) (= 0 ~in_encrypted~0) (= 0 ~__ste_Client_Keyring0_User0~0) (not (= ~__ste_email_to0~0 1))) [2019-10-22 11:24:10,260 INFO L443 ceAbstractionStarter]: For program point L2712(lines 2712 2720) no Hoare annotation was computed. [2019-10-22 11:24:10,260 INFO L443 ceAbstractionStarter]: For program point L2712-2(lines 2712 2720) no Hoare annotation was computed. [2019-10-22 11:24:10,261 INFO L443 ceAbstractionStarter]: For program point L2712-4(lines 2712 2720) no Hoare annotation was computed. [2019-10-22 11:24:10,261 INFO L443 ceAbstractionStarter]: For program point L2712-6(lines 2712 2720) no Hoare annotation was computed. [2019-10-22 11:24:10,261 INFO L443 ceAbstractionStarter]: For program point L2712-8(lines 2712 2720) no Hoare annotation was computed. [2019-10-22 11:24:10,261 INFO L439 ceAbstractionStarter]: At program point L929(lines 916 945) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 1 ~queue_empty~0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= ~__ste_email_to1~0 0) (not (= ULTIMATE.start_setClientId_~handle 2)) (= 0 ~in_encrypted~0) (not (= ~__ste_email_to0~0 1)) (not (= 1 ULTIMATE.start_setup_chuck_~chuck___0)) (= ~rjh~0 2)) [2019-10-22 11:24:10,261 INFO L443 ceAbstractionStarter]: For program point L2581(lines 2581 2627) no Hoare annotation was computed. [2019-10-22 11:24:10,261 INFO L443 ceAbstractionStarter]: For program point L2582(lines 2582 2593) no Hoare annotation was computed. [2019-10-22 11:24:10,261 INFO L439 ceAbstractionStarter]: At program point L865(lines 852 950) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 1 ~queue_empty~0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= ~__ste_email_to1~0 0) (not (= ULTIMATE.start_setClientId_~handle 2)) (= 0 ~in_encrypted~0) (not (= ~__ste_email_to0~0 1)) (not (= 1 ULTIMATE.start_setup_chuck_~chuck___0)) (= ~rjh~0 2)) [2019-10-22 11:24:10,261 INFO L443 ceAbstractionStarter]: For program point L799(lines 799 954) no Hoare annotation was computed. [2019-10-22 11:24:10,261 INFO L443 ceAbstractionStarter]: For program point L2715(lines 2715 2719) no Hoare annotation was computed. [2019-10-22 11:24:10,261 INFO L443 ceAbstractionStarter]: For program point L2715-3(lines 2715 2719) no Hoare annotation was computed. [2019-10-22 11:24:10,261 INFO L443 ceAbstractionStarter]: For program point L2649-1(lines 2649 2680) no Hoare annotation was computed. [2019-10-22 11:24:10,262 INFO L443 ceAbstractionStarter]: For program point L2649(lines 2649 2680) no Hoare annotation was computed. [2019-10-22 11:24:10,262 INFO L439 ceAbstractionStarter]: At program point L2517(lines 2470 2523) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 1 ~queue_empty~0) (= 0 ULTIMATE.start_test_~op1~0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= ~__ste_email_to1~0 0) (not (= ULTIMATE.start_setClientId_~handle 2)) (= 0 ~in_encrypted~0) (not (= ~__ste_email_to0~0 1)) (not (= 1 ULTIMATE.start_setup_chuck_~chuck___0)) (= ~rjh~0 2)) [2019-10-22 11:24:10,262 INFO L443 ceAbstractionStarter]: For program point L2715-6(lines 2715 2719) no Hoare annotation was computed. [2019-10-22 11:24:10,262 INFO L443 ceAbstractionStarter]: For program point L2715-9(lines 2715 2719) no Hoare annotation was computed. [2019-10-22 11:24:10,262 INFO L443 ceAbstractionStarter]: For program point L2715-12(lines 2715 2719) no Hoare annotation was computed. [2019-10-22 11:24:10,263 INFO L443 ceAbstractionStarter]: For program point L1064(lines 1064 1072) no Hoare annotation was computed. [2019-10-22 11:24:10,263 INFO L443 ceAbstractionStarter]: For program point L1064-2(lines 1064 1072) no Hoare annotation was computed. [2019-10-22 11:24:10,263 INFO L443 ceAbstractionStarter]: For program point L1064-4(lines 1064 1072) no Hoare annotation was computed. [2019-10-22 11:24:10,263 INFO L443 ceAbstractionStarter]: For program point L2650(lines 2650 2661) no Hoare annotation was computed. [2019-10-22 11:24:10,263 INFO L443 ceAbstractionStarter]: For program point L2650-1(lines 2650 2661) no Hoare annotation was computed. [2019-10-22 11:24:10,263 INFO L443 ceAbstractionStarter]: For program point L1197(lines 1197 1208) no Hoare annotation was computed. [2019-10-22 11:24:10,263 INFO L443 ceAbstractionStarter]: For program point L1197-1(lines 1197 1208) no Hoare annotation was computed. [2019-10-22 11:24:10,263 INFO L443 ceAbstractionStarter]: For program point L1197-2(lines 1197 1208) no Hoare annotation was computed. [2019-10-22 11:24:10,263 INFO L443 ceAbstractionStarter]: For program point L1197-3(lines 1197 1208) no Hoare annotation was computed. [2019-10-22 11:24:10,263 INFO L443 ceAbstractionStarter]: For program point L1197-4(lines 1197 1208) no Hoare annotation was computed. [2019-10-22 11:24:10,263 INFO L443 ceAbstractionStarter]: For program point L1197-5(lines 1197 1208) no Hoare annotation was computed. [2019-10-22 11:24:10,264 INFO L443 ceAbstractionStarter]: For program point L934(lines 934 941) no Hoare annotation was computed. [2019-10-22 11:24:10,264 INFO L439 ceAbstractionStarter]: At program point L934-1(lines 791 955) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 1 ~queue_empty~0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= ~__ste_email_to1~0 0) (not (= ULTIMATE.start_setClientId_~handle 2)) (= 0 ~in_encrypted~0) (not (= ~__ste_email_to0~0 1)) (not (= 1 ULTIMATE.start_setup_chuck_~chuck___0)) (= ~rjh~0 2)) [2019-10-22 11:24:10,264 INFO L443 ceAbstractionStarter]: For program point L2784(lines 2784 2800) no Hoare annotation was computed. [2019-10-22 11:24:10,264 INFO L443 ceAbstractionStarter]: For program point L2784-1(lines 2784 2800) no Hoare annotation was computed. [2019-10-22 11:24:10,264 INFO L443 ceAbstractionStarter]: For program point L2586(lines 2586 2592) no Hoare annotation was computed. [2019-10-22 11:24:10,264 INFO L443 ceAbstractionStarter]: For program point L1067(lines 1067 1071) no Hoare annotation was computed. [2019-10-22 11:24:10,264 INFO L439 ceAbstractionStarter]: At program point L1067-2(lines 1060 1075) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 1 ~queue_empty~0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (not (= ULTIMATE.start_setClientId_~handle 2)) (= ~__ste_email_to1~0 0) (= 2 ULTIMATE.start_createEmail_~to) (= 0 ~in_encrypted~0) (not (= ~__ste_email_to0~0 1)) (= 1 ULTIMATE.start_createEmail_~msg~0) (not (= 1 ULTIMATE.start_setup_chuck_~chuck___0)) (= ~rjh~0 2)) [2019-10-22 11:24:10,264 INFO L443 ceAbstractionStarter]: For program point L1067-3(lines 1067 1071) no Hoare annotation was computed. [2019-10-22 11:24:10,264 INFO L439 ceAbstractionStarter]: At program point L1067-5(lines 1060 1075) the Hoare annotation is: (let ((.cse2 (= ~__ste_email_to0~0 2)) (.cse5 (= 2 ULTIMATE.start_setup_rjh_~rjh___0)) (.cse6 (= 2 ULTIMATE.start_createEmail_~to)) (.cse3 (= 1 ULTIMATE.start_outgoing__wrappee__Keys_~msg)) (.cse4 (and (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (not (= 1 ULTIMATE.start_setup_rjh_~rjh___0)) (not (= ULTIMATE.start_setClientId_~handle 2)) (not (= 1 ULTIMATE.start_setup_chuck_~chuck___0))) (= 1 ULTIMATE.start_setEmailTo_~handle) (= 0 ~in_encrypted~0) (not (= 1 ULTIMATE.start_createEmail_~to)) (not (= ~__ste_email_to0~0 1)) (= 1 ULTIMATE.start_createEmail_~msg~0))) (.cse7 (= ULTIMATE.start_setEmailTo_~value 2)) (.cse8 (= ULTIMATE.start_outgoing_~msg ULTIMATE.start_getEmailTo_~handle)) (.cse9 (= ~rjh~0 2)) (.cse0 (= 1 ~queue_empty~0)) (.cse1 (= ~__ste_email_to1~0 0))) (or (and .cse0 (= 0 |ULTIMATE.start_getEmailTo_#res|) .cse1 (and .cse2 (not .cse3) .cse4 .cse5 .cse6 (not (= ULTIMATE.start_setEmailFrom_~handle 1)) .cse7 (not (= 1 ULTIMATE.start_outgoing_~msg)) .cse8 .cse9)) (and (and .cse2 .cse5 (= 2 |ULTIMATE.start_getEmailTo_#res|) .cse6 (and .cse3 (= 1 ULTIMATE.start_getEmailTo_~handle) .cse4) .cse7 .cse8 .cse9) .cse0 .cse1))) [2019-10-22 11:24:10,264 INFO L443 ceAbstractionStarter]: For program point L1067-6(lines 1067 1071) no Hoare annotation was computed. [2019-10-22 11:24:10,265 INFO L443 ceAbstractionStarter]: For program point L803(lines 803 810) no Hoare annotation was computed. [2019-10-22 11:24:10,265 INFO L439 ceAbstractionStarter]: At program point L1067-8(lines 1060 1075) the Hoare annotation is: false [2019-10-22 11:24:10,265 INFO L443 ceAbstractionStarter]: For program point L870(lines 870 874) no Hoare annotation was computed. [2019-10-22 11:24:10,265 INFO L439 ceAbstractionStarter]: At program point L738(lines 733 741) the Hoare annotation is: (and (= ~__ste_Client_Keyring0_User0~0 ~__ste_Client_Keyring0_User1~0) (= 1 ~queue_empty~0) (not (= ~rjh~0 1)) (= ~__ste_email_to1~0 0) (= 0 ~in_encrypted~0) (= 0 ~__ste_Client_Keyring0_User0~0) (not (= ~__ste_email_to0~0 1))) [2019-10-22 11:24:10,265 INFO L443 ceAbstractionStarter]: For program point L1729(lines 1729 1739) no Hoare annotation was computed. [2019-10-22 11:24:10,265 INFO L443 ceAbstractionStarter]: For program point L1729-1(lines 1729 1739) no Hoare annotation was computed. [2019-10-22 11:24:10,265 INFO L443 ceAbstractionStarter]: For program point L2654(lines 2654 2660) no Hoare annotation was computed. [2019-10-22 11:24:10,265 INFO L443 ceAbstractionStarter]: For program point L2654-1(lines 2654 2660) no Hoare annotation was computed. [2019-10-22 11:24:10,265 INFO L439 ceAbstractionStarter]: At program point L2456(lines 2436 2460) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 1 ~queue_empty~0) (= 0 ULTIMATE.start_test_~op1~0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= ~__ste_email_to1~0 0) (not (= ULTIMATE.start_setClientId_~handle 2)) (= 0 ~in_encrypted~0) (not (= ~__ste_email_to0~0 1)) (not (= 1 ULTIMATE.start_setup_chuck_~chuck___0)) (= ~rjh~0 2)) [2019-10-22 11:24:10,265 INFO L439 ceAbstractionStarter]: At program point L2456-2(lines 2436 2460) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 1 ~queue_empty~0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= ~__ste_email_to1~0 0) (not (= ULTIMATE.start_setClientId_~handle 2)) (= 0 ~in_encrypted~0) (not (= ~__ste_email_to0~0 1)) (not (= 1 ULTIMATE.start_setup_chuck_~chuck___0)) (= ~rjh~0 2)) [2019-10-22 11:24:10,265 INFO L439 ceAbstractionStarter]: At program point L2456-1(lines 2436 2460) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 1 ~queue_empty~0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= ~__ste_email_to1~0 0) (not (= ULTIMATE.start_setClientId_~handle 2)) (= 0 ~in_encrypted~0) (not (= ~__ste_email_to0~0 1)) (not (= 1 ULTIMATE.start_setup_chuck_~chuck___0)) (= ~rjh~0 2)) [2019-10-22 11:24:10,266 INFO L439 ceAbstractionStarter]: At program point L2456-4(lines 2436 2460) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 1 ~queue_empty~0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= ~__ste_email_to1~0 0) (not (= ULTIMATE.start_setClientId_~handle 2)) (= 0 ~in_encrypted~0) (not (= ~__ste_email_to0~0 1)) (not (= 1 ULTIMATE.start_setup_chuck_~chuck___0)) (= ~rjh~0 2)) [2019-10-22 11:24:10,266 INFO L439 ceAbstractionStarter]: At program point L2456-3(lines 2436 2460) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 1 ~queue_empty~0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= ~__ste_email_to1~0 0) (not (= ULTIMATE.start_setClientId_~handle 2)) (= 0 ~in_encrypted~0) (not (= ~__ste_email_to0~0 1)) (not (= 1 ULTIMATE.start_setup_chuck_~chuck___0)) (= ~rjh~0 2)) [2019-10-22 11:24:10,266 INFO L443 ceAbstractionStarter]: For program point L1201(lines 1201 1207) no Hoare annotation was computed. [2019-10-22 11:24:10,266 INFO L443 ceAbstractionStarter]: For program point L1201-1(lines 1201 1207) no Hoare annotation was computed. [2019-10-22 11:24:10,266 INFO L443 ceAbstractionStarter]: For program point L1201-2(lines 1201 1207) no Hoare annotation was computed. [2019-10-22 11:24:10,267 INFO L443 ceAbstractionStarter]: For program point L1201-3(lines 1201 1207) no Hoare annotation was computed. [2019-10-22 11:24:10,267 INFO L443 ceAbstractionStarter]: For program point L1201-4(lines 1201 1207) no Hoare annotation was computed. [2019-10-22 11:24:10,267 INFO L443 ceAbstractionStarter]: For program point L1201-5(lines 1201 1207) no Hoare annotation was computed. [2019-10-22 11:24:10,267 INFO L439 ceAbstractionStarter]: At program point L1598(lines 1670 1682) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= ~__ste_email_to0~0 2) (= 1 ~queue_empty~0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= ~__ste_email_to1~0 0) (not (= ULTIMATE.start_setClientId_~handle 2)) (= 1 ULTIMATE.start_setEmailTo_~handle) (= 2 ULTIMATE.start_createEmail_~to) (= ULTIMATE.start_setEmailTo_~value 2) (= 1 ULTIMATE.start_createEmail_~msg~0) (not (= 1 ULTIMATE.start_setup_chuck_~chuck___0)) (= ~rjh~0 2)) [2019-10-22 11:24:10,267 INFO L443 ceAbstractionStarter]: For program point L2788(lines 2788 2799) no Hoare annotation was computed. [2019-10-22 11:24:10,267 INFO L443 ceAbstractionStarter]: For program point L2788-1(lines 2788 2799) no Hoare annotation was computed. [2019-10-22 11:24:10,267 INFO L443 ceAbstractionStarter]: For program point L1401(lines 1401 1414) no Hoare annotation was computed. [2019-10-22 11:24:10,268 INFO L439 ceAbstractionStarter]: At program point L1401-1(lines 1391 1417) the Hoare annotation is: (let ((.cse0 (= 1 ~queue_empty~0)) (.cse1 (= ~__ste_email_to0~0 2)) (.cse4 (= 2 ULTIMATE.start_setup_rjh_~rjh___0)) (.cse2 (= 1 ULTIMATE.start_outgoing__wrappee__Keys_~msg)) (.cse6 (= ULTIMATE.start_mail_~msg 1)) (.cse3 (and (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (not (= 1 ULTIMATE.start_setup_rjh_~rjh___0)) (not (= ULTIMATE.start_setClientId_~handle 2)) (not (= 1 ULTIMATE.start_setup_chuck_~chuck___0))) (= 1 ULTIMATE.start_setEmailTo_~handle) (= 0 ~in_encrypted~0) (not (= ~__ste_email_to0~0 1)) (= 1 ULTIMATE.start_createEmail_~msg~0))) (.cse5 (= 2 ULTIMATE.start_createEmail_~to)) (.cse7 (= ULTIMATE.start_setEmailTo_~value 2)) (.cse8 (= ULTIMATE.start_outgoing_~msg ULTIMATE.start_getEmailTo_~handle)) (.cse9 (= ~rjh~0 2)) (.cse10 (= ~__ste_email_to1~0 0))) (or (and .cse0 (= 0 |ULTIMATE.start_getEmailTo_#res|) (and .cse1 (not .cse2) .cse3 .cse4 .cse5 (not .cse6) (not (= ULTIMATE.start_setEmailFrom_~handle 1)) .cse7 (not (= 1 ULTIMATE.start_outgoing_~msg)) .cse8 .cse9) .cse10) (and .cse0 (and .cse1 .cse4 (= 2 |ULTIMATE.start_getEmailTo_#res|) (and .cse2 (= 1 ULTIMATE.start_getEmailTo_~handle) .cse6 .cse3) .cse5 .cse7 .cse8 .cse9) .cse10))) [2019-10-22 11:24:10,268 INFO L443 ceAbstractionStarter]: For program point L1401-2(lines 1401 1414) no Hoare annotation was computed. [2019-10-22 11:24:10,268 INFO L446 ceAbstractionStarter]: At program point L1401-3(lines 1391 1417) the Hoare annotation is: true [2019-10-22 11:24:10,268 INFO L443 ceAbstractionStarter]: For program point L1733(lines 1733 1738) no Hoare annotation was computed. [2019-10-22 11:24:10,268 INFO L443 ceAbstractionStarter]: For program point L1733-1(lines 1733 1738) no Hoare annotation was computed. [2019-10-22 11:24:10,268 INFO L439 ceAbstractionStarter]: At program point L1206(lines 1193 1211) the Hoare annotation is: false [2019-10-22 11:24:10,268 INFO L439 ceAbstractionStarter]: At program point L1206-1(lines 1193 1211) the Hoare annotation is: (let ((.cse0 (= 1 ~queue_empty~0)) (.cse1 (= ~__ste_email_to1~0 0)) (.cse3 (= ~__ste_email_to0~0 2)) (.cse4 (and (not (= 1 ULTIMATE.start_incoming_~client)) (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (not (= 1 ULTIMATE.start_setup_rjh_~rjh___0)) (not (= ULTIMATE.start_setClientId_~handle 2)) (not (= 1 ULTIMATE.start_setup_chuck_~chuck___0))) (not (= 1 |ULTIMATE.start_getEmailTo_#res|)) (= 1 ULTIMATE.start_setEmailTo_~handle) (= 0 ~in_encrypted~0) (not (= ~__ste_email_to0~0 1)) (= 1 ULTIMATE.start_createEmail_~msg~0))) (.cse2 (= 2 ULTIMATE.start_setup_rjh_~rjh___0)) (.cse5 (= 2 ULTIMATE.start_createEmail_~to)) (.cse6 (= ULTIMATE.start_setEmailTo_~value 2)) (.cse7 (= ~rjh~0 2))) (or (and .cse0 .cse1 (and .cse2 (and .cse3 .cse4 (= 2 |ULTIMATE.start_getEmailTo_#res|) (= 2 ULTIMATE.start_incoming_~client) .cse5 .cse6 .cse7))) (and .cse0 (and (= 0 |ULTIMATE.start_getEmailTo_#res|) .cse1 (= 0 ULTIMATE.start_incoming_~client) (and .cse3 (not (= 1 ULTIMATE.start_outgoing__wrappee__Keys_~msg)) .cse4 .cse2 .cse5 (not (= ULTIMATE.start_mail_~msg 1)) (not (= ULTIMATE.start_isEncrypted_~handle 1)) .cse6 (not (= 1 ULTIMATE.start_outgoing_~msg)) .cse7))))) [2019-10-22 11:24:10,268 INFO L439 ceAbstractionStarter]: At program point L1206-2(lines 1193 1211) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= ~__ste_email_to0~0 2) (= 1 ~queue_empty~0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= ~__ste_email_to1~0 0) (not (= ULTIMATE.start_setClientId_~handle 2)) (= 1 ULTIMATE.start_setEmailTo_~handle) (= 2 ULTIMATE.start_createEmail_~to) (= ULTIMATE.start_setEmailTo_~value 2) (= 1 ULTIMATE.start_createEmail_~msg~0) (not (= 1 ULTIMATE.start_setup_chuck_~chuck___0)) (= ~rjh~0 2)) [2019-10-22 11:24:10,268 INFO L439 ceAbstractionStarter]: At program point L1206-3(lines 1193 1211) the Hoare annotation is: false [2019-10-22 11:24:10,268 INFO L446 ceAbstractionStarter]: At program point L1206-4(lines 1193 1211) the Hoare annotation is: true [2019-10-22 11:24:10,269 INFO L446 ceAbstractionStarter]: At program point L1206-5(lines 1193 1211) the Hoare annotation is: true [2019-10-22 11:24:10,269 INFO L439 ceAbstractionStarter]: At program point L876(lines 866 949) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 1 ~queue_empty~0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= ~__ste_email_to1~0 0) (not (= ULTIMATE.start_setClientId_~handle 2)) (= 0 ~in_encrypted~0) (not (= ~__ste_email_to0~0 1)) (not (= 1 ULTIMATE.start_setup_chuck_~chuck___0)) (= ~rjh~0 2)) [2019-10-22 11:24:10,269 INFO L443 ceAbstractionStarter]: For program point L2792(lines 2792 2798) no Hoare annotation was computed. [2019-10-22 11:24:10,269 INFO L443 ceAbstractionStarter]: For program point L2792-1(lines 2792 2798) no Hoare annotation was computed. [2019-10-22 11:24:10,269 INFO L443 ceAbstractionStarter]: For program point L2528(lines 2528 2564) no Hoare annotation was computed. [2019-10-22 11:24:10,269 INFO L443 ceAbstractionStarter]: For program point L2528-2(lines 2528 2564) no Hoare annotation was computed. [2019-10-22 11:24:10,269 INFO L443 ceAbstractionStarter]: For program point L2528-1(lines 2528 2564) no Hoare annotation was computed. [2019-10-22 11:24:10,269 INFO L443 ceAbstractionStarter]: For program point L2396(lines 2396 2412) no Hoare annotation was computed. [2019-10-22 11:24:10,269 INFO L443 ceAbstractionStarter]: For program point L2528-4(lines 2528 2564) no Hoare annotation was computed. [2019-10-22 11:24:10,269 INFO L443 ceAbstractionStarter]: For program point L1405(lines 1405 1411) no Hoare annotation was computed. [2019-10-22 11:24:10,269 INFO L443 ceAbstractionStarter]: For program point L2528-3(lines 2528 2564) no Hoare annotation was computed. [2019-10-22 11:24:10,269 INFO L443 ceAbstractionStarter]: For program point L2396-2(lines 2396 2412) no Hoare annotation was computed. [2019-10-22 11:24:10,269 INFO L443 ceAbstractionStarter]: For program point L1405-2(lines 1405 1411) no Hoare annotation was computed. [2019-10-22 11:24:10,270 INFO L443 ceAbstractionStarter]: For program point L2396-1(lines 2396 2412) no Hoare annotation was computed. [2019-10-22 11:24:10,270 INFO L443 ceAbstractionStarter]: For program point L2396-4(lines 2396 2412) no Hoare annotation was computed. [2019-10-22 11:24:10,270 INFO L443 ceAbstractionStarter]: For program point L2396-3(lines 2396 2412) no Hoare annotation was computed. [2019-10-22 11:24:10,270 INFO L443 ceAbstractionStarter]: For program point L2595(lines 2595 2626) no Hoare annotation was computed. [2019-10-22 11:24:10,270 INFO L443 ceAbstractionStarter]: For program point L2529(lines 2529 2537) no Hoare annotation was computed. [2019-10-22 11:24:10,270 INFO L443 ceAbstractionStarter]: For program point L2529-2(lines 2529 2537) no Hoare annotation was computed. [2019-10-22 11:24:10,271 INFO L443 ceAbstractionStarter]: For program point L2529-4(lines 2529 2537) no Hoare annotation was computed. [2019-10-22 11:24:10,271 INFO L443 ceAbstractionStarter]: For program point L2529-6(lines 2529 2537) no Hoare annotation was computed. [2019-10-22 11:24:10,271 INFO L443 ceAbstractionStarter]: For program point L2529-8(lines 2529 2537) no Hoare annotation was computed. [2019-10-22 11:24:10,271 INFO L439 ceAbstractionStarter]: At program point L812(lines 799 954) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 1 ~queue_empty~0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= ~__ste_email_to1~0 0) (not (= ULTIMATE.start_setClientId_~handle 2)) (= 0 ~in_encrypted~0) (not (= ~__ste_email_to0~0 1)) (not (= 1 ULTIMATE.start_setup_chuck_~chuck___0)) (= ~rjh~0 2)) [2019-10-22 11:24:10,271 INFO L439 ceAbstractionStarter]: At program point L614(lines 595 616) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 1 ~queue_empty~0) (= 0 ULTIMATE.start_test_~op1~0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= ~__ste_email_to1~0 0) (not (= ULTIMATE.start_setClientId_~handle 2)) (= 0 ~in_encrypted~0) (not (= ~__ste_email_to0~0 1)) (not (= 1 ULTIMATE.start_setup_chuck_~chuck___0)) (= ~rjh~0 2)) [2019-10-22 11:24:10,271 INFO L443 ceAbstractionStarter]: For program point L2596(lines 2596 2607) no Hoare annotation was computed. [2019-10-22 11:24:10,271 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-10-22 11:24:10,271 INFO L443 ceAbstractionStarter]: For program point L747(line 747) no Hoare annotation was computed. [2019-10-22 11:24:10,271 INFO L443 ceAbstractionStarter]: For program point L747-1(line 747) no Hoare annotation was computed. [2019-10-22 11:24:10,272 INFO L443 ceAbstractionStarter]: For program point L2663-1(lines 2663 2679) no Hoare annotation was computed. [2019-10-22 11:24:10,272 INFO L443 ceAbstractionStarter]: For program point L2663(lines 2663 2679) no Hoare annotation was computed. [2019-10-22 11:24:10,272 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 747) no Hoare annotation was computed. [2019-10-22 11:24:10,272 INFO L443 ceAbstractionStarter]: For program point L2664(lines 2664 2675) no Hoare annotation was computed. [2019-10-22 11:24:10,272 INFO L443 ceAbstractionStarter]: For program point L2664-1(lines 2664 2675) no Hoare annotation was computed. [2019-10-22 11:24:10,272 INFO L443 ceAbstractionStarter]: For program point L2532(lines 2532 2536) no Hoare annotation was computed. [2019-10-22 11:24:10,272 INFO L443 ceAbstractionStarter]: For program point L2400(lines 2400 2411) no Hoare annotation was computed. [2019-10-22 11:24:10,272 INFO L443 ceAbstractionStarter]: For program point L2532-3(lines 2532 2536) no Hoare annotation was computed. [2019-10-22 11:24:10,272 INFO L443 ceAbstractionStarter]: For program point L2400-2(lines 2400 2411) no Hoare annotation was computed. [2019-10-22 11:24:10,272 INFO L443 ceAbstractionStarter]: For program point L2532-6(lines 2532 2536) no Hoare annotation was computed. [2019-10-22 11:24:10,272 INFO L443 ceAbstractionStarter]: For program point L2400-1(lines 2400 2411) no Hoare annotation was computed. [2019-10-22 11:24:10,272 INFO L443 ceAbstractionStarter]: For program point L2400-4(lines 2400 2411) no Hoare annotation was computed. [2019-10-22 11:24:10,273 INFO L443 ceAbstractionStarter]: For program point L2400-3(lines 2400 2411) no Hoare annotation was computed. [2019-10-22 11:24:10,273 INFO L443 ceAbstractionStarter]: For program point L2532-9(lines 2532 2536) no Hoare annotation was computed. [2019-10-22 11:24:10,273 INFO L443 ceAbstractionStarter]: For program point L2532-12(lines 2532 2536) no Hoare annotation was computed. [2019-10-22 11:24:10,273 INFO L443 ceAbstractionStarter]: For program point L881(lines 881 888) no Hoare annotation was computed. [2019-10-22 11:24:10,273 INFO L439 ceAbstractionStarter]: At program point L2797-1(lines 2780 2803) the Hoare annotation is: false [2019-10-22 11:24:10,273 INFO L439 ceAbstractionStarter]: At program point L2797(lines 2780 2803) the Hoare annotation is: (let ((.cse2 (= ~__ste_email_to0~0 2)) (.cse3 (= 2 ULTIMATE.start_setup_rjh_~rjh___0)) (.cse4 (= 2 ULTIMATE.start_createEmail_~to)) (.cse0 (= 1 ULTIMATE.start_outgoing__wrappee__Keys_~msg)) (.cse1 (and (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (not (= 1 ULTIMATE.start_setup_rjh_~rjh___0)) (not (= ULTIMATE.start_setClientId_~handle 2)) (not (= 1 ULTIMATE.start_setup_chuck_~chuck___0))) (= 1 ULTIMATE.start_setEmailTo_~handle) (= 0 ~in_encrypted~0) (not (= 1 ULTIMATE.start_createEmail_~to)) (not (= ~__ste_email_to0~0 1)) (= 1 ULTIMATE.start_createEmail_~msg~0))) (.cse5 (= ULTIMATE.start_setEmailTo_~value 2)) (.cse6 (= ULTIMATE.start_outgoing_~msg ULTIMATE.start_getEmailTo_~handle)) (.cse7 (= ~rjh~0 2)) (.cse8 (= 1 ~queue_empty~0)) (.cse9 (= ~__ste_email_to1~0 0))) (or (and (and (and (not .cse0) .cse1) .cse2 .cse3 .cse4 .cse5 (not (= 1 ULTIMATE.start_outgoing_~msg)) .cse6 .cse7) .cse8 (= 0 |ULTIMATE.start_getEmailTo_#res|) .cse9) (and (and .cse2 .cse3 (= 2 |ULTIMATE.start_getEmailTo_#res|) .cse4 (and .cse0 (= 1 ULTIMATE.start_getEmailTo_~handle) .cse1) .cse5 .cse6 .cse7) .cse8 .cse9))) [2019-10-22 11:24:10,273 INFO L439 ceAbstractionStarter]: At program point L1741(lines 1720 1744) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= ~__ste_email_to0~0 2) (= 1 ~queue_empty~0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= ~__ste_email_to1~0 0) (not (= ULTIMATE.start_setClientId_~handle 2)) (= 1 ULTIMATE.start_setEmailTo_~handle) (= 2 ULTIMATE.start_createEmail_~to) (= ULTIMATE.start_setEmailTo_~value 2) (= 1 ULTIMATE.start_createEmail_~msg~0) (not (= 1 ULTIMATE.start_setup_chuck_~chuck___0)) (= ~rjh~0 2)) [2019-10-22 11:24:10,273 INFO L446 ceAbstractionStarter]: At program point L1741-1(lines 1720 1744) the Hoare annotation is: true [2019-10-22 11:24:10,273 INFO L443 ceAbstractionStarter]: For program point L2600(lines 2600 2606) no Hoare annotation was computed. [2019-10-22 11:24:10,273 INFO L443 ceAbstractionStarter]: For program point L817(lines 817 821) no Hoare annotation was computed. [2019-10-22 11:24:10,273 INFO L443 ceAbstractionStarter]: For program point L1082(lines 1082 1093) no Hoare annotation was computed. [2019-10-22 11:24:10,274 INFO L443 ceAbstractionStarter]: For program point L1082-1(lines 1082 1093) no Hoare annotation was computed. [2019-10-22 11:24:10,274 INFO L443 ceAbstractionStarter]: For program point L1082-2(lines 1082 1093) no Hoare annotation was computed. [2019-10-22 11:24:10,274 INFO L443 ceAbstractionStarter]: For program point L1082-3(lines 1082 1093) no Hoare annotation was computed. [2019-10-22 11:24:10,274 INFO L443 ceAbstractionStarter]: For program point L2668(lines 2668 2674) no Hoare annotation was computed. [2019-10-22 11:24:10,274 INFO L443 ceAbstractionStarter]: For program point L2668-1(lines 2668 2674) no Hoare annotation was computed. [2019-10-22 11:24:10,274 INFO L443 ceAbstractionStarter]: For program point L2404(lines 2404 2410) no Hoare annotation was computed. [2019-10-22 11:24:10,275 INFO L443 ceAbstractionStarter]: For program point L2404-2(lines 2404 2410) no Hoare annotation was computed. [2019-10-22 11:24:10,275 INFO L443 ceAbstractionStarter]: For program point L2404-1(lines 2404 2410) no Hoare annotation was computed. [2019-10-22 11:24:10,275 INFO L443 ceAbstractionStarter]: For program point L2404-4(lines 2404 2410) no Hoare annotation was computed. [2019-10-22 11:24:10,275 INFO L443 ceAbstractionStarter]: For program point L2404-3(lines 2404 2410) no Hoare annotation was computed. [2019-10-22 11:24:10,275 INFO L443 ceAbstractionStarter]: For program point L1216(lines 1216 1224) no Hoare annotation was computed. [2019-10-22 11:24:10,275 INFO L443 ceAbstractionStarter]: For program point L1216-2(lines 1216 1224) no Hoare annotation was computed. [2019-10-22 11:24:10,275 INFO L443 ceAbstractionStarter]: For program point L1216-4(lines 1216 1224) no Hoare annotation was computed. [2019-10-22 11:24:10,275 INFO L443 ceAbstractionStarter]: For program point L1216-6(lines 1216 1224) no Hoare annotation was computed. [2019-10-22 11:24:10,275 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-22 11:24:10,275 INFO L443 ceAbstractionStarter]: For program point L2539-1(lines 2539 2563) no Hoare annotation was computed. [2019-10-22 11:24:10,275 INFO L443 ceAbstractionStarter]: For program point L2539(lines 2539 2563) no Hoare annotation was computed. [2019-10-22 11:24:10,276 INFO L443 ceAbstractionStarter]: For program point L2539-3(lines 2539 2563) no Hoare annotation was computed. [2019-10-22 11:24:10,276 INFO L443 ceAbstractionStarter]: For program point L2539-2(lines 2539 2563) no Hoare annotation was computed. [2019-10-22 11:24:10,276 INFO L443 ceAbstractionStarter]: For program point L2539-4(lines 2539 2563) no Hoare annotation was computed. [2019-10-22 11:24:10,276 INFO L443 ceAbstractionStarter]: For program point L1086(lines 1086 1092) no Hoare annotation was computed. [2019-10-22 11:24:10,276 INFO L443 ceAbstractionStarter]: For program point L1086-1(lines 1086 1092) no Hoare annotation was computed. [2019-10-22 11:24:10,276 INFO L443 ceAbstractionStarter]: For program point L1086-2(lines 1086 1092) no Hoare annotation was computed. [2019-10-22 11:24:10,276 INFO L443 ceAbstractionStarter]: For program point L1086-3(lines 1086 1092) no Hoare annotation was computed. [2019-10-22 11:24:10,276 INFO L443 ceAbstractionStarter]: For program point L2540(lines 2540 2548) no Hoare annotation was computed. [2019-10-22 11:24:10,276 INFO L443 ceAbstractionStarter]: For program point L2474(lines 2474 2520) no Hoare annotation was computed. [2019-10-22 11:24:10,276 INFO L443 ceAbstractionStarter]: For program point L2540-2(lines 2540 2548) no Hoare annotation was computed. [2019-10-22 11:24:10,276 INFO L443 ceAbstractionStarter]: For program point L2540-4(lines 2540 2548) no Hoare annotation was computed. [2019-10-22 11:24:10,276 INFO L443 ceAbstractionStarter]: For program point L2540-6(lines 2540 2548) no Hoare annotation was computed. [2019-10-22 11:24:10,276 INFO L443 ceAbstractionStarter]: For program point L2540-8(lines 2540 2548) no Hoare annotation was computed. [2019-10-22 11:24:10,276 INFO L443 ceAbstractionStarter]: For program point L1219(lines 1219 1223) no Hoare annotation was computed. [2019-10-22 11:24:10,277 INFO L443 ceAbstractionStarter]: For program point L1219-3(lines 1219 1223) no Hoare annotation was computed. [2019-10-22 11:24:10,277 INFO L439 ceAbstractionStarter]: At program point L1219-5(lines 1212 1227) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= ~__ste_email_to0~0 2) (= 1 ~queue_empty~0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= ~__ste_email_to1~0 0) (not (= ULTIMATE.start_setClientId_~handle 2)) (= 1 ULTIMATE.start_setEmailTo_~handle) (= 2 ULTIMATE.start_createEmail_~to) (= ULTIMATE.start_setEmailTo_~value 2) (= 1 ULTIMATE.start_createEmail_~msg~0) (not (= 1 ULTIMATE.start_setup_chuck_~chuck___0)) (= ~rjh~0 2)) [2019-10-22 11:24:10,277 INFO L443 ceAbstractionStarter]: For program point L1219-6(lines 1219 1223) no Hoare annotation was computed. [2019-10-22 11:24:10,277 INFO L443 ceAbstractionStarter]: For program point L1219-9(lines 1219 1223) no Hoare annotation was computed. [2019-10-22 11:24:10,277 INFO L446 ceAbstractionStarter]: At program point L1219-11(lines 1212 1227) the Hoare annotation is: true [2019-10-22 11:24:10,277 INFO L439 ceAbstractionStarter]: At program point L823(lines 813 953) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 1 ~queue_empty~0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= ~__ste_email_to1~0 0) (not (= ULTIMATE.start_setClientId_~handle 2)) (= 0 ~in_encrypted~0) (not (= ~__ste_email_to0~0 1)) (not (= 1 ULTIMATE.start_setup_chuck_~chuck___0)) (= ~rjh~0 2)) [2019-10-22 11:24:10,277 INFO L443 ceAbstractionStarter]: For program point L2475(lines 2475 2486) no Hoare annotation was computed. [2019-10-22 11:24:10,277 INFO L439 ceAbstractionStarter]: At program point L2409-1(lines 2392 2415) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 1 ~queue_empty~0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= ~__ste_email_to1~0 0) (not (= ULTIMATE.start_setClientId_~handle 2)) (= 0 ~in_encrypted~0) (not (= ~__ste_email_to0~0 1)) (not (= 1 ULTIMATE.start_setup_chuck_~chuck___0)) (= ~rjh~0 2)) [2019-10-22 11:24:10,277 INFO L439 ceAbstractionStarter]: At program point L2409(lines 2392 2415) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 1 ~queue_empty~0) (= 0 ULTIMATE.start_test_~op1~0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= ~__ste_email_to1~0 0) (not (= ULTIMATE.start_setClientId_~handle 2)) (= 0 ~in_encrypted~0) (not (= ~__ste_email_to0~0 1)) (not (= 1 ULTIMATE.start_setup_chuck_~chuck___0)) (= ~rjh~0 2)) [2019-10-22 11:24:10,278 INFO L439 ceAbstractionStarter]: At program point L2409-3(lines 2392 2415) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 1 ~queue_empty~0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= ~__ste_email_to1~0 0) (not (= ULTIMATE.start_setClientId_~handle 2)) (= 0 ~in_encrypted~0) (not (= ~__ste_email_to0~0 1)) (not (= 1 ULTIMATE.start_setup_chuck_~chuck___0)) (= ~rjh~0 2)) [2019-10-22 11:24:10,278 INFO L439 ceAbstractionStarter]: At program point L2409-2(lines 2392 2415) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 1 ~queue_empty~0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= ~__ste_email_to1~0 0) (not (= ULTIMATE.start_setClientId_~handle 2)) (= 0 ~in_encrypted~0) (not (= ~__ste_email_to0~0 1)) (not (= 1 ULTIMATE.start_setup_chuck_~chuck___0)) (= ~rjh~0 2)) [2019-10-22 11:24:10,278 INFO L439 ceAbstractionStarter]: At program point L2409-4(lines 2392 2415) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 1 ~queue_empty~0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= ~__ste_email_to1~0 0) (not (= ULTIMATE.start_setClientId_~handle 2)) (= 0 ~in_encrypted~0) (not (= ~__ste_email_to0~0 1)) (not (= 1 ULTIMATE.start_setup_chuck_~chuck___0)) (= ~rjh~0 2)) [2019-10-22 11:24:10,278 INFO L439 ceAbstractionStarter]: At program point L956(lines 790 957) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 1 ~queue_empty~0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (not (= ULTIMATE.start_setClientId_~handle 2)) (= ~__ste_email_to1~0 0) (= 0 ~in_encrypted~0) (not (= ~__ste_email_to0~0 1)) (not (= 1 ULTIMATE.start_setup_chuck_~chuck___0)) (= ~rjh~0 2)) [2019-10-22 11:24:10,279 INFO L439 ceAbstractionStarter]: At program point L890(lines 877 948) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 1 ~queue_empty~0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= ~__ste_email_to1~0 0) (not (= ULTIMATE.start_setClientId_~handle 2)) (= 0 ~in_encrypted~0) (not (= ~__ste_email_to0~0 1)) (not (= 1 ULTIMATE.start_setup_chuck_~chuck___0)) (= ~rjh~0 2)) [2019-10-22 11:24:10,279 INFO L443 ceAbstractionStarter]: For program point L2609(lines 2609 2625) no Hoare annotation was computed. [2019-10-22 11:24:10,279 INFO L443 ceAbstractionStarter]: For program point L2543(lines 2543 2547) no Hoare annotation was computed. [2019-10-22 11:24:10,279 INFO L443 ceAbstractionStarter]: For program point L2543-3(lines 2543 2547) no Hoare annotation was computed. [2019-10-22 11:24:10,279 INFO L443 ceAbstractionStarter]: For program point L2543-6(lines 2543 2547) no Hoare annotation was computed. [2019-10-22 11:24:10,279 INFO L443 ceAbstractionStarter]: For program point L2543-9(lines 2543 2547) no Hoare annotation was computed. [2019-10-22 11:24:10,279 INFO L443 ceAbstractionStarter]: For program point L2543-12(lines 2543 2547) no Hoare annotation was computed. [2019-10-22 11:24:10,279 INFO L443 ceAbstractionStarter]: For program point L2808(lines 2808 2820) no Hoare annotation was computed. [2019-10-22 11:24:10,279 INFO L443 ceAbstractionStarter]: For program point L2808-2(lines 2808 2820) no Hoare annotation was computed. [2019-10-22 11:24:10,279 INFO L443 ceAbstractionStarter]: For program point L2808-4(lines 2808 2820) no Hoare annotation was computed. [2019-10-22 11:24:10,280 INFO L443 ceAbstractionStarter]: For program point L2610(lines 2610 2621) no Hoare annotation was computed. [2019-10-22 11:24:10,280 INFO L439 ceAbstractionStarter]: At program point L1091(lines 1078 1096) the Hoare annotation is: (let ((.cse1 (= 1 ~queue_empty~0)) (.cse3 (= ~__ste_email_to1~0 0)) (.cse0 (= ~__ste_email_to0~0 2)) (.cse2 (= 2 ULTIMATE.start_setup_rjh_~rjh___0)) (.cse5 (= 2 ULTIMATE.start_createEmail_~to)) (.cse6 (= ULTIMATE.start_setEmailTo_~value 2)) (.cse4 (and (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (not (= 1 ULTIMATE.start_setup_rjh_~rjh___0)) (not (= ULTIMATE.start_setClientId_~handle 2)) (not (= 1 ULTIMATE.start_setup_chuck_~chuck___0))) (= 1 ULTIMATE.start_setEmailTo_~handle) (= 0 ~in_encrypted~0) (not (= 1 ULTIMATE.start_createEmail_~to)) (not (= ULTIMATE.start_setEmailTo_~value 1)) (not (= ~__ste_email_to0~0 1)) (= 1 ULTIMATE.start_createEmail_~msg~0))) (.cse7 (= ULTIMATE.start_outgoing_~msg ULTIMATE.start_getEmailTo_~handle)) (.cse8 (= ~rjh~0 2))) (or (and .cse0 .cse1 (= 0 |ULTIMATE.start_getEmailTo_#res|) .cse2 .cse3 .cse4 .cse5 .cse6 (not (= 1 ULTIMATE.start_outgoing_~msg)) .cse7 .cse8) (and .cse1 .cse3 (and .cse0 .cse2 (= 2 |ULTIMATE.start_getEmailTo_#res|) .cse5 .cse6 (and (= 1 ULTIMATE.start_getEmailTo_~handle) .cse4) .cse7 .cse8)))) [2019-10-22 11:24:10,280 INFO L439 ceAbstractionStarter]: At program point L1091-1(lines 1078 1096) the Hoare annotation is: (let ((.cse0 (= 1 ~queue_empty~0)) (.cse1 (= ~__ste_email_to1~0 0)) (.cse2 (= ~__ste_email_to0~0 2)) (.cse3 (= 2 ULTIMATE.start_setup_rjh_~rjh___0)) (.cse4 (= 2 ULTIMATE.start_createEmail_~to)) (.cse5 (and (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (not (= 1 ULTIMATE.start_setup_rjh_~rjh___0)) (not (= ULTIMATE.start_setClientId_~handle 2)) (not (= 1 ULTIMATE.start_setup_chuck_~chuck___0))) (not (= 1 |ULTIMATE.start_getEmailTo_#res|)) (= 1 ULTIMATE.start_setEmailTo_~handle) (= 0 ~in_encrypted~0) (not (= 1 ULTIMATE.start_createEmail_~to)) (not (= ~__ste_email_to0~0 1)) (= 1 ULTIMATE.start_createEmail_~msg~0))) (.cse6 (= ULTIMATE.start_setEmailTo_~value 2)) (.cse7 (= ~rjh~0 2))) (or (and .cse0 .cse1 (and .cse2 .cse3 (= 2 |ULTIMATE.start_getEmailTo_#res|) .cse4 .cse5 .cse6 .cse7)) (and .cse0 (and (= 0 |ULTIMATE.start_getEmailTo_#res|) .cse1 (and .cse2 (not (= 1 ULTIMATE.start_outgoing__wrappee__Keys_~msg)) .cse3 .cse4 (not (= ULTIMATE.start_mail_~msg 1)) .cse5 .cse6 (not (= 1 ULTIMATE.start_outgoing_~msg)) .cse7))))) [2019-10-22 11:24:10,280 INFO L439 ceAbstractionStarter]: At program point L1091-2(lines 1078 1096) the Hoare annotation is: false [2019-10-22 11:24:10,280 INFO L446 ceAbstractionStarter]: At program point L1091-3(lines 1078 1096) the Hoare annotation is: true [2019-10-22 11:24:10,280 INFO L443 ceAbstractionStarter]: For program point L2479(lines 2479 2485) no Hoare annotation was computed. [2019-10-22 11:24:10,329 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 11:24:10 BoogieIcfgContainer [2019-10-22 11:24:10,329 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 11:24:10,329 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 11:24:10,330 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 11:24:10,330 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 11:24:10,330 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:23:39" (3/4) ... [2019-10-22 11:24:10,334 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-10-22 11:24:10,358 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 132 nodes and edges [2019-10-22 11:24:10,360 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 73 nodes and edges [2019-10-22 11:24:10,361 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2019-10-22 11:24:10,363 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-10-22 11:24:10,364 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-10-22 11:24:10,397 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((__ste_email_to0 == 2 && 1 == queue_empty) && 0 == \result) && 2 == rjh___0) && __ste_email_to1 == 0) && ((((((((handle == chuck___0 && !(1 == rjh___0)) && !(handle == 2)) && !(1 == chuck___0)) && 1 == handle) && 0 == in_encrypted) && !(1 == to)) && !(value == 1)) && !(__ste_email_to0 == 1)) && 1 == msg) && 2 == to) && value == 2) && !(1 == msg)) && msg == handle) && rjh == 2) || ((1 == queue_empty && __ste_email_to1 == 0) && ((((((__ste_email_to0 == 2 && 2 == rjh___0) && 2 == \result) && 2 == to) && value == 2) && 1 == handle && ((((((((handle == chuck___0 && !(1 == rjh___0)) && !(handle == 2)) && !(1 == chuck___0)) && 1 == handle) && 0 == in_encrypted) && !(1 == to)) && !(value == 1)) && !(__ste_email_to0 == 1)) && 1 == msg) && msg == handle) && rjh == 2) [2019-10-22 11:24:10,399 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((__ste_email_to0 == 2 && 2 == rjh___0) && 2 == \result) && 2 == to) && 1 == handle && ((((((((handle == chuck___0 && !(1 == rjh___0)) && !(handle == 2)) && !(1 == chuck___0)) && 1 == handle) && 0 == in_encrypted) && !(1 == to)) && !(value == 1)) && !(__ste_email_to0 == 1)) && 1 == msg) && value == 2) && msg == handle) && rjh == 2) && 1 == queue_empty) && __ste_email_to1 == 0) || (((1 == queue_empty && 0 == \result) && __ste_email_to1 == 0) && ((((__ste_email_to0 == 2 && 2 == rjh___0) && 2 == to) && value == 2) && ((((((((((handle == chuck___0 && !(1 == rjh___0)) && !(handle == 2)) && !(1 == chuck___0)) && 1 == handle) && 0 == in_encrypted) && !(1 == to)) && !(value == 1)) && !(__ste_email_to0 == 1)) && 1 == msg) && !(1 == msg)) && msg == handle) && rjh == 2) [2019-10-22 11:24:10,399 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((__ste_email_to0 == 2 && 2 == rjh___0) && 2 == \result) && 2 == to) && 1 == handle && ((((((((handle == chuck___0 && !(1 == rjh___0)) && !(handle == 2)) && !(1 == chuck___0)) && 1 == handle) && 0 == in_encrypted) && !(1 == to)) && !(value == 1)) && !(__ste_email_to0 == 1)) && 1 == msg) && value == 2) && msg == handle) && rjh == 2) && 1 == queue_empty) && __ste_email_to1 == 0) || (((1 == queue_empty && 0 == \result) && __ste_email_to1 == 0) && ((((__ste_email_to0 == 2 && 2 == rjh___0) && 2 == to) && value == 2) && ((((((((((handle == chuck___0 && !(1 == rjh___0)) && !(handle == 2)) && !(1 == chuck___0)) && 1 == handle) && 0 == in_encrypted) && !(1 == to)) && !(value == 1)) && !(__ste_email_to0 == 1)) && 1 == msg) && !(1 == msg)) && msg == handle) && rjh == 2) [2019-10-22 11:24:10,399 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((__ste_email_to0 == 2 && 2 == rjh___0) && 2 == \result) && 2 == to) && 1 == handle && ((((((((handle == chuck___0 && !(1 == rjh___0)) && !(handle == 2)) && !(1 == chuck___0)) && 1 == handle) && 0 == in_encrypted) && !(1 == to)) && !(value == 1)) && !(__ste_email_to0 == 1)) && 1 == msg) && value == 2) && msg == handle) && rjh == 2) && 1 == queue_empty) && __ste_email_to1 == 0) || (((1 == queue_empty && 0 == \result) && __ste_email_to1 == 0) && ((((__ste_email_to0 == 2 && 2 == rjh___0) && 2 == to) && value == 2) && ((((((((((handle == chuck___0 && !(1 == rjh___0)) && !(handle == 2)) && !(1 == chuck___0)) && 1 == handle) && 0 == in_encrypted) && !(1 == to)) && !(value == 1)) && !(__ste_email_to0 == 1)) && 1 == msg) && !(1 == msg)) && msg == handle) && rjh == 2) [2019-10-22 11:24:10,400 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((!(1 == msg) && (((((((handle == chuck___0 && !(1 == rjh___0)) && !(handle == 2)) && !(1 == chuck___0)) && 1 == handle) && 0 == in_encrypted) && !(1 == to)) && !(__ste_email_to0 == 1)) && 1 == msg) && __ste_email_to0 == 2) && 2 == rjh___0) && 2 == to) && value == 2) && !(1 == msg)) && msg == handle) && rjh == 2) && 1 == queue_empty) && 0 == \result) && __ste_email_to1 == 0) || (((((((((__ste_email_to0 == 2 && 2 == rjh___0) && 2 == \result) && 2 == to) && (1 == msg && 1 == handle) && (((((((handle == chuck___0 && !(1 == rjh___0)) && !(handle == 2)) && !(1 == chuck___0)) && 1 == handle) && 0 == in_encrypted) && !(1 == to)) && !(__ste_email_to0 == 1)) && 1 == msg) && value == 2) && msg == handle) && rjh == 2) && 1 == queue_empty) && __ste_email_to1 == 0) [2019-10-22 11:24:10,400 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((1 == queue_empty && 0 == \result) && __ste_email_to1 == 0) && ((((((((__ste_email_to0 == 2 && !(1 == msg)) && (((((((handle == chuck___0 && !(1 == rjh___0)) && !(handle == 2)) && !(1 == chuck___0)) && 1 == handle) && 0 == in_encrypted) && !(1 == to)) && !(__ste_email_to0 == 1)) && 1 == msg) && 2 == rjh___0) && 2 == to) && !(handle == 1)) && value == 2) && !(1 == msg)) && msg == handle) && rjh == 2) || (((((((((__ste_email_to0 == 2 && 2 == rjh___0) && 2 == \result) && 2 == to) && (1 == msg && 1 == handle) && (((((((handle == chuck___0 && !(1 == rjh___0)) && !(handle == 2)) && !(1 == chuck___0)) && 1 == handle) && 0 == in_encrypted) && !(1 == to)) && !(__ste_email_to0 == 1)) && 1 == msg) && value == 2) && msg == handle) && rjh == 2) && 1 == queue_empty) && __ste_email_to1 == 0) [2019-10-22 11:24:10,400 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((1 == queue_empty && 0 == \result) && (((((((((__ste_email_to0 == 2 && !(1 == msg)) && ((((((handle == chuck___0 && !(1 == rjh___0)) && !(handle == 2)) && !(1 == chuck___0)) && 1 == handle) && 0 == in_encrypted) && !(__ste_email_to0 == 1)) && 1 == msg) && 2 == rjh___0) && 2 == to) && !(msg == 1)) && !(handle == 1)) && value == 2) && !(1 == msg)) && msg == handle) && rjh == 2) && __ste_email_to1 == 0) || ((1 == queue_empty && ((((((__ste_email_to0 == 2 && 2 == rjh___0) && 2 == \result) && ((1 == msg && 1 == handle) && msg == 1) && ((((((handle == chuck___0 && !(1 == rjh___0)) && !(handle == 2)) && !(1 == chuck___0)) && 1 == handle) && 0 == in_encrypted) && !(__ste_email_to0 == 1)) && 1 == msg) && 2 == to) && value == 2) && msg == handle) && rjh == 2) && __ste_email_to1 == 0) [2019-10-22 11:24:10,400 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((1 == queue_empty && __ste_email_to1 == 0) && (((((__ste_email_to0 == 2 && 2 == rjh___0) && 2 == \result) && 2 == to) && ((((((((handle == chuck___0 && !(1 == rjh___0)) && !(handle == 2)) && !(1 == chuck___0)) && !(1 == \result)) && 1 == handle) && 0 == in_encrypted) && !(1 == to)) && !(__ste_email_to0 == 1)) && 1 == msg) && value == 2) && rjh == 2) || (1 == queue_empty && (0 == \result && __ste_email_to1 == 0) && (((((((__ste_email_to0 == 2 && !(1 == msg)) && 2 == rjh___0) && 2 == to) && !(msg == 1)) && ((((((((handle == chuck___0 && !(1 == rjh___0)) && !(handle == 2)) && !(1 == chuck___0)) && !(1 == \result)) && 1 == handle) && 0 == in_encrypted) && !(1 == to)) && !(__ste_email_to0 == 1)) && 1 == msg) && value == 2) && !(1 == msg)) && rjh == 2) [2019-10-22 11:24:10,401 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((1 == queue_empty && __ste_email_to1 == 0) && 2 == rjh___0 && (((((__ste_email_to0 == 2 && (((((!(1 == client) && ((handle == chuck___0 && !(1 == rjh___0)) && !(handle == 2)) && !(1 == chuck___0)) && !(1 == \result)) && 1 == handle) && 0 == in_encrypted) && !(__ste_email_to0 == 1)) && 1 == msg) && 2 == \result) && 2 == client) && 2 == to) && value == 2) && rjh == 2) || (1 == queue_empty && ((0 == \result && __ste_email_to1 == 0) && 0 == client) && ((((((((__ste_email_to0 == 2 && !(1 == msg)) && (((((!(1 == client) && ((handle == chuck___0 && !(1 == rjh___0)) && !(handle == 2)) && !(1 == chuck___0)) && !(1 == \result)) && 1 == handle) && 0 == in_encrypted) && !(__ste_email_to0 == 1)) && 1 == msg) && 2 == rjh___0) && 2 == to) && !(msg == 1)) && !(handle == 1)) && value == 2) && !(1 == msg)) && rjh == 2) [2019-10-22 11:24:10,401 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (1 == queue_empty && (((((((((((__ste_email_to0 == 2 && !(1 == msg)) && 2 == rjh___0) && ((((!(1 == client) && ((handle == chuck___0 && !(1 == rjh___0)) && !(handle == 2)) && !(1 == chuck___0)) && !(1 == \result)) && 1 == handle) && !(__ste_email_to0 == 1)) && 1 == msg) && 2 == to) && !(msg == 1)) && !(handle == 1)) && value == 2) && !(1 == msg)) && rjh == 2) && 0 == \result) && __ste_email_to1 == 0) && 0 == client) || ((1 == queue_empty && __ste_email_to1 == 0) && ((((((__ste_email_to0 == 2 && 2 == \result) && ((((!(1 == client) && ((handle == chuck___0 && !(1 == rjh___0)) && !(handle == 2)) && !(1 == chuck___0)) && !(1 == \result)) && 1 == handle) && !(__ste_email_to0 == 1)) && 1 == msg) && 2 == client) && 2 == to) && value == 2) && rjh == 2) && 2 == rjh___0) [2019-10-22 11:24:10,401 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___0) && __ste_email_to1 == 0) && !(handle == 2)) && 1 == handle) && value == 2) && !(1 == chuck___0)) && __ste_email_to0 == 2) && 1 == \result) && 2 == to) && 1 == msg) && rjh == 2 [2019-10-22 11:24:10,550 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_82b3d1c6-00b3-4f1e-819f-a2c12e5f8b31/bin/utaipan/witness.graphml [2019-10-22 11:24:10,550 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 11:24:10,552 INFO L168 Benchmark]: Toolchain (without parser) took 33883.03 ms. Allocated memory was 1.0 GB in the beginning and 2.3 GB in the end (delta: 1.3 GB). Free memory was 936.8 MB in the beginning and 1.8 GB in the end (delta: -817.0 MB). Peak memory consumption was 498.4 MB. Max. memory is 11.5 GB. [2019-10-22 11:24:10,552 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 957.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:24:10,553 INFO L168 Benchmark]: CACSL2BoogieTranslator took 834.48 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 936.8 MB in the beginning and 1.1 GB in the end (delta: -155.6 MB). Peak memory consumption was 30.0 MB. Max. memory is 11.5 GB. [2019-10-22 11:24:10,553 INFO L168 Benchmark]: Boogie Procedure Inliner took 135.49 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: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 11.5 GB. [2019-10-22 11:24:10,553 INFO L168 Benchmark]: Boogie Preprocessor took 121.51 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-10-22 11:24:10,554 INFO L168 Benchmark]: RCFGBuilder took 1772.85 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 890.1 MB in the end (delta: 187.6 MB). Peak memory consumption was 187.6 MB. Max. memory is 11.5 GB. [2019-10-22 11:24:10,554 INFO L168 Benchmark]: TraceAbstraction took 30792.91 ms. Allocated memory was 1.2 GB in the beginning and 2.3 GB in the end (delta: 1.2 GB). Free memory was 888.8 MB in the beginning and 1.8 GB in the end (delta: -903.8 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2019-10-22 11:24:10,554 INFO L168 Benchmark]: Witness Printer took 221.14 ms. Allocated memory is still 2.3 GB. Free memory was 1.8 GB in the beginning and 1.8 GB in the end (delta: 38.7 MB). Peak memory consumption was 38.7 MB. Max. memory is 11.5 GB. [2019-10-22 11:24:10,556 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 957.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 834.48 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 936.8 MB in the beginning and 1.1 GB in the end (delta: -155.6 MB). Peak memory consumption was 30.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 135.49 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: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 121.51 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1772.85 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 890.1 MB in the end (delta: 187.6 MB). Peak memory consumption was 187.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 30792.91 ms. Allocated memory was 1.2 GB in the beginning and 2.3 GB in the end (delta: 1.2 GB). Free memory was 888.8 MB in the beginning and 1.8 GB in the end (delta: -903.8 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. * Witness Printer took 221.14 ms. Allocated memory is still 2.3 GB. Free memory was 1.8 GB in the beginning and 1.8 GB in the end (delta: 38.7 MB). Peak memory consumption was 38.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 747]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 747]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - InvariantResult [Line: 1097]: Loop Invariant Derived loop invariant: (((((((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___0) && !(handle == 2)) && __ste_email_to1 == 0) && 1 == handle) && 0 == in_encrypted) && value == 2) && !(1 == chuck___0)) && __ste_email_to0 == 2) && 2 == to) && 1 == msg) && rjh == 2 - InvariantResult [Line: 2345]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 733]: Loop Invariant Derived loop invariant: (((((__ste_Client_Keyring0_User0 == __ste_Client_Keyring0_User1 && 1 == queue_empty) && !(rjh == 1)) && __ste_email_to1 == 0) && 0 == in_encrypted) && 0 == __ste_Client_Keyring0_User0) && !(__ste_email_to0 == 1) - InvariantResult [Line: 2780]: Loop Invariant Derived loop invariant: (((((((((((!(1 == msg) && (((((((handle == chuck___0 && !(1 == rjh___0)) && !(handle == 2)) && !(1 == chuck___0)) && 1 == handle) && 0 == in_encrypted) && !(1 == to)) && !(__ste_email_to0 == 1)) && 1 == msg) && __ste_email_to0 == 2) && 2 == rjh___0) && 2 == to) && value == 2) && !(1 == msg)) && msg == handle) && rjh == 2) && 1 == queue_empty) && 0 == \result) && __ste_email_to1 == 0) || (((((((((__ste_email_to0 == 2 && 2 == rjh___0) && 2 == \result) && 2 == to) && (1 == msg && 1 == handle) && (((((((handle == chuck___0 && !(1 == rjh___0)) && !(handle == 2)) && !(1 == chuck___0)) && 1 == handle) && 0 == in_encrypted) && !(1 == to)) && !(__ste_email_to0 == 1)) && 1 == msg) && value == 2) && msg == handle) && rjh == 2) && 1 == queue_empty) && __ste_email_to1 == 0) - InvariantResult [Line: 1702]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1193]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2780]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1193]: Loop Invariant Derived loop invariant: ((1 == queue_empty && __ste_email_to1 == 0) && 2 == rjh___0 && (((((__ste_email_to0 == 2 && (((((!(1 == client) && ((handle == chuck___0 && !(1 == rjh___0)) && !(handle == 2)) && !(1 == chuck___0)) && !(1 == \result)) && 1 == handle) && 0 == in_encrypted) && !(__ste_email_to0 == 1)) && 1 == msg) && 2 == \result) && 2 == client) && 2 == to) && value == 2) && rjh == 2) || (1 == queue_empty && ((0 == \result && __ste_email_to1 == 0) && 0 == client) && ((((((((__ste_email_to0 == 2 && !(1 == msg)) && (((((!(1 == client) && ((handle == chuck___0 && !(1 == rjh___0)) && !(handle == 2)) && !(1 == chuck___0)) && !(1 == \result)) && 1 == handle) && 0 == in_encrypted) && !(__ste_email_to0 == 1)) && 1 == msg) && 2 == rjh___0) && 2 == to) && !(msg == 1)) && !(handle == 1)) && value == 2) && !(1 == msg)) && rjh == 2) - InvariantResult [Line: 1670]: Loop Invariant Derived loop invariant: ((((((((((handle == chuck___0 && __ste_email_to0 == 2) && 1 == queue_empty) && 2 == rjh___0) && __ste_email_to1 == 0) && !(handle == 2)) && 1 == handle) && 2 == to) && value == 2) && 1 == msg) && !(1 == chuck___0)) && rjh == 2 - InvariantResult [Line: 595]: Loop Invariant Derived loop invariant: ((((((((handle == chuck___0 && 1 == queue_empty) && 0 == op1) && 2 == rjh___0) && __ste_email_to1 == 0) && !(handle == 2)) && 0 == in_encrypted) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 - InvariantResult [Line: 1230]: Loop Invariant Derived loop invariant: ((((((((((handle == chuck___0 && __ste_email_to0 == 2) && 1 == queue_empty) && 2 == rjh___0) && __ste_email_to1 == 0) && !(handle == 2)) && 1 == handle) && 2 == to) && value == 2) && 1 == msg) && !(1 == chuck___0)) && rjh == 2 - InvariantResult [Line: 574]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2345]: Loop Invariant Derived loop invariant: ((((((((((handle == chuck___0 && __ste_email_to0 == 2) && 1 == queue_empty) && 2 == rjh___0) && __ste_email_to1 == 0) && !(handle == 2)) && 1 == handle) && 2 == to) && value == 2) && 1 == msg) && !(1 == chuck___0)) && rjh == 2 - InvariantResult [Line: 824]: Loop Invariant Derived loop invariant: (((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___0) && __ste_email_to1 == 0) && !(handle == 2)) && 0 == in_encrypted) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 - InvariantResult [Line: 1230]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___0) && __ste_email_to1 == 0) && !(handle == 2)) && 0 == in_encrypted) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 - InvariantResult [Line: 1391]: Loop Invariant Derived loop invariant: (((1 == queue_empty && 0 == \result) && (((((((((__ste_email_to0 == 2 && !(1 == msg)) && ((((((handle == chuck___0 && !(1 == rjh___0)) && !(handle == 2)) && !(1 == chuck___0)) && 1 == handle) && 0 == in_encrypted) && !(__ste_email_to0 == 1)) && 1 == msg) && 2 == rjh___0) && 2 == to) && !(msg == 1)) && !(handle == 1)) && value == 2) && !(1 == msg)) && msg == handle) && rjh == 2) && __ste_email_to1 == 0) || ((1 == queue_empty && ((((((__ste_email_to0 == 2 && 2 == rjh___0) && 2 == \result) && ((1 == msg && 1 == handle) && msg == 1) && ((((((handle == chuck___0 && !(1 == rjh___0)) && !(handle == 2)) && !(1 == chuck___0)) && 1 == handle) && 0 == in_encrypted) && !(__ste_email_to0 == 1)) && 1 == msg) && 2 == to) && value == 2) && msg == handle) && rjh == 2) && __ste_email_to1 == 0) - InvariantResult [Line: 1212]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2524]: Loop Invariant Derived loop invariant: (((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___0) && __ste_email_to1 == 0) && !(handle == 2)) && 0 == in_encrypted) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 - InvariantResult [Line: 813]: Loop Invariant Derived loop invariant: (((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___0) && __ste_email_to1 == 0) && !(handle == 2)) && 0 == in_encrypted) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 - InvariantResult [Line: 1720]: Loop Invariant Derived loop invariant: ((((((((((handle == chuck___0 && __ste_email_to0 == 2) && 1 == queue_empty) && 2 == rjh___0) && __ste_email_to1 == 0) && !(handle == 2)) && 1 == handle) && 2 == to) && value == 2) && 1 == msg) && !(1 == chuck___0)) && rjh == 2 - InvariantResult [Line: 799]: Loop Invariant Derived loop invariant: (((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___0) && __ste_email_to1 == 0) && !(handle == 2)) && 0 == in_encrypted) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 - InvariantResult [Line: 916]: Loop Invariant Derived loop invariant: (((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___0) && __ste_email_to1 == 0) && !(handle == 2)) && 0 == in_encrypted) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 - InvariantResult [Line: 1720]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2416]: Loop Invariant Derived loop invariant: (((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___0) && __ste_email_to1 == 0) && !(handle == 2)) && 0 == in_encrypted) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 - InvariantResult [Line: 1391]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2524]: Loop Invariant Derived loop invariant: (((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___0) && __ste_email_to1 == 0) && !(handle == 2)) && 0 == in_encrypted) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 - InvariantResult [Line: 1711]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 902]: Loop Invariant Derived loop invariant: (((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___0) && __ste_email_to1 == 0) && !(handle == 2)) && 0 == in_encrypted) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___0) && __ste_email_to1 == 0) && !(handle == 2)) && 0 == in_encrypted) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 - InvariantResult [Line: 1212]: Loop Invariant Derived loop invariant: ((((((((((handle == chuck___0 && __ste_email_to0 == 2) && 1 == queue_empty) && 2 == rjh___0) && __ste_email_to1 == 0) && !(handle == 2)) && 1 == handle) && 2 == to) && value == 2) && 1 == msg) && !(1 == chuck___0)) && rjh == 2 - InvariantResult [Line: 1577]: Loop Invariant Derived loop invariant: (((((((((__ste_email_to0 == 2 && 2 == rjh___0) && 2 == \result) && 2 == to) && 1 == handle && ((((((((handle == chuck___0 && !(1 == rjh___0)) && !(handle == 2)) && !(1 == chuck___0)) && 1 == handle) && 0 == in_encrypted) && !(1 == to)) && !(value == 1)) && !(__ste_email_to0 == 1)) && 1 == msg) && value == 2) && msg == handle) && rjh == 2) && 1 == queue_empty) && __ste_email_to1 == 0) || (((1 == queue_empty && 0 == \result) && __ste_email_to1 == 0) && ((((__ste_email_to0 == 2 && 2 == rjh___0) && 2 == to) && value == 2) && ((((((((((handle == chuck___0 && !(1 == rjh___0)) && !(handle == 2)) && !(1 == chuck___0)) && 1 == handle) && 0 == in_encrypted) && !(1 == to)) && !(value == 1)) && !(__ste_email_to0 == 1)) && 1 == msg) && !(1 == msg)) && msg == handle) && rjh == 2) - InvariantResult [Line: 2416]: Loop Invariant Derived loop invariant: (((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___0) && __ste_email_to1 == 0) && !(handle == 2)) && 0 == in_encrypted) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___0) && __ste_email_to1 == 0) && !(handle == 2)) && 0 == in_encrypted) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 - InvariantResult [Line: 697]: Loop Invariant Derived loop invariant: (((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___0) && __ste_email_to1 == 0) && !(handle == 2)) && 0 == in_encrypted) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 - InvariantResult [Line: 2524]: Loop Invariant Derived loop invariant: (((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___0) && __ste_email_to1 == 0) && !(handle == 2)) && 0 == in_encrypted) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 - InvariantResult [Line: 551]: Loop Invariant Derived loop invariant: ((((((((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___0) && !(handle == 2)) && __ste_email_to1 == 0) && 0 == in_encrypted) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && __ste_client_privateKey1 == 456) && __ste_Client_Keyring0_User0 == __ste_Client_Keyring0_User1) && !(2 == chuck___0)) && !(handle == 1)) && 0 == __ste_Client_Keyring0_User0) && rjh == 2 - InvariantResult [Line: 1577]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 687]: Loop Invariant Derived loop invariant: (((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___0) && __ste_email_to1 == 0) && !(handle == 2)) && 0 == in_encrypted) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 - InvariantResult [Line: 2416]: Loop Invariant Derived loop invariant: (((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___0) && __ste_email_to1 == 0) && !(handle == 2)) && 0 == in_encrypted) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 - InvariantResult [Line: 2524]: Loop Invariant Derived loop invariant: (((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___0) && __ste_email_to1 == 0) && !(handle == 2)) && 0 == in_encrypted) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___0) && __ste_email_to1 == 0) && !(handle == 2)) && 0 == in_encrypted) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___0) && !(handle == 2)) && __ste_email_to1 == 0) && 0 == in_encrypted) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && __ste_client_privateKey1 == 456) && __ste_Client_Keyring0_User0 == __ste_Client_Keyring0_User1) && !(2 == chuck___0)) && !(handle == 1)) && 0 == __ste_Client_Keyring0_User0) && rjh == 2 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((__ste_Client_Keyring0_User0 == __ste_Client_Keyring0_User1 && 1 == queue_empty) && __ste_email_to1 == 0) && rjh == handle) && handle == rjh___0) && 0 == in_encrypted) && 0 == __ste_Client_Keyring0_User0) && !(__ste_email_to0 == 1)) && rjh == 2 - InvariantResult [Line: 1078]: Loop Invariant Derived loop invariant: ((((((((((__ste_email_to0 == 2 && 1 == queue_empty) && 0 == \result) && 2 == rjh___0) && __ste_email_to1 == 0) && ((((((((handle == chuck___0 && !(1 == rjh___0)) && !(handle == 2)) && !(1 == chuck___0)) && 1 == handle) && 0 == in_encrypted) && !(1 == to)) && !(value == 1)) && !(__ste_email_to0 == 1)) && 1 == msg) && 2 == to) && value == 2) && !(1 == msg)) && msg == handle) && rjh == 2) || ((1 == queue_empty && __ste_email_to1 == 0) && ((((((__ste_email_to0 == 2 && 2 == rjh___0) && 2 == \result) && 2 == to) && value == 2) && 1 == handle && ((((((((handle == chuck___0 && !(1 == rjh___0)) && !(handle == 2)) && !(1 == chuck___0)) && 1 == handle) && 0 == in_encrypted) && !(1 == to)) && !(value == 1)) && !(__ste_email_to0 == 1)) && 1 == msg) && msg == handle) && rjh == 2) - InvariantResult [Line: 2416]: Loop Invariant Derived loop invariant: ((((((((handle == chuck___0 && 1 == queue_empty) && 0 == op1) && 2 == rjh___0) && __ste_email_to1 == 0) && !(handle == 2)) && 0 == in_encrypted) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 - InvariantResult [Line: 1078]: Loop Invariant Derived loop invariant: ((1 == queue_empty && __ste_email_to1 == 0) && (((((__ste_email_to0 == 2 && 2 == rjh___0) && 2 == \result) && 2 == to) && ((((((((handle == chuck___0 && !(1 == rjh___0)) && !(handle == 2)) && !(1 == chuck___0)) && !(1 == \result)) && 1 == handle) && 0 == in_encrypted) && !(1 == to)) && !(__ste_email_to0 == 1)) && 1 == msg) && value == 2) && rjh == 2) || (1 == queue_empty && (0 == \result && __ste_email_to1 == 0) && (((((((__ste_email_to0 == 2 && !(1 == msg)) && 2 == rjh___0) && 2 == to) && !(msg == 1)) && ((((((((handle == chuck___0 && !(1 == rjh___0)) && !(handle == 2)) && !(1 == chuck___0)) && !(1 == \result)) && 1 == handle) && 0 == in_encrypted) && !(1 == to)) && !(__ste_email_to0 == 1)) && 1 == msg) && value == 2) && !(1 == msg)) && rjh == 2) - InvariantResult [Line: 1693]: Loop Invariant Derived loop invariant: (((((((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___0) && __ste_email_to1 == 0) && !(handle == 2)) && 1 == handle) && value == 2) && !(1 == chuck___0)) && __ste_email_to0 == 2) && 1 == \result) && 2 == to) && 1 == msg) && rjh == 2 - InvariantResult [Line: 1078]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___0) && __ste_email_to1 == 0) && 456 == value) && 0 == in_encrypted) && handle == 2) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && __ste_client_privateKey1 == 456) && __ste_Client_Keyring0_User0 == __ste_Client_Keyring0_User1) && !(2 == chuck___0)) && 0 == __ste_Client_Keyring0_User0) && rjh == 2 - InvariantResult [Line: 2631]: Loop Invariant Derived loop invariant: (((((((((__ste_email_to0 == 2 && 2 == rjh___0) && 2 == \result) && 2 == to) && 1 == handle && ((((((((handle == chuck___0 && !(1 == rjh___0)) && !(handle == 2)) && !(1 == chuck___0)) && 1 == handle) && 0 == in_encrypted) && !(1 == to)) && !(value == 1)) && !(__ste_email_to0 == 1)) && 1 == msg) && value == 2) && msg == handle) && rjh == 2) && 1 == queue_empty) && __ste_email_to1 == 0) || (((1 == queue_empty && 0 == \result) && __ste_email_to1 == 0) && ((((__ste_email_to0 == 2 && 2 == rjh___0) && 2 == to) && value == 2) && ((((((((((handle == chuck___0 && !(1 == rjh___0)) && !(handle == 2)) && !(1 == chuck___0)) && 1 == handle) && 0 == in_encrypted) && !(1 == to)) && !(value == 1)) && !(__ste_email_to0 == 1)) && 1 == msg) && !(1 == msg)) && msg == handle) && rjh == 2) - InvariantResult [Line: 2685]: Loop Invariant Derived loop invariant: ((((((((handle == chuck___0 && 1 == queue_empty) && 0 == op1) && 2 == rjh___0) && __ste_email_to1 == 0) && !(handle == 2)) && 0 == in_encrypted) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 - InvariantResult [Line: 1249]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1078]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___0) && __ste_email_to1 == 0) && !(handle == 2)) && 0 == in_encrypted) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 - InvariantResult [Line: 2524]: Loop Invariant Derived loop invariant: ((((((((handle == chuck___0 && 1 == queue_empty) && 0 == op1) && 2 == rjh___0) && __ste_email_to1 == 0) && !(handle == 2)) && 0 == in_encrypted) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 - InvariantResult [Line: 2416]: Loop Invariant Derived loop invariant: (((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___0) && __ste_email_to1 == 0) && !(handle == 2)) && 0 == in_encrypted) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 - InvariantResult [Line: 2470]: Loop Invariant Derived loop invariant: ((((((((handle == chuck___0 && 1 == queue_empty) && 0 == op1) && 2 == rjh___0) && __ste_email_to1 == 0) && !(handle == 2)) && 0 == in_encrypted) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 - InvariantResult [Line: 2631]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((__ste_Client_Keyring0_User0 == __ste_Client_Keyring0_User1 && 1 == queue_empty) && !(rjh == 1)) && !(handle == 2)) && __ste_email_to1 == 0) && 0 == in_encrypted) && 0 == __ste_Client_Keyring0_User0) && !(__ste_email_to0 == 1) - InvariantResult [Line: 2436]: Loop Invariant Derived loop invariant: (((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___0) && __ste_email_to1 == 0) && !(handle == 2)) && 0 == in_encrypted) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((((__ste_client_privateKey1 == 456 && __ste_Client_Keyring0_User0 == __ste_Client_Keyring0_User1) && 1 == queue_empty) && __ste_email_to1 == 0) && rjh == handle) && 456 == value) && handle == rjh___0) && 0 == in_encrypted) && 0 == __ste_Client_Keyring0_User0) && handle == 2) && !(__ste_email_to0 == 1)) && rjh == 2 - InvariantResult [Line: 790]: Loop Invariant Derived loop invariant: (((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___0) && !(handle == 2)) && __ste_email_to1 == 0) && 0 == in_encrypted) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((__ste_Client_Keyring0_User0 == __ste_Client_Keyring0_User1 && 1 == queue_empty) && !(rjh == 1)) && !(handle == 2)) && __ste_email_to1 == 0) && 0 == in_encrypted) && 0 == __ste_Client_Keyring0_User0) && !(__ste_email_to0 == 1) - InvariantResult [Line: 1249]: Loop Invariant Derived loop invariant: (((((((((__ste_email_to0 == 2 && 2 == rjh___0) && 2 == \result) && 2 == to) && 1 == handle && ((((((((handle == chuck___0 && !(1 == rjh___0)) && !(handle == 2)) && !(1 == chuck___0)) && 1 == handle) && 0 == in_encrypted) && !(1 == to)) && !(value == 1)) && !(__ste_email_to0 == 1)) && 1 == msg) && value == 2) && msg == handle) && rjh == 2) && 1 == queue_empty) && __ste_email_to1 == 0) || (((1 == queue_empty && 0 == \result) && __ste_email_to1 == 0) && ((((__ste_email_to0 == 2 && 2 == rjh___0) && 2 == to) && value == 2) && ((((((((((handle == chuck___0 && !(1 == rjh___0)) && !(handle == 2)) && !(1 == chuck___0)) && 1 == handle) && 0 == in_encrypted) && !(1 == to)) && !(value == 1)) && !(__ste_email_to0 == 1)) && 1 == msg) && !(1 == msg)) && msg == handle) && rjh == 2) - InvariantResult [Line: 891]: Loop Invariant Derived loop invariant: (((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___0) && __ste_email_to1 == 0) && !(handle == 2)) && 0 == in_encrypted) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 - InvariantResult [Line: 791]: Loop Invariant Derived loop invariant: (((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___0) && __ste_email_to1 == 0) && !(handle == 2)) && 0 == in_encrypted) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 - InvariantResult [Line: 1508]: Loop Invariant Derived loop invariant: (((((((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___0) && !(handle == 2)) && __ste_email_to1 == 0) && 1 == handle) && 0 == in_encrypted) && value == 2) && !(1 == chuck___0)) && __ste_email_to0 == 2) && 2 == to) && 1 == msg) && rjh == 2 - InvariantResult [Line: 877]: Loop Invariant Derived loop invariant: (((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___0) && __ste_email_to1 == 0) && !(handle == 2)) && 0 == in_encrypted) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 - InvariantResult [Line: 1626]: Loop Invariant Derived loop invariant: ((((((((((handle == chuck___0 && __ste_email_to0 == 2) && 1 == queue_empty) && 2 == rjh___0) && __ste_email_to1 == 0) && !(handle == 2)) && 1 == handle) && 2 == to) && value == 2) && 1 == msg) && !(1 == chuck___0)) && rjh == 2 - InvariantResult [Line: 1060]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2436]: Loop Invariant Derived loop invariant: (((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___0) && __ste_email_to1 == 0) && !(handle == 2)) && 0 == in_encrypted) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 - InvariantResult [Line: 1626]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2436]: Loop Invariant Derived loop invariant: ((((((((handle == chuck___0 && 1 == queue_empty) && 0 == op1) && 2 == rjh___0) && __ste_email_to1 == 0) && !(handle == 2)) && 0 == in_encrypted) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 - InvariantResult [Line: 866]: Loop Invariant Derived loop invariant: (((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___0) && __ste_email_to1 == 0) && !(handle == 2)) && 0 == in_encrypted) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 - InvariantResult [Line: 852]: Loop Invariant Derived loop invariant: (((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___0) && __ste_email_to1 == 0) && !(handle == 2)) && 0 == in_encrypted) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 - InvariantResult [Line: 2436]: Loop Invariant Derived loop invariant: (((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___0) && __ste_email_to1 == 0) && !(handle == 2)) && 0 == in_encrypted) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 - InvariantResult [Line: 1378]: Loop Invariant Derived loop invariant: (1 == queue_empty && (((((((((((__ste_email_to0 == 2 && !(1 == msg)) && 2 == rjh___0) && ((((!(1 == client) && ((handle == chuck___0 && !(1 == rjh___0)) && !(handle == 2)) && !(1 == chuck___0)) && !(1 == \result)) && 1 == handle) && !(__ste_email_to0 == 1)) && 1 == msg) && 2 == to) && !(msg == 1)) && !(handle == 1)) && value == 2) && !(1 == msg)) && rjh == 2) && 0 == \result) && __ste_email_to1 == 0) && 0 == client) || ((1 == queue_empty && __ste_email_to1 == 0) && ((((((__ste_email_to0 == 2 && 2 == \result) && ((((!(1 == client) && ((handle == chuck___0 && !(1 == rjh___0)) && !(handle == 2)) && !(1 == chuck___0)) && !(1 == \result)) && 1 == handle) && !(__ste_email_to0 == 1)) && 1 == msg) && 2 == client) && 2 == to) && value == 2) && rjh == 2) && 2 == rjh___0) - InvariantResult [Line: 1378]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2436]: Loop Invariant Derived loop invariant: (((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___0) && __ste_email_to1 == 0) && !(handle == 2)) && 0 == in_encrypted) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 - InvariantResult [Line: 2577]: Loop Invariant Derived loop invariant: ((((((((handle == chuck___0 && 1 == queue_empty) && 0 == op1) && 2 == rjh___0) && __ste_email_to1 == 0) && !(handle == 2)) && 0 == in_encrypted) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 - InvariantResult [Line: 1060]: Loop Invariant Derived loop invariant: (((((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___0) && !(handle == 2)) && __ste_email_to1 == 0) && 2 == to) && 0 == in_encrypted) && !(__ste_email_to0 == 1)) && 1 == msg) && !(1 == chuck___0)) && rjh == 2 - InvariantResult [Line: 1193]: Loop Invariant Derived loop invariant: ((((((((((handle == chuck___0 && __ste_email_to0 == 2) && 1 == queue_empty) && 2 == rjh___0) && __ste_email_to1 == 0) && !(handle == 2)) && 1 == handle) && 2 == to) && value == 2) && 1 == msg) && !(1 == chuck___0)) && rjh == 2 - InvariantResult [Line: 1193]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2392]: Loop Invariant Derived loop invariant: ((((((((handle == chuck___0 && 1 == queue_empty) && 0 == op1) && 2 == rjh___0) && __ste_email_to1 == 0) && !(handle == 2)) && 0 == in_encrypted) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 - InvariantResult [Line: 838]: Loop Invariant Derived loop invariant: (((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___0) && __ste_email_to1 == 0) && !(handle == 2)) && 0 == in_encrypted) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 - InvariantResult [Line: 2392]: Loop Invariant Derived loop invariant: (((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___0) && __ste_email_to1 == 0) && !(handle == 2)) && 0 == in_encrypted) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 - InvariantResult [Line: 2392]: Loop Invariant Derived loop invariant: (((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___0) && __ste_email_to1 == 0) && !(handle == 2)) && 0 == in_encrypted) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 - InvariantResult [Line: 584]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1193]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2392]: Loop Invariant Derived loop invariant: (((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___0) && __ste_email_to1 == 0) && !(handle == 2)) && 0 == in_encrypted) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 - InvariantResult [Line: 1193]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1060]: Loop Invariant Derived loop invariant: (((1 == queue_empty && 0 == \result) && __ste_email_to1 == 0) && ((((((((__ste_email_to0 == 2 && !(1 == msg)) && (((((((handle == chuck___0 && !(1 == rjh___0)) && !(handle == 2)) && !(1 == chuck___0)) && 1 == handle) && 0 == in_encrypted) && !(1 == to)) && !(__ste_email_to0 == 1)) && 1 == msg) && 2 == rjh___0) && 2 == to) && !(handle == 1)) && value == 2) && !(1 == msg)) && msg == handle) && rjh == 2) || (((((((((__ste_email_to0 == 2 && 2 == rjh___0) && 2 == \result) && 2 == to) && (1 == msg && 1 == handle) && (((((((handle == chuck___0 && !(1 == rjh___0)) && !(handle == 2)) && !(1 == chuck___0)) && 1 == handle) && 0 == in_encrypted) && !(1 == to)) && !(__ste_email_to0 == 1)) && 1 == msg) && value == 2) && msg == handle) && rjh == 2) && 1 == queue_empty) && __ste_email_to1 == 0) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((__ste_Client_Keyring0_User0 == __ste_Client_Keyring0_User1 && 1 == queue_empty) && !(rjh == 1)) && __ste_email_to1 == 0) && 0 == in_encrypted) && 0 == __ste_Client_Keyring0_User0) && !(__ste_email_to0 == 1) - InvariantResult [Line: 2392]: Loop Invariant Derived loop invariant: (((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___0) && __ste_email_to1 == 0) && !(handle == 2)) && 0 == in_encrypted) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 383 locations, 2 error locations. Result: SAFE, OverallTime: 30.6s, OverallIterations: 21, TraceHistogramMax: 2, AutomataDifference: 5.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 20.8s, HoareTripleCheckerStatistics: 15325 SDtfs, 25127 SDslu, 35472 SDs, 0 SdLazy, 1624 SolverSat, 118 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 181 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2907occurred in iteration=18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.8s AutomataMinimizationTime, 21 MinimizatonAttempts, 6400 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 95 LocationsWithAnnotation, 95 PreInvPairs, 751 NumberOfFragments, 3672 HoareAnnotationTreeSize, 95 FomulaSimplifications, 137161067 FormulaSimplificationTreeSizeReduction, 4.7s HoareSimplificationTime, 95 FomulaSimplificationsInter, 96029435 FormulaSimplificationTreeSizeReductionInter, 16.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 1390 NumberOfCodeBlocks, 1390 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 1369 ConstructedInterpolants, 0 QuantifiedInterpolants, 179615 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 PerfectInterpolantSequences, 28/28 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...