./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/product-lines/email_spec9_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_b66b2805-03ff-4969-852e-96bbd030a60f/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_b66b2805-03ff-4969-852e-96bbd030a60f/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_b66b2805-03ff-4969-852e-96bbd030a60f/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_b66b2805-03ff-4969-852e-96bbd030a60f/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/product-lines/email_spec9_product12.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_b66b2805-03ff-4969-852e-96bbd030a60f/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_b66b2805-03ff-4969-852e-96bbd030a60f/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 122860f60c237ba0e5aaff00f5b5723e95eecabf ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:26:01,612 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 11:26:01,614 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 11:26:01,624 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 11:26:01,625 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 11:26:01,627 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 11:26:01,628 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 11:26:01,630 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 11:26:01,631 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 11:26:01,631 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 11:26:01,632 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 11:26:01,633 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 11:26:01,633 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 11:26:01,635 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 11:26:01,636 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 11:26:01,637 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 11:26:01,638 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 11:26:01,638 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 11:26:01,639 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 11:26:01,641 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 11:26:01,648 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 11:26:01,649 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 11:26:01,650 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 11:26:01,650 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 11:26:01,652 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 11:26:01,652 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 11:26:01,652 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 11:26:01,653 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 11:26:01,655 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 11:26:01,656 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 11:26:01,656 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 11:26:01,657 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 11:26:01,657 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 11:26:01,658 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 11:26:01,659 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 11:26:01,659 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 11:26:01,659 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 11:26:01,659 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 11:26:01,659 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 11:26:01,660 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 11:26:01,660 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 11:26:01,661 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_b66b2805-03ff-4969-852e-96bbd030a60f/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-10-22 11:26:01,674 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 11:26:01,675 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 11:26:01,675 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-22 11:26:01,675 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-22 11:26:01,676 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-22 11:26:01,676 INFO L138 SettingsManager]: * Explicit value domain=true [2019-10-22 11:26:01,676 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-10-22 11:26:01,676 INFO L138 SettingsManager]: * Octagon Domain=false [2019-10-22 11:26:01,676 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-10-22 11:26:01,676 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-10-22 11:26:01,677 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-10-22 11:26:01,677 INFO L138 SettingsManager]: * Interval Domain=false [2019-10-22 11:26:01,677 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 11:26:01,678 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 11:26:01,678 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 11:26:01,678 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 11:26:01,678 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 11:26:01,678 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 11:26:01,678 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 11:26:01,678 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 11:26:01,679 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 11:26:01,679 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 11:26:01,679 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 11:26:01,679 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 11:26:01,679 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 11:26:01,679 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 11:26:01,680 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 11:26:01,680 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:26:01,680 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 11:26:01,680 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 11:26:01,680 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 11:26:01,680 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-22 11:26:01,681 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 11:26:01,681 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 11:26:01,681 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-22 11:26:01,681 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_b66b2805-03ff-4969-852e-96bbd030a60f/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 -> 122860f60c237ba0e5aaff00f5b5723e95eecabf [2019-10-22 11:26:01,705 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 11:26:01,715 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 11:26:01,717 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 11:26:01,719 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 11:26:01,719 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 11:26:01,720 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_b66b2805-03ff-4969-852e-96bbd030a60f/bin/utaipan/../../sv-benchmarks/c/product-lines/email_spec9_product12.cil.c [2019-10-22 11:26:01,766 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b66b2805-03ff-4969-852e-96bbd030a60f/bin/utaipan/data/2a73bfae8/cb40f854f4f64e4bba50b82d43cada59/FLAG0dac4ec81 [2019-10-22 11:26:02,281 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 11:26:02,281 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_b66b2805-03ff-4969-852e-96bbd030a60f/sv-benchmarks/c/product-lines/email_spec9_product12.cil.c [2019-10-22 11:26:02,295 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b66b2805-03ff-4969-852e-96bbd030a60f/bin/utaipan/data/2a73bfae8/cb40f854f4f64e4bba50b82d43cada59/FLAG0dac4ec81 [2019-10-22 11:26:02,739 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_b66b2805-03ff-4969-852e-96bbd030a60f/bin/utaipan/data/2a73bfae8/cb40f854f4f64e4bba50b82d43cada59 [2019-10-22 11:26:02,743 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 11:26:02,744 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 11:26:02,745 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 11:26:02,745 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 11:26:02,748 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 11:26:02,749 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:26:02" (1/1) ... [2019-10-22 11:26:02,751 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d531761 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:02, skipping insertion in model container [2019-10-22 11:26:02,751 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:26:02" (1/1) ... [2019-10-22 11:26:02,757 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 11:26:02,823 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 11:26:03,370 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:26:03,400 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 11:26:03,524 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:26:03,598 INFO L192 MainTranslator]: Completed translation [2019-10-22 11:26:03,599 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:03 WrapperNode [2019-10-22 11:26:03,599 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 11:26:03,600 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 11:26:03,600 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 11:26:03,600 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 11:26:03,608 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:26:03" (1/1) ... [2019-10-22 11:26:03,648 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:26:03" (1/1) ... [2019-10-22 11:26:03,728 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 11:26:03,728 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 11:26:03,728 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 11:26:03,728 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 11:26:03,737 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:03" (1/1) ... [2019-10-22 11:26:03,738 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:03" (1/1) ... [2019-10-22 11:26:03,743 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:03" (1/1) ... [2019-10-22 11:26:03,743 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:03" (1/1) ... [2019-10-22 11:26:03,771 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:03" (1/1) ... [2019-10-22 11:26:03,800 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:03" (1/1) ... [2019-10-22 11:26:03,804 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:03" (1/1) ... [2019-10-22 11:26:03,827 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 11:26:03,828 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 11:26:03,828 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 11:26:03,828 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 11:26:03,830 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:03" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b66b2805-03ff-4969-852e-96bbd030a60f/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:26:03,887 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-10-22 11:26:03,888 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 11:26:03,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-22 11:26:03,888 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 11:26:03,888 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 11:26:05,458 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 11:26:05,459 INFO L284 CfgBuilder]: Removed 231 assume(true) statements. [2019-10-22 11:26:05,460 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:26:05 BoogieIcfgContainer [2019-10-22 11:26:05,460 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 11:26:05,461 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 11:26:05,461 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 11:26:05,464 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 11:26:05,464 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 11:26:02" (1/3) ... [2019-10-22 11:26:05,465 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11c1d847 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:26:05, skipping insertion in model container [2019-10-22 11:26:05,466 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:03" (2/3) ... [2019-10-22 11:26:05,466 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11c1d847 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:26:05, skipping insertion in model container [2019-10-22 11:26:05,466 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:26:05" (3/3) ... [2019-10-22 11:26:05,467 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec9_product12.cil.c [2019-10-22 11:26:05,476 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 11:26:05,487 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-10-22 11:26:05,497 INFO L249 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-10-22 11:26:05,525 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 11:26:05,525 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 11:26:05,525 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 11:26:05,525 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 11:26:05,525 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 11:26:05,525 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 11:26:05,526 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 11:26:05,526 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 11:26:05,543 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states. [2019-10-22 11:26:05,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-22 11:26:05,553 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:05,554 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:26:05,555 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:26:05,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:05,560 INFO L82 PathProgramCache]: Analyzing trace with hash 1406579473, now seen corresponding path program 1 times [2019-10-22 11:26:05,568 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:05,568 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793370799] [2019-10-22 11:26:05,568 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:05,568 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:05,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:05,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:05,872 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:26:05,873 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793370799] [2019-10-22 11:26:05,874 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:05,874 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:26:05,874 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500724175] [2019-10-22 11:26:05,878 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:26:05,879 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:05,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:26:05,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:26:05,894 INFO L87 Difference]: Start difference. First operand 383 states. Second operand 3 states. [2019-10-22 11:26:06,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:06,024 INFO L93 Difference]: Finished difference Result 1114 states and 1961 transitions. [2019-10-22 11:26:06,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:26:06,029 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-10-22 11:26:06,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:06,048 INFO L225 Difference]: With dead ends: 1114 [2019-10-22 11:26:06,049 INFO L226 Difference]: Without dead ends: 678 [2019-10-22 11:26:06,052 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:26:06,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 678 states. [2019-10-22 11:26:06,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 678 to 348. [2019-10-22 11:26:06,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2019-10-22 11:26:06,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 608 transitions. [2019-10-22 11:26:06,123 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 608 transitions. Word has length 41 [2019-10-22 11:26:06,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:06,124 INFO L462 AbstractCegarLoop]: Abstraction has 348 states and 608 transitions. [2019-10-22 11:26:06,124 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:26:06,124 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 608 transitions. [2019-10-22 11:26:06,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-22 11:26:06,126 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:06,127 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:26:06,127 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:26:06,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:06,127 INFO L82 PathProgramCache]: Analyzing trace with hash 1229064159, now seen corresponding path program 1 times [2019-10-22 11:26:06,128 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:06,128 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448852163] [2019-10-22 11:26:06,128 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:06,128 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:06,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:06,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:06,211 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:26:06,212 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448852163] [2019-10-22 11:26:06,212 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:06,212 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:26:06,212 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668363474] [2019-10-22 11:26:06,214 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:26:06,214 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:06,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:26:06,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:26:06,215 INFO L87 Difference]: Start difference. First operand 348 states and 608 transitions. Second operand 5 states. [2019-10-22 11:26:06,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:06,424 INFO L93 Difference]: Finished difference Result 993 states and 1740 transitions. [2019-10-22 11:26:06,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 11:26:06,425 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2019-10-22 11:26:06,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:06,428 INFO L225 Difference]: With dead ends: 993 [2019-10-22 11:26:06,428 INFO L226 Difference]: Without dead ends: 664 [2019-10-22 11:26:06,430 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:26:06,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2019-10-22 11:26:06,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 348. [2019-10-22 11:26:06,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2019-10-22 11:26:06,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 607 transitions. [2019-10-22 11:26:06,457 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 607 transitions. Word has length 43 [2019-10-22 11:26:06,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:06,457 INFO L462 AbstractCegarLoop]: Abstraction has 348 states and 607 transitions. [2019-10-22 11:26:06,457 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:26:06,460 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 607 transitions. [2019-10-22 11:26:06,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-22 11:26:06,462 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:06,462 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:26:06,462 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:26:06,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:06,462 INFO L82 PathProgramCache]: Analyzing trace with hash 1119354482, now seen corresponding path program 1 times [2019-10-22 11:26:06,462 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:06,463 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351550447] [2019-10-22 11:26:06,463 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:06,463 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:06,463 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:06,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:06,564 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:26:06,564 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351550447] [2019-10-22 11:26:06,565 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:06,565 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:26:06,565 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721340718] [2019-10-22 11:26:06,565 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:26:06,566 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:06,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:26:06,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:26:06,566 INFO L87 Difference]: Start difference. First operand 348 states and 607 transitions. Second operand 3 states. [2019-10-22 11:26:06,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:06,598 INFO L93 Difference]: Finished difference Result 678 states and 1188 transitions. [2019-10-22 11:26:06,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:26:06,599 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-10-22 11:26:06,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:06,601 INFO L225 Difference]: With dead ends: 678 [2019-10-22 11:26:06,601 INFO L226 Difference]: Without dead ends: 353 [2019-10-22 11:26:06,602 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:26:06,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2019-10-22 11:26:06,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 348. [2019-10-22 11:26:06,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2019-10-22 11:26:06,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 606 transitions. [2019-10-22 11:26:06,620 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 606 transitions. Word has length 44 [2019-10-22 11:26:06,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:06,620 INFO L462 AbstractCegarLoop]: Abstraction has 348 states and 606 transitions. [2019-10-22 11:26:06,620 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:26:06,620 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 606 transitions. [2019-10-22 11:26:06,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-22 11:26:06,622 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:06,622 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:26:06,623 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:26:06,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:06,623 INFO L82 PathProgramCache]: Analyzing trace with hash 529516012, now seen corresponding path program 1 times [2019-10-22 11:26:06,623 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:06,623 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165916282] [2019-10-22 11:26:06,623 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:06,623 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:06,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:06,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:06,690 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:26:06,691 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165916282] [2019-10-22 11:26:06,691 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:06,691 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:26:06,691 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947572394] [2019-10-22 11:26:06,691 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:26:06,692 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:06,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:26:06,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:26:06,692 INFO L87 Difference]: Start difference. First operand 348 states and 606 transitions. Second operand 3 states. [2019-10-22 11:26:06,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:06,726 INFO L93 Difference]: Finished difference Result 688 states and 1201 transitions. [2019-10-22 11:26:06,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:26:06,726 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2019-10-22 11:26:06,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:06,728 INFO L225 Difference]: With dead ends: 688 [2019-10-22 11:26:06,729 INFO L226 Difference]: Without dead ends: 348 [2019-10-22 11:26:06,730 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:26:06,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2019-10-22 11:26:06,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 348. [2019-10-22 11:26:06,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2019-10-22 11:26:06,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 604 transitions. [2019-10-22 11:26:06,747 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 604 transitions. Word has length 45 [2019-10-22 11:26:06,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:06,747 INFO L462 AbstractCegarLoop]: Abstraction has 348 states and 604 transitions. [2019-10-22 11:26:06,747 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:26:06,747 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 604 transitions. [2019-10-22 11:26:06,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-22 11:26:06,750 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:06,750 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:26:06,751 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:26:06,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:06,751 INFO L82 PathProgramCache]: Analyzing trace with hash -1405066185, now seen corresponding path program 1 times [2019-10-22 11:26:06,751 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:06,751 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725528840] [2019-10-22 11:26:06,751 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:06,752 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:06,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:06,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:06,848 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:26:06,848 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725528840] [2019-10-22 11:26:06,848 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:06,848 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:26:06,849 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70179738] [2019-10-22 11:26:06,849 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:26:06,849 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:06,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:26:06,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:26:06,851 INFO L87 Difference]: Start difference. First operand 348 states and 604 transitions. Second operand 5 states. [2019-10-22 11:26:06,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:06,988 INFO L93 Difference]: Finished difference Result 983 states and 1720 transitions. [2019-10-22 11:26:06,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:26:06,988 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2019-10-22 11:26:06,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:06,992 INFO L225 Difference]: With dead ends: 983 [2019-10-22 11:26:06,993 INFO L226 Difference]: Without dead ends: 662 [2019-10-22 11:26:06,994 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:26:06,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2019-10-22 11:26:07,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 348. [2019-10-22 11:26:07,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2019-10-22 11:26:07,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 603 transitions. [2019-10-22 11:26:07,009 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 603 transitions. Word has length 46 [2019-10-22 11:26:07,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:07,010 INFO L462 AbstractCegarLoop]: Abstraction has 348 states and 603 transitions. [2019-10-22 11:26:07,010 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:26:07,010 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 603 transitions. [2019-10-22 11:26:07,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-22 11:26:07,011 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:07,011 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:26:07,011 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:26:07,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:07,011 INFO L82 PathProgramCache]: Analyzing trace with hash 2127825844, now seen corresponding path program 1 times [2019-10-22 11:26:07,011 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:07,012 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921485539] [2019-10-22 11:26:07,012 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:07,012 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:07,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:07,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:07,094 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:26:07,094 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921485539] [2019-10-22 11:26:07,094 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:07,094 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:26:07,094 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626843809] [2019-10-22 11:26:07,095 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:26:07,095 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:07,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:26:07,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:26:07,095 INFO L87 Difference]: Start difference. First operand 348 states and 603 transitions. Second operand 5 states. [2019-10-22 11:26:07,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:07,230 INFO L93 Difference]: Finished difference Result 988 states and 1725 transitions. [2019-10-22 11:26:07,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:26:07,231 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-10-22 11:26:07,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:07,233 INFO L225 Difference]: With dead ends: 988 [2019-10-22 11:26:07,233 INFO L226 Difference]: Without dead ends: 667 [2019-10-22 11:26:07,234 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:26:07,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2019-10-22 11:26:07,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 348. [2019-10-22 11:26:07,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2019-10-22 11:26:07,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 602 transitions. [2019-10-22 11:26:07,255 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 602 transitions. Word has length 47 [2019-10-22 11:26:07,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:07,256 INFO L462 AbstractCegarLoop]: Abstraction has 348 states and 602 transitions. [2019-10-22 11:26:07,256 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:26:07,256 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 602 transitions. [2019-10-22 11:26:07,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-10-22 11:26:07,257 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:07,257 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:26:07,257 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:26:07,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:07,257 INFO L82 PathProgramCache]: Analyzing trace with hash 491431836, now seen corresponding path program 1 times [2019-10-22 11:26:07,257 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:07,258 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843036995] [2019-10-22 11:26:07,258 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:07,258 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:07,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:07,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:07,319 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:26:07,319 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843036995] [2019-10-22 11:26:07,320 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:07,320 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:26:07,320 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814806047] [2019-10-22 11:26:07,320 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:26:07,320 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:07,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:26:07,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:26:07,321 INFO L87 Difference]: Start difference. First operand 348 states and 602 transitions. Second operand 3 states. [2019-10-22 11:26:07,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:07,346 INFO L93 Difference]: Finished difference Result 462 states and 787 transitions. [2019-10-22 11:26:07,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:26:07,347 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2019-10-22 11:26:07,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:07,348 INFO L225 Difference]: With dead ends: 462 [2019-10-22 11:26:07,348 INFO L226 Difference]: Without dead ends: 351 [2019-10-22 11:26:07,348 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:26:07,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2019-10-22 11:26:07,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 350. [2019-10-22 11:26:07,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2019-10-22 11:26:07,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 604 transitions. [2019-10-22 11:26:07,364 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 604 transitions. Word has length 48 [2019-10-22 11:26:07,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:07,364 INFO L462 AbstractCegarLoop]: Abstraction has 350 states and 604 transitions. [2019-10-22 11:26:07,364 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:26:07,365 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 604 transitions. [2019-10-22 11:26:07,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-22 11:26:07,366 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:07,366 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:26:07,366 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:26:07,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:07,366 INFO L82 PathProgramCache]: Analyzing trace with hash -1357482402, now seen corresponding path program 1 times [2019-10-22 11:26:07,366 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:07,367 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078790407] [2019-10-22 11:26:07,367 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:07,367 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:07,367 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:07,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:07,411 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:26:07,411 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078790407] [2019-10-22 11:26:07,412 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:07,412 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:26:07,412 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704482904] [2019-10-22 11:26:07,412 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:26:07,412 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:07,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:26:07,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:26:07,413 INFO L87 Difference]: Start difference. First operand 350 states and 604 transitions. Second operand 3 states. [2019-10-22 11:26:07,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:07,447 INFO L93 Difference]: Finished difference Result 936 states and 1636 transitions. [2019-10-22 11:26:07,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:26:07,448 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-10-22 11:26:07,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:07,450 INFO L225 Difference]: With dead ends: 936 [2019-10-22 11:26:07,450 INFO L226 Difference]: Without dead ends: 617 [2019-10-22 11:26:07,451 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:26:07,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2019-10-22 11:26:07,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 506. [2019-10-22 11:26:07,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 506 states. [2019-10-22 11:26:07,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 890 transitions. [2019-10-22 11:26:07,473 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 890 transitions. Word has length 54 [2019-10-22 11:26:07,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:07,474 INFO L462 AbstractCegarLoop]: Abstraction has 506 states and 890 transitions. [2019-10-22 11:26:07,474 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:26:07,474 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 890 transitions. [2019-10-22 11:26:07,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-22 11:26:07,475 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:07,475 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:26:07,475 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:26:07,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:07,475 INFO L82 PathProgramCache]: Analyzing trace with hash -1913867361, now seen corresponding path program 1 times [2019-10-22 11:26:07,475 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:07,476 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170144508] [2019-10-22 11:26:07,476 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:07,476 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:07,476 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:07,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:07,563 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:26:07,563 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170144508] [2019-10-22 11:26:07,563 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:07,563 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-22 11:26:07,563 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072885267] [2019-10-22 11:26:07,564 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-22 11:26:07,564 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:07,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-22 11:26:07,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-22 11:26:07,564 INFO L87 Difference]: Start difference. First operand 506 states and 890 transitions. Second operand 9 states. [2019-10-22 11:26:08,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:08,494 INFO L93 Difference]: Finished difference Result 1553 states and 2649 transitions. [2019-10-22 11:26:08,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-22 11:26:08,495 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2019-10-22 11:26:08,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:08,500 INFO L225 Difference]: With dead ends: 1553 [2019-10-22 11:26:08,500 INFO L226 Difference]: Without dead ends: 1462 [2019-10-22 11:26:08,501 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:26:08,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1462 states. [2019-10-22 11:26:08,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1462 to 951. [2019-10-22 11:26:08,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 951 states. [2019-10-22 11:26:08,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 951 states to 951 states and 1691 transitions. [2019-10-22 11:26:08,579 INFO L78 Accepts]: Start accepts. Automaton has 951 states and 1691 transitions. Word has length 55 [2019-10-22 11:26:08,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:08,579 INFO L462 AbstractCegarLoop]: Abstraction has 951 states and 1691 transitions. [2019-10-22 11:26:08,579 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-22 11:26:08,579 INFO L276 IsEmpty]: Start isEmpty. Operand 951 states and 1691 transitions. [2019-10-22 11:26:08,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-22 11:26:08,580 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:08,581 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:26:08,581 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:26:08,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:08,581 INFO L82 PathProgramCache]: Analyzing trace with hash 299135132, now seen corresponding path program 1 times [2019-10-22 11:26:08,582 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:08,582 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381777256] [2019-10-22 11:26:08,582 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:08,582 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:08,582 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:08,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:08,668 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:26:08,669 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381777256] [2019-10-22 11:26:08,669 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:08,669 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:26:08,669 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416150057] [2019-10-22 11:26:08,670 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:26:08,670 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:08,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:26:08,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:26:08,670 INFO L87 Difference]: Start difference. First operand 951 states and 1691 transitions. Second operand 4 states. [2019-10-22 11:26:08,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:08,940 INFO L93 Difference]: Finished difference Result 1930 states and 3346 transitions. [2019-10-22 11:26:08,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:26:08,941 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2019-10-22 11:26:08,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:08,947 INFO L225 Difference]: With dead ends: 1930 [2019-10-22 11:26:08,947 INFO L226 Difference]: Without dead ends: 1780 [2019-10-22 11:26:08,948 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:26:08,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1780 states. [2019-10-22 11:26:09,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1780 to 1472. [2019-10-22 11:26:09,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1472 states. [2019-10-22 11:26:09,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1472 states to 1472 states and 2616 transitions. [2019-10-22 11:26:09,019 INFO L78 Accepts]: Start accepts. Automaton has 1472 states and 2616 transitions. Word has length 56 [2019-10-22 11:26:09,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:09,019 INFO L462 AbstractCegarLoop]: Abstraction has 1472 states and 2616 transitions. [2019-10-22 11:26:09,019 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:26:09,019 INFO L276 IsEmpty]: Start isEmpty. Operand 1472 states and 2616 transitions. [2019-10-22 11:26:09,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-22 11:26:09,021 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:09,021 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:26:09,021 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:26:09,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:09,022 INFO L82 PathProgramCache]: Analyzing trace with hash -287670882, now seen corresponding path program 1 times [2019-10-22 11:26:09,022 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:09,022 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184161378] [2019-10-22 11:26:09,022 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:09,022 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:09,022 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:09,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:09,081 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:26:09,081 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184161378] [2019-10-22 11:26:09,081 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:09,082 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:26:09,082 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64055886] [2019-10-22 11:26:09,082 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:26:09,082 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:09,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:26:09,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:26:09,083 INFO L87 Difference]: Start difference. First operand 1472 states and 2616 transitions. Second operand 3 states. [2019-10-22 11:26:09,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:09,140 INFO L93 Difference]: Finished difference Result 1660 states and 2914 transitions. [2019-10-22 11:26:09,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:26:09,143 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-10-22 11:26:09,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:09,147 INFO L225 Difference]: With dead ends: 1660 [2019-10-22 11:26:09,147 INFO L226 Difference]: Without dead ends: 1454 [2019-10-22 11:26:09,148 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:26:09,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1454 states. [2019-10-22 11:26:09,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1454 to 1454. [2019-10-22 11:26:09,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1454 states. [2019-10-22 11:26:09,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1454 states to 1454 states and 2583 transitions. [2019-10-22 11:26:09,224 INFO L78 Accepts]: Start accepts. Automaton has 1454 states and 2583 transitions. Word has length 56 [2019-10-22 11:26:09,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:09,225 INFO L462 AbstractCegarLoop]: Abstraction has 1454 states and 2583 transitions. [2019-10-22 11:26:09,225 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:26:09,225 INFO L276 IsEmpty]: Start isEmpty. Operand 1454 states and 2583 transitions. [2019-10-22 11:26:09,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-10-22 11:26:09,227 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:09,227 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:26:09,228 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:26:09,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:09,228 INFO L82 PathProgramCache]: Analyzing trace with hash 1551555458, now seen corresponding path program 1 times [2019-10-22 11:26:09,228 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:09,228 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132063658] [2019-10-22 11:26:09,228 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:09,229 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:09,229 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:09,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:09,288 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:26:09,288 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132063658] [2019-10-22 11:26:09,288 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:09,289 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:26:09,289 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760406859] [2019-10-22 11:26:09,289 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:26:09,289 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:09,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:26:09,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:26:09,290 INFO L87 Difference]: Start difference. First operand 1454 states and 2583 transitions. Second operand 4 states. [2019-10-22 11:26:09,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:09,351 INFO L93 Difference]: Finished difference Result 1558 states and 2753 transitions. [2019-10-22 11:26:09,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:26:09,351 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2019-10-22 11:26:09,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:09,356 INFO L225 Difference]: With dead ends: 1558 [2019-10-22 11:26:09,356 INFO L226 Difference]: Without dead ends: 1386 [2019-10-22 11:26:09,357 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:26:09,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1386 states. [2019-10-22 11:26:09,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1386 to 1386. [2019-10-22 11:26:09,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1386 states. [2019-10-22 11:26:09,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1386 states to 1386 states and 2469 transitions. [2019-10-22 11:26:09,427 INFO L78 Accepts]: Start accepts. Automaton has 1386 states and 2469 transitions. Word has length 83 [2019-10-22 11:26:09,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:09,427 INFO L462 AbstractCegarLoop]: Abstraction has 1386 states and 2469 transitions. [2019-10-22 11:26:09,427 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:26:09,428 INFO L276 IsEmpty]: Start isEmpty. Operand 1386 states and 2469 transitions. [2019-10-22 11:26:09,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-10-22 11:26:09,431 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:09,431 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:26:09,431 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:26:09,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:09,432 INFO L82 PathProgramCache]: Analyzing trace with hash 64522138, now seen corresponding path program 1 times [2019-10-22 11:26:09,432 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:09,432 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093615121] [2019-10-22 11:26:09,432 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:09,432 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:09,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:09,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:09,552 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:26:09,553 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093615121] [2019-10-22 11:26:09,554 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:09,554 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-22 11:26:09,554 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562701233] [2019-10-22 11:26:09,554 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-22 11:26:09,554 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:09,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-22 11:26:09,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-22 11:26:09,555 INFO L87 Difference]: Start difference. First operand 1386 states and 2469 transitions. Second operand 10 states. [2019-10-22 11:26:09,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:09,975 INFO L93 Difference]: Finished difference Result 1956 states and 3380 transitions. [2019-10-22 11:26:09,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-22 11:26:09,976 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 84 [2019-10-22 11:26:09,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:09,981 INFO L225 Difference]: With dead ends: 1956 [2019-10-22 11:26:09,982 INFO L226 Difference]: Without dead ends: 1837 [2019-10-22 11:26:09,983 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:26:09,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1837 states. [2019-10-22 11:26:10,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1837 to 1404. [2019-10-22 11:26:10,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1404 states. [2019-10-22 11:26:10,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1404 states to 1404 states and 2493 transitions. [2019-10-22 11:26:10,063 INFO L78 Accepts]: Start accepts. Automaton has 1404 states and 2493 transitions. Word has length 84 [2019-10-22 11:26:10,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:10,064 INFO L462 AbstractCegarLoop]: Abstraction has 1404 states and 2493 transitions. [2019-10-22 11:26:10,064 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-22 11:26:10,064 INFO L276 IsEmpty]: Start isEmpty. Operand 1404 states and 2493 transitions. [2019-10-22 11:26:10,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-10-22 11:26:10,067 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:10,067 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:26:10,067 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:26:10,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:10,068 INFO L82 PathProgramCache]: Analyzing trace with hash -2096099641, now seen corresponding path program 1 times [2019-10-22 11:26:10,068 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:10,068 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585617090] [2019-10-22 11:26:10,068 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:10,068 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:10,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:10,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:10,183 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:26:10,183 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585617090] [2019-10-22 11:26:10,183 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:10,184 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 11:26:10,184 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302429733] [2019-10-22 11:26:10,184 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 11:26:10,185 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:10,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 11:26:10,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:26:10,185 INFO L87 Difference]: Start difference. First operand 1404 states and 2493 transitions. Second operand 6 states. [2019-10-22 11:26:10,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:10,478 INFO L93 Difference]: Finished difference Result 2973 states and 5241 transitions. [2019-10-22 11:26:10,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 11:26:10,479 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 85 [2019-10-22 11:26:10,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:10,487 INFO L225 Difference]: With dead ends: 2973 [2019-10-22 11:26:10,487 INFO L226 Difference]: Without dead ends: 2908 [2019-10-22 11:26:10,489 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:26:10,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2908 states. [2019-10-22 11:26:10,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2908 to 2673. [2019-10-22 11:26:10,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2673 states. [2019-10-22 11:26:10,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2673 states to 2673 states and 4773 transitions. [2019-10-22 11:26:10,620 INFO L78 Accepts]: Start accepts. Automaton has 2673 states and 4773 transitions. Word has length 85 [2019-10-22 11:26:10,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:10,621 INFO L462 AbstractCegarLoop]: Abstraction has 2673 states and 4773 transitions. [2019-10-22 11:26:10,621 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 11:26:10,621 INFO L276 IsEmpty]: Start isEmpty. Operand 2673 states and 4773 transitions. [2019-10-22 11:26:10,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-10-22 11:26:10,634 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:10,634 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:26:10,634 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:26:10,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:10,634 INFO L82 PathProgramCache]: Analyzing trace with hash -1065197571, now seen corresponding path program 1 times [2019-10-22 11:26:10,635 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:10,635 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997833617] [2019-10-22 11:26:10,635 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:10,635 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:10,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:10,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:10,714 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:26:10,715 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997833617] [2019-10-22 11:26:10,715 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:10,715 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-22 11:26:10,715 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729323563] [2019-10-22 11:26:10,716 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-22 11:26:10,716 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:10,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-22 11:26:10,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-22 11:26:10,717 INFO L87 Difference]: Start difference. First operand 2673 states and 4773 transitions. Second operand 8 states. [2019-10-22 11:26:10,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:10,955 INFO L93 Difference]: Finished difference Result 3032 states and 5351 transitions. [2019-10-22 11:26:10,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-22 11:26:10,955 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 85 [2019-10-22 11:26:10,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:10,964 INFO L225 Difference]: With dead ends: 3032 [2019-10-22 11:26:10,964 INFO L226 Difference]: Without dead ends: 2646 [2019-10-22 11:26:10,966 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2019-10-22 11:26:10,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2646 states. [2019-10-22 11:26:11,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2646 to 2613. [2019-10-22 11:26:11,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2613 states. [2019-10-22 11:26:11,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2613 states to 2613 states and 4663 transitions. [2019-10-22 11:26:11,078 INFO L78 Accepts]: Start accepts. Automaton has 2613 states and 4663 transitions. Word has length 85 [2019-10-22 11:26:11,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:11,079 INFO L462 AbstractCegarLoop]: Abstraction has 2613 states and 4663 transitions. [2019-10-22 11:26:11,079 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-22 11:26:11,079 INFO L276 IsEmpty]: Start isEmpty. Operand 2613 states and 4663 transitions. [2019-10-22 11:26:11,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-10-22 11:26:11,084 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:11,084 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:26:11,084 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:26:11,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:11,084 INFO L82 PathProgramCache]: Analyzing trace with hash -200799019, now seen corresponding path program 1 times [2019-10-22 11:26:11,084 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:11,084 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913975083] [2019-10-22 11:26:11,085 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:11,085 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:11,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:11,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:11,169 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:26:11,170 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913975083] [2019-10-22 11:26:11,170 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:11,170 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-22 11:26:11,170 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295572146] [2019-10-22 11:26:11,170 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-22 11:26:11,170 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:11,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-22 11:26:11,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-22 11:26:11,171 INFO L87 Difference]: Start difference. First operand 2613 states and 4663 transitions. Second operand 9 states. [2019-10-22 11:26:11,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:11,725 INFO L93 Difference]: Finished difference Result 2765 states and 4903 transitions. [2019-10-22 11:26:11,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-22 11:26:11,726 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 86 [2019-10-22 11:26:11,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:11,734 INFO L225 Difference]: With dead ends: 2765 [2019-10-22 11:26:11,734 INFO L226 Difference]: Without dead ends: 2643 [2019-10-22 11:26:11,735 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2019-10-22 11:26:11,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2643 states. [2019-10-22 11:26:11,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2643 to 2610. [2019-10-22 11:26:11,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2610 states. [2019-10-22 11:26:11,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2610 states to 2610 states and 4651 transitions. [2019-10-22 11:26:11,905 INFO L78 Accepts]: Start accepts. Automaton has 2610 states and 4651 transitions. Word has length 86 [2019-10-22 11:26:11,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:11,905 INFO L462 AbstractCegarLoop]: Abstraction has 2610 states and 4651 transitions. [2019-10-22 11:26:11,905 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-22 11:26:11,905 INFO L276 IsEmpty]: Start isEmpty. Operand 2610 states and 4651 transitions. [2019-10-22 11:26:11,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-10-22 11:26:11,910 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:11,910 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:26:11,911 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:26:11,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:11,911 INFO L82 PathProgramCache]: Analyzing trace with hash -356866571, now seen corresponding path program 1 times [2019-10-22 11:26:11,911 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:11,911 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155922905] [2019-10-22 11:26:11,911 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:11,912 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:11,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:11,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:11,952 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:26:11,952 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155922905] [2019-10-22 11:26:11,952 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:11,952 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:26:11,953 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790384173] [2019-10-22 11:26:11,953 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:26:11,953 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:11,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:26:11,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:26:11,954 INFO L87 Difference]: Start difference. First operand 2610 states and 4651 transitions. Second operand 4 states. [2019-10-22 11:26:12,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:12,149 INFO L93 Difference]: Finished difference Result 5240 states and 9325 transitions. [2019-10-22 11:26:12,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:26:12,150 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 86 [2019-10-22 11:26:12,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:12,162 INFO L225 Difference]: With dead ends: 5240 [2019-10-22 11:26:12,162 INFO L226 Difference]: Without dead ends: 3887 [2019-10-22 11:26:12,164 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:26:12,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3887 states. [2019-10-22 11:26:12,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3887 to 2597. [2019-10-22 11:26:12,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2597 states. [2019-10-22 11:26:12,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2597 states to 2597 states and 4634 transitions. [2019-10-22 11:26:12,287 INFO L78 Accepts]: Start accepts. Automaton has 2597 states and 4634 transitions. Word has length 86 [2019-10-22 11:26:12,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:12,287 INFO L462 AbstractCegarLoop]: Abstraction has 2597 states and 4634 transitions. [2019-10-22 11:26:12,287 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:26:12,288 INFO L276 IsEmpty]: Start isEmpty. Operand 2597 states and 4634 transitions. [2019-10-22 11:26:12,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-10-22 11:26:12,292 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:12,292 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:26:12,292 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:26:12,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:12,293 INFO L82 PathProgramCache]: Analyzing trace with hash 1071985214, now seen corresponding path program 1 times [2019-10-22 11:26:12,293 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:12,293 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101168488] [2019-10-22 11:26:12,293 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:12,293 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:12,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:12,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:12,350 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:26:12,350 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101168488] [2019-10-22 11:26:12,350 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:12,350 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:26:12,350 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143315192] [2019-10-22 11:26:12,351 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:26:12,351 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:12,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:26:12,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:26:12,351 INFO L87 Difference]: Start difference. First operand 2597 states and 4634 transitions. Second operand 5 states. [2019-10-22 11:26:12,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:12,455 INFO L93 Difference]: Finished difference Result 2597 states and 4634 transitions. [2019-10-22 11:26:12,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:26:12,455 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 88 [2019-10-22 11:26:12,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:12,456 INFO L225 Difference]: With dead ends: 2597 [2019-10-22 11:26:12,456 INFO L226 Difference]: Without dead ends: 0 [2019-10-22 11:26:12,458 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:26:12,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-22 11:26:12,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-22 11:26:12,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-22 11:26:12,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-22 11:26:12,459 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 88 [2019-10-22 11:26:12,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:12,459 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 11:26:12,459 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:26:12,459 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-22 11:26:12,459 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-22 11:26:12,463 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-22 11:26:13,145 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 123 [2019-10-22 11:26:13,772 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 149 [2019-10-22 11:26:14,453 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 151 [2019-10-22 11:26:14,873 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 147 [2019-10-22 11:26:15,824 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 23 [2019-10-22 11:26:15,945 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 23 [2019-10-22 11:26:16,061 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 23 [2019-10-22 11:26:16,163 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 23 [2019-10-22 11:26:16,470 WARN L191 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 40 [2019-10-22 11:26:17,117 WARN L191 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 42 [2019-10-22 11:26:17,915 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 40 [2019-10-22 11:26:18,177 WARN L191 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 43 [2019-10-22 11:26:18,787 WARN L191 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 45 [2019-10-22 11:26:19,441 WARN L191 SmtUtils]: Spent 379.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 45 [2019-10-22 11:26:19,847 WARN L191 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 40 [2019-10-22 11:26:20,371 WARN L191 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 45 [2019-10-22 11:26:20,739 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 33 [2019-10-22 11:26:21,068 WARN L191 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 47 [2019-10-22 11:26:21,328 WARN L191 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 42 [2019-10-22 11:26:21,721 WARN L191 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 44 [2019-10-22 11:26:21,951 WARN L191 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 40 [2019-10-22 11:26:22,523 WARN L191 SmtUtils]: Spent 361.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 45 [2019-10-22 11:26:22,820 WARN L191 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 45 [2019-10-22 11:26:23,096 WARN L191 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 42 [2019-10-22 11:26:23,506 WARN L191 SmtUtils]: Spent 408.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 45 [2019-10-22 11:26:23,975 WARN L191 SmtUtils]: Spent 383.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 45 [2019-10-22 11:26:24,527 WARN L191 SmtUtils]: Spent 386.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 45 [2019-10-22 11:26:24,629 INFO L443 ceAbstractionStarter]: For program point L2414(lines 2414 2430) no Hoare annotation was computed. [2019-10-22 11:26:24,629 INFO L443 ceAbstractionStarter]: For program point L2348(lines 2348 2352) no Hoare annotation was computed. [2019-10-22 11:26:24,630 INFO L443 ceAbstractionStarter]: For program point L2348-3(lines 2348 2352) no Hoare annotation was computed. [2019-10-22 11:26:24,630 INFO L443 ceAbstractionStarter]: For program point L2348-6(lines 2348 2352) no Hoare annotation was computed. [2019-10-22 11:26:24,630 INFO L443 ceAbstractionStarter]: For program point L2348-9(lines 2348 2352) no Hoare annotation was computed. [2019-10-22 11:26:24,630 INFO L443 ceAbstractionStarter]: For program point L2348-12(lines 2348 2352) no Hoare annotation was computed. [2019-10-22 11:26:24,630 INFO L439 ceAbstractionStarter]: At program point L631(lines 618 636) the Hoare annotation is: false [2019-10-22 11:26:24,630 INFO L439 ceAbstractionStarter]: At program point L631-1(lines 618 636) the Hoare annotation is: (and (= 1 ULTIMATE.start_outgoing__wrappee__Keys_~msg) (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 1 ~queue_empty~0) (= 1 ULTIMATE.start_getEmailTo_~handle) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= 2 ULTIMATE.start_incoming_~client) (not (= ULTIMATE.start_setClientId_~handle 2)) (= 1 ULTIMATE.start_setEmailTo_~handle) (= 0 ~in_encrypted~0) (= ULTIMATE.start_setEmailTo_~value 2) (not (= 1 ULTIMATE.start_setup_chuck_~chuck___0)) (= 1 ULTIMATE.start_outgoing_~msg) (= ~__ste_email_to0~0 2) (= ULTIMATE.start_mail_~msg 1) (= 2 |ULTIMATE.start_getEmailTo_#res|) (= |ULTIMATE.start_createEmail_#res| 1) (= 2 ULTIMATE.start_createEmail_~to) (= 1 ULTIMATE.start_createEmail_~msg~0) (= ~rjh~0 2)) [2019-10-22 11:26:24,630 INFO L439 ceAbstractionStarter]: At program point L631-2(lines 618 636) the Hoare annotation is: (and (= 1 ULTIMATE.start_outgoing__wrappee__Keys_~msg) (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 1 ~queue_empty~0) (= 1 ULTIMATE.start_getEmailTo_~handle) (= ULTIMATE.start_getClientPrivateKey_~handle 2) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= 2 ULTIMATE.start_incoming_~client) (not (= ULTIMATE.start_setClientId_~handle 2)) (= 1 ULTIMATE.start_setEmailTo_~handle) (= ULTIMATE.start_setEmailTo_~value 2) (not (= 1 ULTIMATE.start_setup_chuck_~chuck___0)) (= 1 ULTIMATE.start_outgoing_~msg) (= ~__ste_email_to0~0 2) (= ULTIMATE.start_mail_~msg 1) (= 2 |ULTIMATE.start_getEmailTo_#res|) (= |ULTIMATE.start_createEmail_#res| 1) (= 2 ULTIMATE.start_createEmail_~to) (= 1 ULTIMATE.start_createEmail_~msg~0) (= ~rjh~0 2)) [2019-10-22 11:26:24,630 INFO L443 ceAbstractionStarter]: For program point L2613(lines 2613 2625) no Hoare annotation was computed. [2019-10-22 11:26:24,631 INFO L439 ceAbstractionStarter]: At program point L1556(lines 1545 1559) 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)) (= 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) (= |ULTIMATE.start_createEmail_#res| 1) (= 2 ULTIMATE.start_createEmail_~to) (= 1 ULTIMATE.start_createEmail_~msg~0) (= ~rjh~0 2)) [2019-10-22 11:26:24,631 INFO L439 ceAbstractionStarter]: At program point L631-3(lines 618 636) the Hoare annotation is: false [2019-10-22 11:26:24,631 INFO L446 ceAbstractionStarter]: At program point L631-4(lines 618 636) the Hoare annotation is: true [2019-10-22 11:26:24,631 INFO L443 ceAbstractionStarter]: For program point L2613-2(lines 2613 2625) no Hoare annotation was computed. [2019-10-22 11:26:24,631 INFO L446 ceAbstractionStarter]: At program point L631-5(lines 618 636) the Hoare annotation is: true [2019-10-22 11:26:24,631 INFO L443 ceAbstractionStarter]: For program point L2613-4(lines 2613 2625) no Hoare annotation was computed. [2019-10-22 11:26:24,631 INFO L443 ceAbstractionStarter]: For program point L2415(lines 2415 2426) no Hoare annotation was computed. [2019-10-22 11:26:24,631 INFO L443 ceAbstractionStarter]: For program point L2812(lines 2812 2819) no Hoare annotation was computed. [2019-10-22 11:26:24,631 INFO L439 ceAbstractionStarter]: At program point L2812-1(lines 2669 2833) 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)) (= 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:26:24,631 INFO L443 ceAbstractionStarter]: For program point L2284(lines 2284 2290) no Hoare annotation was computed. [2019-10-22 11:26:24,631 INFO L443 ceAbstractionStarter]: For program point L2681(lines 2681 2688) no Hoare annotation was computed. [2019-10-22 11:26:24,632 INFO L439 ceAbstractionStarter]: At program point L2483-1(lines 2436 2489) the Hoare annotation is: false [2019-10-22 11:26:24,632 INFO L439 ceAbstractionStarter]: At program point L2483(lines 2436 2489) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 1 ~queue_empty~0) (= 1 ULTIMATE.start_getEmailTo_~handle) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (not (= ULTIMATE.start_setClientId_~handle 2)) (= 1 ULTIMATE.start_setEmailTo_~handle) (= 0 ~in_encrypted~0) (= ULTIMATE.start_setEmailTo_~value 2) (not (= 1 ULTIMATE.start_setup_chuck_~chuck___0)) (= 1 ULTIMATE.start_outgoing_~msg) (= ~__ste_email_to0~0 2) (= 2 |ULTIMATE.start_getEmailTo_#res|) (= |ULTIMATE.start_createEmail_#res| 1) (= 2 ULTIMATE.start_createEmail_~to) (= 1 ULTIMATE.start_createEmail_~msg~0) (= ~rjh~0 2)) [2019-10-22 11:26:24,632 INFO L443 ceAbstractionStarter]: For program point L369(lines 369 379) no Hoare annotation was computed. [2019-10-22 11:26:24,632 INFO L443 ceAbstractionStarter]: For program point L369-1(lines 369 379) no Hoare annotation was computed. [2019-10-22 11:26:24,632 INFO L443 ceAbstractionStarter]: For program point L2748(lines 2748 2752) no Hoare annotation was computed. [2019-10-22 11:26:24,632 INFO L443 ceAbstractionStarter]: For program point L2616(lines 2616 2624) no Hoare annotation was computed. [2019-10-22 11:26:24,632 INFO L443 ceAbstractionStarter]: For program point L2616-2(lines 2616 2624) no Hoare annotation was computed. [2019-10-22 11:26:24,632 INFO L443 ceAbstractionStarter]: For program point L2616-4(lines 2616 2624) no Hoare annotation was computed. [2019-10-22 11:26:24,632 INFO L439 ceAbstractionStarter]: At program point L238(lines 310 322) the Hoare annotation is: (and (= 1 ULTIMATE.start_outgoing__wrappee__Keys_~msg) (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 1 ~queue_empty~0) (= 1 ULTIMATE.start_getEmailTo_~handle) (= ULTIMATE.start_getClientPrivateKey_~handle 2) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= 2 ULTIMATE.start_incoming_~client) (not (= ULTIMATE.start_setClientId_~handle 2)) (= 1 ULTIMATE.start_setEmailTo_~handle) (= ULTIMATE.start_setEmailTo_~value 2) (not (= 1 ULTIMATE.start_setup_chuck_~chuck___0)) (= 1 ULTIMATE.start_outgoing_~msg) (= ~__ste_email_to0~0 2) (= ULTIMATE.start_mail_~msg 1) (= 2 |ULTIMATE.start_getEmailTo_#res|) (= |ULTIMATE.start_createEmail_#res| 1) (= 2 ULTIMATE.start_createEmail_~to) (= 1 ULTIMATE.start_createEmail_~msg~0) (= ~rjh~0 2)) [2019-10-22 11:26:24,633 INFO L443 ceAbstractionStarter]: For program point L2154(lines 2154 2170) no Hoare annotation was computed. [2019-10-22 11:26:24,633 INFO L443 ceAbstractionStarter]: For program point L2154-1(lines 2154 2170) no Hoare annotation was computed. [2019-10-22 11:26:24,633 INFO L443 ceAbstractionStarter]: For program point L2419(lines 2419 2425) no Hoare annotation was computed. [2019-10-22 11:26:24,633 INFO L446 ceAbstractionStarter]: At program point L966(lines 948 968) the Hoare annotation is: true [2019-10-22 11:26:24,633 INFO L443 ceAbstractionStarter]: For program point L2619(lines 2619 2623) no Hoare annotation was computed. [2019-10-22 11:26:24,633 INFO L443 ceAbstractionStarter]: For program point L2619-3(lines 2619 2623) no Hoare annotation was computed. [2019-10-22 11:26:24,633 INFO L439 ceAbstractionStarter]: At program point L2619-2(lines 1 2841) 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)) (= 0 ~in_encrypted~0) (= 0 ~__ste_Client_Keyring0_User0~0) (not (= ~__ste_email_to0~0 1))) [2019-10-22 11:26:24,634 INFO L439 ceAbstractionStarter]: At program point L2619-5(lines 1 2841) the Hoare annotation is: (and (= ~__ste_Client_Keyring0_User0~0 ~__ste_Client_Keyring0_User1~0) (= 1 ~queue_empty~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:26:24,634 INFO L443 ceAbstractionStarter]: For program point L373(lines 373 378) no Hoare annotation was computed. [2019-10-22 11:26:24,634 INFO L443 ceAbstractionStarter]: For program point L2619-6(lines 2619 2623) no Hoare annotation was computed. [2019-10-22 11:26:24,634 INFO L443 ceAbstractionStarter]: For program point L373-1(lines 373 378) no Hoare annotation was computed. [2019-10-22 11:26:24,634 INFO L439 ceAbstractionStarter]: At program point L2355-1(lines 2329 2372) 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) (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:26:24,634 INFO L439 ceAbstractionStarter]: At program point L2619-8(lines 1 2841) 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) (= 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:26:24,634 INFO L443 ceAbstractionStarter]: For program point L2355(lines 2355 2367) no Hoare annotation was computed. [2019-10-22 11:26:24,635 INFO L439 ceAbstractionStarter]: At program point L2355-3(lines 2329 2372) 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)) (= 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:26:24,635 INFO L443 ceAbstractionStarter]: For program point L2355-2(lines 2355 2367) no Hoare annotation was computed. [2019-10-22 11:26:24,635 INFO L439 ceAbstractionStarter]: At program point L2355-5(lines 2329 2372) 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)) (= 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:26:24,635 INFO L443 ceAbstractionStarter]: For program point L2355-4(lines 2355 2367) no Hoare annotation was computed. [2019-10-22 11:26:24,635 INFO L439 ceAbstractionStarter]: At program point L2355-7(lines 2329 2372) 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)) (= 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:26:24,635 INFO L443 ceAbstractionStarter]: For program point L2355-6(lines 2355 2367) no Hoare annotation was computed. [2019-10-22 11:26:24,635 INFO L439 ceAbstractionStarter]: At program point L2355-9(lines 2329 2372) 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)) (= 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:26:24,635 INFO L443 ceAbstractionStarter]: For program point L2355-8(lines 2355 2367) no Hoare annotation was computed. [2019-10-22 11:26:24,635 INFO L443 ceAbstractionStarter]: For program point L902(lines 902 910) no Hoare annotation was computed. [2019-10-22 11:26:24,635 INFO L443 ceAbstractionStarter]: For program point L2356(lines 2356 2364) no Hoare annotation was computed. [2019-10-22 11:26:24,635 INFO L443 ceAbstractionStarter]: For program point L2356-2(lines 2356 2364) no Hoare annotation was computed. [2019-10-22 11:26:24,635 INFO L443 ceAbstractionStarter]: For program point L2356-4(lines 2356 2364) no Hoare annotation was computed. [2019-10-22 11:26:24,635 INFO L443 ceAbstractionStarter]: For program point L2356-6(lines 2356 2364) no Hoare annotation was computed. [2019-10-22 11:26:24,635 INFO L443 ceAbstractionStarter]: For program point L2158(lines 2158 2169) no Hoare annotation was computed. [2019-10-22 11:26:24,635 INFO L443 ceAbstractionStarter]: For program point L2356-8(lines 2356 2364) no Hoare annotation was computed. [2019-10-22 11:26:24,635 INFO L443 ceAbstractionStarter]: For program point L2158-1(lines 2158 2169) no Hoare annotation was computed. [2019-10-22 11:26:24,635 INFO L443 ceAbstractionStarter]: For program point L507(lines 507 518) no Hoare annotation was computed. [2019-10-22 11:26:24,635 INFO L443 ceAbstractionStarter]: For program point L507-1(lines 507 518) no Hoare annotation was computed. [2019-10-22 11:26:24,635 INFO L443 ceAbstractionStarter]: For program point L507-2(lines 507 518) no Hoare annotation was computed. [2019-10-22 11:26:24,635 INFO L443 ceAbstractionStarter]: For program point L507-3(lines 507 518) no Hoare annotation was computed. [2019-10-22 11:26:24,636 INFO L443 ceAbstractionStarter]: For program point L2225(lines 2225 2237) no Hoare annotation was computed. [2019-10-22 11:26:24,636 INFO L443 ceAbstractionStarter]: For program point L2225-2(lines 2225 2237) no Hoare annotation was computed. [2019-10-22 11:26:24,636 INFO L443 ceAbstractionStarter]: For program point L2225-4(lines 2225 2237) no Hoare annotation was computed. [2019-10-22 11:26:24,636 INFO L443 ceAbstractionStarter]: For program point L2225-6(lines 2225 2237) no Hoare annotation was computed. [2019-10-22 11:26:24,636 INFO L443 ceAbstractionStarter]: For program point L2225-8(lines 2225 2237) no Hoare annotation was computed. [2019-10-22 11:26:24,636 INFO L439 ceAbstractionStarter]: At program point L2754(lines 2744 2827) 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)) (= 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:26:24,636 INFO L443 ceAbstractionStarter]: For program point L641(lines 641 649) no Hoare annotation was computed. [2019-10-22 11:26:24,636 INFO L443 ceAbstractionStarter]: For program point L641-2(lines 641 649) no Hoare annotation was computed. [2019-10-22 11:26:24,636 INFO L443 ceAbstractionStarter]: For program point L641-4(lines 641 649) no Hoare annotation was computed. [2019-10-22 11:26:24,636 INFO L443 ceAbstractionStarter]: For program point L641-6(lines 641 649) no Hoare annotation was computed. [2019-10-22 11:26:24,636 INFO L443 ceAbstractionStarter]: For program point L2359(lines 2359 2363) no Hoare annotation was computed. [2019-10-22 11:26:24,636 INFO L443 ceAbstractionStarter]: For program point L2359-3(lines 2359 2363) no Hoare annotation was computed. [2019-10-22 11:26:24,636 INFO L443 ceAbstractionStarter]: For program point L2293(lines 2293 2324) no Hoare annotation was computed. [2019-10-22 11:26:24,636 INFO L443 ceAbstractionStarter]: For program point L2359-6(lines 2359 2363) no Hoare annotation was computed. [2019-10-22 11:26:24,636 INFO L443 ceAbstractionStarter]: For program point L2359-9(lines 2359 2363) no Hoare annotation was computed. [2019-10-22 11:26:24,636 INFO L443 ceAbstractionStarter]: For program point L2359-12(lines 2359 2363) no Hoare annotation was computed. [2019-10-22 11:26:24,636 INFO L439 ceAbstractionStarter]: At program point L2690(lines 2677 2832) 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)) (= 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:26:24,636 INFO L443 ceAbstractionStarter]: For program point L2294(lines 2294 2305) no Hoare annotation was computed. [2019-10-22 11:26:24,636 INFO L443 ceAbstractionStarter]: For program point L2228(lines 2228 2236) no Hoare annotation was computed. [2019-10-22 11:26:24,636 INFO L443 ceAbstractionStarter]: For program point L2228-2(lines 2228 2236) no Hoare annotation was computed. [2019-10-22 11:26:24,636 INFO L443 ceAbstractionStarter]: For program point L2162(lines 2162 2168) no Hoare annotation was computed. [2019-10-22 11:26:24,637 INFO L443 ceAbstractionStarter]: For program point L2228-4(lines 2228 2236) no Hoare annotation was computed. [2019-10-22 11:26:24,637 INFO L443 ceAbstractionStarter]: For program point L2162-1(lines 2162 2168) no Hoare annotation was computed. [2019-10-22 11:26:24,637 INFO L443 ceAbstractionStarter]: For program point L2228-6(lines 2228 2236) no Hoare annotation was computed. [2019-10-22 11:26:24,637 INFO L443 ceAbstractionStarter]: For program point L2228-8(lines 2228 2236) no Hoare annotation was computed. [2019-10-22 11:26:24,637 INFO L443 ceAbstractionStarter]: For program point L511(lines 511 517) no Hoare annotation was computed. [2019-10-22 11:26:24,637 INFO L443 ceAbstractionStarter]: For program point L511-1(lines 511 517) no Hoare annotation was computed. [2019-10-22 11:26:24,637 INFO L443 ceAbstractionStarter]: For program point L511-2(lines 511 517) no Hoare annotation was computed. [2019-10-22 11:26:24,637 INFO L443 ceAbstractionStarter]: For program point L511-3(lines 511 517) no Hoare annotation was computed. [2019-10-22 11:26:24,637 INFO L443 ceAbstractionStarter]: For program point L644(lines 644 648) no Hoare annotation was computed. [2019-10-22 11:26:24,637 INFO L443 ceAbstractionStarter]: For program point L644-3(lines 644 648) no Hoare annotation was computed. [2019-10-22 11:26:24,637 INFO L443 ceAbstractionStarter]: For program point L2494(lines 2494 2530) no Hoare annotation was computed. [2019-10-22 11:26:24,638 INFO L439 ceAbstractionStarter]: At program point L644-5(lines 637 652) the Hoare annotation is: (and (= 1 ULTIMATE.start_outgoing__wrappee__Keys_~msg) (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 1 ~queue_empty~0) (= 1 ULTIMATE.start_getEmailTo_~handle) (= ULTIMATE.start_getClientPrivateKey_~handle 2) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= 2 ULTIMATE.start_incoming_~client) (not (= ULTIMATE.start_setClientId_~handle 2)) (= 1 ULTIMATE.start_setEmailTo_~handle) (= ULTIMATE.start_setEmailTo_~value 2) (not (= 1 ULTIMATE.start_setup_chuck_~chuck___0)) (= 1 ULTIMATE.start_outgoing_~msg) (= ~__ste_email_to0~0 2) (= ULTIMATE.start_mail_~msg 1) (= 2 |ULTIMATE.start_getEmailTo_#res|) (= |ULTIMATE.start_createEmail_#res| 1) (= 2 ULTIMATE.start_createEmail_~to) (= 1 ULTIMATE.start_createEmail_~msg~0) (= ~rjh~0 2)) [2019-10-22 11:26:24,638 INFO L443 ceAbstractionStarter]: For program point L644-6(lines 644 648) no Hoare annotation was computed. [2019-10-22 11:26:24,638 INFO L443 ceAbstractionStarter]: For program point L2494-2(lines 2494 2530) no Hoare annotation was computed. [2019-10-22 11:26:24,638 INFO L443 ceAbstractionStarter]: For program point L2494-1(lines 2494 2530) no Hoare annotation was computed. [2019-10-22 11:26:24,638 INFO L443 ceAbstractionStarter]: For program point L2494-4(lines 2494 2530) no Hoare annotation was computed. [2019-10-22 11:26:24,638 INFO L443 ceAbstractionStarter]: For program point L644-9(lines 644 648) no Hoare annotation was computed. [2019-10-22 11:26:24,638 INFO L443 ceAbstractionStarter]: For program point L2494-3(lines 2494 2530) no Hoare annotation was computed. [2019-10-22 11:26:24,638 INFO L446 ceAbstractionStarter]: At program point L644-11(lines 637 652) the Hoare annotation is: true [2019-10-22 11:26:24,639 INFO L443 ceAbstractionStarter]: For program point L2759(lines 2759 2766) no Hoare annotation was computed. [2019-10-22 11:26:24,639 INFO L443 ceAbstractionStarter]: For program point L2495(lines 2495 2503) no Hoare annotation was computed. [2019-10-22 11:26:24,639 INFO L439 ceAbstractionStarter]: At program point L381(lines 360 384) the Hoare annotation is: (and (= 1 ULTIMATE.start_outgoing__wrappee__Keys_~msg) (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 1 ~queue_empty~0) (= 1 ULTIMATE.start_getEmailTo_~handle) (= ULTIMATE.start_getClientPrivateKey_~handle 2) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= 2 ULTIMATE.start_incoming_~client) (not (= ULTIMATE.start_setClientId_~handle 2)) (= 1 ULTIMATE.start_setEmailTo_~handle) (= ULTIMATE.start_setEmailTo_~value 2) (not (= 1 ULTIMATE.start_setup_chuck_~chuck___0)) (= 1 ULTIMATE.start_outgoing_~msg) (= ~__ste_email_to0~0 2) (= ULTIMATE.start_mail_~msg 1) (= 2 |ULTIMATE.start_getEmailTo_#res|) (= |ULTIMATE.start_createEmail_#res| 1) (= 2 ULTIMATE.start_createEmail_~to) (= 1 ULTIMATE.start_createEmail_~msg~0) (= ~rjh~0 2)) [2019-10-22 11:26:24,639 INFO L439 ceAbstractionStarter]: At program point L2429(lines 2382 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) (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:26:24,639 INFO L443 ceAbstractionStarter]: For program point L2495-2(lines 2495 2503) no Hoare annotation was computed. [2019-10-22 11:26:24,639 INFO L446 ceAbstractionStarter]: At program point L381-1(lines 360 384) the Hoare annotation is: true [2019-10-22 11:26:24,639 INFO L443 ceAbstractionStarter]: For program point L2495-4(lines 2495 2503) no Hoare annotation was computed. [2019-10-22 11:26:24,639 INFO L443 ceAbstractionStarter]: For program point L2495-6(lines 2495 2503) no Hoare annotation was computed. [2019-10-22 11:26:24,639 INFO L443 ceAbstractionStarter]: For program point L2231(lines 2231 2235) no Hoare annotation was computed. [2019-10-22 11:26:24,639 INFO L443 ceAbstractionStarter]: For program point L2495-8(lines 2495 2503) no Hoare annotation was computed. [2019-10-22 11:26:24,639 INFO L443 ceAbstractionStarter]: For program point L2231-3(lines 2231 2235) no Hoare annotation was computed. [2019-10-22 11:26:24,640 INFO L439 ceAbstractionStarter]: At program point L2231-2(lines 2221 2240) 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) (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:26:24,640 INFO L439 ceAbstractionStarter]: At program point L2231-5(lines 2221 2240) 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)) (= 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:26:24,640 INFO L443 ceAbstractionStarter]: For program point L2231-6(lines 2231 2235) no Hoare annotation was computed. [2019-10-22 11:26:24,640 INFO L443 ceAbstractionStarter]: For program point L2231-9(lines 2231 2235) no Hoare annotation was computed. [2019-10-22 11:26:24,640 INFO L439 ceAbstractionStarter]: At program point L2231-8(lines 2221 2240) 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)) (= 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:26:24,640 INFO L439 ceAbstractionStarter]: At program point L2231-11(lines 2221 2240) 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)) (= 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:26:24,640 INFO L443 ceAbstractionStarter]: For program point L2231-12(lines 2231 2235) no Hoare annotation was computed. [2019-10-22 11:26:24,640 INFO L439 ceAbstractionStarter]: At program point L2231-14(lines 2221 2240) 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)) (= 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:26:24,641 INFO L443 ceAbstractionStarter]: For program point L2298(lines 2298 2304) no Hoare annotation was computed. [2019-10-22 11:26:24,641 INFO L443 ceAbstractionStarter]: For program point L2695(lines 2695 2699) no Hoare annotation was computed. [2019-10-22 11:26:24,641 INFO L446 ceAbstractionStarter]: At program point L2167-1(lines 2150 2173) the Hoare annotation is: true [2019-10-22 11:26:24,641 INFO L439 ceAbstractionStarter]: At program point L2167(lines 2150 2173) the Hoare annotation is: (and (= 1 ULTIMATE.start_outgoing__wrappee__Keys_~msg) (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 1 ~queue_empty~0) (= 1 ULTIMATE.start_getEmailTo_~handle) (= ULTIMATE.start_getClientPrivateKey_~handle 2) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (not (= ULTIMATE.start_setClientId_~handle 2)) (= 2 ULTIMATE.start_incoming_~client) (= 1 ULTIMATE.start_setEmailTo_~handle) (= ULTIMATE.start_setEmailTo_~value 2) (not (= 1 ULTIMATE.start_setup_chuck_~chuck___0)) (= 1 ULTIMATE.start_outgoing_~msg) (= ~__ste_email_to0~0 2) (= ULTIMATE.start_mail_~msg 1) (= 2 |ULTIMATE.start_getEmailTo_#res|) (= |ULTIMATE.start_createEmail_#res| 1) (= 2 ULTIMATE.start_createEmail_~to) (= 1 ULTIMATE.start_createEmail_~msg~0) (= ~rjh~0 2)) [2019-10-22 11:26:24,641 INFO L439 ceAbstractionStarter]: At program point L516(lines 503 521) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 1 ~queue_empty~0) (= 1 ULTIMATE.start_getEmailTo_~handle) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (not (= ULTIMATE.start_setClientId_~handle 2)) (= 1 ULTIMATE.start_setEmailTo_~handle) (= 0 ~in_encrypted~0) (= ULTIMATE.start_setEmailTo_~value 2) (not (= 1 ULTIMATE.start_setup_chuck_~chuck___0)) (= 1 ULTIMATE.start_outgoing_~msg) (= ~__ste_email_to0~0 2) (= 2 |ULTIMATE.start_getEmailTo_#res|) (= |ULTIMATE.start_createEmail_#res| 1) (= 2 ULTIMATE.start_createEmail_~to) (= 1 ULTIMATE.start_createEmail_~msg~0) (= ~rjh~0 2)) [2019-10-22 11:26:24,642 INFO L443 ceAbstractionStarter]: For program point L2498(lines 2498 2502) no Hoare annotation was computed. [2019-10-22 11:26:24,642 INFO L439 ceAbstractionStarter]: At program point L516-1(lines 503 521) the Hoare annotation is: (and (= 1 ULTIMATE.start_outgoing__wrappee__Keys_~msg) (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 1 ULTIMATE.start_getEmailTo_~handle) (= 1 ~queue_empty~0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (not (= ULTIMATE.start_setClientId_~handle 2)) (= 1 ULTIMATE.start_setEmailTo_~handle) (= 0 ~in_encrypted~0) (= ULTIMATE.start_setEmailTo_~value 2) (not (= 1 ULTIMATE.start_setup_chuck_~chuck___0)) (= 1 ULTIMATE.start_outgoing_~msg) (= ~__ste_email_to0~0 2) (= ULTIMATE.start_mail_~msg 1) (= 2 |ULTIMATE.start_getEmailTo_#res|) (= |ULTIMATE.start_createEmail_#res| 1) (= 2 ULTIMATE.start_createEmail_~to) (= 1 ULTIMATE.start_createEmail_~msg~0) (= ~rjh~0 2)) [2019-10-22 11:26:24,642 INFO L439 ceAbstractionStarter]: At program point L516-2(lines 503 521) the Hoare annotation is: false [2019-10-22 11:26:24,642 INFO L446 ceAbstractionStarter]: At program point L516-3(lines 503 521) the Hoare annotation is: true [2019-10-22 11:26:24,642 INFO L443 ceAbstractionStarter]: For program point L2498-3(lines 2498 2502) no Hoare annotation was computed. [2019-10-22 11:26:24,642 INFO L443 ceAbstractionStarter]: For program point L2498-6(lines 2498 2502) no Hoare annotation was computed. [2019-10-22 11:26:24,642 INFO L443 ceAbstractionStarter]: For program point L2498-9(lines 2498 2502) no Hoare annotation was computed. [2019-10-22 11:26:24,642 INFO L443 ceAbstractionStarter]: For program point L2498-12(lines 2498 2502) no Hoare annotation was computed. [2019-10-22 11:26:24,642 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-22 11:26:24,643 INFO L439 ceAbstractionStarter]: At program point L2701(lines 2691 2831) 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)) (= 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:26:24,643 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 1452) no Hoare annotation was computed. [2019-10-22 11:26:24,643 INFO L439 ceAbstractionStarter]: At program point L2834(lines 2668 2835) 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)) (= 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:26:24,643 INFO L439 ceAbstractionStarter]: At program point L2768(lines 2755 2826) 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)) (= 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:26:24,643 INFO L443 ceAbstractionStarter]: For program point L2505-1(lines 2505 2529) no Hoare annotation was computed. [2019-10-22 11:26:24,643 INFO L443 ceAbstractionStarter]: For program point L2505(lines 2505 2529) no Hoare annotation was computed. [2019-10-22 11:26:24,643 INFO L443 ceAbstractionStarter]: For program point L2505-3(lines 2505 2529) no Hoare annotation was computed. [2019-10-22 11:26:24,643 INFO L443 ceAbstractionStarter]: For program point L2505-2(lines 2505 2529) no Hoare annotation was computed. [2019-10-22 11:26:24,644 INFO L443 ceAbstractionStarter]: For program point L2505-4(lines 2505 2529) no Hoare annotation was computed. [2019-10-22 11:26:24,644 INFO L443 ceAbstractionStarter]: For program point L2307(lines 2307 2323) no Hoare annotation was computed. [2019-10-22 11:26:24,644 INFO L443 ceAbstractionStarter]: For program point L2506(lines 2506 2514) no Hoare annotation was computed. [2019-10-22 11:26:24,644 INFO L443 ceAbstractionStarter]: For program point L2506-2(lines 2506 2514) no Hoare annotation was computed. [2019-10-22 11:26:24,644 INFO L443 ceAbstractionStarter]: For program point L2440(lines 2440 2486) no Hoare annotation was computed. [2019-10-22 11:26:24,644 INFO L443 ceAbstractionStarter]: For program point L2506-4(lines 2506 2514) no Hoare annotation was computed. [2019-10-22 11:26:24,644 INFO L443 ceAbstractionStarter]: For program point L2440-1(lines 2440 2486) no Hoare annotation was computed. [2019-10-22 11:26:24,644 INFO L443 ceAbstractionStarter]: For program point L2308(lines 2308 2319) no Hoare annotation was computed. [2019-10-22 11:26:24,644 INFO L443 ceAbstractionStarter]: For program point L2506-6(lines 2506 2514) no Hoare annotation was computed. [2019-10-22 11:26:24,644 INFO L443 ceAbstractionStarter]: For program point L2506-8(lines 2506 2514) no Hoare annotation was computed. [2019-10-22 11:26:24,644 INFO L443 ceAbstractionStarter]: For program point L2441-1(lines 2441 2452) no Hoare annotation was computed. [2019-10-22 11:26:24,644 INFO L443 ceAbstractionStarter]: For program point L2441(lines 2441 2452) no Hoare annotation was computed. [2019-10-22 11:26:24,645 INFO L439 ceAbstractionStarter]: At program point L988(lines 969 990) 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) (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:26:24,645 INFO L443 ceAbstractionStarter]: For program point L2706(lines 2706 2713) no Hoare annotation was computed. [2019-10-22 11:26:24,645 INFO L443 ceAbstractionStarter]: For program point L526(lines 526 534) no Hoare annotation was computed. [2019-10-22 11:26:24,645 INFO L443 ceAbstractionStarter]: For program point L2178(lines 2178 2190) no Hoare annotation was computed. [2019-10-22 11:26:24,645 INFO L443 ceAbstractionStarter]: For program point L2178-2(lines 2178 2190) no Hoare annotation was computed. [2019-10-22 11:26:24,645 INFO L443 ceAbstractionStarter]: For program point L2178-4(lines 2178 2190) no Hoare annotation was computed. [2019-10-22 11:26:24,645 INFO L443 ceAbstractionStarter]: For program point L2178-6(lines 2178 2190) no Hoare annotation was computed. [2019-10-22 11:26:24,646 INFO L443 ceAbstractionStarter]: For program point L2178-8(lines 2178 2190) no Hoare annotation was computed. [2019-10-22 11:26:24,646 INFO L443 ceAbstractionStarter]: For program point L2178-10(lines 2178 2190) no Hoare annotation was computed. [2019-10-22 11:26:24,646 INFO L443 ceAbstractionStarter]: For program point L2773(lines 2773 2777) no Hoare annotation was computed. [2019-10-22 11:26:24,646 INFO L443 ceAbstractionStarter]: For program point L659(lines 659 670) no Hoare annotation was computed. [2019-10-22 11:26:24,646 INFO L443 ceAbstractionStarter]: For program point L659-1(lines 659 670) no Hoare annotation was computed. [2019-10-22 11:26:24,646 INFO L443 ceAbstractionStarter]: For program point L2509(lines 2509 2513) no Hoare annotation was computed. [2019-10-22 11:26:24,646 INFO L443 ceAbstractionStarter]: For program point L1452(line 1452) no Hoare annotation was computed. [2019-10-22 11:26:24,646 INFO L443 ceAbstractionStarter]: For program point L2509-3(lines 2509 2513) no Hoare annotation was computed. [2019-10-22 11:26:24,647 INFO L443 ceAbstractionStarter]: For program point L1452-1(line 1452) no Hoare annotation was computed. [2019-10-22 11:26:24,647 INFO L443 ceAbstractionStarter]: For program point L2509-6(lines 2509 2513) no Hoare annotation was computed. [2019-10-22 11:26:24,647 INFO L443 ceAbstractionStarter]: For program point L2509-9(lines 2509 2513) no Hoare annotation was computed. [2019-10-22 11:26:24,647 INFO L439 ceAbstractionStarter]: At program point L65(lines 55 67) the Hoare annotation is: (and (= 1 ULTIMATE.start_outgoing__wrappee__Keys_~msg) (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 1 ULTIMATE.start_getEmailTo_~handle) (= 1 ~queue_empty~0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= 2 ULTIMATE.start_incoming_~client) (not (= ULTIMATE.start_setClientId_~handle 2)) (= 1 ULTIMATE.start_setEmailTo_~handle) (= ULTIMATE.start_setEmailTo_~value 2) (not (= 1 ULTIMATE.start_setup_chuck_~chuck___0)) (= 1 ULTIMATE.start_outgoing_~msg) (= ~__ste_email_to0~0 2) (= ULTIMATE.start_mail_~msg 1) (= 2 |ULTIMATE.start_getEmailTo_#res|) (= |ULTIMATE.start_createEmail_#res| 1) (= 2 ULTIMATE.start_createEmail_~to) (= 1 ULTIMATE.start_createEmail_~msg~0) (= ~rjh~0 2)) [2019-10-22 11:26:24,647 INFO L443 ceAbstractionStarter]: For program point L2509-12(lines 2509 2513) no Hoare annotation was computed. [2019-10-22 11:26:24,647 INFO L446 ceAbstractionStarter]: At program point L65-1(lines 55 67) the Hoare annotation is: true [2019-10-22 11:26:24,647 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-10-22 11:26:24,647 INFO L443 ceAbstractionStarter]: For program point L2312(lines 2312 2318) no Hoare annotation was computed. [2019-10-22 11:26:24,647 INFO L443 ceAbstractionStarter]: For program point L529(lines 529 533) no Hoare annotation was computed. [2019-10-22 11:26:24,647 INFO L439 ceAbstractionStarter]: At program point L529-2(lines 522 537) 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) (not (= ULTIMATE.start_setClientId_~handle 2)) (= 1 ULTIMATE.start_setEmailTo_~handle) (= 2 ULTIMATE.start_createEmail_~to) (= 0 ~in_encrypted~0) (= 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:26:24,648 INFO L443 ceAbstractionStarter]: For program point L2445-1(lines 2445 2451) no Hoare annotation was computed. [2019-10-22 11:26:24,648 INFO L443 ceAbstractionStarter]: For program point L2445(lines 2445 2451) no Hoare annotation was computed. [2019-10-22 11:26:24,648 INFO L443 ceAbstractionStarter]: For program point L2181(lines 2181 2189) no Hoare annotation was computed. [2019-10-22 11:26:24,648 INFO L443 ceAbstractionStarter]: For program point L2181-2(lines 2181 2189) no Hoare annotation was computed. [2019-10-22 11:26:24,648 INFO L443 ceAbstractionStarter]: For program point L2181-4(lines 2181 2189) no Hoare annotation was computed. [2019-10-22 11:26:24,648 INFO L443 ceAbstractionStarter]: For program point L2181-6(lines 2181 2189) no Hoare annotation was computed. [2019-10-22 11:26:24,648 INFO L443 ceAbstractionStarter]: For program point L2181-8(lines 2181 2189) no Hoare annotation was computed. [2019-10-22 11:26:24,648 INFO L443 ceAbstractionStarter]: For program point L2181-10(lines 2181 2189) no Hoare annotation was computed. [2019-10-22 11:26:24,648 INFO L443 ceAbstractionStarter]: For program point L266(lines 266 288) no Hoare annotation was computed. [2019-10-22 11:26:24,648 INFO L439 ceAbstractionStarter]: At program point L266-1(lines 266 288) the Hoare annotation is: (and (= 1 ULTIMATE.start_outgoing__wrappee__Keys_~msg) (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 1 ~queue_empty~0) (= 1 ULTIMATE.start_getEmailTo_~handle) (= ULTIMATE.start_getClientPrivateKey_~handle 2) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= 2 ULTIMATE.start_incoming_~client) (not (= ULTIMATE.start_setClientId_~handle 2)) (= 1 ULTIMATE.start_setEmailTo_~handle) (= ULTIMATE.start_setEmailTo_~value 2) (not (= 1 ULTIMATE.start_setup_chuck_~chuck___0)) (= 1 ULTIMATE.start_outgoing_~msg) (= ~__ste_email_to0~0 2) (= ULTIMATE.start_mail_~msg 1) (= 2 |ULTIMATE.start_getEmailTo_#res|) (= |ULTIMATE.start_createEmail_#res| 1) (= 2 ULTIMATE.start_createEmail_~to) (= 1 ULTIMATE.start_createEmail_~msg~0) (= ~rjh~0 2)) [2019-10-22 11:26:24,648 INFO L443 ceAbstractionStarter]: For program point L266-2(lines 266 288) no Hoare annotation was computed. [2019-10-22 11:26:24,649 INFO L446 ceAbstractionStarter]: At program point L266-3(lines 266 288) the Hoare annotation is: true [2019-10-22 11:26:24,649 INFO L443 ceAbstractionStarter]: For program point L663(lines 663 669) no Hoare annotation was computed. [2019-10-22 11:26:24,649 INFO L443 ceAbstractionStarter]: For program point L663-1(lines 663 669) no Hoare annotation was computed. [2019-10-22 11:26:24,649 INFO L443 ceAbstractionStarter]: For program point L2184(lines 2184 2188) no Hoare annotation was computed. [2019-10-22 11:26:24,649 INFO L439 ceAbstractionStarter]: At program point L2184-2(lines 1 2841) 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)) (= 0 ~in_encrypted~0) (= 0 ~__ste_Client_Keyring0_User0~0) (not (= ~__ste_email_to0~0 1))) [2019-10-22 11:26:24,649 INFO L443 ceAbstractionStarter]: For program point L2184-3(lines 2184 2188) no Hoare annotation was computed. [2019-10-22 11:26:24,650 INFO L443 ceAbstractionStarter]: For program point L2184-6(lines 2184 2188) no Hoare annotation was computed. [2019-10-22 11:26:24,650 INFO L439 ceAbstractionStarter]: At program point L2184-5(lines 1 2841) the Hoare annotation is: (and (= ~__ste_client_privateKey1~0 456) (= ~__ste_Client_Keyring0_User0~0 ~__ste_Client_Keyring0_User1~0) (= 1 ~queue_empty~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:26:24,650 INFO L439 ceAbstractionStarter]: At program point L2184-8(lines 1 2841) 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)) (= 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:26:24,650 INFO L443 ceAbstractionStarter]: For program point L2184-9(lines 2184 2188) no Hoare annotation was computed. [2019-10-22 11:26:24,650 INFO L443 ceAbstractionStarter]: For program point L2184-12(lines 2184 2188) no Hoare annotation was computed. [2019-10-22 11:26:24,650 INFO L439 ceAbstractionStarter]: At program point L2184-11(lines 1 2841) 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)) (= 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:26:24,651 INFO L439 ceAbstractionStarter]: At program point L2184-14(lines 1071 1080) 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)) (= 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:26:24,651 INFO L439 ceAbstractionStarter]: At program point L2779(lines 2769 2825) 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)) (= 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:26:24,651 INFO L443 ceAbstractionStarter]: For program point L2184-15(lines 2184 2188) no Hoare annotation was computed. [2019-10-22 11:26:24,651 INFO L439 ceAbstractionStarter]: At program point L2184-17(lines 1061 1070) 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)) (= 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:26:24,651 INFO L443 ceAbstractionStarter]: For program point L2516(lines 2516 2528) no Hoare annotation was computed. [2019-10-22 11:26:24,651 INFO L443 ceAbstractionStarter]: For program point L2516-2(lines 2516 2528) no Hoare annotation was computed. [2019-10-22 11:26:24,651 INFO L439 ceAbstractionStarter]: At program point L2516-1(lines 2490 2533) 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) (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:26:24,651 INFO L443 ceAbstractionStarter]: For program point L2516-4(lines 2516 2528) no Hoare annotation was computed. [2019-10-22 11:26:24,651 INFO L439 ceAbstractionStarter]: At program point L2516-3(lines 1 2841) 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)) (= 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:26:24,651 INFO L443 ceAbstractionStarter]: For program point L2516-6(lines 2516 2528) no Hoare annotation was computed. [2019-10-22 11:26:24,652 INFO L439 ceAbstractionStarter]: At program point L2516-5(lines 1 2841) 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)) (= 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:26:24,652 INFO L443 ceAbstractionStarter]: For program point L270(lines 270 285) no Hoare annotation was computed. [2019-10-22 11:26:24,652 INFO L443 ceAbstractionStarter]: For program point L2252(lines 2252 2262) no Hoare annotation was computed. [2019-10-22 11:26:24,652 INFO L443 ceAbstractionStarter]: For program point L2516-8(lines 2516 2528) no Hoare annotation was computed. [2019-10-22 11:26:24,652 INFO L439 ceAbstractionStarter]: At program point L2516-7(lines 1 2841) 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)) (= 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:26:24,652 INFO L443 ceAbstractionStarter]: For program point L270-2(lines 270 285) no Hoare annotation was computed. [2019-10-22 11:26:24,652 INFO L443 ceAbstractionStarter]: For program point L2252-2(lines 2252 2262) no Hoare annotation was computed. [2019-10-22 11:26:24,652 INFO L439 ceAbstractionStarter]: At program point L138(lines 1 2841) the Hoare annotation is: (and (= ~__ste_Client_Keyring0_User0~0 ~__ste_Client_Keyring0_User1~0) (= 1 ~queue_empty~0) (not (= ~rjh~0 1)) (= 0 ~in_encrypted~0) (= 0 ~__ste_Client_Keyring0_User0~0) (not (= ~__ste_email_to0~0 1))) [2019-10-22 11:26:24,652 INFO L443 ceAbstractionStarter]: For program point L2252-1(lines 2252 2262) no Hoare annotation was computed. [2019-10-22 11:26:24,652 INFO L439 ceAbstractionStarter]: At program point L2516-9(lines 1 2841) 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)) (= 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:26:24,653 INFO L443 ceAbstractionStarter]: For program point L2252-4(lines 2252 2262) no Hoare annotation was computed. [2019-10-22 11:26:24,653 INFO L443 ceAbstractionStarter]: For program point L2252-3(lines 2252 2262) no Hoare annotation was computed. [2019-10-22 11:26:24,653 INFO L439 ceAbstractionStarter]: At program point L2715(lines 2702 2830) 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)) (= 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:26:24,653 INFO L443 ceAbstractionStarter]: For program point L2517(lines 2517 2525) no Hoare annotation was computed. [2019-10-22 11:26:24,653 INFO L443 ceAbstractionStarter]: For program point L2517-2(lines 2517 2525) no Hoare annotation was computed. [2019-10-22 11:26:24,653 INFO L443 ceAbstractionStarter]: For program point L2517-4(lines 2517 2525) no Hoare annotation was computed. [2019-10-22 11:26:24,653 INFO L443 ceAbstractionStarter]: For program point L2517-6(lines 2517 2525) no Hoare annotation was computed. [2019-10-22 11:26:24,654 INFO L443 ceAbstractionStarter]: For program point L2517-8(lines 2517 2525) no Hoare annotation was computed. [2019-10-22 11:26:24,654 INFO L439 ceAbstractionStarter]: At program point L668(lines 655 673) the Hoare annotation is: (and (= 1 ULTIMATE.start_outgoing__wrappee__Keys_~msg) (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 1 ~queue_empty~0) (= 1 ULTIMATE.start_getEmailTo_~handle) (= ULTIMATE.start_getClientPrivateKey_~handle 2) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= 2 ULTIMATE.start_incoming_~client) (not (= ULTIMATE.start_setClientId_~handle 2)) (= 1 ULTIMATE.start_setEmailTo_~handle) (= ULTIMATE.start_setEmailTo_~value 2) (not (= 1 ULTIMATE.start_setup_chuck_~chuck___0)) (= 1 ULTIMATE.start_outgoing_~msg) (= ~__ste_email_to0~0 2) (= ULTIMATE.start_mail_~msg 1) (= 2 |ULTIMATE.start_getEmailTo_#res|) (= |ULTIMATE.start_createEmail_#res| 1) (= 2 ULTIMATE.start_createEmail_~to) (= 1 ULTIMATE.start_createEmail_~msg~0) (= ~rjh~0 2)) [2019-10-22 11:26:24,654 INFO L446 ceAbstractionStarter]: At program point L668-1(lines 655 673) the Hoare annotation is: true [2019-10-22 11:26:24,654 INFO L443 ceAbstractionStarter]: For program point L2386(lines 2386 2432) no Hoare annotation was computed. [2019-10-22 11:26:24,654 INFO L439 ceAbstractionStarter]: At program point L338(lines 333 341) the Hoare annotation is: (and (= 1 ULTIMATE.start_outgoing__wrappee__Keys_~msg) (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 1 ~queue_empty~0) (= 1 ULTIMATE.start_getEmailTo_~handle) (= ULTIMATE.start_getClientPrivateKey_~handle 2) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= 2 ULTIMATE.start_incoming_~client) (not (= ULTIMATE.start_setClientId_~handle 2)) (= 1 ULTIMATE.start_setEmailTo_~handle) (= ULTIMATE.start_setEmailTo_~value 2) (not (= 1 ULTIMATE.start_setup_chuck_~chuck___0)) (= 1 ULTIMATE.start_outgoing_~msg) (= ~__ste_email_to0~0 2) (= ULTIMATE.start_mail_~msg 1) (= 1 |ULTIMATE.start_is_queue_empty_#res|) (= 2 |ULTIMATE.start_getEmailTo_#res|) (= |ULTIMATE.start_createEmail_#res| 1) (= 2 ULTIMATE.start_createEmail_~to) (= 1 ULTIMATE.start_createEmail_~msg~0) (= ~rjh~0 2)) [2019-10-22 11:26:24,654 INFO L443 ceAbstractionStarter]: For program point L2387(lines 2387 2398) no Hoare annotation was computed. [2019-10-22 11:26:24,655 INFO L443 ceAbstractionStarter]: For program point L2784(lines 2784 2791) no Hoare annotation was computed. [2019-10-22 11:26:24,655 INFO L443 ceAbstractionStarter]: For program point L2520(lines 2520 2524) no Hoare annotation was computed. [2019-10-22 11:26:24,655 INFO L443 ceAbstractionStarter]: For program point L2454(lines 2454 2485) no Hoare annotation was computed. [2019-10-22 11:26:24,655 INFO L443 ceAbstractionStarter]: For program point L2520-3(lines 2520 2524) no Hoare annotation was computed. [2019-10-22 11:26:24,655 INFO L443 ceAbstractionStarter]: For program point L2454-1(lines 2454 2485) no Hoare annotation was computed. [2019-10-22 11:26:24,655 INFO L439 ceAbstractionStarter]: At program point L2322(lines 2275 2328) 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) (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:26:24,655 INFO L443 ceAbstractionStarter]: For program point L2520-6(lines 2520 2524) no Hoare annotation was computed. [2019-10-22 11:26:24,655 INFO L443 ceAbstractionStarter]: For program point L2520-9(lines 2520 2524) no Hoare annotation was computed. [2019-10-22 11:26:24,655 INFO L443 ceAbstractionStarter]: For program point L2520-12(lines 2520 2524) no Hoare annotation was computed. [2019-10-22 11:26:24,655 INFO L443 ceAbstractionStarter]: For program point L2455-1(lines 2455 2466) no Hoare annotation was computed. [2019-10-22 11:26:24,655 INFO L443 ceAbstractionStarter]: For program point L2455(lines 2455 2466) no Hoare annotation was computed. [2019-10-22 11:26:24,655 INFO L443 ceAbstractionStarter]: For program point L275(lines 275 282) no Hoare annotation was computed. [2019-10-22 11:26:24,655 INFO L443 ceAbstractionStarter]: For program point L275-2(lines 275 282) no Hoare annotation was computed. [2019-10-22 11:26:24,656 INFO L443 ceAbstractionStarter]: For program point L2720(lines 2720 2727) no Hoare annotation was computed. [2019-10-22 11:26:24,656 INFO L443 ceAbstractionStarter]: For program point L78(lines 78 91) no Hoare annotation was computed. [2019-10-22 11:26:24,656 INFO L439 ceAbstractionStarter]: At program point L78-1(lines 68 94) the Hoare annotation is: (and (= 1 ULTIMATE.start_outgoing__wrappee__Keys_~msg) (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 1 ~queue_empty~0) (= 1 ULTIMATE.start_getEmailTo_~handle) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (not (= ULTIMATE.start_setClientId_~handle 2)) (= 1 ULTIMATE.start_setEmailTo_~handle) (= 0 ~in_encrypted~0) (= ULTIMATE.start_setEmailTo_~value 2) (not (= 1 ULTIMATE.start_setup_chuck_~chuck___0)) (= 1 ULTIMATE.start_outgoing_~msg) (= ~__ste_email_to0~0 2) (= ULTIMATE.start_mail_~msg 1) (= 2 |ULTIMATE.start_getEmailTo_#res|) (= |ULTIMATE.start_createEmail_#res| 1) (= 2 ULTIMATE.start_createEmail_~to) (= 1 ULTIMATE.start_createEmail_~msg~0) (= ~rjh~0 2)) [2019-10-22 11:26:24,656 INFO L443 ceAbstractionStarter]: For program point L78-2(lines 78 91) no Hoare annotation was computed. [2019-10-22 11:26:24,656 INFO L446 ceAbstractionStarter]: At program point L78-3(lines 68 94) the Hoare annotation is: true [2019-10-22 11:26:24,656 INFO L443 ceAbstractionStarter]: For program point L2589-1(lines 2589 2605) no Hoare annotation was computed. [2019-10-22 11:26:24,656 INFO L443 ceAbstractionStarter]: For program point L2589(lines 2589 2605) no Hoare annotation was computed. [2019-10-22 11:26:24,656 INFO L443 ceAbstractionStarter]: For program point L2391(lines 2391 2397) no Hoare annotation was computed. [2019-10-22 11:26:24,656 INFO L439 ceAbstractionStarter]: At program point L146(lines 141 149) the Hoare annotation is: (and (= ~__ste_Client_Keyring0_User0~0 ~__ste_Client_Keyring0_User1~0) (= 1 ~queue_empty~0) (not (= ~rjh~0 1)) (= 0 ~in_encrypted~0) (= 0 ~__ste_Client_Keyring0_User0~0) (not (= ~__ste_email_to0~0 1))) [2019-10-22 11:26:24,656 INFO L443 ceAbstractionStarter]: For program point L2459-1(lines 2459 2465) no Hoare annotation was computed. [2019-10-22 11:26:24,656 INFO L443 ceAbstractionStarter]: For program point L2459(lines 2459 2465) no Hoare annotation was computed. [2019-10-22 11:26:24,657 INFO L439 ceAbstractionStarter]: At program point L2261-1(lines 2241 2265) 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)) (= 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:26:24,657 INFO L439 ceAbstractionStarter]: At program point L2261(lines 2241 2265) 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) (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:26:24,657 INFO L439 ceAbstractionStarter]: At program point L2261-3(lines 2241 2265) 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)) (= 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:26:24,657 INFO L439 ceAbstractionStarter]: At program point L2261-2(lines 2241 2265) 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)) (= 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:26:24,658 INFO L439 ceAbstractionStarter]: At program point L2261-4(lines 2241 2265) 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)) (= 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:26:24,658 INFO L443 ceAbstractionStarter]: For program point L82(lines 82 88) no Hoare annotation was computed. [2019-10-22 11:26:24,658 INFO L443 ceAbstractionStarter]: For program point L82-2(lines 82 88) no Hoare annotation was computed. [2019-10-22 11:26:24,658 INFO L443 ceAbstractionStarter]: For program point L2593-1(lines 2593 2604) no Hoare annotation was computed. [2019-10-22 11:26:24,658 INFO L443 ceAbstractionStarter]: For program point L2593(lines 2593 2604) no Hoare annotation was computed. [2019-10-22 11:26:24,658 INFO L439 ceAbstractionStarter]: At program point L347(lines 342 350) the Hoare annotation is: false [2019-10-22 11:26:24,658 INFO L443 ceAbstractionStarter]: For program point L678(lines 678 686) no Hoare annotation was computed. [2019-10-22 11:26:24,658 INFO L443 ceAbstractionStarter]: For program point L678-2(lines 678 686) no Hoare annotation was computed. [2019-10-22 11:26:24,659 INFO L443 ceAbstractionStarter]: For program point L678-4(lines 678 686) no Hoare annotation was computed. [2019-10-22 11:26:24,659 INFO L443 ceAbstractionStarter]: For program point L678-6(lines 678 686) no Hoare annotation was computed. [2019-10-22 11:26:24,659 INFO L439 ceAbstractionStarter]: At program point L2793(lines 2780 2824) 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)) (= 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:26:24,659 INFO L443 ceAbstractionStarter]: For program point L217(lines 217 224) no Hoare annotation was computed. [2019-10-22 11:26:24,659 INFO L439 ceAbstractionStarter]: At program point L217-1(lines 217 224) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 1 ~queue_empty~0) (= 1 ULTIMATE.start_getEmailTo_~handle) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (not (= ULTIMATE.start_setClientId_~handle 2)) (= 1 ULTIMATE.start_setEmailTo_~handle) (= 0 ~in_encrypted~0) (= ULTIMATE.start_setEmailTo_~value 2) (not (= 1 ULTIMATE.start_setup_chuck_~chuck___0)) (= 1 ULTIMATE.start_outgoing_~msg) (= ~__ste_email_to0~0 2) (= 2 |ULTIMATE.start_getEmailTo_#res|) (= |ULTIMATE.start_createEmail_#res| 1) (= 2 ULTIMATE.start_createEmail_~to) (= 1 ULTIMATE.start_createEmail_~msg~0) (= ~rjh~0 2)) [2019-10-22 11:26:24,659 INFO L443 ceAbstractionStarter]: For program point L217-2(lines 217 224) no Hoare annotation was computed. [2019-10-22 11:26:24,659 INFO L439 ceAbstractionStarter]: At program point L217-3(lines 217 224) the Hoare annotation is: false [2019-10-22 11:26:24,659 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-10-22 11:26:24,660 INFO L439 ceAbstractionStarter]: At program point L945(lines 925 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) (not (= ULTIMATE.start_setClientPrivateKey_~handle 2)) (= 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:26:24,660 INFO L443 ceAbstractionStarter]: For program point L681(lines 681 685) no Hoare annotation was computed. [2019-10-22 11:26:24,660 INFO L439 ceAbstractionStarter]: At program point L2729(lines 2716 2829) 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)) (= 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:26:24,660 INFO L439 ceAbstractionStarter]: At program point L681-2(lines 674 689) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 1 ~queue_empty~0) (= 1 ULTIMATE.start_getEmailTo_~handle) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (not (= ULTIMATE.start_setClientId_~handle 2)) (= 1 ULTIMATE.start_setEmailTo_~handle) (= 0 ~in_encrypted~0) (= ULTIMATE.start_setEmailTo_~value 2) (not (= 1 ULTIMATE.start_setup_chuck_~chuck___0)) (= 1 ULTIMATE.start_outgoing_~msg) (= ~__ste_email_to0~0 2) (= 2 |ULTIMATE.start_getEmailTo_#res|) (= |ULTIMATE.start_createEmail_#res| 1) (= 2 ULTIMATE.start_createEmail_~to) (= 1 ULTIMATE.start_createEmail_~msg~0) (= ~rjh~0 2)) [2019-10-22 11:26:24,660 INFO L443 ceAbstractionStarter]: For program point L681-3(lines 681 685) no Hoare annotation was computed. [2019-10-22 11:26:24,660 INFO L443 ceAbstractionStarter]: For program point L2597-1(lines 2597 2603) no Hoare annotation was computed. [2019-10-22 11:26:24,660 INFO L443 ceAbstractionStarter]: For program point L2597(lines 2597 2603) no Hoare annotation was computed. [2019-10-22 11:26:24,660 INFO L443 ceAbstractionStarter]: For program point L681-6(lines 681 685) no Hoare annotation was computed. [2019-10-22 11:26:24,660 INFO L439 ceAbstractionStarter]: At program point L681-8(lines 674 689) the Hoare annotation is: false [2019-10-22 11:26:24,660 INFO L443 ceAbstractionStarter]: For program point L681-9(lines 681 685) no Hoare annotation was computed. [2019-10-22 11:26:24,660 INFO L443 ceAbstractionStarter]: For program point L2333-1(lines 2333 2369) no Hoare annotation was computed. [2019-10-22 11:26:24,660 INFO L443 ceAbstractionStarter]: For program point L2333(lines 2333 2369) no Hoare annotation was computed. [2019-10-22 11:26:24,661 INFO L443 ceAbstractionStarter]: For program point L2333-3(lines 2333 2369) no Hoare annotation was computed. [2019-10-22 11:26:24,661 INFO L443 ceAbstractionStarter]: For program point L2333-2(lines 2333 2369) no Hoare annotation was computed. [2019-10-22 11:26:24,661 INFO L443 ceAbstractionStarter]: For program point L2201-1(lines 2201 2217) no Hoare annotation was computed. [2019-10-22 11:26:24,661 INFO L443 ceAbstractionStarter]: For program point L2201(lines 2201 2217) no Hoare annotation was computed. [2019-10-22 11:26:24,661 INFO L443 ceAbstractionStarter]: For program point L2333-4(lines 2333 2369) no Hoare annotation was computed. [2019-10-22 11:26:24,661 INFO L443 ceAbstractionStarter]: For program point L2201-3(lines 2201 2217) no Hoare annotation was computed. [2019-10-22 11:26:24,661 INFO L443 ceAbstractionStarter]: For program point L2201-2(lines 2201 2217) no Hoare annotation was computed. [2019-10-22 11:26:24,661 INFO L443 ceAbstractionStarter]: For program point L2201-4(lines 2201 2217) no Hoare annotation was computed. [2019-10-22 11:26:24,662 INFO L443 ceAbstractionStarter]: For program point L2400(lines 2400 2431) no Hoare annotation was computed. [2019-10-22 11:26:24,662 INFO L443 ceAbstractionStarter]: For program point L2334(lines 2334 2342) no Hoare annotation was computed. [2019-10-22 11:26:24,662 INFO L443 ceAbstractionStarter]: For program point L2334-2(lines 2334 2342) no Hoare annotation was computed. [2019-10-22 11:26:24,662 INFO L443 ceAbstractionStarter]: For program point L2334-4(lines 2334 2342) no Hoare annotation was computed. [2019-10-22 11:26:24,662 INFO L443 ceAbstractionStarter]: For program point L2334-6(lines 2334 2342) no Hoare annotation was computed. [2019-10-22 11:26:24,662 INFO L443 ceAbstractionStarter]: For program point L2334-8(lines 2334 2342) no Hoare annotation was computed. [2019-10-22 11:26:24,662 INFO L443 ceAbstractionStarter]: For program point L2401(lines 2401 2412) no Hoare annotation was computed. [2019-10-22 11:26:24,662 INFO L443 ceAbstractionStarter]: For program point L2798(lines 2798 2805) no Hoare annotation was computed. [2019-10-22 11:26:24,662 INFO L443 ceAbstractionStarter]: For program point L2468(lines 2468 2484) no Hoare annotation was computed. [2019-10-22 11:26:24,662 INFO L443 ceAbstractionStarter]: For program point L2468-1(lines 2468 2484) no Hoare annotation was computed. [2019-10-22 11:26:24,663 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 1452) no Hoare annotation was computed. [2019-10-22 11:26:24,663 INFO L443 ceAbstractionStarter]: For program point L2469-1(lines 2469 2480) no Hoare annotation was computed. [2019-10-22 11:26:24,663 INFO L443 ceAbstractionStarter]: For program point L2469(lines 2469 2480) no Hoare annotation was computed. [2019-10-22 11:26:24,663 INFO L443 ceAbstractionStarter]: For program point L2337(lines 2337 2341) no Hoare annotation was computed. [2019-10-22 11:26:24,663 INFO L443 ceAbstractionStarter]: For program point L2337-3(lines 2337 2341) no Hoare annotation was computed. [2019-10-22 11:26:24,663 INFO L443 ceAbstractionStarter]: For program point L2205-1(lines 2205 2216) no Hoare annotation was computed. [2019-10-22 11:26:24,663 INFO L443 ceAbstractionStarter]: For program point L2205(lines 2205 2216) no Hoare annotation was computed. [2019-10-22 11:26:24,663 INFO L443 ceAbstractionStarter]: For program point L2205-3(lines 2205 2216) no Hoare annotation was computed. [2019-10-22 11:26:24,663 INFO L443 ceAbstractionStarter]: For program point L2205-2(lines 2205 2216) no Hoare annotation was computed. [2019-10-22 11:26:24,663 INFO L443 ceAbstractionStarter]: For program point L2337-6(lines 2337 2341) no Hoare annotation was computed. [2019-10-22 11:26:24,663 INFO L443 ceAbstractionStarter]: For program point L2337-9(lines 2337 2341) no Hoare annotation was computed. [2019-10-22 11:26:24,663 INFO L443 ceAbstractionStarter]: For program point L2205-4(lines 2205 2216) no Hoare annotation was computed. [2019-10-22 11:26:24,663 INFO L443 ceAbstractionStarter]: For program point L2337-12(lines 2337 2341) no Hoare annotation was computed. [2019-10-22 11:26:24,664 INFO L443 ceAbstractionStarter]: For program point L2734(lines 2734 2741) no Hoare annotation was computed. [2019-10-22 11:26:24,664 INFO L439 ceAbstractionStarter]: At program point L2602(lines 2585 2608) the Hoare annotation is: (and (= 1 ULTIMATE.start_outgoing__wrappee__Keys_~msg) (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 1 ~queue_empty~0) (= 1 ULTIMATE.start_getEmailTo_~handle) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (not (= ULTIMATE.start_setClientId_~handle 2)) (= 1 ULTIMATE.start_setEmailTo_~handle) (= 0 ~in_encrypted~0) (= ULTIMATE.start_setEmailTo_~value 2) (not (= 1 ULTIMATE.start_setup_chuck_~chuck___0)) (= 1 ULTIMATE.start_outgoing_~msg) (= ~__ste_email_to0~0 2) (= 2 |ULTIMATE.start_getEmailTo_#res|) (= |ULTIMATE.start_createEmail_#res| 1) (= 2 ULTIMATE.start_createEmail_~to) (= 1 ULTIMATE.start_createEmail_~msg~0) (= ~rjh~0 2)) [2019-10-22 11:26:24,664 INFO L439 ceAbstractionStarter]: At program point L2602-1(lines 2585 2608) the Hoare annotation is: false [2019-10-22 11:26:24,664 INFO L439 ceAbstractionStarter]: At program point L356(lines 351 359) the Hoare annotation is: false [2019-10-22 11:26:24,664 INFO L443 ceAbstractionStarter]: For program point L489(lines 489 497) no Hoare annotation was computed. [2019-10-22 11:26:24,664 INFO L443 ceAbstractionStarter]: For program point L489-2(lines 489 497) no Hoare annotation was computed. [2019-10-22 11:26:24,664 INFO L443 ceAbstractionStarter]: For program point L489-4(lines 489 497) no Hoare annotation was computed. [2019-10-22 11:26:24,664 INFO L443 ceAbstractionStarter]: For program point L2405(lines 2405 2411) no Hoare annotation was computed. [2019-10-22 11:26:24,664 INFO L443 ceAbstractionStarter]: For program point L2670(lines 2669 2833) no Hoare annotation was computed. [2019-10-22 11:26:24,664 INFO L443 ceAbstractionStarter]: For program point L622(lines 622 633) no Hoare annotation was computed. [2019-10-22 11:26:24,664 INFO L443 ceAbstractionStarter]: For program point L622-1(lines 622 633) no Hoare annotation was computed. [2019-10-22 11:26:24,665 INFO L443 ceAbstractionStarter]: For program point L622-2(lines 622 633) no Hoare annotation was computed. [2019-10-22 11:26:24,665 INFO L443 ceAbstractionStarter]: For program point L622-3(lines 622 633) no Hoare annotation was computed. [2019-10-22 11:26:24,665 INFO L443 ceAbstractionStarter]: For program point L622-4(lines 622 633) no Hoare annotation was computed. [2019-10-22 11:26:24,665 INFO L443 ceAbstractionStarter]: For program point L622-5(lines 622 633) no Hoare annotation was computed. [2019-10-22 11:26:24,665 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-22 11:26:24,665 INFO L443 ceAbstractionStarter]: For program point L2671(lines 2671 2675) no Hoare annotation was computed. [2019-10-22 11:26:24,665 INFO L443 ceAbstractionStarter]: For program point L2473-1(lines 2473 2479) no Hoare annotation was computed. [2019-10-22 11:26:24,666 INFO L443 ceAbstractionStarter]: For program point L2473(lines 2473 2479) no Hoare annotation was computed. [2019-10-22 11:26:24,666 INFO L443 ceAbstractionStarter]: For program point L2209-1(lines 2209 2215) no Hoare annotation was computed. [2019-10-22 11:26:24,666 INFO L443 ceAbstractionStarter]: For program point L2209(lines 2209 2215) no Hoare annotation was computed. [2019-10-22 11:26:24,666 INFO L443 ceAbstractionStarter]: For program point L2209-3(lines 2209 2215) no Hoare annotation was computed. [2019-10-22 11:26:24,666 INFO L443 ceAbstractionStarter]: For program point L2209-2(lines 2209 2215) no Hoare annotation was computed. [2019-10-22 11:26:24,666 INFO L443 ceAbstractionStarter]: For program point L2209-4(lines 2209 2215) no Hoare annotation was computed. [2019-10-22 11:26:24,666 INFO L443 ceAbstractionStarter]: For program point L492(lines 492 496) no Hoare annotation was computed. [2019-10-22 11:26:24,667 INFO L439 ceAbstractionStarter]: At program point L492-2(lines 485 500) 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)) (= 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:26:24,667 INFO L443 ceAbstractionStarter]: For program point L492-3(lines 492 496) no Hoare annotation was computed. [2019-10-22 11:26:24,667 INFO L439 ceAbstractionStarter]: At program point L492-5(lines 485 500) the Hoare annotation is: (and (= 1 ULTIMATE.start_outgoing__wrappee__Keys_~msg) (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 1 ~queue_empty~0) (= 1 ULTIMATE.start_getEmailTo_~handle) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (not (= ULTIMATE.start_setClientId_~handle 2)) (= 1 ULTIMATE.start_setEmailTo_~handle) (= 0 ~in_encrypted~0) (= ULTIMATE.start_setEmailTo_~value 2) (not (= 1 ULTIMATE.start_setup_chuck_~chuck___0)) (= 1 ULTIMATE.start_outgoing_~msg) (= ~__ste_email_to0~0 2) (= 2 |ULTIMATE.start_getEmailTo_#res|) (= |ULTIMATE.start_createEmail_#res| 1) (= 2 ULTIMATE.start_createEmail_~to) (= 1 ULTIMATE.start_createEmail_~msg~0) (= ~rjh~0 2)) [2019-10-22 11:26:24,667 INFO L443 ceAbstractionStarter]: For program point L492-6(lines 492 496) no Hoare annotation was computed. [2019-10-22 11:26:24,667 INFO L439 ceAbstractionStarter]: At program point L492-8(lines 485 500) the Hoare annotation is: false [2019-10-22 11:26:24,667 INFO L443 ceAbstractionStarter]: For program point L626(lines 626 632) no Hoare annotation was computed. [2019-10-22 11:26:24,667 INFO L443 ceAbstractionStarter]: For program point L626-1(lines 626 632) no Hoare annotation was computed. [2019-10-22 11:26:24,667 INFO L443 ceAbstractionStarter]: For program point L626-2(lines 626 632) no Hoare annotation was computed. [2019-10-22 11:26:24,667 INFO L443 ceAbstractionStarter]: For program point L626-3(lines 626 632) no Hoare annotation was computed. [2019-10-22 11:26:24,667 INFO L443 ceAbstractionStarter]: For program point L626-4(lines 626 632) no Hoare annotation was computed. [2019-10-22 11:26:24,667 INFO L443 ceAbstractionStarter]: For program point L626-5(lines 626 632) no Hoare annotation was computed. [2019-10-22 11:26:24,667 INFO L443 ceAbstractionStarter]: For program point L2344(lines 2344 2368) no Hoare annotation was computed. [2019-10-22 11:26:24,667 INFO L443 ceAbstractionStarter]: For program point L2344-2(lines 2344 2368) no Hoare annotation was computed. [2019-10-22 11:26:24,668 INFO L443 ceAbstractionStarter]: For program point L2344-1(lines 2344 2368) no Hoare annotation was computed. [2019-10-22 11:26:24,668 INFO L443 ceAbstractionStarter]: For program point L2344-4(lines 2344 2368) no Hoare annotation was computed. [2019-10-22 11:26:24,668 INFO L443 ceAbstractionStarter]: For program point L2344-3(lines 2344 2368) no Hoare annotation was computed. [2019-10-22 11:26:24,668 INFO L439 ceAbstractionStarter]: At program point L2807(lines 2794 2823) 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)) (= 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:26:24,668 INFO L443 ceAbstractionStarter]: For program point L2345(lines 2345 2353) no Hoare annotation was computed. [2019-10-22 11:26:24,668 INFO L443 ceAbstractionStarter]: For program point L2279(lines 2279 2325) no Hoare annotation was computed. [2019-10-22 11:26:24,668 INFO L443 ceAbstractionStarter]: For program point L2345-2(lines 2345 2353) no Hoare annotation was computed. [2019-10-22 11:26:24,668 INFO L443 ceAbstractionStarter]: For program point L2345-4(lines 2345 2353) no Hoare annotation was computed. [2019-10-22 11:26:24,668 INFO L443 ceAbstractionStarter]: For program point L2345-6(lines 2345 2353) no Hoare annotation was computed. [2019-10-22 11:26:24,668 INFO L443 ceAbstractionStarter]: For program point L2345-8(lines 2345 2353) no Hoare annotation was computed. [2019-10-22 11:26:24,668 INFO L443 ceAbstractionStarter]: For program point L958(lines 958 965) no Hoare annotation was computed. [2019-10-22 11:26:24,668 INFO L446 ceAbstractionStarter]: At program point L958-1(lines 958 965) the Hoare annotation is: true [2019-10-22 11:26:24,669 INFO L443 ceAbstractionStarter]: For program point L2280(lines 2280 2291) no Hoare annotation was computed. [2019-10-22 11:26:24,669 INFO L439 ceAbstractionStarter]: At program point L2214(lines 2197 2220) 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) (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:26:24,669 INFO L439 ceAbstractionStarter]: At program point L2214-2(lines 2197 2220) 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)) (= 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:26:24,669 INFO L439 ceAbstractionStarter]: At program point L2214-1(lines 2197 2220) 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)) (= 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:26:24,669 INFO L439 ceAbstractionStarter]: At program point L2214-4(lines 2197 2220) 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)) (= 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:26:24,670 INFO L439 ceAbstractionStarter]: At program point L2214-3(lines 2197 2220) 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)) (= 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:26:24,670 INFO L439 ceAbstractionStarter]: At program point L2743(lines 2730 2828) 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)) (= 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:26:24,670 INFO L443 ceAbstractionStarter]: For program point L2677(lines 2677 2832) no Hoare annotation was computed. [2019-10-22 11:26:24,716 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 11:26:24 BoogieIcfgContainer [2019-10-22 11:26:24,716 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 11:26:24,717 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 11:26:24,717 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 11:26:24,717 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 11:26:24,717 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:26:05" (3/4) ... [2019-10-22 11:26:24,720 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-10-22 11:26:24,760 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 132 nodes and edges [2019-10-22 11:26:24,762 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 73 nodes and edges [2019-10-22 11:26:24,763 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-10-22 11:26:24,765 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-10-22 11:26:24,767 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-10-22 11:26:24,804 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___0) && !(handle == 2)) && 1 == handle) && 0 == in_encrypted) && value == 2) && !(1 == chuck___0)) && __ste_email_to0 == 2) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2 [2019-10-22 11:26:24,808 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((handle == chuck___0 && 1 == queue_empty) && 1 == handle) && 2 == rjh___0) && !(handle == 2)) && 1 == handle) && 0 == in_encrypted) && value == 2) && !(1 == chuck___0)) && 1 == msg) && __ste_email_to0 == 2) && 2 == \result) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2 [2019-10-22 11:26:24,813 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((handle == chuck___0 && 1 == queue_empty) && 1 == handle) && 2 == rjh___0) && !(handle == 2)) && 1 == handle) && 0 == in_encrypted) && value == 2) && !(1 == chuck___0)) && 1 == msg) && __ste_email_to0 == 2) && 2 == \result) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2 [2019-10-22 11:26:24,816 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((handle == chuck___0 && 1 == queue_empty) && 1 == handle) && 2 == rjh___0) && !(handle == 2)) && 1 == handle) && 0 == in_encrypted) && value == 2) && !(1 == chuck___0)) && 1 == msg) && __ste_email_to0 == 2) && 2 == \result) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2 [2019-10-22 11:26:24,816 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((handle == chuck___0 && 1 == queue_empty) && 1 == handle) && 2 == rjh___0) && !(handle == 2)) && 1 == handle) && 0 == in_encrypted) && value == 2) && !(1 == chuck___0)) && 1 == msg) && __ste_email_to0 == 2) && 2 == \result) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2 [2019-10-22 11:26:24,816 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((1 == msg && handle == chuck___0) && 1 == queue_empty) && 1 == handle) && 2 == rjh___0) && !(handle == 2)) && 1 == handle) && 0 == in_encrypted) && value == 2) && !(1 == chuck___0)) && 1 == msg) && __ste_email_to0 == 2) && 2 == \result) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2 [2019-10-22 11:26:24,816 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((1 == msg && handle == chuck___0) && 1 == queue_empty) && 1 == handle) && 2 == rjh___0) && !(handle == 2)) && 1 == handle) && 0 == in_encrypted) && value == 2) && !(1 == chuck___0)) && 1 == msg) && __ste_email_to0 == 2) && 2 == \result) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2 [2019-10-22 11:26:24,816 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((1 == msg && handle == chuck___0) && 1 == queue_empty) && 1 == handle) && 2 == rjh___0) && !(handle == 2)) && 1 == handle) && 0 == in_encrypted) && value == 2) && !(1 == chuck___0)) && 1 == msg) && __ste_email_to0 == 2) && msg == 1) && 2 == \result) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2 [2019-10-22 11:26:24,817 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((1 == msg && handle == chuck___0) && 1 == handle) && 1 == queue_empty) && 2 == rjh___0) && !(handle == 2)) && 1 == handle) && 0 == in_encrypted) && value == 2) && !(1 == chuck___0)) && 1 == msg) && __ste_email_to0 == 2) && msg == 1) && 2 == \result) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2 [2019-10-22 11:26:24,817 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((1 == msg && handle == chuck___0) && 1 == queue_empty) && 1 == handle) && 2 == rjh___0) && 2 == client) && !(handle == 2)) && 1 == handle) && 0 == in_encrypted) && value == 2) && !(1 == chuck___0)) && 1 == msg) && __ste_email_to0 == 2) && msg == 1) && 2 == \result) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2 [2019-10-22 11:26:24,817 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((1 == msg && handle == chuck___0) && 1 == handle) && 1 == queue_empty) && 2 == rjh___0) && 2 == client) && !(handle == 2)) && 1 == handle) && value == 2) && !(1 == chuck___0)) && 1 == msg) && __ste_email_to0 == 2) && msg == 1) && 2 == \result) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2 [2019-10-22 11:26:24,817 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((1 == msg && handle == chuck___0) && 1 == queue_empty) && 1 == handle) && handle == 2) && 2 == rjh___0) && !(handle == 2)) && 2 == client) && 1 == handle) && value == 2) && !(1 == chuck___0)) && 1 == msg) && __ste_email_to0 == 2) && msg == 1) && 2 == \result) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2 [2019-10-22 11:26:24,817 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((1 == msg && handle == chuck___0) && 1 == queue_empty) && 1 == handle) && handle == 2) && 2 == rjh___0) && 2 == client) && !(handle == 2)) && 1 == handle) && value == 2) && !(1 == chuck___0)) && 1 == msg) && __ste_email_to0 == 2) && msg == 1) && 2 == \result) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2 [2019-10-22 11:26:24,817 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((1 == msg && handle == chuck___0) && 1 == queue_empty) && 1 == handle) && handle == 2) && 2 == rjh___0) && 2 == client) && !(handle == 2)) && 1 == handle) && value == 2) && !(1 == chuck___0)) && 1 == msg) && __ste_email_to0 == 2) && msg == 1) && 2 == \result) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2 [2019-10-22 11:26:24,817 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((1 == msg && handle == chuck___0) && 1 == queue_empty) && 1 == handle) && handle == 2) && 2 == rjh___0) && 2 == client) && !(handle == 2)) && 1 == handle) && value == 2) && !(1 == chuck___0)) && 1 == msg) && __ste_email_to0 == 2) && msg == 1) && 2 == \result) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2 [2019-10-22 11:26:24,817 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((1 == msg && handle == chuck___0) && 1 == queue_empty) && 1 == handle) && handle == 2) && 2 == rjh___0) && 2 == client) && !(handle == 2)) && 1 == handle) && value == 2) && !(1 == chuck___0)) && 1 == msg) && __ste_email_to0 == 2) && msg == 1) && 1 == \result) && 2 == \result) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2 [2019-10-22 11:26:24,818 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((1 == msg && handle == chuck___0) && 1 == queue_empty) && 1 == handle) && handle == 2) && 2 == rjh___0) && 2 == client) && !(handle == 2)) && 1 == handle) && value == 2) && !(1 == chuck___0)) && 1 == msg) && __ste_email_to0 == 2) && msg == 1) && 2 == \result) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2 [2019-10-22 11:26:24,818 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((1 == msg && handle == chuck___0) && 1 == queue_empty) && 1 == handle) && handle == 2) && 2 == rjh___0) && 2 == client) && !(handle == 2)) && 1 == handle) && value == 2) && !(1 == chuck___0)) && 1 == msg) && __ste_email_to0 == 2) && msg == 1) && 2 == \result) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2 [2019-10-22 11:26:24,818 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((1 == msg && handle == chuck___0) && 1 == queue_empty) && 1 == handle) && handle == 2) && 2 == rjh___0) && 2 == client) && !(handle == 2)) && 1 == handle) && value == 2) && !(1 == chuck___0)) && 1 == msg) && __ste_email_to0 == 2) && msg == 1) && 2 == \result) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2 [2019-10-22 11:26:24,946 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_b66b2805-03ff-4969-852e-96bbd030a60f/bin/utaipan/witness.graphml [2019-10-22 11:26:24,946 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 11:26:24,947 INFO L168 Benchmark]: Toolchain (without parser) took 22203.69 ms. Allocated memory was 1.0 GB in the beginning and 2.0 GB in the end (delta: 975.7 MB). Free memory was 944.5 MB in the beginning and 1.8 GB in the end (delta: -845.3 MB). Peak memory consumption was 130.4 MB. Max. memory is 11.5 GB. [2019-10-22 11:26:24,947 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 967.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:26:24,948 INFO L168 Benchmark]: CACSL2BoogieTranslator took 854.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 944.5 MB in the beginning and 1.1 GB in the end (delta: -127.4 MB). Peak memory consumption was 29.8 MB. Max. memory is 11.5 GB. [2019-10-22 11:26:24,948 INFO L168 Benchmark]: Boogie Procedure Inliner took 128.39 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.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-10-22 11:26:24,948 INFO L168 Benchmark]: Boogie Preprocessor took 99.36 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.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-10-22 11:26:24,948 INFO L168 Benchmark]: RCFGBuilder took 1632.08 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 871.6 MB in the end (delta: 186.7 MB). Peak memory consumption was 186.7 MB. Max. memory is 11.5 GB. [2019-10-22 11:26:24,949 INFO L168 Benchmark]: TraceAbstraction took 19255.50 ms. Allocated memory was 1.2 GB in the beginning and 2.0 GB in the end (delta: 844.6 MB). Free memory was 871.6 MB in the beginning and 1.8 GB in the end (delta: -972.2 MB). Peak memory consumption was 914.2 MB. Max. memory is 11.5 GB. [2019-10-22 11:26:24,949 INFO L168 Benchmark]: Witness Printer took 229.44 ms. Allocated memory is still 2.0 GB. Free memory was 1.8 GB in the beginning and 1.8 GB in the end (delta: 54.0 MB). Peak memory consumption was 54.0 MB. Max. memory is 11.5 GB. [2019-10-22 11:26:24,950 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.28 ms. Allocated memory is still 1.0 GB. Free memory is still 967.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 854.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 944.5 MB in the beginning and 1.1 GB in the end (delta: -127.4 MB). Peak memory consumption was 29.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 128.39 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.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 99.36 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.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1632.08 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 871.6 MB in the end (delta: 186.7 MB). Peak memory consumption was 186.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 19255.50 ms. Allocated memory was 1.2 GB in the beginning and 2.0 GB in the end (delta: 844.6 MB). Free memory was 871.6 MB in the beginning and 1.8 GB in the end (delta: -972.2 MB). Peak memory consumption was 914.2 MB. Max. memory is 11.5 GB. * Witness Printer took 229.44 ms. Allocated memory is still 2.0 GB. Free memory was 1.8 GB in the beginning and 1.8 GB in the end (delta: 54.0 MB). Peak memory consumption was 54.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1452]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1452]: 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: 2329]: Loop Invariant Derived loop invariant: ((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___0) && !(handle == 2)) && 0 == in_encrypted) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 - InvariantResult [Line: 637]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1061]: Loop Invariant Derived loop invariant: ((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___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)) && 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)) && 0 == in_encrypted) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 - InvariantResult [Line: 141]: Loop Invariant Derived loop invariant: ((((__ste_Client_Keyring0_User0 == __ste_Client_Keyring0_User1 && 1 == queue_empty) && !(rjh == 1)) && 0 == in_encrypted) && 0 == __ste_Client_Keyring0_User0) && !(__ste_email_to0 == 1) - InvariantResult [Line: 2221]: Loop Invariant Derived loop invariant: ((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___0) && !(handle == 2)) && 0 == in_encrypted) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 - InvariantResult [Line: 2329]: Loop Invariant Derived loop invariant: ((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___0) && !(handle == 2)) && 0 == in_encrypted) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 - InvariantResult [Line: 2329]: Loop Invariant Derived loop invariant: ((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___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) && 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: 2436]: Loop Invariant Derived loop invariant: ((((((((((((((handle == chuck___0 && 1 == queue_empty) && 1 == handle) && 2 == rjh___0) && !(handle == 2)) && 1 == handle) && 0 == in_encrypted) && value == 2) && !(1 == chuck___0)) && 1 == msg) && __ste_email_to0 == 2) && 2 == \result) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2 - InvariantResult [Line: 2490]: Loop Invariant Derived loop invariant: (((((((handle == chuck___0 && 1 == queue_empty) && 0 == op1) && 2 == rjh___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_Keyring0_User0 == __ste_Client_Keyring0_User1 && 1 == queue_empty) && !(rjh == 1)) && 0 == in_encrypted) && 0 == __ste_Client_Keyring0_User0) && !(__ste_email_to0 == 1) - InvariantResult [Line: 55]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2329]: Loop Invariant Derived loop invariant: (((((((handle == chuck___0 && 1 == queue_empty) && 0 == op1) && 2 == rjh___0) && !(handle == 2)) && 0 == in_encrypted) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 - InvariantResult [Line: 2221]: Loop Invariant Derived loop invariant: ((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___0) && !(handle == 2)) && 0 == in_encrypted) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 - InvariantResult [Line: 2275]: Loop Invariant Derived loop invariant: (((((((handle == chuck___0 && 1 == queue_empty) && 0 == op1) && 2 == rjh___0) && !(handle == 2)) && 0 == in_encrypted) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 - InvariantResult [Line: 958]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2668]: Loop Invariant Derived loop invariant: ((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___0) && !(handle == 2)) && 0 == in_encrypted) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 - InvariantResult [Line: 2436]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 55]: Loop Invariant Derived loop invariant: ((((((((((((((((1 == msg && handle == chuck___0) && 1 == handle) && 1 == queue_empty) && 2 == rjh___0) && 2 == client) && !(handle == 2)) && 1 == handle) && value == 2) && !(1 == chuck___0)) && 1 == msg) && __ste_email_to0 == 2) && msg == 1) && 2 == \result) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___0) && !(handle == 2)) && 0 == in_encrypted) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 - InvariantResult [Line: 2769]: Loop Invariant Derived loop invariant: ((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___0) && !(handle == 2)) && 0 == in_encrypted) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 - InvariantResult [Line: 2669]: Loop Invariant Derived loop invariant: ((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___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)) && 0 == in_encrypted) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 - InvariantResult [Line: 342]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1071]: Loop Invariant Derived loop invariant: ((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___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)) && 0 == in_encrypted) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 - InvariantResult [Line: 2221]: Loop Invariant Derived loop invariant: ((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___0) && !(handle == 2)) && 0 == in_encrypted) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 - InvariantResult [Line: 2329]: Loop Invariant Derived loop invariant: ((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___0) && !(handle == 2)) && 0 == in_encrypted) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 - InvariantResult [Line: 2755]: Loop Invariant Derived loop invariant: ((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___0) && !(handle == 2)) && 0 == in_encrypted) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 - InvariantResult [Line: 503]: Loop Invariant Derived loop invariant: ((((((((((((((handle == chuck___0 && 1 == queue_empty) && 1 == handle) && 2 == rjh___0) && !(handle == 2)) && 1 == handle) && 0 == in_encrypted) && value == 2) && !(1 == chuck___0)) && 1 == msg) && __ste_email_to0 == 2) && 2 == \result) && \result == 1) && 2 == to) && 1 == msg) && 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) && 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: 1]: Loop Invariant Derived loop invariant: (((((__ste_Client_Keyring0_User0 == __ste_Client_Keyring0_User1 && 1 == queue_empty) && !(rjh == 1)) && !(handle == 2)) && 0 == in_encrypted) && 0 == __ste_Client_Keyring0_User0) && !(__ste_email_to0 == 1) - InvariantResult [Line: 503]: Loop Invariant Derived loop invariant: ((((((((((((((((1 == msg && handle == chuck___0) && 1 == handle) && 1 == queue_empty) && 2 == rjh___0) && !(handle == 2)) && 1 == handle) && 0 == in_encrypted) && value == 2) && !(1 == chuck___0)) && 1 == msg) && __ste_email_to0 == 2) && msg == 1) && 2 == \result) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2 - InvariantResult [Line: 2730]: Loop Invariant Derived loop invariant: ((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___0) && !(handle == 2)) && 0 == in_encrypted) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 - InvariantResult [Line: 2744]: Loop Invariant Derived loop invariant: ((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___0) && !(handle == 2)) && 0 == in_encrypted) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 - InvariantResult [Line: 503]: 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 == handle) && handle == rjh___0) && 0 == in_encrypted) && 0 == __ste_Client_Keyring0_User0) && !(__ste_email_to0 == 1)) && rjh == 2 - InvariantResult [Line: 674]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 503]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___0) && !(handle == 2)) && 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: 2221]: Loop Invariant Derived loop invariant: (((((((handle == chuck___0 && 1 == queue_empty) && 0 == op1) && 2 == rjh___0) && !(handle == 2)) && 0 == in_encrypted) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 - InvariantResult [Line: 637]: Loop Invariant Derived loop invariant: (((((((((((((((((1 == msg && handle == chuck___0) && 1 == queue_empty) && 1 == handle) && handle == 2) && 2 == rjh___0) && 2 == client) && !(handle == 2)) && 1 == handle) && value == 2) && !(1 == chuck___0)) && 1 == msg) && __ste_email_to0 == 2) && msg == 1) && 2 == \result) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2 - InvariantResult [Line: 2241]: Loop Invariant Derived loop invariant: ((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___0) && !(handle == 2)) && 0 == in_encrypted) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 - InvariantResult [Line: 2716]: Loop Invariant Derived loop invariant: ((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___0) && !(handle == 2)) && 0 == in_encrypted) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 - InvariantResult [Line: 2241]: Loop Invariant Derived loop invariant: ((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___0) && !(handle == 2)) && 0 == in_encrypted) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 - InvariantResult [Line: 2241]: Loop Invariant Derived loop invariant: ((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___0) && !(handle == 2)) && 0 == in_encrypted) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 - InvariantResult [Line: 360]: Loop Invariant Derived loop invariant: (((((((((((((((((1 == msg && handle == chuck___0) && 1 == queue_empty) && 1 == handle) && handle == 2) && 2 == rjh___0) && 2 == client) && !(handle == 2)) && 1 == handle) && value == 2) && !(1 == chuck___0)) && 1 == msg) && __ste_email_to0 == 2) && msg == 1) && 2 == \result) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2 - InvariantResult [Line: 2382]: Loop Invariant Derived loop invariant: (((((((handle == chuck___0 && 1 == queue_empty) && 0 == op1) && 2 == rjh___0) && !(handle == 2)) && 0 == in_encrypted) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 - InvariantResult [Line: 674]: Loop Invariant Derived loop invariant: ((((((((((((((handle == chuck___0 && 1 == queue_empty) && 1 == handle) && 2 == rjh___0) && !(handle == 2)) && 1 == handle) && 0 == in_encrypted) && value == 2) && !(1 == chuck___0)) && 1 == msg) && __ste_email_to0 == 2) && 2 == \result) && \result == 1) && 2 == to) && 1 == msg) && 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)) && 0 == in_encrypted) && 0 == __ste_Client_Keyring0_User0) && !(__ste_email_to0 == 1) - InvariantResult [Line: 969]: Loop Invariant Derived loop invariant: (((((((handle == chuck___0 && 1 == queue_empty) && 0 == op1) && 2 == rjh___0) && !(handle == 2)) && 0 == in_encrypted) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 - InvariantResult [Line: 360]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 948]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2241]: Loop Invariant Derived loop invariant: ((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___0) && !(handle == 2)) && 0 == in_encrypted) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 - InvariantResult [Line: 310]: Loop Invariant Derived loop invariant: (((((((((((((((((1 == msg && handle == chuck___0) && 1 == queue_empty) && 1 == handle) && handle == 2) && 2 == rjh___0) && 2 == client) && !(handle == 2)) && 1 == handle) && value == 2) && !(1 == chuck___0)) && 1 == msg) && __ste_email_to0 == 2) && msg == 1) && 2 == \result) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2 - InvariantResult [Line: 351]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 485]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2197]: Loop Invariant Derived loop invariant: ((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___0) && !(handle == 2)) && 0 == in_encrypted) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 - InvariantResult [Line: 2197]: Loop Invariant Derived loop invariant: ((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___0) && !(handle == 2)) && 0 == in_encrypted) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 - InvariantResult [Line: 2197]: Loop Invariant Derived loop invariant: ((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___0) && !(handle == 2)) && 0 == in_encrypted) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 - InvariantResult [Line: 2241]: Loop Invariant Derived loop invariant: (((((((handle == chuck___0 && 1 == queue_empty) && 0 == op1) && 2 == rjh___0) && !(handle == 2)) && 0 == in_encrypted) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 - InvariantResult [Line: 618]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1545]: Loop Invariant Derived loop invariant: (((((((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___0) && !(handle == 2)) && 1 == handle) && 0 == in_encrypted) && value == 2) && !(1 == chuck___0)) && __ste_email_to0 == 2) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2 - InvariantResult [Line: 2585]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 618]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 68]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 217]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 333]: Loop Invariant Derived loop invariant: ((((((((((((((((((1 == msg && handle == chuck___0) && 1 == queue_empty) && 1 == handle) && handle == 2) && 2 == rjh___0) && 2 == client) && !(handle == 2)) && 1 == handle) && value == 2) && !(1 == chuck___0)) && 1 == msg) && __ste_email_to0 == 2) && msg == 1) && 1 == \result) && 2 == \result) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2 - InvariantResult [Line: 618]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 485]: Loop Invariant Derived loop invariant: (((((((((((((((1 == msg && handle == chuck___0) && 1 == queue_empty) && 1 == handle) && 2 == rjh___0) && !(handle == 2)) && 1 == handle) && 0 == in_encrypted) && value == 2) && !(1 == chuck___0)) && 1 == msg) && __ste_email_to0 == 2) && 2 == \result) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2 - InvariantResult [Line: 2197]: Loop Invariant Derived loop invariant: (((((((handle == chuck___0 && 1 == queue_empty) && 0 == op1) && 2 == rjh___0) && !(handle == 2)) && 0 == in_encrypted) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 - InvariantResult [Line: 2702]: Loop Invariant Derived loop invariant: ((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___0) && !(handle == 2)) && 0 == in_encrypted) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 - InvariantResult [Line: 925]: Loop Invariant Derived loop invariant: (((((((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___0) && !(handle == 2)) && 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: 68]: Loop Invariant Derived loop invariant: ((((((((((((((((1 == msg && handle == chuck___0) && 1 == queue_empty) && 1 == handle) && 2 == rjh___0) && !(handle == 2)) && 1 == handle) && 0 == in_encrypted) && value == 2) && !(1 == chuck___0)) && 1 == msg) && __ste_email_to0 == 2) && msg == 1) && 2 == \result) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2 - InvariantResult [Line: 217]: Loop Invariant Derived loop invariant: ((((((((((((((handle == chuck___0 && 1 == queue_empty) && 1 == handle) && 2 == rjh___0) && !(handle == 2)) && 1 == handle) && 0 == in_encrypted) && value == 2) && !(1 == chuck___0)) && 1 == msg) && __ste_email_to0 == 2) && 2 == \result) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2 - InvariantResult [Line: 2197]: Loop Invariant Derived loop invariant: ((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___0) && !(handle == 2)) && 0 == in_encrypted) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 - InvariantResult [Line: 2794]: Loop Invariant Derived loop invariant: ((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___0) && !(handle == 2)) && 0 == in_encrypted) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 - InvariantResult [Line: 2677]: Loop Invariant Derived loop invariant: ((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___0) && !(handle == 2)) && 0 == in_encrypted) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 - InvariantResult [Line: 2150]: Loop Invariant Derived loop invariant: (((((((((((((((((1 == msg && handle == chuck___0) && 1 == queue_empty) && 1 == handle) && handle == 2) && 2 == rjh___0) && !(handle == 2)) && 2 == client) && 1 == handle) && value == 2) && !(1 == chuck___0)) && 1 == msg) && __ste_email_to0 == 2) && msg == 1) && 2 == \result) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2 - InvariantResult [Line: 2691]: Loop Invariant Derived loop invariant: ((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___0) && !(handle == 2)) && 0 == in_encrypted) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 - InvariantResult [Line: 618]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2150]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 266]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 618]: Loop Invariant Derived loop invariant: (((((((((((((((((1 == msg && handle == chuck___0) && 1 == queue_empty) && 1 == handle) && 2 == rjh___0) && 2 == client) && !(handle == 2)) && 1 == handle) && 0 == in_encrypted) && value == 2) && !(1 == chuck___0)) && 1 == msg) && __ste_email_to0 == 2) && msg == 1) && 2 == \result) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2 - InvariantResult [Line: 2585]: Loop Invariant Derived loop invariant: (((((((((((((((1 == msg && handle == chuck___0) && 1 == queue_empty) && 1 == handle) && 2 == rjh___0) && !(handle == 2)) && 1 == handle) && 0 == in_encrypted) && value == 2) && !(1 == chuck___0)) && 1 == msg) && __ste_email_to0 == 2) && 2 == \result) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2 - InvariantResult [Line: 618]: Loop Invariant Derived loop invariant: (((((((((((((((((1 == msg && handle == chuck___0) && 1 == queue_empty) && 1 == handle) && handle == 2) && 2 == rjh___0) && 2 == client) && !(handle == 2)) && 1 == handle) && value == 2) && !(1 == chuck___0)) && 1 == msg) && __ste_email_to0 == 2) && msg == 1) && 2 == \result) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2 - InvariantResult [Line: 485]: Loop Invariant Derived loop invariant: ((((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___0) && !(handle == 2)) && 2 == to) && 0 == in_encrypted) && !(__ste_email_to0 == 1)) && 1 == msg) && !(1 == chuck___0)) && rjh == 2 - InvariantResult [Line: 266]: Loop Invariant Derived loop invariant: (((((((((((((((((1 == msg && handle == chuck___0) && 1 == queue_empty) && 1 == handle) && handle == 2) && 2 == rjh___0) && 2 == client) && !(handle == 2)) && 1 == handle) && value == 2) && !(1 == chuck___0)) && 1 == msg) && __ste_email_to0 == 2) && msg == 1) && 2 == \result) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2 - InvariantResult [Line: 2780]: Loop Invariant Derived loop invariant: ((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___0) && !(handle == 2)) && 0 == in_encrypted) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 - InvariantResult [Line: 2221]: Loop Invariant Derived loop invariant: ((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___0) && !(handle == 2)) && 0 == in_encrypted) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 - InvariantResult [Line: 655]: Loop Invariant Derived loop invariant: (((((((((((((((((1 == msg && handle == chuck___0) && 1 == queue_empty) && 1 == handle) && handle == 2) && 2 == rjh___0) && 2 == client) && !(handle == 2)) && 1 == handle) && value == 2) && !(1 == chuck___0)) && 1 == msg) && __ste_email_to0 == 2) && msg == 1) && 2 == \result) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2 - InvariantResult [Line: 655]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 522]: Loop Invariant Derived loop invariant: ((((((((((handle == chuck___0 && __ste_email_to0 == 2) && 1 == queue_empty) && 2 == rjh___0) && !(handle == 2)) && 1 == handle) && 2 == to) && 0 == in_encrypted) && value == 2) && 1 == msg) && !(1 == chuck___0)) && rjh == 2 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 383 locations, 2 error locations. Result: SAFE, OverallTime: 19.1s, OverallIterations: 18, TraceHistogramMax: 2, AutomataDifference: 4.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 12.1s, HoareTripleCheckerStatistics: 12637 SDtfs, 22440 SDslu, 25073 SDs, 0 SdLazy, 926 SolverSat, 82 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 138 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2673occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 18 MinimizatonAttempts, 4239 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 95 LocationsWithAnnotation, 95 PreInvPairs, 694 NumberOfFragments, 2779 HoareAnnotationTreeSize, 95 FomulaSimplifications, 927846 FormulaSimplificationTreeSizeReduction, 2.9s HoareSimplificationTime, 95 FomulaSimplificationsInter, 629072 FormulaSimplificationTreeSizeReductionInter, 9.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 1132 NumberOfCodeBlocks, 1132 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1114 ConstructedInterpolants, 0 QuantifiedInterpolants, 140669 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 22/22 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...