./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/product-lines/email_spec0_product19_true-unreach-call_true-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_d194db7a-2445-4436-9ab1-45e8c82eb792/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_d194db7a-2445-4436-9ab1-45e8c82eb792/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_d194db7a-2445-4436-9ab1-45e8c82eb792/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_d194db7a-2445-4436-9ab1-45e8c82eb792/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/product-lines/email_spec0_product19_true-unreach-call_true-termination.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_d194db7a-2445-4436-9ab1-45e8c82eb792/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_d194db7a-2445-4436-9ab1-45e8c82eb792/bin-2019/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 fa70b27961ca39062c0ebe653ea06e8e7d50aca3 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 10:28:00,391 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 10:28:00,392 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 10:28:00,399 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 10:28:00,399 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 10:28:00,399 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 10:28:00,400 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 10:28:00,401 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 10:28:00,402 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 10:28:00,402 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 10:28:00,403 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 10:28:00,403 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 10:28:00,404 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 10:28:00,404 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 10:28:00,405 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 10:28:00,406 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 10:28:00,406 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 10:28:00,407 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 10:28:00,409 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 10:28:00,410 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 10:28:00,410 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 10:28:00,411 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 10:28:00,413 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 10:28:00,413 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 10:28:00,413 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 10:28:00,414 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 10:28:00,414 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 10:28:00,415 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 10:28:00,415 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 10:28:00,416 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 10:28:00,416 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 10:28:00,417 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 10:28:00,417 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 10:28:00,417 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 10:28:00,418 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 10:28:00,418 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 10:28:00,418 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_d194db7a-2445-4436-9ab1-45e8c82eb792/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-18 10:28:00,428 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 10:28:00,428 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 10:28:00,429 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 10:28:00,429 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-18 10:28:00,429 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-18 10:28:00,429 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-18 10:28:00,429 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-18 10:28:00,429 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-18 10:28:00,430 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-18 10:28:00,430 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-18 10:28:00,430 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-18 10:28:00,430 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-18 10:28:00,430 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-18 10:28:00,430 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 10:28:00,430 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 10:28:00,430 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 10:28:00,431 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 10:28:00,431 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 10:28:00,431 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 10:28:00,431 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 10:28:00,431 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 10:28:00,431 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 10:28:00,431 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 10:28:00,432 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 10:28:00,432 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 10:28:00,432 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 10:28:00,432 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 10:28:00,432 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 10:28:00,432 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 10:28:00,432 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 10:28:00,432 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 10:28:00,432 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 10:28:00,432 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 10:28:00,432 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-18 10:28:00,433 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 10:28:00,433 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 10:28:00,433 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 10:28:00,433 INFO L133 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_d194db7a-2445-4436-9ab1-45e8c82eb792/bin-2019/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 -> fa70b27961ca39062c0ebe653ea06e8e7d50aca3 [2018-11-18 10:28:00,453 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 10:28:00,461 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 10:28:00,463 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 10:28:00,464 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 10:28:00,464 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 10:28:00,465 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_d194db7a-2445-4436-9ab1-45e8c82eb792/bin-2019/utaipan/../../sv-benchmarks/c/product-lines/email_spec0_product19_true-unreach-call_true-termination.cil.c [2018-11-18 10:28:00,500 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d194db7a-2445-4436-9ab1-45e8c82eb792/bin-2019/utaipan/data/178892ba1/000cd07aceea4db2b053056bc05fa576/FLAGc9ea52021 [2018-11-18 10:28:00,976 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 10:28:00,977 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_d194db7a-2445-4436-9ab1-45e8c82eb792/sv-benchmarks/c/product-lines/email_spec0_product19_true-unreach-call_true-termination.cil.c [2018-11-18 10:28:00,989 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d194db7a-2445-4436-9ab1-45e8c82eb792/bin-2019/utaipan/data/178892ba1/000cd07aceea4db2b053056bc05fa576/FLAGc9ea52021 [2018-11-18 10:28:00,999 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_d194db7a-2445-4436-9ab1-45e8c82eb792/bin-2019/utaipan/data/178892ba1/000cd07aceea4db2b053056bc05fa576 [2018-11-18 10:28:01,001 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 10:28:01,002 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 10:28:01,002 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 10:28:01,003 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 10:28:01,005 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 10:28:01,005 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:28:01" (1/1) ... [2018-11-18 10:28:01,007 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f86fe87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:28:01, skipping insertion in model container [2018-11-18 10:28:01,007 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:28:01" (1/1) ... [2018-11-18 10:28:01,013 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 10:28:01,055 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 10:28:01,392 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 10:28:01,400 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 10:28:01,533 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 10:28:01,569 INFO L195 MainTranslator]: Completed translation [2018-11-18 10:28:01,569 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:28:01 WrapperNode [2018-11-18 10:28:01,569 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 10:28:01,570 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 10:28:01,570 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 10:28:01,570 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 10:28:01,575 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:28:01" (1/1) ... [2018-11-18 10:28:01,596 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:28:01" (1/1) ... [2018-11-18 10:28:01,604 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 10:28:01,604 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 10:28:01,604 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 10:28:01,605 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 10:28:01,612 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:28:01" (1/1) ... [2018-11-18 10:28:01,612 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:28:01" (1/1) ... [2018-11-18 10:28:01,618 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:28:01" (1/1) ... [2018-11-18 10:28:01,618 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:28:01" (1/1) ... [2018-11-18 10:28:01,638 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:28:01" (1/1) ... [2018-11-18 10:28:01,646 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:28:01" (1/1) ... [2018-11-18 10:28:01,653 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:28:01" (1/1) ... [2018-11-18 10:28:01,659 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 10:28:01,660 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 10:28:01,660 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 10:28:01,660 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 10:28:01,661 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:28:01" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d194db7a-2445-4436-9ab1-45e8c82eb792/bin-2019/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 [2018-11-18 10:28:01,693 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_client [2018-11-18 10:28:01,693 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_client [2018-11-18 10:28:01,693 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Forward [2018-11-18 10:28:01,693 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Forward [2018-11-18 10:28:01,693 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyChange [2018-11-18 10:28:01,693 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyChange [2018-11-18 10:28:01,693 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSigned [2018-11-18 10:28:01,693 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSigned [2018-11-18 10:28:01,694 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2018-11-18 10:28:01,694 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2018-11-18 10:28:01,694 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAdd [2018-11-18 10:28:01,694 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAdd [2018-11-18 10:28:01,694 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 10:28:01,694 INFO L130 BoogieDeclarations]: Found specification of procedure bobToRjh [2018-11-18 10:28:01,694 INFO L138 BoogieDeclarations]: Found implementation of procedure bobToRjh [2018-11-18 10:28:01,694 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob [2018-11-18 10:28:01,695 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob [2018-11-18 10:28:01,695 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2018-11-18 10:28:01,695 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2018-11-18 10:28:01,695 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__wrappee__Base [2018-11-18 10:28:01,695 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__wrappee__Base [2018-11-18 10:28:01,695 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Keys [2018-11-18 10:28:01,695 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Keys [2018-11-18 10:28:01,695 INFO L130 BoogieDeclarations]: Found specification of procedure createEmail [2018-11-18 10:28:01,695 INFO L138 BoogieDeclarations]: Found implementation of procedure createEmail [2018-11-18 10:28:01,695 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2018-11-18 10:28:01,696 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2018-11-18 10:28:01,696 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_email [2018-11-18 10:28:01,696 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_email [2018-11-18 10:28:01,696 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Sign [2018-11-18 10:28:01,696 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Sign [2018-11-18 10:28:01,696 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2018-11-18 10:28:01,696 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2018-11-18 10:28:01,696 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2018-11-18 10:28:01,696 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2018-11-18 10:28:01,696 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__wrappee__Base [2018-11-18 10:28:01,696 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__wrappee__Base [2018-11-18 10:28:01,696 INFO L130 BoogieDeclarations]: Found specification of procedure getClientId [2018-11-18 10:28:01,697 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientId [2018-11-18 10:28:01,697 INFO L130 BoogieDeclarations]: Found specification of procedure deliver [2018-11-18 10:28:01,697 INFO L138 BoogieDeclarations]: Found implementation of procedure deliver [2018-11-18 10:28:01,697 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2018-11-18 10:28:01,697 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2018-11-18 10:28:01,697 INFO L130 BoogieDeclarations]: Found specification of procedure verify [2018-11-18 10:28:01,697 INFO L138 BoogieDeclarations]: Found implementation of procedure verify [2018-11-18 10:28:01,697 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2018-11-18 10:28:01,697 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2018-11-18 10:28:01,698 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2018-11-18 10:28:01,698 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2018-11-18 10:28:01,698 INFO L130 BoogieDeclarations]: Found specification of procedure forward [2018-11-18 10:28:01,698 INFO L138 BoogieDeclarations]: Found implementation of procedure forward [2018-11-18 10:28:01,698 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringSize [2018-11-18 10:28:01,698 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringSize [2018-11-18 10:28:01,698 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAdd [2018-11-18 10:28:01,698 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAdd [2018-11-18 10:28:01,698 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2018-11-18 10:28:01,699 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__wrappee__Base [2018-11-18 10:28:01,699 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__wrappee__Base [2018-11-18 10:28:01,699 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 10:28:01,699 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 10:28:01,699 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAddRjh [2018-11-18 10:28:01,699 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAddRjh [2018-11-18 10:28:01,699 INFO L130 BoogieDeclarations]: Found specification of procedure rjhEnableForwarding [2018-11-18 10:28:01,699 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhEnableForwarding [2018-11-18 10:28:01,699 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__DecryptForward_spec__1 [2018-11-18 10:28:01,699 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__DecryptForward_spec__1 [2018-11-18 10:28:01,699 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2018-11-18 10:28:01,700 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2018-11-18 10:28:01,700 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringSize [2018-11-18 10:28:01,700 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringSize [2018-11-18 10:28:01,700 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2018-11-18 10:28:01,700 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2018-11-18 10:28:01,700 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2018-11-18 10:28:01,700 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2018-11-18 10:28:01,700 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyChange [2018-11-18 10:28:01,700 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyChange [2018-11-18 10:28:01,701 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2018-11-18 10:28:01,701 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2018-11-18 10:28:01,701 INFO L130 BoogieDeclarations]: Found specification of procedure mail [2018-11-18 10:28:01,701 INFO L138 BoogieDeclarations]: Found implementation of procedure mail [2018-11-18 10:28:01,701 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2018-11-18 10:28:01,701 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2018-11-18 10:28:01,701 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2018-11-18 10:28:01,701 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2018-11-18 10:28:01,701 INFO L130 BoogieDeclarations]: Found specification of procedure sign [2018-11-18 10:28:01,702 INFO L138 BoogieDeclarations]: Found implementation of procedure sign [2018-11-18 10:28:01,702 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailId [2018-11-18 10:28:01,702 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailId [2018-11-18 10:28:01,702 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 10:28:01,702 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 10:28:01,702 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh [2018-11-18 10:28:01,702 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh [2018-11-18 10:28:01,702 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Forward [2018-11-18 10:28:01,702 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Forward [2018-11-18 10:28:01,702 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Keys [2018-11-18 10:28:01,703 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Keys [2018-11-18 10:28:01,703 INFO L130 BoogieDeclarations]: Found specification of procedure getClientForwardReceiver [2018-11-18 10:28:01,703 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientForwardReceiver [2018-11-18 10:28:01,703 INFO L130 BoogieDeclarations]: Found specification of procedure incoming [2018-11-18 10:28:01,703 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming [2018-11-18 10:28:01,703 INFO L130 BoogieDeclarations]: Found specification of procedure rjhDeletePrivateKey [2018-11-18 10:28:01,703 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhDeletePrivateKey [2018-11-18 10:28:01,703 INFO L130 BoogieDeclarations]: Found specification of procedure test [2018-11-18 10:28:01,703 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2018-11-18 10:28:01,704 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringUser [2018-11-18 10:28:01,704 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringUser [2018-11-18 10:28:01,704 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2018-11-18 10:28:01,704 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2018-11-18 10:28:01,704 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2018-11-18 10:28:01,704 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2018-11-18 10:28:01,704 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2018-11-18 10:28:01,704 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2018-11-18 10:28:01,704 INFO L130 BoogieDeclarations]: Found specification of procedure setClientForwardReceiver [2018-11-18 10:28:01,704 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientForwardReceiver [2018-11-18 10:28:01,705 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2018-11-18 10:28:01,705 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2018-11-18 10:28:01,705 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2018-11-18 10:28:01,705 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2018-11-18 10:28:01,705 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2018-11-18 10:28:01,705 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2018-11-18 10:28:01,705 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck [2018-11-18 10:28:01,705 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck [2018-11-18 10:28:01,705 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2018-11-18 10:28:01,705 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2018-11-18 10:28:01,706 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2018-11-18 10:28:01,706 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2018-11-18 10:28:01,706 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2018-11-18 10:28:01,706 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2018-11-18 10:28:01,706 INFO L130 BoogieDeclarations]: Found specification of procedure printMail [2018-11-18 10:28:01,706 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail [2018-11-18 10:28:01,706 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2018-11-18 10:28:01,706 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2018-11-18 10:28:01,706 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSignatureVerified [2018-11-18 10:28:01,707 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSignatureVerified [2018-11-18 10:28:01,707 INFO L130 BoogieDeclarations]: Found specification of procedure is_queue_empty [2018-11-18 10:28:01,707 INFO L138 BoogieDeclarations]: Found implementation of procedure is_queue_empty [2018-11-18 10:28:01,707 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringPublicKey [2018-11-18 10:28:01,707 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringPublicKey [2018-11-18 10:28:01,707 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSignKey [2018-11-18 10:28:01,707 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSignKey [2018-11-18 10:28:01,707 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2018-11-18 10:28:01,707 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2018-11-18 10:28:01,707 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2018-11-18 10:28:01,708 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2018-11-18 10:28:01,708 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 10:28:01,708 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 10:28:02,504 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 10:28:02,504 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:28:02 BoogieIcfgContainer [2018-11-18 10:28:02,504 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 10:28:02,505 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 10:28:02,505 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 10:28:02,507 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 10:28:02,507 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 10:28:01" (1/3) ... [2018-11-18 10:28:02,507 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2eafd664 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:28:02, skipping insertion in model container [2018-11-18 10:28:02,508 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:28:01" (2/3) ... [2018-11-18 10:28:02,508 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2eafd664 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:28:02, skipping insertion in model container [2018-11-18 10:28:02,508 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:28:02" (3/3) ... [2018-11-18 10:28:02,509 INFO L112 eAbstractionObserver]: Analyzing ICFG email_spec0_product19_true-unreach-call_true-termination.cil.c [2018-11-18 10:28:02,515 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 10:28:02,521 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 10:28:02,530 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 10:28:02,554 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 10:28:02,554 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 10:28:02,554 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 10:28:02,555 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 10:28:02,555 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 10:28:02,555 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 10:28:02,555 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 10:28:02,555 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 10:28:02,575 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states. [2018-11-18 10:28:02,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-11-18 10:28:02,590 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:28:02,591 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:28:02,594 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:28:02,599 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:28:02,599 INFO L82 PathProgramCache]: Analyzing trace with hash -1478557778, now seen corresponding path program 1 times [2018-11-18 10:28:02,601 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:28:02,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:28:02,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:28:02,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:28:02,631 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:28:02,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:28:02,926 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-11-18 10:28:02,928 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:28:02,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 10:28:02,928 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:28:02,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-18 10:28:02,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 10:28:02,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 10:28:02,941 INFO L87 Difference]: Start difference. First operand 480 states. Second operand 2 states. [2018-11-18 10:28:02,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:28:02,990 INFO L93 Difference]: Finished difference Result 725 states and 947 transitions. [2018-11-18 10:28:02,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 10:28:02,991 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 182 [2018-11-18 10:28:02,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:28:03,004 INFO L225 Difference]: With dead ends: 725 [2018-11-18 10:28:03,004 INFO L226 Difference]: Without dead ends: 469 [2018-11-18 10:28:03,008 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 10:28:03,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2018-11-18 10:28:03,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 469. [2018-11-18 10:28:03,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 469 states. [2018-11-18 10:28:03,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 617 transitions. [2018-11-18 10:28:03,064 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 617 transitions. Word has length 182 [2018-11-18 10:28:03,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:28:03,065 INFO L480 AbstractCegarLoop]: Abstraction has 469 states and 617 transitions. [2018-11-18 10:28:03,065 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-18 10:28:03,065 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 617 transitions. [2018-11-18 10:28:03,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-11-18 10:28:03,070 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:28:03,070 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:28:03,071 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:28:03,071 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:28:03,071 INFO L82 PathProgramCache]: Analyzing trace with hash -1906301330, now seen corresponding path program 1 times [2018-11-18 10:28:03,071 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:28:03,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:28:03,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:28:03,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:28:03,072 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:28:03,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:28:03,202 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-11-18 10:28:03,203 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:28:03,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:28:03,203 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:28:03,204 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:28:03,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:28:03,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:28:03,205 INFO L87 Difference]: Start difference. First operand 469 states and 617 transitions. Second operand 3 states. [2018-11-18 10:28:03,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:28:03,257 INFO L93 Difference]: Finished difference Result 709 states and 914 transitions. [2018-11-18 10:28:03,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:28:03,258 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 184 [2018-11-18 10:28:03,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:28:03,261 INFO L225 Difference]: With dead ends: 709 [2018-11-18 10:28:03,261 INFO L226 Difference]: Without dead ends: 473 [2018-11-18 10:28:03,263 INFO L604 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 [2018-11-18 10:28:03,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2018-11-18 10:28:03,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 472. [2018-11-18 10:28:03,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 472 states. [2018-11-18 10:28:03,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 620 transitions. [2018-11-18 10:28:03,287 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 620 transitions. Word has length 184 [2018-11-18 10:28:03,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:28:03,288 INFO L480 AbstractCegarLoop]: Abstraction has 472 states and 620 transitions. [2018-11-18 10:28:03,288 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:28:03,288 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 620 transitions. [2018-11-18 10:28:03,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-11-18 10:28:03,291 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:28:03,291 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:28:03,291 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:28:03,292 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:28:03,292 INFO L82 PathProgramCache]: Analyzing trace with hash 1175632719, now seen corresponding path program 1 times [2018-11-18 10:28:03,292 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:28:03,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:28:03,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:28:03,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:28:03,293 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:28:03,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:28:03,397 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-11-18 10:28:03,397 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:28:03,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:28:03,398 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:28:03,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:28:03,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:28:03,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:28:03,399 INFO L87 Difference]: Start difference. First operand 472 states and 620 transitions. Second operand 3 states. [2018-11-18 10:28:03,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:28:03,433 INFO L93 Difference]: Finished difference Result 920 states and 1238 transitions. [2018-11-18 10:28:03,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:28:03,435 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 191 [2018-11-18 10:28:03,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:28:03,438 INFO L225 Difference]: With dead ends: 920 [2018-11-18 10:28:03,438 INFO L226 Difference]: Without dead ends: 514 [2018-11-18 10:28:03,440 INFO L604 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 [2018-11-18 10:28:03,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2018-11-18 10:28:03,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 513. [2018-11-18 10:28:03,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 513 states. [2018-11-18 10:28:03,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 690 transitions. [2018-11-18 10:28:03,459 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 690 transitions. Word has length 191 [2018-11-18 10:28:03,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:28:03,460 INFO L480 AbstractCegarLoop]: Abstraction has 513 states and 690 transitions. [2018-11-18 10:28:03,460 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:28:03,460 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 690 transitions. [2018-11-18 10:28:03,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-11-18 10:28:03,463 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:28:03,463 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:28:03,463 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:28:03,463 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:28:03,463 INFO L82 PathProgramCache]: Analyzing trace with hash -1989064870, now seen corresponding path program 1 times [2018-11-18 10:28:03,464 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:28:03,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:28:03,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:28:03,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:28:03,464 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:28:03,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:28:03,620 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-18 10:28:03,621 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:28:03,621 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 10:28:03,621 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 193 with the following transitions: [2018-11-18 10:28:03,623 INFO L202 CegarAbsIntRunner]: [2], [3], [4], [6], [21], [24], [27], [44], [46], [49], [53], [64], [68], [71], [81], [84], [98], [101], [111], [134], [150], [153], [154], [155], [157], [158], [160], [164], [167], [177], [178], [182], [185], [186], [189], [193], [199], [203], [205], [207], [210], [217], [224], [227], [363], [366], [372], [375], [377], [467], [470], [479], [480], [481], [482], [536], [538], [557], [561], [562], [565], [575], [586], [587], [598], [601], [640], [642], [645], [647], [659], [681], [692], [695], [709], [720], [740], [743], [752], [833], [835], [836], [837], [845], [847], [849], [851], [852], [856], [858], [863], [897], [900], [914], [917], [918], [919], [921], [922], [923], [924], [925], [926], [927], [929], [930], [935], [936], [937], [938], [939], [940], [941], [942], [943], [947], [948], [949], [950], [971], [981], [982], [983], [984], [985], [986], [987], [988], [989], [990], [991], [993], [994], [995], [997], [998], [999], [1000], [1021], [1023], [1024], [1025], [1026], [1027], [1028], [1029], [1035], [1036], [1037], [1038], [1039], [1040], [1041], [1043], [1044], [1067], [1085], [1086], [1095], [1096], [1097], [1098], [1099], [1100], [1101], [1102], [1103], [1105], [1106], [1107] [2018-11-18 10:28:03,655 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 10:28:03,655 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 10:28:04,830 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 10:28:04,831 INFO L272 AbstractInterpreter]: Visited 44 different actions 46 times. Never merged. Never widened. Performed 5211 root evaluator evaluations with a maximum evaluation depth of 3. Performed 5211 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 371 variables. [2018-11-18 10:28:04,845 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:28:04,845 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 10:28:05,251 INFO L227 lantSequenceWeakener]: Weakened 44 states. On average, predicates are now at 97.63% of their original sizes. [2018-11-18 10:28:05,251 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 10:28:05,430 INFO L415 sIntCurrentIteration]: We unified 191 AI predicates to 191 [2018-11-18 10:28:05,430 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 10:28:05,431 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 10:28:05,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [8] total 28 [2018-11-18 10:28:05,431 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:28:05,432 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-18 10:28:05,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-18 10:28:05,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=395, Unknown=0, NotChecked=0, Total=462 [2018-11-18 10:28:05,432 INFO L87 Difference]: Start difference. First operand 513 states and 690 transitions. Second operand 22 states. [2018-11-18 10:28:16,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:28:16,381 INFO L93 Difference]: Finished difference Result 1461 states and 1992 transitions. [2018-11-18 10:28:16,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-18 10:28:16,381 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 192 [2018-11-18 10:28:16,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:28:16,383 INFO L225 Difference]: With dead ends: 1461 [2018-11-18 10:28:16,383 INFO L226 Difference]: Without dead ends: 973 [2018-11-18 10:28:16,385 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 203 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=151, Invalid=971, Unknown=0, NotChecked=0, Total=1122 [2018-11-18 10:28:16,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 973 states. [2018-11-18 10:28:16,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 973 to 737. [2018-11-18 10:28:16,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 737 states. [2018-11-18 10:28:16,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 737 states and 1027 transitions. [2018-11-18 10:28:16,410 INFO L78 Accepts]: Start accepts. Automaton has 737 states and 1027 transitions. Word has length 192 [2018-11-18 10:28:16,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:28:16,411 INFO L480 AbstractCegarLoop]: Abstraction has 737 states and 1027 transitions. [2018-11-18 10:28:16,411 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-18 10:28:16,411 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 1027 transitions. [2018-11-18 10:28:16,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-11-18 10:28:16,414 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:28:16,414 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:28:16,415 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:28:16,415 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:28:16,415 INFO L82 PathProgramCache]: Analyzing trace with hash 241250057, now seen corresponding path program 1 times [2018-11-18 10:28:16,415 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:28:16,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:28:16,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:28:16,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:28:16,416 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:28:16,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:28:16,548 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-18 10:28:16,548 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:28:16,548 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 10:28:16,548 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 194 with the following transitions: [2018-11-18 10:28:16,549 INFO L202 CegarAbsIntRunner]: [2], [3], [4], [6], [21], [24], [27], [44], [46], [49], [53], [64], [68], [71], [81], [84], [98], [101], [111], [134], [150], [153], [154], [155], [157], [158], [160], [164], [167], [177], [178], [182], [185], [186], [189], [193], [199], [203], [205], [207], [210], [217], [224], [227], [363], [366], [372], [375], [377], [467], [470], [479], [480], [481], [482], [536], [538], [557], [561], [562], [565], [575], [586], [587], [598], [601], [640], [642], [645], [647], [659], [681], [692], [695], [709], [720], [740], [743], [752], [833], [835], [836], [837], [845], [847], [849], [851], [852], [856], [858], [863], [897], [900], [902], [905], [914], [917], [918], [919], [921], [922], [923], [924], [925], [926], [927], [929], [930], [935], [936], [937], [938], [939], [940], [941], [942], [943], [947], [948], [949], [950], [971], [981], [982], [983], [984], [985], [986], [987], [988], [989], [990], [991], [993], [994], [995], [997], [998], [999], [1000], [1021], [1023], [1024], [1025], [1026], [1027], [1028], [1029], [1035], [1036], [1037], [1038], [1039], [1040], [1041], [1043], [1044], [1067], [1085], [1086], [1095], [1096], [1097], [1098], [1099], [1100], [1101], [1102], [1103], [1105], [1106], [1107] [2018-11-18 10:28:16,553 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 10:28:16,554 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 10:28:17,061 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 10:28:17,061 INFO L272 AbstractInterpreter]: Visited 50 different actions 56 times. Never merged. Never widened. Performed 5595 root evaluator evaluations with a maximum evaluation depth of 3. Performed 5595 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 371 variables. [2018-11-18 10:28:17,069 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:28:17,069 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 10:28:17,317 INFO L227 lantSequenceWeakener]: Weakened 52 states. On average, predicates are now at 97.66% of their original sizes. [2018-11-18 10:28:17,318 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 10:28:17,518 INFO L415 sIntCurrentIteration]: We unified 192 AI predicates to 192 [2018-11-18 10:28:17,519 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 10:28:17,519 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 10:28:17,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [8] total 30 [2018-11-18 10:28:17,519 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:28:17,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-18 10:28:17,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-18 10:28:17,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=479, Unknown=0, NotChecked=0, Total=552 [2018-11-18 10:28:17,520 INFO L87 Difference]: Start difference. First operand 737 states and 1027 transitions. Second operand 24 states. [2018-11-18 10:28:29,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:28:29,066 INFO L93 Difference]: Finished difference Result 1663 states and 2300 transitions. [2018-11-18 10:28:29,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-18 10:28:29,067 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 193 [2018-11-18 10:28:29,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:28:29,069 INFO L225 Difference]: With dead ends: 1663 [2018-11-18 10:28:29,069 INFO L226 Difference]: Without dead ends: 978 [2018-11-18 10:28:29,070 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 206 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=173, Invalid=1233, Unknown=0, NotChecked=0, Total=1406 [2018-11-18 10:28:29,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 978 states. [2018-11-18 10:28:29,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 978 to 742. [2018-11-18 10:28:29,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 742 states. [2018-11-18 10:28:29,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 742 states and 1031 transitions. [2018-11-18 10:28:29,093 INFO L78 Accepts]: Start accepts. Automaton has 742 states and 1031 transitions. Word has length 193 [2018-11-18 10:28:29,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:28:29,093 INFO L480 AbstractCegarLoop]: Abstraction has 742 states and 1031 transitions. [2018-11-18 10:28:29,093 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-18 10:28:29,093 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 1031 transitions. [2018-11-18 10:28:29,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-11-18 10:28:29,096 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:28:29,096 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:28:29,097 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:28:29,097 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:28:29,097 INFO L82 PathProgramCache]: Analyzing trace with hash 993771541, now seen corresponding path program 1 times [2018-11-18 10:28:29,097 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:28:29,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:28:29,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:28:29,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:28:29,098 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:28:29,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:28:29,212 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-18 10:28:29,212 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:28:29,212 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 10:28:29,213 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 195 with the following transitions: [2018-11-18 10:28:29,213 INFO L202 CegarAbsIntRunner]: [2], [3], [4], [6], [21], [24], [27], [44], [46], [49], [53], [64], [68], [71], [81], [84], [98], [101], [111], [134], [150], [153], [154], [155], [157], [158], [160], [164], [167], [177], [178], [182], [185], [186], [189], [193], [199], [203], [205], [207], [210], [217], [224], [227], [363], [366], [372], [375], [377], [467], [470], [479], [480], [481], [482], [536], [538], [557], [561], [562], [565], [575], [586], [587], [598], [601], [640], [642], [645], [647], [659], [681], [692], [695], [697], [700], [709], [720], [740], [743], [752], [833], [835], [836], [837], [845], [847], [849], [851], [852], [856], [858], [863], [897], [900], [902], [905], [914], [917], [918], [919], [921], [922], [923], [924], [925], [926], [927], [929], [930], [935], [936], [937], [938], [939], [940], [941], [942], [943], [947], [948], [949], [950], [971], [981], [982], [983], [984], [985], [986], [987], [988], [989], [990], [991], [993], [994], [995], [997], [998], [999], [1000], [1021], [1023], [1024], [1025], [1026], [1027], [1028], [1029], [1035], [1036], [1037], [1038], [1039], [1040], [1041], [1043], [1044], [1067], [1085], [1086], [1095], [1096], [1097], [1098], [1099], [1100], [1101], [1102], [1103], [1105], [1106], [1107] [2018-11-18 10:28:29,216 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 10:28:29,216 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 10:28:29,714 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 10:28:29,714 INFO L272 AbstractInterpreter]: Visited 61 different actions 73 times. Never merged. Never widened. Performed 6718 root evaluator evaluations with a maximum evaluation depth of 3. Performed 6718 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 371 variables. [2018-11-18 10:28:29,715 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:28:29,715 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 10:28:29,979 INFO L227 lantSequenceWeakener]: Weakened 65 states. On average, predicates are now at 97.75% of their original sizes. [2018-11-18 10:28:29,979 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 10:28:30,212 INFO L415 sIntCurrentIteration]: We unified 193 AI predicates to 193 [2018-11-18 10:28:30,212 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 10:28:30,212 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 10:28:30,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [31] imperfect sequences [8] total 37 [2018-11-18 10:28:30,212 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:28:30,213 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-18 10:28:30,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-18 10:28:30,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=843, Unknown=0, NotChecked=0, Total=930 [2018-11-18 10:28:30,213 INFO L87 Difference]: Start difference. First operand 742 states and 1031 transitions. Second operand 31 states. [2018-11-18 10:28:43,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:28:43,896 INFO L93 Difference]: Finished difference Result 1651 states and 2282 transitions. [2018-11-18 10:28:43,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-18 10:28:43,896 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 194 [2018-11-18 10:28:43,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:28:43,899 INFO L225 Difference]: With dead ends: 1651 [2018-11-18 10:28:43,899 INFO L226 Difference]: Without dead ends: 978 [2018-11-18 10:28:43,901 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 214 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 460 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=256, Invalid=2396, Unknown=0, NotChecked=0, Total=2652 [2018-11-18 10:28:43,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 978 states. [2018-11-18 10:28:43,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 978 to 742. [2018-11-18 10:28:43,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 742 states. [2018-11-18 10:28:43,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 742 states and 1028 transitions. [2018-11-18 10:28:43,930 INFO L78 Accepts]: Start accepts. Automaton has 742 states and 1028 transitions. Word has length 194 [2018-11-18 10:28:43,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:28:43,930 INFO L480 AbstractCegarLoop]: Abstraction has 742 states and 1028 transitions. [2018-11-18 10:28:43,930 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-11-18 10:28:43,930 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 1028 transitions. [2018-11-18 10:28:43,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-11-18 10:28:43,933 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:28:43,933 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:28:43,934 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:28:43,934 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:28:43,934 INFO L82 PathProgramCache]: Analyzing trace with hash -1740253808, now seen corresponding path program 1 times [2018-11-18 10:28:43,934 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:28:43,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:28:43,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:28:43,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:28:43,935 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:28:43,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:28:44,050 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-11-18 10:28:44,050 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:28:44,050 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 10:28:44,050 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 197 with the following transitions: [2018-11-18 10:28:44,051 INFO L202 CegarAbsIntRunner]: [2], [3], [4], [6], [21], [24], [27], [44], [46], [49], [53], [64], [68], [71], [81], [84], [98], [101], [111], [134], [150], [153], [154], [155], [157], [158], [160], [164], [167], [177], [178], [182], [185], [186], [189], [193], [199], [203], [205], [207], [210], [217], [224], [227], [363], [366], [372], [375], [377], [467], [470], [479], [480], [481], [482], [536], [538], [557], [561], [562], [565], [575], [586], [587], [598], [601], [640], [642], [645], [647], [659], [681], [692], [695], [697], [700], [709], [720], [740], [743], [752], [833], [835], [836], [837], [845], [847], [849], [851], [852], [856], [858], [863], [897], [900], [902], [905], [907], [910], [914], [917], [918], [919], [921], [922], [923], [924], [925], [926], [927], [929], [930], [935], [936], [937], [938], [939], [940], [941], [942], [943], [947], [948], [949], [950], [971], [981], [982], [983], [984], [985], [986], [987], [988], [989], [990], [991], [993], [994], [995], [997], [998], [999], [1000], [1021], [1023], [1024], [1025], [1026], [1027], [1028], [1029], [1035], [1036], [1037], [1038], [1039], [1040], [1041], [1043], [1044], [1067], [1085], [1086], [1095], [1096], [1097], [1098], [1099], [1100], [1101], [1102], [1103], [1105], [1106], [1107] [2018-11-18 10:28:44,053 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 10:28:44,053 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 10:28:44,623 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 10:28:44,623 INFO L272 AbstractInterpreter]: Visited 67 different actions 85 times. Never merged. Never widened. Performed 7105 root evaluator evaluations with a maximum evaluation depth of 3. Performed 7105 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 371 variables. [2018-11-18 10:28:44,625 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:28:44,625 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 10:28:44,888 INFO L227 lantSequenceWeakener]: Weakened 74 states. On average, predicates are now at 97.63% of their original sizes. [2018-11-18 10:28:44,888 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 10:28:45,213 INFO L415 sIntCurrentIteration]: We unified 195 AI predicates to 195 [2018-11-18 10:28:45,213 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 10:28:45,213 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 10:28:45,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [36] imperfect sequences [8] total 42 [2018-11-18 10:28:45,213 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:28:45,213 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-11-18 10:28:45,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-11-18 10:28:45,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1137, Unknown=0, NotChecked=0, Total=1260 [2018-11-18 10:28:45,214 INFO L87 Difference]: Start difference. First operand 742 states and 1028 transitions. Second operand 36 states. [2018-11-18 10:29:00,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:29:00,144 INFO L93 Difference]: Finished difference Result 1652 states and 2282 transitions. [2018-11-18 10:29:00,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-11-18 10:29:00,144 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 196 [2018-11-18 10:29:00,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:29:00,147 INFO L225 Difference]: With dead ends: 1652 [2018-11-18 10:29:00,147 INFO L226 Difference]: Without dead ends: 984 [2018-11-18 10:29:00,149 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 221 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 746 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=376, Invalid=3406, Unknown=0, NotChecked=0, Total=3782 [2018-11-18 10:29:00,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 984 states. [2018-11-18 10:29:00,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 984 to 537. [2018-11-18 10:29:00,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 537 states. [2018-11-18 10:29:00,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 706 transitions. [2018-11-18 10:29:00,164 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 706 transitions. Word has length 196 [2018-11-18 10:29:00,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:29:00,164 INFO L480 AbstractCegarLoop]: Abstraction has 537 states and 706 transitions. [2018-11-18 10:29:00,164 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-11-18 10:29:00,164 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 706 transitions. [2018-11-18 10:29:00,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-11-18 10:29:00,166 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:29:00,166 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:29:00,167 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:29:00,167 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:29:00,167 INFO L82 PathProgramCache]: Analyzing trace with hash 2011568981, now seen corresponding path program 1 times [2018-11-18 10:29:00,167 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:29:00,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:29:00,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:29:00,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:29:00,168 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:29:00,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:29:00,268 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-11-18 10:29:00,268 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:29:00,268 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 10:29:00,269 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 199 with the following transitions: [2018-11-18 10:29:00,269 INFO L202 CegarAbsIntRunner]: [2], [3], [4], [6], [21], [24], [27], [44], [46], [49], [53], [64], [68], [71], [81], [84], [98], [101], [111], [134], [150], [153], [154], [155], [157], [158], [160], [164], [167], [177], [178], [182], [185], [186], [189], [193], [199], [203], [205], [207], [210], [217], [224], [227], [363], [366], [372], [375], [377], [467], [470], [479], [480], [481], [482], [536], [538], [557], [561], [562], [565], [575], [586], [587], [598], [601], [640], [642], [645], [647], [659], [681], [692], [695], [697], [700], [702], [705], [709], [720], [740], [743], [752], [833], [835], [836], [837], [845], [847], [849], [851], [852], [856], [858], [863], [897], [900], [902], [905], [907], [910], [914], [917], [918], [919], [921], [922], [923], [924], [925], [926], [927], [929], [930], [935], [936], [937], [938], [939], [940], [941], [942], [943], [947], [948], [949], [950], [971], [981], [982], [983], [984], [985], [986], [987], [988], [989], [990], [991], [993], [994], [995], [997], [998], [999], [1000], [1021], [1023], [1024], [1025], [1026], [1027], [1028], [1029], [1035], [1036], [1037], [1038], [1039], [1040], [1041], [1043], [1044], [1067], [1085], [1086], [1095], [1096], [1097], [1098], [1099], [1100], [1101], [1102], [1103], [1105], [1106], [1107] [2018-11-18 10:29:00,271 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 10:29:00,271 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 10:29:00,873 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 10:29:00,874 INFO L272 AbstractInterpreter]: Visited 86 different actions 114 times. Merged at 7 different actions 7 times. Never widened. Performed 7572 root evaluator evaluations with a maximum evaluation depth of 3. Performed 7572 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 387 variables. [2018-11-18 10:29:00,909 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:29:00,909 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 10:29:01,310 INFO L227 lantSequenceWeakener]: Weakened 96 states. On average, predicates are now at 97.62% of their original sizes. [2018-11-18 10:29:01,311 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 10:29:01,819 INFO L415 sIntCurrentIteration]: We unified 197 AI predicates to 197 [2018-11-18 10:29:01,819 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 10:29:01,819 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 10:29:01,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [43] imperfect sequences [8] total 49 [2018-11-18 10:29:01,819 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:29:01,820 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-11-18 10:29:01,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-11-18 10:29:01,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=1639, Unknown=0, NotChecked=0, Total=1806 [2018-11-18 10:29:01,820 INFO L87 Difference]: Start difference. First operand 537 states and 706 transitions. Second operand 43 states. [2018-11-18 10:29:31,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:29:31,414 INFO L93 Difference]: Finished difference Result 1760 states and 2407 transitions. [2018-11-18 10:29:31,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-11-18 10:29:31,414 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 198 [2018-11-18 10:29:31,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:29:31,418 INFO L225 Difference]: With dead ends: 1760 [2018-11-18 10:29:31,419 INFO L226 Difference]: Without dead ends: 1524 [2018-11-18 10:29:31,420 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 230 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1201 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=554, Invalid=5146, Unknown=0, NotChecked=0, Total=5700 [2018-11-18 10:29:31,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1524 states. [2018-11-18 10:29:31,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1524 to 1006. [2018-11-18 10:29:31,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1006 states. [2018-11-18 10:29:31,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1006 states to 1006 states and 1451 transitions. [2018-11-18 10:29:31,471 INFO L78 Accepts]: Start accepts. Automaton has 1006 states and 1451 transitions. Word has length 198 [2018-11-18 10:29:31,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:29:31,471 INFO L480 AbstractCegarLoop]: Abstraction has 1006 states and 1451 transitions. [2018-11-18 10:29:31,471 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-11-18 10:29:31,471 INFO L276 IsEmpty]: Start isEmpty. Operand 1006 states and 1451 transitions. [2018-11-18 10:29:31,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2018-11-18 10:29:31,474 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:29:31,474 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:29:31,475 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:29:31,475 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:29:31,475 INFO L82 PathProgramCache]: Analyzing trace with hash 589206809, now seen corresponding path program 1 times [2018-11-18 10:29:31,475 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:29:31,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:29:31,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:29:31,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:29:31,476 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:29:31,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:29:31,584 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-11-18 10:29:31,584 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:29:31,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:29:31,584 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:29:31,585 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:29:31,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:29:31,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:29:31,585 INFO L87 Difference]: Start difference. First operand 1006 states and 1451 transitions. Second operand 3 states. [2018-11-18 10:29:31,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:29:31,656 INFO L93 Difference]: Finished difference Result 2211 states and 3317 transitions. [2018-11-18 10:29:31,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:29:31,657 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 203 [2018-11-18 10:29:31,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:29:31,661 INFO L225 Difference]: With dead ends: 2211 [2018-11-18 10:29:31,661 INFO L226 Difference]: Without dead ends: 1305 [2018-11-18 10:29:31,663 INFO L604 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 [2018-11-18 10:29:31,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1305 states. [2018-11-18 10:29:31,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1305 to 1304. [2018-11-18 10:29:31,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1304 states. [2018-11-18 10:29:31,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1304 states to 1304 states and 1962 transitions. [2018-11-18 10:29:31,726 INFO L78 Accepts]: Start accepts. Automaton has 1304 states and 1962 transitions. Word has length 203 [2018-11-18 10:29:31,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:29:31,726 INFO L480 AbstractCegarLoop]: Abstraction has 1304 states and 1962 transitions. [2018-11-18 10:29:31,727 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:29:31,727 INFO L276 IsEmpty]: Start isEmpty. Operand 1304 states and 1962 transitions. [2018-11-18 10:29:31,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-11-18 10:29:31,731 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:29:31,731 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:29:31,731 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:29:31,731 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:29:31,731 INFO L82 PathProgramCache]: Analyzing trace with hash -1127899814, now seen corresponding path program 1 times [2018-11-18 10:29:31,731 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:29:31,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:29:31,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:29:31,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:29:31,732 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:29:31,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:29:31,830 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-11-18 10:29:31,830 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:29:31,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:29:31,831 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:29:31,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:29:31,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:29:31,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:29:31,831 INFO L87 Difference]: Start difference. First operand 1304 states and 1962 transitions. Second operand 3 states. [2018-11-18 10:29:31,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:29:31,906 INFO L93 Difference]: Finished difference Result 2963 states and 4611 transitions. [2018-11-18 10:29:31,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:29:31,906 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 204 [2018-11-18 10:29:31,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:29:31,912 INFO L225 Difference]: With dead ends: 2963 [2018-11-18 10:29:31,912 INFO L226 Difference]: Without dead ends: 1779 [2018-11-18 10:29:31,915 INFO L604 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 [2018-11-18 10:29:31,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1779 states. [2018-11-18 10:29:31,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1779 to 1778. [2018-11-18 10:29:31,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1778 states. [2018-11-18 10:29:32,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1778 states to 1778 states and 2768 transitions. [2018-11-18 10:29:32,001 INFO L78 Accepts]: Start accepts. Automaton has 1778 states and 2768 transitions. Word has length 204 [2018-11-18 10:29:32,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:29:32,002 INFO L480 AbstractCegarLoop]: Abstraction has 1778 states and 2768 transitions. [2018-11-18 10:29:32,002 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:29:32,002 INFO L276 IsEmpty]: Start isEmpty. Operand 1778 states and 2768 transitions. [2018-11-18 10:29:32,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2018-11-18 10:29:32,007 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:29:32,007 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:29:32,008 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:29:32,008 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:29:32,008 INFO L82 PathProgramCache]: Analyzing trace with hash -277514473, now seen corresponding path program 1 times [2018-11-18 10:29:32,008 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:29:32,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:29:32,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:29:32,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:29:32,009 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:29:32,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:29:32,112 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-11-18 10:29:32,112 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:29:32,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:29:32,113 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:29:32,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:29:32,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:29:32,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:29:32,113 INFO L87 Difference]: Start difference. First operand 1778 states and 2768 transitions. Second operand 3 states. [2018-11-18 10:29:32,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:29:32,227 INFO L93 Difference]: Finished difference Result 4329 states and 6951 transitions. [2018-11-18 10:29:32,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:29:32,227 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 205 [2018-11-18 10:29:32,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:29:32,233 INFO L225 Difference]: With dead ends: 4329 [2018-11-18 10:29:32,233 INFO L226 Difference]: Without dead ends: 2685 [2018-11-18 10:29:32,236 INFO L604 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 [2018-11-18 10:29:32,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2685 states. [2018-11-18 10:29:32,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2685 to 2684. [2018-11-18 10:29:32,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2684 states. [2018-11-18 10:29:32,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2684 states to 2684 states and 4308 transitions. [2018-11-18 10:29:32,320 INFO L78 Accepts]: Start accepts. Automaton has 2684 states and 4308 transitions. Word has length 205 [2018-11-18 10:29:32,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:29:32,321 INFO L480 AbstractCegarLoop]: Abstraction has 2684 states and 4308 transitions. [2018-11-18 10:29:32,321 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:29:32,321 INFO L276 IsEmpty]: Start isEmpty. Operand 2684 states and 4308 transitions. [2018-11-18 10:29:32,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-11-18 10:29:32,327 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:29:32,327 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:29:32,328 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:29:32,328 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:29:32,328 INFO L82 PathProgramCache]: Analyzing trace with hash 1867477658, now seen corresponding path program 1 times [2018-11-18 10:29:32,328 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:29:32,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:29:32,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:29:32,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:29:32,329 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:29:32,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:29:32,390 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-11-18 10:29:32,391 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:29:32,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:29:32,391 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:29:32,391 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:29:32,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:29:32,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:29:32,392 INFO L87 Difference]: Start difference. First operand 2684 states and 4308 transitions. Second operand 3 states. [2018-11-18 10:29:32,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:29:32,528 INFO L93 Difference]: Finished difference Result 6955 states and 11429 transitions. [2018-11-18 10:29:32,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:29:32,529 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 206 [2018-11-18 10:29:32,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:29:32,539 INFO L225 Difference]: With dead ends: 6955 [2018-11-18 10:29:32,539 INFO L226 Difference]: Without dead ends: 4419 [2018-11-18 10:29:32,543 INFO L604 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 [2018-11-18 10:29:32,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4419 states. [2018-11-18 10:29:32,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4419 to 4418. [2018-11-18 10:29:32,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4418 states. [2018-11-18 10:29:32,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4418 states to 4418 states and 7240 transitions. [2018-11-18 10:29:32,686 INFO L78 Accepts]: Start accepts. Automaton has 4418 states and 7240 transitions. Word has length 206 [2018-11-18 10:29:32,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:29:32,687 INFO L480 AbstractCegarLoop]: Abstraction has 4418 states and 7240 transitions. [2018-11-18 10:29:32,687 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:29:32,687 INFO L276 IsEmpty]: Start isEmpty. Operand 4418 states and 7240 transitions. [2018-11-18 10:29:32,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-11-18 10:29:32,695 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:29:32,696 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:29:32,696 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:29:32,696 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:29:32,696 INFO L82 PathProgramCache]: Analyzing trace with hash 1493964247, now seen corresponding path program 1 times [2018-11-18 10:29:32,696 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:29:32,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:29:32,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:29:32,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:29:32,697 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:29:32,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:29:32,762 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-11-18 10:29:32,762 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:29:32,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:29:32,763 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:29:32,763 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:29:32,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:29:32,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:29:32,763 INFO L87 Difference]: Start difference. First operand 4418 states and 7240 transitions. Second operand 3 states. [2018-11-18 10:29:32,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:29:32,977 INFO L93 Difference]: Finished difference Result 11993 states and 19897 transitions. [2018-11-18 10:29:32,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:29:32,977 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 207 [2018-11-18 10:29:32,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:29:32,996 INFO L225 Difference]: With dead ends: 11993 [2018-11-18 10:29:32,996 INFO L226 Difference]: Without dead ends: 7737 [2018-11-18 10:29:33,004 INFO L604 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 [2018-11-18 10:29:33,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7737 states. [2018-11-18 10:29:33,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7737 to 7736. [2018-11-18 10:29:33,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7736 states. [2018-11-18 10:29:33,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7736 states to 7736 states and 12748 transitions. [2018-11-18 10:29:33,255 INFO L78 Accepts]: Start accepts. Automaton has 7736 states and 12748 transitions. Word has length 207 [2018-11-18 10:29:33,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:29:33,256 INFO L480 AbstractCegarLoop]: Abstraction has 7736 states and 12748 transitions. [2018-11-18 10:29:33,256 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:29:33,256 INFO L276 IsEmpty]: Start isEmpty. Operand 7736 states and 12748 transitions. [2018-11-18 10:29:33,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2018-11-18 10:29:33,269 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:29:33,270 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:29:33,270 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:29:33,270 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:29:33,270 INFO L82 PathProgramCache]: Analyzing trace with hash -699487865, now seen corresponding path program 1 times [2018-11-18 10:29:33,270 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:29:33,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:29:33,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:29:33,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:29:33,271 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:29:33,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:29:33,364 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-11-18 10:29:33,365 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:29:33,365 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 10:29:33,365 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 210 with the following transitions: [2018-11-18 10:29:33,365 INFO L202 CegarAbsIntRunner]: [2], [3], [4], [6], [21], [24], [27], [44], [46], [49], [53], [64], [68], [71], [81], [84], [98], [101], [111], [134], [150], [153], [154], [155], [157], [158], [160], [164], [167], [177], [178], [182], [185], [186], [188], [189], [193], [199], [203], [205], [207], [210], [217], [224], [229], [236], [239], [241], [363], [366], [372], [375], [377], [467], [470], [479], [480], [481], [482], [536], [538], [557], [561], [562], [565], [575], [586], [587], [598], [601], [640], [642], [645], [647], [659], [681], [692], [695], [697], [700], [702], [705], [709], [720], [740], [743], [752], [833], [835], [836], [837], [845], [847], [849], [851], [852], [856], [858], [863], [897], [900], [902], [905], [907], [910], [914], [917], [918], [919], [921], [922], [923], [924], [925], [926], [927], [929], [930], [935], [936], [937], [938], [939], [940], [941], [942], [943], [947], [948], [949], [950], [971], [981], [982], [983], [984], [985], [986], [987], [988], [989], [990], [991], [993], [994], [995], [997], [998], [999], [1000], [1001], [1002], [1005], [1006], [1021], [1023], [1024], [1025], [1026], [1027], [1028], [1029], [1035], [1036], [1037], [1038], [1039], [1040], [1041], [1043], [1044], [1067], [1085], [1086], [1095], [1096], [1097], [1098], [1099], [1100], [1101], [1102], [1103], [1105], [1106], [1107] [2018-11-18 10:29:33,367 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 10:29:33,367 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 10:29:33,970 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 10:29:33,970 INFO L272 AbstractInterpreter]: Visited 94 different actions 130 times. Merged at 9 different actions 9 times. Never widened. Performed 8346 root evaluator evaluations with a maximum evaluation depth of 3. Performed 8346 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 388 variables. [2018-11-18 10:29:33,977 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:29:33,977 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 10:29:34,385 INFO L227 lantSequenceWeakener]: Weakened 107 states. On average, predicates are now at 97.86% of their original sizes. [2018-11-18 10:29:34,386 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 10:29:34,899 INFO L415 sIntCurrentIteration]: We unified 208 AI predicates to 208 [2018-11-18 10:29:34,899 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 10:29:34,899 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 10:29:34,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [47] imperfect sequences [8] total 53 [2018-11-18 10:29:34,899 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:29:34,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-11-18 10:29:34,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-11-18 10:29:34,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=1981, Unknown=0, NotChecked=0, Total=2162 [2018-11-18 10:29:34,900 INFO L87 Difference]: Start difference. First operand 7736 states and 12748 transitions. Second operand 47 states. [2018-11-18 10:29:58,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:29:58,399 INFO L93 Difference]: Finished difference Result 15699 states and 25886 transitions. [2018-11-18 10:29:58,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-11-18 10:29:58,399 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 209 [2018-11-18 10:29:58,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:29:58,422 INFO L225 Difference]: With dead ends: 15699 [2018-11-18 10:29:58,422 INFO L226 Difference]: Without dead ends: 8165 [2018-11-18 10:29:58,437 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 242 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1402 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=565, Invalid=5915, Unknown=0, NotChecked=0, Total=6480 [2018-11-18 10:29:58,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8165 states. [2018-11-18 10:29:58,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8165 to 7830. [2018-11-18 10:29:58,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7830 states. [2018-11-18 10:29:58,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7830 states to 7830 states and 12850 transitions. [2018-11-18 10:29:58,785 INFO L78 Accepts]: Start accepts. Automaton has 7830 states and 12850 transitions. Word has length 209 [2018-11-18 10:29:58,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:29:58,785 INFO L480 AbstractCegarLoop]: Abstraction has 7830 states and 12850 transitions. [2018-11-18 10:29:58,785 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-11-18 10:29:58,785 INFO L276 IsEmpty]: Start isEmpty. Operand 7830 states and 12850 transitions. [2018-11-18 10:29:58,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-11-18 10:29:58,799 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:29:58,799 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:29:58,799 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:29:58,799 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:29:58,799 INFO L82 PathProgramCache]: Analyzing trace with hash -742563878, now seen corresponding path program 1 times [2018-11-18 10:29:58,800 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:29:58,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:29:58,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:29:58,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:29:58,800 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:29:58,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:29:58,870 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-11-18 10:29:58,871 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:29:58,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:29:58,871 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:29:58,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:29:58,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:29:58,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:29:58,872 INFO L87 Difference]: Start difference. First operand 7830 states and 12850 transitions. Second operand 3 states. [2018-11-18 10:29:59,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:29:59,265 INFO L93 Difference]: Finished difference Result 21784 states and 36023 transitions. [2018-11-18 10:29:59,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:29:59,265 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 208 [2018-11-18 10:29:59,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:29:59,294 INFO L225 Difference]: With dead ends: 21784 [2018-11-18 10:29:59,294 INFO L226 Difference]: Without dead ends: 14182 [2018-11-18 10:29:59,307 INFO L604 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 [2018-11-18 10:29:59,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14182 states. [2018-11-18 10:29:59,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14182 to 14181. [2018-11-18 10:29:59,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14181 states. [2018-11-18 10:29:59,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14181 states to 14181 states and 23261 transitions. [2018-11-18 10:29:59,766 INFO L78 Accepts]: Start accepts. Automaton has 14181 states and 23261 transitions. Word has length 208 [2018-11-18 10:29:59,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:29:59,767 INFO L480 AbstractCegarLoop]: Abstraction has 14181 states and 23261 transitions. [2018-11-18 10:29:59,767 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:29:59,767 INFO L276 IsEmpty]: Start isEmpty. Operand 14181 states and 23261 transitions. [2018-11-18 10:29:59,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2018-11-18 10:29:59,796 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:29:59,796 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:29:59,797 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:29:59,797 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:29:59,797 INFO L82 PathProgramCache]: Analyzing trace with hash 608476311, now seen corresponding path program 1 times [2018-11-18 10:29:59,797 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:29:59,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:29:59,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:29:59,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:29:59,798 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:29:59,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:29:59,901 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-11-18 10:29:59,901 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:29:59,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:29:59,902 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:29:59,902 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:29:59,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:29:59,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:29:59,902 INFO L87 Difference]: Start difference. First operand 14181 states and 23261 transitions. Second operand 3 states. [2018-11-18 10:30:00,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:30:00,695 INFO L93 Difference]: Finished difference Result 40985 states and 67468 transitions. [2018-11-18 10:30:00,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:30:00,695 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 209 [2018-11-18 10:30:00,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:30:00,864 INFO L225 Difference]: With dead ends: 40985 [2018-11-18 10:30:00,864 INFO L226 Difference]: Without dead ends: 27055 [2018-11-18 10:30:00,887 INFO L604 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 [2018-11-18 10:30:00,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27055 states. [2018-11-18 10:30:01,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27055 to 27054. [2018-11-18 10:30:01,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27054 states. [2018-11-18 10:30:01,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27054 states to 27054 states and 44130 transitions. [2018-11-18 10:30:01,838 INFO L78 Accepts]: Start accepts. Automaton has 27054 states and 44130 transitions. Word has length 209 [2018-11-18 10:30:01,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:30:01,838 INFO L480 AbstractCegarLoop]: Abstraction has 27054 states and 44130 transitions. [2018-11-18 10:30:01,838 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:30:01,838 INFO L276 IsEmpty]: Start isEmpty. Operand 27054 states and 44130 transitions. [2018-11-18 10:30:01,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-11-18 10:30:01,875 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:30:01,875 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:30:01,875 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:30:01,875 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:30:01,875 INFO L82 PathProgramCache]: Analyzing trace with hash -949787366, now seen corresponding path program 1 times [2018-11-18 10:30:01,875 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:30:01,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:30:01,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:30:01,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:30:01,876 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:30:01,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:30:01,955 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-11-18 10:30:01,955 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:30:01,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:30:01,955 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:30:01,955 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:30:01,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:30:01,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:30:01,956 INFO L87 Difference]: Start difference. First operand 27054 states and 44130 transitions. Second operand 3 states. [2018-11-18 10:30:03,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:30:03,422 INFO L93 Difference]: Finished difference Result 77652 states and 126968 transitions. [2018-11-18 10:30:03,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:30:03,423 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 210 [2018-11-18 10:30:03,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:30:03,517 INFO L225 Difference]: With dead ends: 77652 [2018-11-18 10:30:03,517 INFO L226 Difference]: Without dead ends: 50872 [2018-11-18 10:30:03,557 INFO L604 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 [2018-11-18 10:30:03,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50872 states. [2018-11-18 10:30:05,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50872 to 50871. [2018-11-18 10:30:05,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50871 states. [2018-11-18 10:30:05,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50871 states to 50871 states and 82407 transitions. [2018-11-18 10:30:05,419 INFO L78 Accepts]: Start accepts. Automaton has 50871 states and 82407 transitions. Word has length 210 [2018-11-18 10:30:05,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:30:05,419 INFO L480 AbstractCegarLoop]: Abstraction has 50871 states and 82407 transitions. [2018-11-18 10:30:05,419 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:30:05,419 INFO L276 IsEmpty]: Start isEmpty. Operand 50871 states and 82407 transitions. [2018-11-18 10:30:05,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-11-18 10:30:05,465 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:30:05,465 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:30:05,465 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:30:05,465 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:30:05,465 INFO L82 PathProgramCache]: Analyzing trace with hash -67386027, now seen corresponding path program 1 times [2018-11-18 10:30:05,465 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:30:05,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:30:05,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:30:05,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:30:05,466 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:30:05,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:30:05,531 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-11-18 10:30:05,531 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:30:05,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:30:05,531 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:30:05,531 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:30:05,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:30:05,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:30:05,532 INFO L87 Difference]: Start difference. First operand 50871 states and 82407 transitions. Second operand 3 states. [2018-11-18 10:30:08,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:30:08,658 INFO L93 Difference]: Finished difference Result 146758 states and 237398 transitions. [2018-11-18 10:30:08,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:30:08,658 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 211 [2018-11-18 10:30:08,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:30:08,849 INFO L225 Difference]: With dead ends: 146758 [2018-11-18 10:30:08,850 INFO L226 Difference]: Without dead ends: 96193 [2018-11-18 10:30:08,913 INFO L604 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 [2018-11-18 10:30:08,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96193 states. [2018-11-18 10:30:12,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96193 to 96192. [2018-11-18 10:30:12,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96192 states. [2018-11-18 10:30:12,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96192 states to 96192 states and 153836 transitions. [2018-11-18 10:30:12,491 INFO L78 Accepts]: Start accepts. Automaton has 96192 states and 153836 transitions. Word has length 211 [2018-11-18 10:30:12,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:30:12,491 INFO L480 AbstractCegarLoop]: Abstraction has 96192 states and 153836 transitions. [2018-11-18 10:30:12,491 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:30:12,491 INFO L276 IsEmpty]: Start isEmpty. Operand 96192 states and 153836 transitions. [2018-11-18 10:30:12,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-11-18 10:30:12,566 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:30:12,566 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:30:12,566 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:30:12,566 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:30:12,566 INFO L82 PathProgramCache]: Analyzing trace with hash 1999421978, now seen corresponding path program 1 times [2018-11-18 10:30:12,566 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:30:12,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:30:12,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:30:12,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:30:12,567 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:30:12,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:30:12,684 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-11-18 10:30:12,684 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:30:12,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:30:12,684 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:30:12,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:30:12,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:30:12,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:30:12,685 INFO L87 Difference]: Start difference. First operand 96192 states and 153836 transitions. Second operand 3 states. [2018-11-18 10:30:19,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:30:19,193 INFO L93 Difference]: Finished difference Result 180699 states and 288702 transitions. [2018-11-18 10:30:19,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:30:19,193 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 212 [2018-11-18 10:30:19,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:30:19,527 INFO L225 Difference]: With dead ends: 180699 [2018-11-18 10:30:19,527 INFO L226 Difference]: Without dead ends: 180463 [2018-11-18 10:30:19,562 INFO L604 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 [2018-11-18 10:30:19,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180463 states. [2018-11-18 10:30:25,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180463 to 180462. [2018-11-18 10:30:25,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180462 states. [2018-11-18 10:30:26,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180462 states to 180462 states and 285334 transitions. [2018-11-18 10:30:26,132 INFO L78 Accepts]: Start accepts. Automaton has 180462 states and 285334 transitions. Word has length 212 [2018-11-18 10:30:26,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:30:26,132 INFO L480 AbstractCegarLoop]: Abstraction has 180462 states and 285334 transitions. [2018-11-18 10:30:26,132 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:30:26,132 INFO L276 IsEmpty]: Start isEmpty. Operand 180462 states and 285334 transitions. [2018-11-18 10:30:26,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2018-11-18 10:30:26,258 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:30:26,258 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:30:26,258 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:30:26,258 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:30:26,259 INFO L82 PathProgramCache]: Analyzing trace with hash -487834445, now seen corresponding path program 1 times [2018-11-18 10:30:26,259 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:30:26,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:30:26,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:30:26,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:30:26,260 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:30:26,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:30:26,386 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-11-18 10:30:26,386 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:30:26,386 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 10:30:26,386 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 216 with the following transitions: [2018-11-18 10:30:26,387 INFO L202 CegarAbsIntRunner]: [2], [3], [4], [6], [21], [24], [27], [44], [46], [49], [53], [64], [68], [71], [81], [84], [98], [101], [111], [134], [150], [153], [154], [155], [157], [158], [160], [164], [167], [177], [178], [182], [185], [186], [189], [193], [199], [203], [205], [207], [210], [217], [224], [229], [236], [243], [250], [257], [264], [271], [278], [281], [283], [363], [366], [372], [375], [377], [467], [470], [479], [480], [481], [482], [536], [538], [539], [542], [556], [557], [561], [562], [565], [575], [586], [587], [598], [601], [640], [642], [645], [647], [659], [681], [692], [695], [697], [700], [702], [705], [709], [720], [740], [743], [752], [833], [835], [836], [837], [844], [845], [847], [849], [851], [852], [856], [858], [863], [897], [900], [902], [905], [907], [910], [914], [917], [918], [919], [921], [922], [923], [924], [925], [926], [927], [929], [930], [935], [936], [937], [938], [939], [940], [941], [942], [943], [947], [948], [949], [950], [971], [981], [982], [983], [984], [985], [986], [987], [988], [989], [990], [991], [993], [994], [995], [997], [998], [999], [1000], [1011], [1012], [1021], [1023], [1024], [1025], [1026], [1027], [1028], [1029], [1035], [1036], [1037], [1038], [1039], [1040], [1041], [1043], [1044], [1067], [1085], [1086], [1093], [1094], [1095], [1096], [1097], [1098], [1099], [1100], [1101], [1102], [1103], [1105], [1106], [1107] [2018-11-18 10:30:26,390 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 10:30:26,391 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 10:30:27,364 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 10:30:27,364 INFO L272 AbstractInterpreter]: Visited 98 different actions 118 times. Never merged. Never widened. Performed 8304 root evaluator evaluations with a maximum evaluation depth of 3. Performed 8304 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 391 variables. [2018-11-18 10:30:27,369 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:30:27,369 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 10:30:27,704 INFO L227 lantSequenceWeakener]: Weakened 108 states. On average, predicates are now at 97.75% of their original sizes. [2018-11-18 10:30:27,704 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 10:30:28,219 INFO L415 sIntCurrentIteration]: We unified 214 AI predicates to 214 [2018-11-18 10:30:28,219 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 10:30:28,219 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 10:30:28,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [48] imperfect sequences [8] total 54 [2018-11-18 10:30:28,219 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:30:28,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-11-18 10:30:28,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-18 10:30:28,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=2078, Unknown=0, NotChecked=0, Total=2256 [2018-11-18 10:30:28,221 INFO L87 Difference]: Start difference. First operand 180462 states and 285334 transitions. Second operand 48 states. [2018-11-18 10:31:03,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:31:03,104 INFO L93 Difference]: Finished difference Result 359696 states and 569855 transitions. [2018-11-18 10:31:03,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-11-18 10:31:03,104 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 215 [2018-11-18 10:31:03,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:31:03,427 INFO L225 Difference]: With dead ends: 359696 [2018-11-18 10:31:03,428 INFO L226 Difference]: Without dead ends: 180084 [2018-11-18 10:31:03,758 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 252 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1823 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=625, Invalid=6685, Unknown=0, NotChecked=0, Total=7310 [2018-11-18 10:31:03,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180084 states. [2018-11-18 10:31:13,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180084 to 179773. [2018-11-18 10:31:13,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179773 states. [2018-11-18 10:31:13,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179773 states to 179773 states and 283262 transitions. [2018-11-18 10:31:13,417 INFO L78 Accepts]: Start accepts. Automaton has 179773 states and 283262 transitions. Word has length 215 [2018-11-18 10:31:13,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:31:13,417 INFO L480 AbstractCegarLoop]: Abstraction has 179773 states and 283262 transitions. [2018-11-18 10:31:13,417 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-11-18 10:31:13,417 INFO L276 IsEmpty]: Start isEmpty. Operand 179773 states and 283262 transitions. [2018-11-18 10:31:13,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-11-18 10:31:13,494 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:31:13,494 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:31:13,494 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:31:13,495 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:31:13,495 INFO L82 PathProgramCache]: Analyzing trace with hash 1938609237, now seen corresponding path program 1 times [2018-11-18 10:31:13,495 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:31:13,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:31:13,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:31:13,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:31:13,496 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:31:13,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:31:13,613 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-11-18 10:31:13,613 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:31:13,613 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 10:31:13,613 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 214 with the following transitions: [2018-11-18 10:31:13,613 INFO L202 CegarAbsIntRunner]: [2], [3], [4], [6], [21], [24], [27], [44], [46], [49], [53], [64], [68], [71], [81], [84], [98], [101], [111], [134], [150], [153], [154], [155], [157], [158], [160], [164], [167], [177], [178], [182], [185], [186], [189], [193], [199], [203], [207], [210], [217], [224], [229], [236], [243], [250], [257], [264], [271], [278], [285], [292], [299], [306], [311], [318], [325], [332], [339], [346], [353], [363], [366], [372], [375], [377], [467], [470], [479], [480], [481], [482], [536], [538], [557], [561], [562], [565], [575], [586], [587], [598], [601], [640], [642], [645], [647], [659], [681], [692], [695], [697], [700], [702], [705], [709], [720], [740], [743], [752], [833], [835], [836], [837], [845], [847], [849], [851], [852], [856], [858], [863], [897], [900], [902], [905], [907], [910], [914], [917], [918], [919], [921], [922], [923], [924], [925], [926], [927], [929], [930], [935], [936], [937], [938], [939], [940], [941], [942], [943], [947], [948], [949], [950], [971], [981], [982], [983], [984], [985], [986], [987], [988], [989], [990], [991], [993], [994], [995], [997], [998], [999], [1000], [1021], [1023], [1024], [1025], [1026], [1027], [1028], [1029], [1035], [1036], [1037], [1038], [1039], [1040], [1041], [1043], [1044], [1067], [1085], [1086], [1095], [1096], [1097], [1098], [1099], [1100], [1101], [1102], [1103], [1105], [1106], [1107] [2018-11-18 10:31:13,615 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 10:31:13,615 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 10:31:14,740 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 10:31:14,740 INFO L272 AbstractInterpreter]: Visited 164 different actions 187 times. Never merged. Never widened. Performed 13615 root evaluator evaluations with a maximum evaluation depth of 3. Performed 13615 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 396 variables. [2018-11-18 10:31:14,741 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:31:14,741 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 10:31:15,219 INFO L227 lantSequenceWeakener]: Weakened 175 states. On average, predicates are now at 98.01% of their original sizes. [2018-11-18 10:31:15,219 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 10:31:16,710 INFO L415 sIntCurrentIteration]: We unified 212 AI predicates to 212 [2018-11-18 10:31:16,710 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 10:31:16,710 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 10:31:16,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [88] imperfect sequences [8] total 94 [2018-11-18 10:31:16,711 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:31:16,711 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-11-18 10:31:16,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-11-18 10:31:16,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=505, Invalid=7151, Unknown=0, NotChecked=0, Total=7656 [2018-11-18 10:31:16,713 INFO L87 Difference]: Start difference. First operand 179773 states and 283262 transitions. Second operand 88 states. [2018-11-18 10:33:11,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:33:11,371 INFO L93 Difference]: Finished difference Result 187705 states and 296017 transitions. [2018-11-18 10:33:11,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-11-18 10:33:11,371 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 213 [2018-11-18 10:33:11,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:33:11,706 INFO L225 Difference]: With dead ends: 187705 [2018-11-18 10:33:11,706 INFO L226 Difference]: Without dead ends: 187468 [2018-11-18 10:33:11,741 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 298 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7844 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=2027, Invalid=28075, Unknown=0, NotChecked=0, Total=30102 [2018-11-18 10:33:11,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187468 states. [2018-11-18 10:33:18,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187468 to 180495. [2018-11-18 10:33:18,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180495 states. [2018-11-18 10:33:19,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180495 states to 180495 states and 284154 transitions. [2018-11-18 10:33:19,004 INFO L78 Accepts]: Start accepts. Automaton has 180495 states and 284154 transitions. Word has length 213 [2018-11-18 10:33:19,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:33:19,004 INFO L480 AbstractCegarLoop]: Abstraction has 180495 states and 284154 transitions. [2018-11-18 10:33:19,004 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-11-18 10:33:19,004 INFO L276 IsEmpty]: Start isEmpty. Operand 180495 states and 284154 transitions. [2018-11-18 10:33:19,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-11-18 10:33:19,112 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:33:19,112 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:33:19,112 INFO L423 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:33:19,112 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:33:19,112 INFO L82 PathProgramCache]: Analyzing trace with hash 726019569, now seen corresponding path program 1 times [2018-11-18 10:33:19,113 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:33:19,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:33:19,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:33:19,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:33:19,113 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:33:19,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:33:19,218 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-11-18 10:33:19,218 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:33:19,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-18 10:33:19,219 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:33:19,219 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 10:33:19,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 10:33:19,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-18 10:33:19,219 INFO L87 Difference]: Start difference. First operand 180495 states and 284154 transitions. Second operand 8 states. [2018-11-18 10:33:25,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:33:25,683 INFO L93 Difference]: Finished difference Result 180495 states and 284154 transitions. [2018-11-18 10:33:25,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 10:33:25,683 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 220 [2018-11-18 10:33:25,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:33:25,684 INFO L225 Difference]: With dead ends: 180495 [2018-11-18 10:33:25,684 INFO L226 Difference]: Without dead ends: 0 [2018-11-18 10:33:25,827 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-18 10:33:25,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-18 10:33:25,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-18 10:33:25,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-18 10:33:25,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-18 10:33:25,837 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 220 [2018-11-18 10:33:25,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:33:25,837 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 10:33:25,837 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 10:33:25,837 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-18 10:33:25,837 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 10:33:25,841 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-18 10:33:33,725 WARN L180 SmtUtils]: Spent 7.56 s on a formula simplification. DAG size of input: 3092 DAG size of output: 24 [2018-11-18 10:33:35,351 WARN L180 SmtUtils]: Spent 356.00 ms on a formula simplification that was a NOOP. DAG size: 1 [2018-11-18 10:33:44,616 WARN L180 SmtUtils]: Spent 8.29 s on a formula simplification. DAG size of input: 3156 DAG size of output: 24 [2018-11-18 10:34:08,696 WARN L180 SmtUtils]: Spent 24.07 s on a formula simplification. DAG size of input: 6087 DAG size of output: 22 [2018-11-18 10:34:32,482 WARN L180 SmtUtils]: Spent 23.77 s on a formula simplification. DAG size of input: 6092 DAG size of output: 22 [2018-11-18 10:34:38,730 WARN L180 SmtUtils]: Spent 6.24 s on a formula simplification. DAG size of input: 3155 DAG size of output: 24 [2018-11-18 10:35:03,811 WARN L180 SmtUtils]: Spent 24.18 s on a formula simplification. DAG size of input: 6099 DAG size of output: 22 [2018-11-18 10:35:10,901 WARN L180 SmtUtils]: Spent 6.18 s on a formula simplification. DAG size of input: 3155 DAG size of output: 24 [2018-11-18 10:35:36,205 WARN L180 SmtUtils]: Spent 23.51 s on a formula simplification. DAG size of input: 6099 DAG size of output: 22 [2018-11-18 10:35:42,441 WARN L180 SmtUtils]: Spent 6.22 s on a formula simplification. DAG size of input: 3156 DAG size of output: 24 [2018-11-18 10:36:05,964 WARN L180 SmtUtils]: Spent 23.50 s on a formula simplification. DAG size of input: 6099 DAG size of output: 22 [2018-11-18 10:36:29,603 WARN L180 SmtUtils]: Spent 23.62 s on a formula simplification. DAG size of input: 6099 DAG size of output: 22 [2018-11-18 10:36:37,294 WARN L180 SmtUtils]: Spent 5.94 s on a formula simplification. DAG size of input: 3079 DAG size of output: 24 [2018-11-18 10:37:04,141 WARN L180 SmtUtils]: Spent 24.08 s on a formula simplification. DAG size of input: 6199 DAG size of output: 22 [2018-11-18 10:37:28,966 WARN L180 SmtUtils]: Spent 24.81 s on a formula simplification. DAG size of input: 6227 DAG size of output: 22 [2018-11-18 10:37:54,074 WARN L180 SmtUtils]: Spent 25.09 s on a formula simplification. DAG size of input: 6227 DAG size of output: 22 [2018-11-18 10:38:20,040 WARN L180 SmtUtils]: Spent 25.08 s on a formula simplification. DAG size of input: 6228 DAG size of output: 22 [2018-11-18 10:38:26,077 WARN L180 SmtUtils]: Spent 6.00 s on a formula simplification. DAG size of input: 3092 DAG size of output: 24 [2018-11-18 10:38:52,188 WARN L180 SmtUtils]: Spent 26.09 s on a formula simplification. DAG size of input: 6227 DAG size of output: 22 [2018-11-18 10:39:00,063 WARN L180 SmtUtils]: Spent 6.08 s on a formula simplification. DAG size of input: 3090 DAG size of output: 24 [2018-11-18 10:39:09,861 WARN L180 SmtUtils]: Spent 6.08 s on a formula simplification. DAG size of input: 3092 DAG size of output: 24 [2018-11-18 10:39:13,588 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 52 [2018-11-18 10:39:13,947 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 50 [2018-11-18 10:39:19,986 INFO L425 ceAbstractionStarter]: For program point bobKeyChangeFINAL(lines 757 766) no Hoare annotation was computed. [2018-11-18 10:39:19,986 INFO L425 ceAbstractionStarter]: For program point bobKeyChangeEXIT(lines 757 766) no Hoare annotation was computed. [2018-11-18 10:39:19,987 INFO L421 ceAbstractionStarter]: At program point bobKeyChangeENTRY(lines 757 766) the Hoare annotation is: (or (not (= |#t~string51.offset| 0)) (= 0 |#t~string51.base|) (not (= 3 ~chuck~0)) (not (= ~__ste_client_idCounter0~0 1)) (= ~__ste_client_privateKey0~0 123) (= |#t~string53.base| 0) (not (= 0 ~__ste_client_forwardReceiver0~0)) (= |#t~string49.base| 0) (not (= 1 ~bob~0)) (not (= ~rjh~0 2)) (not (= 0 |#t~string53.offset|)) (not (= |#t~string49.offset| 0)) (not (= 123 |old(~__ste_client_privateKey0~0)|))) [2018-11-18 10:39:19,987 INFO L425 ceAbstractionStarter]: For program point valid_productEXIT(lines 486 494) no Hoare annotation was computed. [2018-11-18 10:39:19,987 INFO L428 ceAbstractionStarter]: At program point valid_productENTRY(lines 486 494) the Hoare annotation is: true [2018-11-18 10:39:19,987 INFO L425 ceAbstractionStarter]: For program point valid_productFINAL(lines 486 494) no Hoare annotation was computed. [2018-11-18 10:39:19,987 INFO L421 ceAbstractionStarter]: At program point L193(line 193) the Hoare annotation is: (or (not (= 3 ~chuck~0)) (or (not (= |#t~string51.offset| 0)) (= 0 |#t~string51.base|) (not (= ~__ste_client_idCounter0~0 1)) (= |#t~string53.base| 0) (not (= 0 |#t~string53.offset|)) (not (= |#t~string49.offset| 0)) (= |#t~string49.base| 0) (not (= 1 ~bob~0))) (not (= 0 ~__ste_client_forwardReceiver0~0)) (= ~__ste_email_to0~0 2) (not (= ~rjh~0 2)) (not (= 123 ~__ste_client_privateKey0~0)) (not (= |old(~__ste_email_to0~0)| 2))) [2018-11-18 10:39:19,989 INFO L421 ceAbstractionStarter]: At program point L192(line 192) the Hoare annotation is: (or (not (= 3 ~chuck~0)) (or (not (= |#t~string51.offset| 0)) (= 0 |#t~string51.base|) (not (= ~__ste_client_idCounter0~0 1)) (= |#t~string53.base| 0) (not (= 0 |#t~string53.offset|)) (not (= |#t~string49.offset| 0)) (= |#t~string49.base| 0) (not (= 1 ~bob~0))) (not (= 0 ~__ste_client_forwardReceiver0~0)) (= ~__ste_email_to0~0 2) (not (= ~rjh~0 2)) (not (= 123 ~__ste_client_privateKey0~0)) (not (= |old(~__ste_email_to0~0)| 2))) [2018-11-18 10:39:19,989 INFO L421 ceAbstractionStarter]: At program point mailENTRY(lines 186 197) the Hoare annotation is: (or (not (= 3 ~chuck~0)) (or (not (= |#t~string51.offset| 0)) (= 0 |#t~string51.base|) (not (= ~__ste_client_idCounter0~0 1)) (= |#t~string53.base| 0) (not (= 0 |#t~string53.offset|)) (not (= |#t~string49.offset| 0)) (= |#t~string49.base| 0) (not (= 1 ~bob~0))) (not (= 0 ~__ste_client_forwardReceiver0~0)) (= ~__ste_email_to0~0 2) (not (= ~rjh~0 2)) (not (= 123 ~__ste_client_privateKey0~0)) (not (= |old(~__ste_email_to0~0)| 2))) [2018-11-18 10:39:19,989 INFO L425 ceAbstractionStarter]: For program point L192-1(line 192) no Hoare annotation was computed. [2018-11-18 10:39:19,989 INFO L425 ceAbstractionStarter]: For program point mailEXIT(lines 186 197) no Hoare annotation was computed. [2018-11-18 10:39:19,989 INFO L425 ceAbstractionStarter]: For program point mailFINAL(lines 186 197) no Hoare annotation was computed. [2018-11-18 10:39:19,989 INFO L425 ceAbstractionStarter]: For program point isSignedEXIT(lines 2773 2791) no Hoare annotation was computed. [2018-11-18 10:39:19,989 INFO L425 ceAbstractionStarter]: For program point L2781(lines 2781 2787) no Hoare annotation was computed. [2018-11-18 10:39:19,989 INFO L428 ceAbstractionStarter]: At program point isSignedENTRY(lines 2773 2791) the Hoare annotation is: true [2018-11-18 10:39:19,989 INFO L425 ceAbstractionStarter]: For program point isSignedFINAL(lines 2773 2791) no Hoare annotation was computed. [2018-11-18 10:39:19,989 INFO L425 ceAbstractionStarter]: For program point L2777(lines 2777 2788) no Hoare annotation was computed. [2018-11-18 10:39:19,989 INFO L425 ceAbstractionStarter]: For program point get_queued_clientEXIT(lines 320 328) no Hoare annotation was computed. [2018-11-18 10:39:19,989 INFO L428 ceAbstractionStarter]: At program point get_queued_clientENTRY(lines 320 328) the Hoare annotation is: true [2018-11-18 10:39:19,990 INFO L425 ceAbstractionStarter]: For program point get_queued_clientFINAL(lines 320 328) no Hoare annotation was computed. [2018-11-18 10:39:19,990 INFO L421 ceAbstractionStarter]: At program point L253(line 253) the Hoare annotation is: (or (not (= 3 ~chuck~0)) (or (not (= |#t~string51.offset| 0)) (= 0 |#t~string51.base|) (not (= ~__ste_client_idCounter0~0 1)) (= |#t~string53.base| 0) (not (= 0 |#t~string53.offset|)) (not (= |#t~string49.offset| 0)) (= |#t~string49.base| 0) (not (= 1 ~bob~0))) (not (= 0 ~__ste_client_forwardReceiver0~0)) (= ~__ste_email_to0~0 2) (not (= ~rjh~0 2)) (not (= 123 ~__ste_client_privateKey0~0)) (not (= |old(~__ste_email_to0~0)| 2))) [2018-11-18 10:39:19,990 INFO L428 ceAbstractionStarter]: At program point L253-1(line 253) the Hoare annotation is: true [2018-11-18 10:39:19,990 INFO L425 ceAbstractionStarter]: For program point L251(lines 251 258) no Hoare annotation was computed. [2018-11-18 10:39:19,990 INFO L425 ceAbstractionStarter]: For program point L251-1(lines 241 261) no Hoare annotation was computed. [2018-11-18 10:39:19,990 INFO L425 ceAbstractionStarter]: For program point incoming__wrappee__ForwardEXIT(lines 241 261) no Hoare annotation was computed. [2018-11-18 10:39:19,990 INFO L425 ceAbstractionStarter]: For program point L248(line 248) no Hoare annotation was computed. [2018-11-18 10:39:19,990 INFO L421 ceAbstractionStarter]: At program point L247(line 247) the Hoare annotation is: (or (not (= 3 ~chuck~0)) (or (not (= |#t~string51.offset| 0)) (= 0 |#t~string51.base|) (not (= ~__ste_client_idCounter0~0 1)) (= |#t~string53.base| 0) (not (= 0 |#t~string53.offset|)) (not (= |#t~string49.offset| 0)) (= |#t~string49.base| 0) (not (= 1 ~bob~0))) (not (= 0 ~__ste_client_forwardReceiver0~0)) (= ~__ste_email_to0~0 2) (not (= ~rjh~0 2)) (not (= 123 ~__ste_client_privateKey0~0)) (not (= |old(~__ste_email_to0~0)| 2))) [2018-11-18 10:39:19,990 INFO L421 ceAbstractionStarter]: At program point L247-1(line 247) the Hoare annotation is: (or (not (= 3 ~chuck~0)) (or (not (= |#t~string51.offset| 0)) (= 0 |#t~string51.base|) (not (= ~__ste_client_idCounter0~0 1)) (= |#t~string53.base| 0) (not (= 0 |#t~string53.offset|)) (not (= |#t~string49.offset| 0)) (= |#t~string49.base| 0) (not (= 1 ~bob~0))) (not (= 0 ~__ste_client_forwardReceiver0~0)) (= ~__ste_email_to0~0 2) (not (= ~rjh~0 2)) (not (= 123 ~__ste_client_privateKey0~0)) (not (= |old(~__ste_email_to0~0)| 2))) [2018-11-18 10:39:19,990 INFO L421 ceAbstractionStarter]: At program point incoming__wrappee__ForwardENTRY(lines 241 261) the Hoare annotation is: (or (not (= 3 ~chuck~0)) (or (not (= |#t~string51.offset| 0)) (= 0 |#t~string51.base|) (not (= ~__ste_client_idCounter0~0 1)) (= |#t~string53.base| 0) (not (= 0 |#t~string53.offset|)) (not (= |#t~string49.offset| 0)) (= |#t~string49.base| 0) (not (= 1 ~bob~0))) (not (= 0 ~__ste_client_forwardReceiver0~0)) (= ~__ste_email_to0~0 2) (not (= ~rjh~0 2)) (not (= 123 ~__ste_client_privateKey0~0)) (not (= |old(~__ste_email_to0~0)| 2))) [2018-11-18 10:39:19,990 INFO L425 ceAbstractionStarter]: For program point L351(lines 351 356) no Hoare annotation was computed. [2018-11-18 10:39:19,990 INFO L425 ceAbstractionStarter]: For program point isKeyPairValidEXIT(lines 338 362) no Hoare annotation was computed. [2018-11-18 10:39:19,990 INFO L428 ceAbstractionStarter]: At program point isKeyPairValidENTRY(lines 338 362) the Hoare annotation is: true [2018-11-18 10:39:19,990 INFO L425 ceAbstractionStarter]: For program point L347(lines 347 357) no Hoare annotation was computed. [2018-11-18 10:39:19,990 INFO L425 ceAbstractionStarter]: For program point isKeyPairValidFINAL(lines 338 362) no Hoare annotation was computed. [2018-11-18 10:39:19,990 INFO L428 ceAbstractionStarter]: At program point signENTRY(lines 373 393) the Hoare annotation is: true [2018-11-18 10:39:19,990 INFO L425 ceAbstractionStarter]: For program point L382(lines 382 386) no Hoare annotation was computed. [2018-11-18 10:39:19,990 INFO L425 ceAbstractionStarter]: For program point signEXIT(lines 373 393) no Hoare annotation was computed. [2018-11-18 10:39:19,990 INFO L421 ceAbstractionStarter]: At program point L379(line 379) the Hoare annotation is: (or (not (= 3 ~chuck~0)) (or (not (= |#t~string51.offset| 0)) (= 0 |#t~string51.base|) (not (= ~__ste_client_idCounter0~0 1)) (= |#t~string53.base| 0) (not (= 0 |#t~string53.offset|)) (not (= |#t~string49.offset| 0)) (= |#t~string49.base| 0) (not (= 1 ~bob~0))) (= sign_~client 1) (not (= 0 ~__ste_client_forwardReceiver0~0)) (not (= ~rjh~0 2)) (not (= 123 ~__ste_client_privateKey0~0)) (not (= ~__ste_email_to0~0 2)) (not (= |sign_#in~client| 1))) [2018-11-18 10:39:19,990 INFO L425 ceAbstractionStarter]: For program point L379-1(line 379) no Hoare annotation was computed. [2018-11-18 10:39:19,990 INFO L425 ceAbstractionStarter]: For program point signFINAL(lines 373 393) no Hoare annotation was computed. [2018-11-18 10:39:19,991 INFO L421 ceAbstractionStarter]: At program point L388(line 388) the Hoare annotation is: (or (not (= 3 ~chuck~0)) (or (not (= |#t~string51.offset| 0)) (= 0 |#t~string51.base|) (not (= ~__ste_client_idCounter0~0 1)) (= |#t~string53.base| 0) (not (= 0 |#t~string53.offset|)) (not (= |#t~string49.offset| 0)) (= |#t~string49.base| 0) (not (= 1 ~bob~0))) (= sign_~client 1) (not (= 0 ~__ste_client_forwardReceiver0~0)) (not (= ~rjh~0 2)) (not (= 123 ~__ste_client_privateKey0~0)) (not (= ~__ste_email_to0~0 2)) (not (= |sign_#in~client| 1))) [2018-11-18 10:39:19,991 INFO L421 ceAbstractionStarter]: At program point L388-1(line 388) the Hoare annotation is: (or (not (= 3 ~chuck~0)) (or (not (= |#t~string51.offset| 0)) (= 0 |#t~string51.base|) (not (= ~__ste_client_idCounter0~0 1)) (= |#t~string53.base| 0) (not (= 0 |#t~string53.offset|)) (not (= |#t~string49.offset| 0)) (= |#t~string49.base| 0) (not (= 1 ~bob~0))) (= sign_~client 1) (not (= 0 ~__ste_client_forwardReceiver0~0)) (not (= ~rjh~0 2)) (not (= 123 ~__ste_client_privateKey0~0)) (not (= ~__ste_email_to0~0 2)) (not (= |sign_#in~client| 1))) [2018-11-18 10:39:19,991 INFO L425 ceAbstractionStarter]: For program point getEmailIdFINAL(lines 2510 2528) no Hoare annotation was computed. [2018-11-18 10:39:19,991 INFO L425 ceAbstractionStarter]: For program point getEmailIdEXIT(lines 2510 2528) no Hoare annotation was computed. [2018-11-18 10:39:19,991 INFO L425 ceAbstractionStarter]: For program point L2518(lines 2518 2524) no Hoare annotation was computed. [2018-11-18 10:39:19,991 INFO L428 ceAbstractionStarter]: At program point getEmailIdENTRY(lines 2510 2528) the Hoare annotation is: true [2018-11-18 10:39:19,991 INFO L425 ceAbstractionStarter]: For program point L2514(lines 2514 2525) no Hoare annotation was computed. [2018-11-18 10:39:19,991 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 644 664) the Hoare annotation is: (or (not (= |#t~string51.offset| 0)) (= 0 |#t~string51.base|) (= |#t~string53.base| 0) (not (= 0 |#t~string53.offset|)) (not (= |#t~string49.offset| 0)) (not (= 0 |old(~__ste_client_forwardReceiver0~0)|)) (= ~__ste_client_forwardReceiver0~0 0) (= |#t~string49.base| 0)) [2018-11-18 10:39:19,991 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 644 664) no Hoare annotation was computed. [2018-11-18 10:39:19,991 INFO L421 ceAbstractionStarter]: At program point L656(line 656) the Hoare annotation is: (or (not (= |#t~string51.offset| 0)) (= 0 |#t~string51.base|) (and (= main_~tmp~11 1) (= ~__ste_client_forwardReceiver0~0 0)) (= |#t~string53.base| 0) (not (= 0 |#t~string53.offset|)) (not (= |#t~string49.offset| 0)) (not (= 0 |old(~__ste_client_forwardReceiver0~0)|)) (= |#t~string49.base| 0)) [2018-11-18 10:39:19,991 INFO L421 ceAbstractionStarter]: At program point L656-1(line 656) the Hoare annotation is: (or (and (= ~bob~0 1) (= ~__ste_client_privateKey0~0 123) (= ~chuck~0 3) (= ~__ste_client_idCounter0~0 1) (= main_~tmp~11 1) (= ~__ste_client_forwardReceiver0~0 0) (= ~rjh~0 2)) (not (= |#t~string51.offset| 0)) (= 0 |#t~string51.base|) (= |#t~string53.base| 0) (not (= 0 |#t~string53.offset|)) (not (= |#t~string49.offset| 0)) (not (= 0 |old(~__ste_client_forwardReceiver0~0)|)) (= |#t~string49.base| 0)) [2018-11-18 10:39:19,991 INFO L425 ceAbstractionStarter]: For program point L654(lines 654 661) no Hoare annotation was computed. [2018-11-18 10:39:19,991 INFO L425 ceAbstractionStarter]: For program point L654-1(lines 654 661) no Hoare annotation was computed. [2018-11-18 10:39:19,991 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 644 664) no Hoare annotation was computed. [2018-11-18 10:39:19,991 INFO L425 ceAbstractionStarter]: For program point L652(line 652) no Hoare annotation was computed. [2018-11-18 10:39:19,991 INFO L421 ceAbstractionStarter]: At program point L651(line 651) the Hoare annotation is: (or (not (= |#t~string51.offset| 0)) (= 0 |#t~string51.base|) (= |#t~string53.base| 0) (not (= 0 |#t~string53.offset|)) (not (= |#t~string49.offset| 0)) (not (= 0 |old(~__ste_client_forwardReceiver0~0)|)) (= ~__ste_client_forwardReceiver0~0 0) (= |#t~string49.base| 0)) [2018-11-18 10:39:19,991 INFO L421 ceAbstractionStarter]: At program point L650(line 650) the Hoare annotation is: (or (not (= |#t~string51.offset| 0)) (= 0 |#t~string51.base|) (= |#t~string53.base| 0) (not (= 0 |#t~string53.offset|)) (not (= |#t~string49.offset| 0)) (not (= 0 |old(~__ste_client_forwardReceiver0~0)|)) (= ~__ste_client_forwardReceiver0~0 0) (= |#t~string49.base| 0)) [2018-11-18 10:39:19,991 INFO L421 ceAbstractionStarter]: At program point L650-1(line 650) the Hoare annotation is: (or (not (= |#t~string51.offset| 0)) (= 0 |#t~string51.base|) (= |#t~string53.base| 0) (not (= 0 |#t~string53.offset|)) (not (= |#t~string49.offset| 0)) (not (= 0 |old(~__ste_client_forwardReceiver0~0)|)) (= ~__ste_client_forwardReceiver0~0 0) (= |#t~string49.base| 0)) [2018-11-18 10:39:19,991 INFO L421 ceAbstractionStarter]: At program point rjhKeyChangeENTRY(lines 767 776) the Hoare annotation is: (or (not (= |#t~string51.offset| 0)) (= 0 |#t~string51.base|) (not (= 3 ~chuck~0)) (not (= ~__ste_client_idCounter0~0 1)) (= ~__ste_client_privateKey0~0 123) (= |#t~string53.base| 0) (not (= 0 ~__ste_client_forwardReceiver0~0)) (= |#t~string49.base| 0) (not (= 1 ~bob~0)) (not (= ~rjh~0 2)) (not (= 0 |#t~string53.offset|)) (not (= |#t~string49.offset| 0)) (not (= 123 |old(~__ste_client_privateKey0~0)|))) [2018-11-18 10:39:19,991 INFO L425 ceAbstractionStarter]: For program point rjhKeyChangeEXIT(lines 767 776) no Hoare annotation was computed. [2018-11-18 10:39:19,992 INFO L425 ceAbstractionStarter]: For program point rjhKeyChangeFINAL(lines 767 776) no Hoare annotation was computed. [2018-11-18 10:39:19,992 INFO L421 ceAbstractionStarter]: At program point L560(line 560) the Hoare annotation is: (or (not (= |#t~string51.offset| 0)) (= 0 |#t~string51.base|) (not (= |old(~__ste_client_idCounter0~0)| 1)) (= |#t~string53.base| 0) (and (= ~__ste_client_privateKey0~0 123) (= ~__ste_client_idCounter0~0 1) (= setup_rjh_~rjh___0 2)) (not (= 0 ~__ste_client_forwardReceiver0~0)) (= |#t~string49.base| 0) (not (= 1 ~bob~0)) (not (= ~rjh~0 2)) (not (= |setup_rjh_#in~rjh___0| 2)) (not (= 0 |#t~string53.offset|)) (not (= |#t~string49.offset| 0)) (not (= 123 |old(~__ste_client_privateKey0~0)|))) [2018-11-18 10:39:19,992 INFO L421 ceAbstractionStarter]: At program point L560-1(line 560) the Hoare annotation is: (or (not (= |#t~string51.offset| 0)) (= 0 |#t~string51.base|) (not (= |old(~__ste_client_idCounter0~0)| 1)) (= |#t~string53.base| 0) (and (= ~__ste_client_privateKey0~0 123) (= ~__ste_client_idCounter0~0 1) (= setup_rjh_~rjh___0 2)) (not (= 0 ~__ste_client_forwardReceiver0~0)) (= |#t~string49.base| 0) (not (= 1 ~bob~0)) (not (= ~rjh~0 2)) (not (= |setup_rjh_#in~rjh___0| 2)) (not (= 0 |#t~string53.offset|)) (not (= |#t~string49.offset| 0)) (not (= 123 |old(~__ste_client_privateKey0~0)|))) [2018-11-18 10:39:19,992 INFO L425 ceAbstractionStarter]: For program point setup_rjhFINAL(lines 555 565) no Hoare annotation was computed. [2018-11-18 10:39:19,992 INFO L421 ceAbstractionStarter]: At program point setup_rjhENTRY(lines 555 565) the Hoare annotation is: (or (not (= |#t~string51.offset| 0)) (= 0 |#t~string51.base|) (not (= |old(~__ste_client_idCounter0~0)| 1)) (= |#t~string53.base| 0) (not (= 0 ~__ste_client_forwardReceiver0~0)) (= |#t~string49.base| 0) (not (= 1 ~bob~0)) (and (= ~__ste_client_privateKey0~0 123) (= ~__ste_client_idCounter0~0 1)) (not (= ~rjh~0 2)) (not (= |setup_rjh_#in~rjh___0| 2)) (not (= 0 |#t~string53.offset|)) (not (= |#t~string49.offset| 0)) (not (= 123 |old(~__ste_client_privateKey0~0)|))) [2018-11-18 10:39:19,992 INFO L425 ceAbstractionStarter]: For program point setup_rjhEXIT(lines 555 565) no Hoare annotation was computed. [2018-11-18 10:39:19,992 INFO L425 ceAbstractionStarter]: For program point setEmailIsSignedEXIT(lines 2792 2807) no Hoare annotation was computed. [2018-11-18 10:39:19,992 INFO L425 ceAbstractionStarter]: For program point L2799(lines 2799 2803) no Hoare annotation was computed. [2018-11-18 10:39:19,992 INFO L425 ceAbstractionStarter]: For program point L2796(lines 2796 2804) no Hoare annotation was computed. [2018-11-18 10:39:19,992 INFO L425 ceAbstractionStarter]: For program point L2799-2(lines 2792 2807) no Hoare annotation was computed. [2018-11-18 10:39:19,992 INFO L428 ceAbstractionStarter]: At program point setEmailIsSignedENTRY(lines 2792 2807) the Hoare annotation is: true [2018-11-18 10:39:19,992 INFO L428 ceAbstractionStarter]: At program point getClientPrivateKeyENTRY(lines 1375 1398) the Hoare annotation is: true [2018-11-18 10:39:19,992 INFO L425 ceAbstractionStarter]: For program point L1387(lines 1387 1393) no Hoare annotation was computed. [2018-11-18 10:39:19,992 INFO L425 ceAbstractionStarter]: For program point getClientPrivateKeyEXIT(lines 1375 1398) no Hoare annotation was computed. [2018-11-18 10:39:19,992 INFO L425 ceAbstractionStarter]: For program point L1383(lines 1383 1394) no Hoare annotation was computed. [2018-11-18 10:39:19,992 INFO L425 ceAbstractionStarter]: For program point getClientPrivateKeyFINAL(lines 1375 1398) no Hoare annotation was computed. [2018-11-18 10:39:19,992 INFO L425 ceAbstractionStarter]: For program point L1379(lines 1379 1395) no Hoare annotation was computed. [2018-11-18 10:39:19,992 INFO L425 ceAbstractionStarter]: For program point printMail__wrappee__ForwardFINAL(lines 91 109) no Hoare annotation was computed. [2018-11-18 10:39:19,992 INFO L428 ceAbstractionStarter]: At program point printMail__wrappee__ForwardENTRY(lines 91 109) the Hoare annotation is: true [2018-11-18 10:39:19,992 INFO L428 ceAbstractionStarter]: At program point L103(line 103) the Hoare annotation is: true [2018-11-18 10:39:19,992 INFO L425 ceAbstractionStarter]: For program point printMail__wrappee__ForwardEXIT(lines 91 109) no Hoare annotation was computed. [2018-11-18 10:39:19,992 INFO L425 ceAbstractionStarter]: For program point L103-1(line 103) no Hoare annotation was computed. [2018-11-18 10:39:19,993 INFO L425 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2018-11-18 10:39:19,993 INFO L428 ceAbstractionStarter]: At program point L99(line 99) the Hoare annotation is: true [2018-11-18 10:39:19,993 INFO L428 ceAbstractionStarter]: At program point L99-1(line 99) the Hoare annotation is: true [2018-11-18 10:39:19,993 INFO L428 ceAbstractionStarter]: At program point L81(line 81) the Hoare annotation is: true [2018-11-18 10:39:19,993 INFO L425 ceAbstractionStarter]: For program point L81-1(line 81) no Hoare annotation was computed. [2018-11-18 10:39:19,993 INFO L428 ceAbstractionStarter]: At program point printMail__wrappee__KeysENTRY(lines 63 90) the Hoare annotation is: true [2018-11-18 10:39:19,993 INFO L428 ceAbstractionStarter]: At program point L78(line 78) the Hoare annotation is: true [2018-11-18 10:39:19,993 INFO L425 ceAbstractionStarter]: For program point L78-1(line 78) no Hoare annotation was computed. [2018-11-18 10:39:19,993 INFO L428 ceAbstractionStarter]: At program point L75(line 75) the Hoare annotation is: true [2018-11-18 10:39:19,993 INFO L425 ceAbstractionStarter]: For program point printMail__wrappee__KeysEXIT(lines 63 90) no Hoare annotation was computed. [2018-11-18 10:39:19,993 INFO L425 ceAbstractionStarter]: For program point L75-1(line 75) no Hoare annotation was computed. [2018-11-18 10:39:19,993 INFO L425 ceAbstractionStarter]: For program point printMail__wrappee__KeysFINAL(lines 63 90) no Hoare annotation was computed. [2018-11-18 10:39:19,993 INFO L428 ceAbstractionStarter]: At program point L84(line 84) the Hoare annotation is: true [2018-11-18 10:39:19,993 INFO L425 ceAbstractionStarter]: For program point L84-1(line 84) no Hoare annotation was computed. [2018-11-18 10:39:19,993 INFO L425 ceAbstractionStarter]: For program point rjhKeyAddFINAL(lines 687 698) no Hoare annotation was computed. [2018-11-18 10:39:19,993 INFO L425 ceAbstractionStarter]: For program point rjhKeyAddEXIT(lines 687 698) no Hoare annotation was computed. [2018-11-18 10:39:19,993 INFO L428 ceAbstractionStarter]: At program point rjhKeyAddENTRY(lines 687 698) the Hoare annotation is: true [2018-11-18 10:39:19,993 INFO L428 ceAbstractionStarter]: At program point L693(line 693) the Hoare annotation is: true [2018-11-18 10:39:19,993 INFO L425 ceAbstractionStarter]: For program point L692(line 692) no Hoare annotation was computed. [2018-11-18 10:39:19,993 INFO L428 ceAbstractionStarter]: At program point L693-1(line 693) the Hoare annotation is: true [2018-11-18 10:39:19,993 INFO L428 ceAbstractionStarter]: At program point L604(line 604) the Hoare annotation is: true [2018-11-18 10:39:19,993 INFO L428 ceAbstractionStarter]: At program point L603(line 603) the Hoare annotation is: true [2018-11-18 10:39:19,993 INFO L425 ceAbstractionStarter]: For program point L604-1(lines 587 609) no Hoare annotation was computed. [2018-11-18 10:39:19,993 INFO L428 ceAbstractionStarter]: At program point L602(line 602) the Hoare annotation is: true [2018-11-18 10:39:19,994 INFO L425 ceAbstractionStarter]: For program point L603-1(line 603) no Hoare annotation was computed. [2018-11-18 10:39:19,994 INFO L425 ceAbstractionStarter]: For program point L602-1(line 602) no Hoare annotation was computed. [2018-11-18 10:39:19,994 INFO L425 ceAbstractionStarter]: For program point L598(lines 598 606) no Hoare annotation was computed. [2018-11-18 10:39:19,994 INFO L425 ceAbstractionStarter]: For program point L596(line 596) no Hoare annotation was computed. [2018-11-18 10:39:19,994 INFO L425 ceAbstractionStarter]: For program point bobToRjhEXIT(lines 587 609) no Hoare annotation was computed. [2018-11-18 10:39:19,994 INFO L428 ceAbstractionStarter]: At program point L595(line 595) the Hoare annotation is: true [2018-11-18 10:39:19,994 INFO L428 ceAbstractionStarter]: At program point L595-1(line 595) the Hoare annotation is: true [2018-11-18 10:39:19,994 INFO L428 ceAbstractionStarter]: At program point bobToRjhENTRY(lines 587 609) the Hoare annotation is: true [2018-11-18 10:39:19,994 INFO L421 ceAbstractionStarter]: At program point L539(line 539) the Hoare annotation is: (or (not (= |#t~string51.offset| 0)) (= 0 |#t~string51.base|) (= |#t~string53.base| 0) (not (= 0 |#t~string53.offset|)) (not (= |#t~string49.offset| 0)) (not (= 0 ~__ste_client_forwardReceiver0~0)) (= setup_bob_~bob___0 1) (not (= |setup_bob_#in~bob___0| 1)) (= |#t~string49.base| 0) (not (= 1 ~bob~0))) [2018-11-18 10:39:19,994 INFO L428 ceAbstractionStarter]: At program point setup_bobENTRY(lines 534 544) the Hoare annotation is: true [2018-11-18 10:39:19,994 INFO L421 ceAbstractionStarter]: At program point L539-1(line 539) the Hoare annotation is: (or (not (= |#t~string51.offset| 0)) (= 0 |#t~string51.base|) (and (= setup_bob_~bob___0 1) (= ~__ste_client_idCounter0~0 1)) (= |#t~string53.base| 0) (not (= 0 |#t~string53.offset|)) (not (= |#t~string49.offset| 0)) (not (= 0 ~__ste_client_forwardReceiver0~0)) (not (= |setup_bob_#in~bob___0| 1)) (= |#t~string49.base| 0) (not (= 1 ~bob~0))) [2018-11-18 10:39:19,994 INFO L425 ceAbstractionStarter]: For program point setup_bobFINAL(lines 534 544) no Hoare annotation was computed. [2018-11-18 10:39:19,994 INFO L425 ceAbstractionStarter]: For program point setup_bobEXIT(lines 534 544) no Hoare annotation was computed. [2018-11-18 10:39:19,994 INFO L425 ceAbstractionStarter]: For program point select_featuresEXIT(lines 472 478) no Hoare annotation was computed. [2018-11-18 10:39:19,994 INFO L428 ceAbstractionStarter]: At program point select_featuresFINAL(lines 472 478) the Hoare annotation is: true [2018-11-18 10:39:19,994 INFO L421 ceAbstractionStarter]: At program point L529(line 529) the Hoare annotation is: (or (not (= |#t~string51.offset| 0)) (= 0 |#t~string51.base|) (= |#t~string53.base| 0) (not (= |setup_bob__wrappee__Base_#in~bob___0| 1)) (not (= 0 |#t~string53.offset|)) (not (= |#t~string49.offset| 0)) (not (= 0 ~__ste_client_forwardReceiver0~0)) (= setup_bob__wrappee__Base_~bob___0 1) (= |#t~string49.base| 0) (not (= 1 ~bob~0))) [2018-11-18 10:39:19,994 INFO L425 ceAbstractionStarter]: For program point setup_bob__wrappee__BaseFINAL(lines 524 533) no Hoare annotation was computed. [2018-11-18 10:39:19,994 INFO L428 ceAbstractionStarter]: At program point setup_bob__wrappee__BaseENTRY(lines 524 533) the Hoare annotation is: true [2018-11-18 10:39:19,994 INFO L425 ceAbstractionStarter]: For program point setup_bob__wrappee__BaseEXIT(lines 524 533) no Hoare annotation was computed. [2018-11-18 10:39:19,994 INFO L421 ceAbstractionStarter]: At program point outgoing__wrappee__KeysENTRY(lines 198 209) the Hoare annotation is: (or (not (= 3 ~chuck~0)) (or (not (= |#t~string51.offset| 0)) (= 0 |#t~string51.base|) (not (= ~__ste_client_idCounter0~0 1)) (= |#t~string53.base| 0) (not (= 0 |#t~string53.offset|)) (not (= |#t~string49.offset| 0)) (= |#t~string49.base| 0) (not (= 1 ~bob~0))) (not (= 0 ~__ste_client_forwardReceiver0~0)) (= ~__ste_email_to0~0 2) (not (= ~rjh~0 2)) (not (= 123 ~__ste_client_privateKey0~0)) (not (= |old(~__ste_email_to0~0)| 2))) [2018-11-18 10:39:19,994 INFO L425 ceAbstractionStarter]: For program point outgoing__wrappee__KeysEXIT(lines 198 209) no Hoare annotation was computed. [2018-11-18 10:39:19,995 INFO L421 ceAbstractionStarter]: At program point L204(line 204) the Hoare annotation is: (let ((.cse0 (not (= 3 ~chuck~0))) (.cse1 (or (not (= |#t~string51.offset| 0)) (= 0 |#t~string51.base|) (not (= ~__ste_client_idCounter0~0 1)) (= |#t~string53.base| 0) (not (= 0 |#t~string53.offset|)) (not (= |#t~string49.offset| 0)) (= |#t~string49.base| 0) (not (= 1 ~bob~0)))) (.cse2 (not (= 0 ~__ste_client_forwardReceiver0~0))) (.cse3 (not (= ~rjh~0 2))) (.cse4 (not (= 123 ~__ste_client_privateKey0~0))) (.cse5 (not (= |old(~__ste_email_to0~0)| 2)))) (and (or .cse0 .cse1 (= outgoing__wrappee__Keys_~client 1) .cse2 (not (= |outgoing__wrappee__Keys_#in~client| 1)) .cse3 .cse4 .cse5) (or .cse0 .cse1 .cse2 (= ~__ste_email_to0~0 2) .cse3 .cse4 .cse5))) [2018-11-18 10:39:19,995 INFO L421 ceAbstractionStarter]: At program point L203(line 203) the Hoare annotation is: (let ((.cse0 (not (= 3 ~chuck~0))) (.cse1 (or (not (= |#t~string51.offset| 0)) (= 0 |#t~string51.base|) (not (= ~__ste_client_idCounter0~0 1)) (= |#t~string53.base| 0) (not (= 0 |#t~string53.offset|)) (not (= |#t~string49.offset| 0)) (= |#t~string49.base| 0) (not (= 1 ~bob~0)))) (.cse2 (not (= 0 ~__ste_client_forwardReceiver0~0))) (.cse3 (not (= ~rjh~0 2))) (.cse4 (not (= 123 ~__ste_client_privateKey0~0))) (.cse5 (not (= |old(~__ste_email_to0~0)| 2)))) (and (or .cse0 .cse1 (= outgoing__wrappee__Keys_~client 1) .cse2 (not (= |outgoing__wrappee__Keys_#in~client| 1)) .cse3 .cse4 .cse5) (or .cse0 .cse1 .cse2 (= ~__ste_email_to0~0 2) .cse3 .cse4 .cse5))) [2018-11-18 10:39:19,995 INFO L421 ceAbstractionStarter]: At program point L204-1(line 204) the Hoare annotation is: (let ((.cse0 (not (= 3 ~chuck~0))) (.cse1 (or (not (= |#t~string51.offset| 0)) (= 0 |#t~string51.base|) (not (= ~__ste_client_idCounter0~0 1)) (= |#t~string53.base| 0) (not (= 0 |#t~string53.offset|)) (not (= |#t~string49.offset| 0)) (= |#t~string49.base| 0) (not (= 1 ~bob~0)))) (.cse2 (not (= 0 ~__ste_client_forwardReceiver0~0))) (.cse3 (not (= ~rjh~0 2))) (.cse4 (not (= 123 ~__ste_client_privateKey0~0))) (.cse5 (not (= |old(~__ste_email_to0~0)| 2)))) (and (or .cse0 .cse1 (= outgoing__wrappee__Keys_~client 1) .cse2 (not (= |outgoing__wrappee__Keys_#in~client| 1)) .cse3 .cse4 .cse5) (or .cse0 .cse1 .cse2 (= ~__ste_email_to0~0 2) .cse3 .cse4 .cse5))) [2018-11-18 10:39:19,995 INFO L425 ceAbstractionStarter]: For program point outgoing__wrappee__KeysFINAL(lines 198 209) no Hoare annotation was computed. [2018-11-18 10:39:19,995 INFO L425 ceAbstractionStarter]: For program point L203-1(line 203) no Hoare annotation was computed. [2018-11-18 10:39:19,995 INFO L425 ceAbstractionStarter]: For program point L1775(lines 1775 1781) no Hoare annotation was computed. [2018-11-18 10:39:19,995 INFO L425 ceAbstractionStarter]: For program point getClientForwardReceiverFINAL(lines 1763 1786) no Hoare annotation was computed. [2018-11-18 10:39:19,995 INFO L425 ceAbstractionStarter]: For program point L1771(lines 1771 1782) no Hoare annotation was computed. [2018-11-18 10:39:19,995 INFO L425 ceAbstractionStarter]: For program point getClientForwardReceiverEXIT(lines 1763 1786) no Hoare annotation was computed. [2018-11-18 10:39:19,995 INFO L425 ceAbstractionStarter]: For program point L1767(lines 1767 1783) no Hoare annotation was computed. [2018-11-18 10:39:19,995 INFO L428 ceAbstractionStarter]: At program point getClientForwardReceiverENTRY(lines 1763 1786) the Hoare annotation is: true [2018-11-18 10:39:19,995 INFO L425 ceAbstractionStarter]: For program point incomingFINAL(lines 262 272) no Hoare annotation was computed. [2018-11-18 10:39:19,995 INFO L421 ceAbstractionStarter]: At program point incomingENTRY(lines 262 272) the Hoare annotation is: (or (= ~__ste_email_to0~0 2) (or (not (= 3 ~chuck~0)) (or (not (= |#t~string51.offset| 0)) (= 0 |#t~string51.base|) (not (= ~__ste_client_idCounter0~0 1)) (= |#t~string53.base| 0) (not (= 0 |#t~string53.offset|)) (not (= |#t~string49.offset| 0)) (= |#t~string49.base| 0) (not (= 1 ~bob~0))) (not (= 0 ~__ste_client_forwardReceiver0~0)) (not (= ~rjh~0 2)) (not (= 123 ~__ste_client_privateKey0~0)) (not (= |old(~__ste_email_to0~0)| 2)))) [2018-11-18 10:39:19,995 INFO L421 ceAbstractionStarter]: At program point L267(line 267) the Hoare annotation is: (or (= ~__ste_email_to0~0 2) (or (not (= 3 ~chuck~0)) (or (not (= |#t~string51.offset| 0)) (= 0 |#t~string51.base|) (not (= ~__ste_client_idCounter0~0 1)) (= |#t~string53.base| 0) (not (= 0 |#t~string53.offset|)) (not (= |#t~string49.offset| 0)) (= |#t~string49.base| 0) (not (= 1 ~bob~0))) (not (= 0 ~__ste_client_forwardReceiver0~0)) (not (= ~rjh~0 2)) (not (= 123 ~__ste_client_privateKey0~0)) (not (= |old(~__ste_email_to0~0)| 2)))) [2018-11-18 10:39:19,995 INFO L421 ceAbstractionStarter]: At program point L267-1(line 267) the Hoare annotation is: (or (= ~__ste_email_to0~0 2) (or (not (= 3 ~chuck~0)) (or (not (= |#t~string51.offset| 0)) (= 0 |#t~string51.base|) (not (= ~__ste_client_idCounter0~0 1)) (= |#t~string53.base| 0) (not (= 0 |#t~string53.offset|)) (not (= |#t~string49.offset| 0)) (= |#t~string49.base| 0) (not (= 1 ~bob~0))) (not (= 0 ~__ste_client_forwardReceiver0~0)) (not (= ~rjh~0 2)) (not (= 123 ~__ste_client_privateKey0~0)) (not (= |old(~__ste_email_to0~0)| 2)))) [2018-11-18 10:39:19,995 INFO L425 ceAbstractionStarter]: For program point incomingEXIT(lines 262 272) no Hoare annotation was computed. [2018-11-18 10:39:19,995 INFO L425 ceAbstractionStarter]: For program point createEmailEXIT(lines 142 156) no Hoare annotation was computed. [2018-11-18 10:39:19,995 INFO L425 ceAbstractionStarter]: For program point L150(line 150) no Hoare annotation was computed. [2018-11-18 10:39:19,995 INFO L421 ceAbstractionStarter]: At program point L149(line 149) the Hoare annotation is: (or (not (= 3 ~chuck~0)) (or (not (= |#t~string51.offset| 0)) (= 0 |#t~string51.base|) (not (= ~__ste_client_idCounter0~0 1)) (= |#t~string53.base| 0) (not (= 0 |#t~string53.offset|)) (not (= |#t~string49.offset| 0)) (= |#t~string49.base| 0) (not (= 1 ~bob~0))) (not (= 0 ~__ste_client_forwardReceiver0~0)) (not (= |createEmail_#in~from| 0)) (not (= ~rjh~0 2)) (not (= |createEmail_#in~to| 2)) (not (= 123 ~__ste_client_privateKey0~0)) (and (= createEmail_~msg~0 1) (= createEmail_~to 2) (= createEmail_~from 0))) [2018-11-18 10:39:19,996 INFO L421 ceAbstractionStarter]: At program point L149-1(line 149) the Hoare annotation is: (or (not (= 3 ~chuck~0)) (or (not (= |#t~string51.offset| 0)) (= 0 |#t~string51.base|) (not (= ~__ste_client_idCounter0~0 1)) (= |#t~string53.base| 0) (not (= 0 |#t~string53.offset|)) (not (= |#t~string49.offset| 0)) (= |#t~string49.base| 0) (not (= 1 ~bob~0))) (not (= 0 ~__ste_client_forwardReceiver0~0)) (not (= |createEmail_#in~from| 0)) (not (= ~rjh~0 2)) (not (= |createEmail_#in~to| 2)) (not (= 123 ~__ste_client_privateKey0~0)) (and (= createEmail_~msg~0 1) (= createEmail_~to 2) (= createEmail_~from 0))) [2018-11-18 10:39:19,996 INFO L428 ceAbstractionStarter]: At program point createEmailENTRY(lines 142 156) the Hoare annotation is: true [2018-11-18 10:39:19,996 INFO L425 ceAbstractionStarter]: For program point createEmailFINAL(lines 142 156) no Hoare annotation was computed. [2018-11-18 10:39:19,996 INFO L421 ceAbstractionStarter]: At program point rjhDeletePrivateKeyENTRY(lines 747 756) the Hoare annotation is: (or (not (= |#t~string51.offset| 0)) (= 0 |#t~string51.base|) (not (= 3 ~chuck~0)) (not (= ~__ste_client_idCounter0~0 1)) (= ~__ste_client_privateKey0~0 123) (= |#t~string53.base| 0) (not (= 0 ~__ste_client_forwardReceiver0~0)) (= |#t~string49.base| 0) (not (= 1 ~bob~0)) (not (= ~rjh~0 2)) (not (= 0 |#t~string53.offset|)) (not (= |#t~string49.offset| 0)) (not (= 123 |old(~__ste_client_privateKey0~0)|))) [2018-11-18 10:39:19,996 INFO L425 ceAbstractionStarter]: For program point rjhDeletePrivateKeyEXIT(lines 747 756) no Hoare annotation was computed. [2018-11-18 10:39:19,996 INFO L425 ceAbstractionStarter]: For program point rjhDeletePrivateKeyFINAL(lines 747 756) no Hoare annotation was computed. [2018-11-18 10:39:19,996 INFO L421 ceAbstractionStarter]: At program point L2001(line 2001) the Hoare annotation is: (or (not (= |#t~string51.offset| 0)) (= 0 |#t~string51.base|) (not (= 3 ~chuck~0)) (not (= ~__ste_client_idCounter0~0 1)) (= |#t~string53.base| 0) (not (= 0 |old(~__ste_client_forwardReceiver0~0)|)) (= |#t~string49.base| 0) (not (= 1 ~bob~0)) (= test_~op6~0 0) (not (= ~rjh~0 2)) (not (= 0 |#t~string53.offset|)) (not (= |#t~string49.offset| 0)) (not (= 123 |old(~__ste_client_privateKey0~0)|))) [2018-11-18 10:39:19,996 INFO L425 ceAbstractionStarter]: For program point L2001-1(line 2001) no Hoare annotation was computed. [2018-11-18 10:39:19,996 INFO L425 ceAbstractionStarter]: For program point L1985(lines 1985 1992) no Hoare annotation was computed. [2018-11-18 10:39:19,996 INFO L428 ceAbstractionStarter]: At program point L1952(lines 1942 2085) the Hoare annotation is: true [2018-11-18 10:39:19,996 INFO L421 ceAbstractionStarter]: At program point L2068(line 2068) the Hoare annotation is: (or (not (= |#t~string51.offset| 0)) (= 0 |#t~string51.base|) (not (= 3 ~chuck~0)) (not (= ~__ste_client_idCounter0~0 1)) (= |#t~string53.base| 0) (not (= 0 |old(~__ste_client_forwardReceiver0~0)|)) (= test_~op11~0 0) (= |#t~string49.base| 0) (not (= 1 ~bob~0)) (not (= ~rjh~0 2)) (not (= 0 |#t~string53.offset|)) (not (= |#t~string49.offset| 0)) (not (= 123 |old(~__ste_client_privateKey0~0)|))) [2018-11-18 10:39:19,996 INFO L425 ceAbstractionStarter]: For program point L2068-1(line 2068) no Hoare annotation was computed. [2018-11-18 10:39:19,996 INFO L425 ceAbstractionStarter]: For program point L2027(lines 2027 2031) no Hoare annotation was computed. [2018-11-18 10:39:19,996 INFO L428 ceAbstractionStarter]: At program point L1994(lines 1981 2082) the Hoare annotation is: true [2018-11-18 10:39:19,996 INFO L425 ceAbstractionStarter]: For program point L1928(lines 1928 2086) no Hoare annotation was computed. [2018-11-18 10:39:19,996 INFO L425 ceAbstractionStarter]: For program point L2052(lines 2052 2059) no Hoare annotation was computed. [2018-11-18 10:39:19,996 INFO L425 ceAbstractionStarter]: For program point testEXIT(lines 1881 2095) no Hoare annotation was computed. [2018-11-18 10:39:19,996 INFO L421 ceAbstractionStarter]: At program point testENTRY(lines 1881 2095) the Hoare annotation is: (or (not (= |#t~string51.offset| 0)) (= 0 |#t~string51.base|) (not (= 3 ~chuck~0)) (not (= ~__ste_client_idCounter0~0 1)) (and (= ~__ste_client_privateKey0~0 123) (= ~__ste_client_forwardReceiver0~0 0)) (= |#t~string53.base| 0) (not (= 0 |old(~__ste_client_forwardReceiver0~0)|)) (= |#t~string49.base| 0) (not (= 1 ~bob~0)) (not (= ~rjh~0 2)) (not (= 0 |#t~string53.offset|)) (not (= |#t~string49.offset| 0)) (not (= 123 |old(~__ste_client_privateKey0~0)|))) [2018-11-18 10:39:19,996 INFO L425 ceAbstractionStarter]: For program point L1920-1(lines 1920 2087) no Hoare annotation was computed. [2018-11-18 10:39:19,996 INFO L425 ceAbstractionStarter]: For program point testFINAL(lines 1881 2095) no Hoare annotation was computed. [2018-11-18 10:39:19,996 INFO L428 ceAbstractionStarter]: At program point L2061(lines 2048 2077) the Hoare annotation is: true [2018-11-18 10:39:19,997 INFO L421 ceAbstractionStarter]: At program point L1987(line 1987) the Hoare annotation is: (or (not (= |#t~string51.offset| 0)) (= 0 |#t~string51.base|) (not (= 3 ~chuck~0)) (not (= ~__ste_client_idCounter0~0 1)) (= |#t~string53.base| 0) (= test_~op5~0 0) (not (= 0 |old(~__ste_client_forwardReceiver0~0)|)) (= |#t~string49.base| 0) (not (= 1 ~bob~0)) (not (= ~rjh~0 2)) (not (= 0 |#t~string53.offset|)) (not (= |#t~string49.offset| 0)) (not (= 123 |old(~__ste_client_privateKey0~0)|))) [2018-11-18 10:39:19,997 INFO L425 ceAbstractionStarter]: For program point L1987-1(line 1987) no Hoare annotation was computed. [2018-11-18 10:39:19,997 INFO L425 ceAbstractionStarter]: For program point L1921(lines 1920 2087) no Hoare annotation was computed. [2018-11-18 10:39:19,997 INFO L425 ceAbstractionStarter]: For program point L1946(lines 1946 1950) no Hoare annotation was computed. [2018-11-18 10:39:19,997 INFO L425 ceAbstractionStarter]: For program point L1971(lines 1971 1978) no Hoare annotation was computed. [2018-11-18 10:39:19,997 INFO L421 ceAbstractionStarter]: At program point L2054(line 2054) the Hoare annotation is: (or (not (= |#t~string51.offset| 0)) (= 0 |#t~string51.base|) (not (= 3 ~chuck~0)) (not (= ~__ste_client_idCounter0~0 1)) (= |#t~string53.base| 0) (not (= 0 |old(~__ste_client_forwardReceiver0~0)|)) (= |#t~string49.base| 0) (not (= 1 ~bob~0)) (not (= ~rjh~0 2)) (not (= 0 |#t~string53.offset|)) (not (= |#t~string49.offset| 0)) (not (= 123 |old(~__ste_client_privateKey0~0)|)) (= test_~op10~0 0)) [2018-11-18 10:39:19,997 INFO L425 ceAbstractionStarter]: For program point L2054-1(line 2054) no Hoare annotation was computed. [2018-11-18 10:39:19,997 INFO L425 ceAbstractionStarter]: For program point L1922(lines 1922 1926) no Hoare annotation was computed. [2018-11-18 10:39:19,997 INFO L425 ceAbstractionStarter]: For program point L2013(lines 2013 2020) no Hoare annotation was computed. [2018-11-18 10:39:19,997 INFO L428 ceAbstractionStarter]: At program point L1980(lines 1967 2083) the Hoare annotation is: true [2018-11-18 10:39:19,997 INFO L425 ceAbstractionStarter]: For program point L2038(lines 2038 2045) no Hoare annotation was computed. [2018-11-18 10:39:19,997 INFO L428 ceAbstractionStarter]: At program point L2088(lines 1919 2089) the Hoare annotation is: true [2018-11-18 10:39:19,997 INFO L428 ceAbstractionStarter]: At program point L2022(lines 2009 2080) the Hoare annotation is: true [2018-11-18 10:39:19,997 INFO L428 ceAbstractionStarter]: At program point L2047(lines 2034 2078) the Hoare annotation is: true [2018-11-18 10:39:19,997 INFO L421 ceAbstractionStarter]: At program point L1973(line 1973) the Hoare annotation is: (or (not (= |#t~string51.offset| 0)) (= 0 |#t~string51.base|) (not (= 3 ~chuck~0)) (not (= ~__ste_client_idCounter0~0 1)) (= |#t~string53.base| 0) (not (= 0 |old(~__ste_client_forwardReceiver0~0)|)) (= |#t~string49.base| 0) (not (= 1 ~bob~0)) (not (= ~rjh~0 2)) (not (= 0 |#t~string53.offset|)) (= test_~op4~0 0) (not (= |#t~string49.offset| 0)) (not (= 123 |old(~__ste_client_privateKey0~0)|))) [2018-11-18 10:39:19,997 INFO L425 ceAbstractionStarter]: For program point L1973-1(line 1973) no Hoare annotation was computed. [2018-11-18 10:39:19,997 INFO L425 ceAbstractionStarter]: For program point L1932(lines 1932 1939) no Hoare annotation was computed. [2018-11-18 10:39:19,997 INFO L425 ceAbstractionStarter]: For program point L1957(lines 1957 1964) no Hoare annotation was computed. [2018-11-18 10:39:19,997 INFO L421 ceAbstractionStarter]: At program point L2015(line 2015) the Hoare annotation is: (or (not (= |#t~string51.offset| 0)) (= 0 |#t~string51.base|) (not (= 3 ~chuck~0)) (not (= ~__ste_client_idCounter0~0 1)) (= |#t~string53.base| 0) (not (= 0 |old(~__ste_client_forwardReceiver0~0)|)) (= |#t~string49.base| 0) (not (= 1 ~bob~0)) (= test_~op7~0 0) (not (= ~rjh~0 2)) (not (= 0 |#t~string53.offset|)) (not (= |#t~string49.offset| 0)) (not (= 123 |old(~__ste_client_privateKey0~0)|))) [2018-11-18 10:39:19,997 INFO L425 ceAbstractionStarter]: For program point L2015-1(line 2015) no Hoare annotation was computed. [2018-11-18 10:39:19,997 INFO L421 ceAbstractionStarter]: At program point L2040(line 2040) the Hoare annotation is: (or (not (= |#t~string51.offset| 0)) (= 0 |#t~string51.base|) (not (= 3 ~chuck~0)) (not (= ~__ste_client_idCounter0~0 1)) (= |#t~string53.base| 0) (not (= 0 |old(~__ste_client_forwardReceiver0~0)|)) (= test_~op9~0 0) (= |#t~string49.base| 0) (not (= 1 ~bob~0)) (not (= ~rjh~0 2)) (not (= 0 |#t~string53.offset|)) (not (= |#t~string49.offset| 0)) (not (= 123 |old(~__ste_client_privateKey0~0)|))) [2018-11-18 10:39:19,997 INFO L425 ceAbstractionStarter]: For program point L2040-1(line 2040) no Hoare annotation was computed. [2018-11-18 10:39:19,998 INFO L428 ceAbstractionStarter]: At program point L1941(lines 1928 2086) the Hoare annotation is: true [2018-11-18 10:39:19,998 INFO L425 ceAbstractionStarter]: For program point L1999(lines 1999 2006) no Hoare annotation was computed. [2018-11-18 10:39:19,998 INFO L428 ceAbstractionStarter]: At program point L1966(lines 1953 2084) the Hoare annotation is: true [2018-11-18 10:39:19,998 INFO L428 ceAbstractionStarter]: At program point L2008(lines 1995 2081) the Hoare annotation is: true [2018-11-18 10:39:19,998 INFO L425 ceAbstractionStarter]: For program point L2066(lines 2066 2073) no Hoare annotation was computed. [2018-11-18 10:39:19,998 INFO L428 ceAbstractionStarter]: At program point L2033(lines 2023 2079) the Hoare annotation is: true [2018-11-18 10:39:19,998 INFO L428 ceAbstractionStarter]: At program point L2066-1(lines 1920 2087) the Hoare annotation is: true [2018-11-18 10:39:19,998 INFO L421 ceAbstractionStarter]: At program point L1934(line 1934) the Hoare annotation is: (or (not (= |#t~string51.offset| 0)) (= 0 |#t~string51.base|) (not (= 3 ~chuck~0)) (not (= ~__ste_client_idCounter0~0 1)) (= |#t~string53.base| 0) (not (= 0 |old(~__ste_client_forwardReceiver0~0)|)) (= test_~op1~0 0) (= |#t~string49.base| 0) (not (= 1 ~bob~0)) (not (= ~rjh~0 2)) (not (= 0 |#t~string53.offset|)) (not (= |#t~string49.offset| 0)) (not (= 123 |old(~__ste_client_privateKey0~0)|))) [2018-11-18 10:39:19,998 INFO L425 ceAbstractionStarter]: For program point L1934-1(line 1934) no Hoare annotation was computed. [2018-11-18 10:39:19,998 INFO L421 ceAbstractionStarter]: At program point L1959(line 1959) the Hoare annotation is: (or (not (= |#t~string51.offset| 0)) (= 0 |#t~string51.base|) (not (= 3 ~chuck~0)) (not (= ~__ste_client_idCounter0~0 1)) (= |#t~string53.base| 0) (not (= 0 |old(~__ste_client_forwardReceiver0~0)|)) (= |#t~string49.base| 0) (not (= 1 ~bob~0)) (= test_~op3~0 0) (not (= ~rjh~0 2)) (not (= 0 |#t~string53.offset|)) (not (= |#t~string49.offset| 0)) (not (= 123 |old(~__ste_client_privateKey0~0)|))) [2018-11-18 10:39:19,998 INFO L425 ceAbstractionStarter]: For program point L1959-1(line 1959) no Hoare annotation was computed. [2018-11-18 10:39:19,998 INFO L425 ceAbstractionStarter]: For program point L2592(lines 2592 2598) no Hoare annotation was computed. [2018-11-18 10:39:19,998 INFO L425 ceAbstractionStarter]: For program point getEmailToFINAL(lines 2584 2602) no Hoare annotation was computed. [2018-11-18 10:39:19,998 INFO L425 ceAbstractionStarter]: For program point L2588(lines 2588 2599) no Hoare annotation was computed. [2018-11-18 10:39:19,998 INFO L425 ceAbstractionStarter]: For program point getEmailToEXIT(lines 2584 2602) no Hoare annotation was computed. [2018-11-18 10:39:19,998 INFO L428 ceAbstractionStarter]: At program point getEmailToENTRY(lines 2584 2602) the Hoare annotation is: true [2018-11-18 10:39:19,998 INFO L428 ceAbstractionStarter]: At program point get_queued_emailENTRY(lines 329 337) the Hoare annotation is: true [2018-11-18 10:39:19,998 INFO L425 ceAbstractionStarter]: For program point get_queued_emailFINAL(lines 329 337) no Hoare annotation was computed. [2018-11-18 10:39:19,998 INFO L425 ceAbstractionStarter]: For program point get_queued_emailEXIT(lines 329 337) no Hoare annotation was computed. [2018-11-18 10:39:19,998 INFO L428 ceAbstractionStarter]: At program point incoming__wrappee__SignENTRY(lines 231 240) the Hoare annotation is: true [2018-11-18 10:39:19,998 INFO L428 ceAbstractionStarter]: At program point L236(line 236) the Hoare annotation is: true [2018-11-18 10:39:19,998 INFO L425 ceAbstractionStarter]: For program point incoming__wrappee__SignEXIT(lines 231 240) no Hoare annotation was computed. [2018-11-18 10:39:19,998 INFO L425 ceAbstractionStarter]: For program point incoming__wrappee__SignFINAL(lines 231 240) no Hoare annotation was computed. [2018-11-18 10:39:19,998 INFO L425 ceAbstractionStarter]: For program point L1505(lines 1505 1516) no Hoare annotation was computed. [2018-11-18 10:39:19,998 INFO L425 ceAbstractionStarter]: For program point getClientKeyringUserEXIT(lines 1500 1553) no Hoare annotation was computed. [2018-11-18 10:39:19,999 INFO L425 ceAbstractionStarter]: For program point L1532(lines 1532 1548) no Hoare annotation was computed. [2018-11-18 10:39:19,999 INFO L425 ceAbstractionStarter]: For program point L1518(lines 1518 1549) no Hoare annotation was computed. [2018-11-18 10:39:19,999 INFO L425 ceAbstractionStarter]: For program point getClientKeyringUserFINAL(lines 1500 1553) no Hoare annotation was computed. [2018-11-18 10:39:19,999 INFO L425 ceAbstractionStarter]: For program point L1537(lines 1537 1543) no Hoare annotation was computed. [2018-11-18 10:39:19,999 INFO L425 ceAbstractionStarter]: For program point L1504(lines 1504 1550) no Hoare annotation was computed. [2018-11-18 10:39:19,999 INFO L425 ceAbstractionStarter]: For program point L1533(lines 1533 1544) no Hoare annotation was computed. [2018-11-18 10:39:19,999 INFO L428 ceAbstractionStarter]: At program point getClientKeyringUserENTRY(lines 1500 1553) the Hoare annotation is: true [2018-11-18 10:39:19,999 INFO L425 ceAbstractionStarter]: For program point L1523(lines 1523 1529) no Hoare annotation was computed. [2018-11-18 10:39:19,999 INFO L425 ceAbstractionStarter]: For program point L1519(lines 1519 1530) no Hoare annotation was computed. [2018-11-18 10:39:19,999 INFO L425 ceAbstractionStarter]: For program point L1509(lines 1509 1515) no Hoare annotation was computed. [2018-11-18 10:39:19,999 INFO L425 ceAbstractionStarter]: For program point L1569(lines 1569 1593) no Hoare annotation was computed. [2018-11-18 10:39:19,999 INFO L428 ceAbstractionStarter]: At program point setClientKeyringUserENTRY(lines 1554 1597) the Hoare annotation is: true [2018-11-18 10:39:19,999 INFO L425 ceAbstractionStarter]: For program point L1559(lines 1559 1567) no Hoare annotation was computed. [2018-11-18 10:39:19,999 INFO L425 ceAbstractionStarter]: For program point L1584(lines 1584 1588) no Hoare annotation was computed. [2018-11-18 10:39:19,999 INFO L425 ceAbstractionStarter]: For program point L1580(lines 1580 1592) no Hoare annotation was computed. [2018-11-18 10:39:19,999 INFO L425 ceAbstractionStarter]: For program point L1580-1(lines 1554 1597) no Hoare annotation was computed. [2018-11-18 10:39:19,999 INFO L425 ceAbstractionStarter]: For program point L1570(lines 1570 1578) no Hoare annotation was computed. [2018-11-18 10:39:19,999 INFO L425 ceAbstractionStarter]: For program point setClientKeyringUserEXIT(lines 1554 1597) no Hoare annotation was computed. [2018-11-18 10:39:19,999 INFO L425 ceAbstractionStarter]: For program point L1562(lines 1562 1566) no Hoare annotation was computed. [2018-11-18 10:39:19,999 INFO L425 ceAbstractionStarter]: For program point L1558(lines 1558 1594) no Hoare annotation was computed. [2018-11-18 10:39:19,999 INFO L425 ceAbstractionStarter]: For program point L1581(lines 1581 1589) no Hoare annotation was computed. [2018-11-18 10:39:19,999 INFO L425 ceAbstractionStarter]: For program point L1573(lines 1573 1577) no Hoare annotation was computed. [2018-11-18 10:39:19,999 INFO L428 ceAbstractionStarter]: At program point setEmailFromENTRY(lines 2566 2581) the Hoare annotation is: true [2018-11-18 10:39:19,999 INFO L425 ceAbstractionStarter]: For program point L2573(lines 2573 2577) no Hoare annotation was computed. [2018-11-18 10:39:19,999 INFO L425 ceAbstractionStarter]: For program point setEmailFromEXIT(lines 2566 2581) no Hoare annotation was computed. [2018-11-18 10:39:19,999 INFO L425 ceAbstractionStarter]: For program point L2570(lines 2570 2578) no Hoare annotation was computed. [2018-11-18 10:39:19,999 INFO L425 ceAbstractionStarter]: For program point L2573-2(lines 2566 2581) no Hoare annotation was computed. [2018-11-18 10:39:20,000 INFO L425 ceAbstractionStarter]: For program point isReadableEXIT(lines 124 132) no Hoare annotation was computed. [2018-11-18 10:39:20,000 INFO L428 ceAbstractionStarter]: At program point isReadableENTRY(lines 124 132) the Hoare annotation is: true [2018-11-18 10:39:20,000 INFO L425 ceAbstractionStarter]: For program point isReadableFINAL(lines 124 132) no Hoare annotation was computed. [2018-11-18 10:39:20,000 INFO L425 ceAbstractionStarter]: For program point __automaton_failFINAL(lines 1855 1862) no Hoare annotation was computed. [2018-11-18 10:39:20,000 INFO L425 ceAbstractionStarter]: For program point __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION(line 1859) no Hoare annotation was computed. [2018-11-18 10:39:20,000 INFO L428 ceAbstractionStarter]: At program point __automaton_failENTRY(lines 1855 1862) the Hoare annotation is: true [2018-11-18 10:39:20,000 INFO L425 ceAbstractionStarter]: For program point __automaton_failEXIT(lines 1855 1862) no Hoare annotation was computed. [2018-11-18 10:39:20,000 INFO L425 ceAbstractionStarter]: For program point L1720(lines 1720 1728) no Hoare annotation was computed. [2018-11-18 10:39:20,000 INFO L425 ceAbstractionStarter]: For program point setClientKeyringPublicKeyEXIT(lines 1715 1758) no Hoare annotation was computed. [2018-11-18 10:39:20,000 INFO L425 ceAbstractionStarter]: For program point L1745(lines 1745 1749) no Hoare annotation was computed. [2018-11-18 10:39:20,000 INFO L425 ceAbstractionStarter]: For program point L1741(lines 1741 1753) no Hoare annotation was computed. [2018-11-18 10:39:20,000 INFO L425 ceAbstractionStarter]: For program point L1741-1(lines 1715 1758) no Hoare annotation was computed. [2018-11-18 10:39:20,000 INFO L425 ceAbstractionStarter]: For program point L1731(lines 1731 1739) no Hoare annotation was computed. [2018-11-18 10:39:20,000 INFO L425 ceAbstractionStarter]: For program point L1723(lines 1723 1727) no Hoare annotation was computed. [2018-11-18 10:39:20,000 INFO L425 ceAbstractionStarter]: For program point L1719(lines 1719 1755) no Hoare annotation was computed. [2018-11-18 10:39:20,000 INFO L428 ceAbstractionStarter]: At program point setClientKeyringPublicKeyENTRY(lines 1715 1758) the Hoare annotation is: true [2018-11-18 10:39:20,000 INFO L425 ceAbstractionStarter]: For program point L1742(lines 1742 1750) no Hoare annotation was computed. [2018-11-18 10:39:20,000 INFO L425 ceAbstractionStarter]: For program point L1734(lines 1734 1738) no Hoare annotation was computed. [2018-11-18 10:39:20,000 INFO L425 ceAbstractionStarter]: For program point L1730(lines 1730 1754) no Hoare annotation was computed. [2018-11-18 10:39:20,000 INFO L421 ceAbstractionStarter]: At program point setup_rjh__wrappee__BaseENTRY(lines 545 554) the Hoare annotation is: (or (not (= |#t~string51.offset| 0)) (= 0 |#t~string51.base|) (not (= |old(~__ste_client_idCounter0~0)| 1)) (= |#t~string53.base| 0) (not (= 0 ~__ste_client_forwardReceiver0~0)) (= |#t~string49.base| 0) (not (= 1 ~bob~0)) (not (= |setup_rjh__wrappee__Base_#in~rjh___0| 2)) (not (= ~rjh~0 2)) (= ~__ste_client_idCounter0~0 1) (not (= 0 |#t~string53.offset|)) (not (= |#t~string49.offset| 0)) (not (= 123 ~__ste_client_privateKey0~0))) [2018-11-18 10:39:20,000 INFO L425 ceAbstractionStarter]: For program point setup_rjh__wrappee__BaseFINAL(lines 545 554) no Hoare annotation was computed. [2018-11-18 10:39:20,001 INFO L421 ceAbstractionStarter]: At program point L550(line 550) the Hoare annotation is: (or (not (= |#t~string51.offset| 0)) (= 0 |#t~string51.base|) (not (= |old(~__ste_client_idCounter0~0)| 1)) (= |#t~string53.base| 0) (not (= 0 ~__ste_client_forwardReceiver0~0)) (and (= ~__ste_client_idCounter0~0 1) (= setup_rjh__wrappee__Base_~rjh___0 2)) (= |#t~string49.base| 0) (not (= 1 ~bob~0)) (not (= |setup_rjh__wrappee__Base_#in~rjh___0| 2)) (not (= ~rjh~0 2)) (not (= 0 |#t~string53.offset|)) (not (= |#t~string49.offset| 0)) (not (= 123 ~__ste_client_privateKey0~0))) [2018-11-18 10:39:20,001 INFO L425 ceAbstractionStarter]: For program point setup_rjh__wrappee__BaseEXIT(lines 545 554) no Hoare annotation was computed. [2018-11-18 10:39:20,001 INFO L425 ceAbstractionStarter]: For program point L1791(lines 1791 1803) no Hoare annotation was computed. [2018-11-18 10:39:20,001 INFO L421 ceAbstractionStarter]: At program point setClientForwardReceiverENTRY(lines 1787 1806) the Hoare annotation is: (or (not (= |#t~string51.offset| 0)) (= 0 |#t~string51.base|) (not (= 3 ~chuck~0)) (not (= ~__ste_client_idCounter0~0 1)) (not (= ~rjh~0 2)) (= |#t~string53.base| 0) (not (= 0 |#t~string53.offset|)) (not (= |#t~string49.offset| 0)) (not (= 0 |old(~__ste_client_forwardReceiver0~0)|)) (= ~__ste_client_forwardReceiver0~0 0) (= |#t~string49.base| 0) (not (= 1 ~bob~0))) [2018-11-18 10:39:20,001 INFO L425 ceAbstractionStarter]: For program point setClientForwardReceiverEXIT(lines 1787 1806) no Hoare annotation was computed. [2018-11-18 10:39:20,001 INFO L425 ceAbstractionStarter]: For program point L1797(lines 1797 1801) no Hoare annotation was computed. [2018-11-18 10:39:20,001 INFO L425 ceAbstractionStarter]: For program point L1797-2(lines 1787 1806) no Hoare annotation was computed. [2018-11-18 10:39:20,001 INFO L425 ceAbstractionStarter]: For program point L1794(lines 1794 1802) no Hoare annotation was computed. [2018-11-18 10:39:20,001 INFO L421 ceAbstractionStarter]: At program point L215(line 215) the Hoare annotation is: (let ((.cse0 (not (= 3 ~chuck~0))) (.cse1 (or (not (= |#t~string51.offset| 0)) (= 0 |#t~string51.base|) (not (= ~__ste_client_idCounter0~0 1)) (= |#t~string53.base| 0) (not (= 0 |#t~string53.offset|)) (not (= |#t~string49.offset| 0)) (= |#t~string49.base| 0) (not (= 1 ~bob~0)))) (.cse2 (not (= 0 ~__ste_client_forwardReceiver0~0))) (.cse3 (not (= ~rjh~0 2))) (.cse4 (not (= 123 ~__ste_client_privateKey0~0))) (.cse5 (not (= |old(~__ste_email_to0~0)| 2)))) (and (or .cse0 .cse1 .cse2 (= ~__ste_email_to0~0 2) .cse3 .cse4 .cse5) (or .cse0 (not (= |outgoing_#in~client| 1)) .cse1 .cse2 .cse3 .cse4 .cse5 (= outgoing_~client 1)))) [2018-11-18 10:39:20,001 INFO L425 ceAbstractionStarter]: For program point outgoingEXIT(lines 210 220) no Hoare annotation was computed. [2018-11-18 10:39:20,001 INFO L421 ceAbstractionStarter]: At program point L215-1(line 215) the Hoare annotation is: (let ((.cse0 (not (= 3 ~chuck~0))) (.cse1 (or (not (= |#t~string51.offset| 0)) (= 0 |#t~string51.base|) (not (= ~__ste_client_idCounter0~0 1)) (= |#t~string53.base| 0) (not (= 0 |#t~string53.offset|)) (not (= |#t~string49.offset| 0)) (= |#t~string49.base| 0) (not (= 1 ~bob~0)))) (.cse2 (not (= 0 ~__ste_client_forwardReceiver0~0))) (.cse3 (not (= ~rjh~0 2))) (.cse4 (not (= 123 ~__ste_client_privateKey0~0))) (.cse5 (not (= |old(~__ste_email_to0~0)| 2)))) (and (or .cse0 .cse1 .cse2 (= ~__ste_email_to0~0 2) .cse3 .cse4 .cse5) (or .cse0 (not (= |outgoing_#in~client| 1)) .cse1 .cse2 .cse3 .cse4 .cse5 (= outgoing_~client 1)))) [2018-11-18 10:39:20,001 INFO L421 ceAbstractionStarter]: At program point outgoingENTRY(lines 210 220) the Hoare annotation is: (or (not (= 3 ~chuck~0)) (or (not (= |#t~string51.offset| 0)) (= 0 |#t~string51.base|) (not (= ~__ste_client_idCounter0~0 1)) (= |#t~string53.base| 0) (not (= 0 |#t~string53.offset|)) (not (= |#t~string49.offset| 0)) (= |#t~string49.base| 0) (not (= 1 ~bob~0))) (not (= 0 ~__ste_client_forwardReceiver0~0)) (= ~__ste_email_to0~0 2) (not (= ~rjh~0 2)) (not (= 123 ~__ste_client_privateKey0~0)) (not (= |old(~__ste_email_to0~0)| 2))) [2018-11-18 10:39:20,001 INFO L425 ceAbstractionStarter]: For program point outgoingFINAL(lines 210 220) no Hoare annotation was computed. [2018-11-18 10:39:20,001 INFO L428 ceAbstractionStarter]: At program point select_helpersFINAL(lines 479 485) the Hoare annotation is: true [2018-11-18 10:39:20,001 INFO L425 ceAbstractionStarter]: For program point select_helpersEXIT(lines 479 485) no Hoare annotation was computed. [2018-11-18 10:39:20,001 INFO L425 ceAbstractionStarter]: For program point getClientIdFINAL(lines 1810 1833) no Hoare annotation was computed. [2018-11-18 10:39:20,001 INFO L425 ceAbstractionStarter]: For program point L1822(lines 1822 1828) no Hoare annotation was computed. [2018-11-18 10:39:20,001 INFO L428 ceAbstractionStarter]: At program point getClientIdENTRY(lines 1810 1833) the Hoare annotation is: true [2018-11-18 10:39:20,001 INFO L425 ceAbstractionStarter]: For program point L1818(lines 1818 1829) no Hoare annotation was computed. [2018-11-18 10:39:20,001 INFO L425 ceAbstractionStarter]: For program point L1814(lines 1814 1830) no Hoare annotation was computed. [2018-11-18 10:39:20,002 INFO L425 ceAbstractionStarter]: For program point getClientIdEXIT(lines 1810 1833) no Hoare annotation was computed. [2018-11-18 10:39:20,002 INFO L428 ceAbstractionStarter]: At program point isVerifiedENTRY(lines 2847 2865) the Hoare annotation is: true [2018-11-18 10:39:20,002 INFO L425 ceAbstractionStarter]: For program point isVerifiedFINAL(lines 2847 2865) no Hoare annotation was computed. [2018-11-18 10:39:20,002 INFO L425 ceAbstractionStarter]: For program point L2855(lines 2855 2861) no Hoare annotation was computed. [2018-11-18 10:39:20,002 INFO L425 ceAbstractionStarter]: For program point isVerifiedEXIT(lines 2847 2865) no Hoare annotation was computed. [2018-11-18 10:39:20,002 INFO L425 ceAbstractionStarter]: For program point L2851(lines 2851 2862) no Hoare annotation was computed. [2018-11-18 10:39:20,002 INFO L425 ceAbstractionStarter]: For program point deliverFINAL(lines 221 230) no Hoare annotation was computed. [2018-11-18 10:39:20,002 INFO L428 ceAbstractionStarter]: At program point deliverENTRY(lines 221 230) the Hoare annotation is: true [2018-11-18 10:39:20,002 INFO L425 ceAbstractionStarter]: For program point deliverEXIT(lines 221 230) no Hoare annotation was computed. [2018-11-18 10:39:20,002 INFO L425 ceAbstractionStarter]: For program point L1474-1(line 1474) no Hoare annotation was computed. [2018-11-18 10:39:20,002 INFO L425 ceAbstractionStarter]: For program point createClientKeyringEntryEXIT(lines 1466 1490) no Hoare annotation was computed. [2018-11-18 10:39:20,002 INFO L428 ceAbstractionStarter]: At program point L1480(line 1480) the Hoare annotation is: true [2018-11-18 10:39:20,002 INFO L425 ceAbstractionStarter]: For program point L1480-1(line 1480) no Hoare annotation was computed. [2018-11-18 10:39:20,002 INFO L425 ceAbstractionStarter]: For program point L1477(lines 1477 1487) no Hoare annotation was computed. [2018-11-18 10:39:20,002 INFO L428 ceAbstractionStarter]: At program point createClientKeyringEntryENTRY(lines 1466 1490) the Hoare annotation is: true [2018-11-18 10:39:20,002 INFO L428 ceAbstractionStarter]: At program point L1474(line 1474) the Hoare annotation is: true [2018-11-18 10:39:20,002 INFO L425 ceAbstractionStarter]: For program point createClientKeyringEntryFINAL(lines 1466 1490) no Hoare annotation was computed. [2018-11-18 10:39:20,002 INFO L425 ceAbstractionStarter]: For program point setup_chuckEXIT(lines 576 586) no Hoare annotation was computed. [2018-11-18 10:39:20,002 INFO L421 ceAbstractionStarter]: At program point setup_chuckENTRY(lines 576 586) the Hoare annotation is: (or (= 0 |#t~string51.base|) (not (= 3 ~chuck~0)) (not (= |#t~string51.offset| 0)) (not (= |setup_chuck_#in~chuck___0| 3)) (not (= |old(~__ste_client_idCounter0~0)| 1)) (= |#t~string53.base| 0) (not (= 0 ~__ste_client_forwardReceiver0~0)) (not (= 1 ~bob~0)) (= |#t~string49.base| 0) (not (= ~rjh~0 2)) (and (= ~__ste_client_privateKey0~0 123) (= ~__ste_client_idCounter0~0 1)) (not (= 0 |#t~string53.offset|)) (not (= 123 |old(~__ste_client_privateKey0~0)|)) (not (= |#t~string49.offset| 0))) [2018-11-18 10:39:20,002 INFO L425 ceAbstractionStarter]: For program point setup_chuckFINAL(lines 576 586) no Hoare annotation was computed. [2018-11-18 10:39:20,002 INFO L421 ceAbstractionStarter]: At program point L581(line 581) the Hoare annotation is: (or (= 0 |#t~string51.base|) (not (= 3 ~chuck~0)) (not (= |#t~string51.offset| 0)) (not (= |setup_chuck_#in~chuck___0| 3)) (not (= |old(~__ste_client_idCounter0~0)| 1)) (= |#t~string53.base| 0) (and (= ~__ste_client_privateKey0~0 123) (= ~__ste_client_idCounter0~0 1) (= setup_chuck_~chuck___0 3)) (not (= 0 ~__ste_client_forwardReceiver0~0)) (not (= 1 ~bob~0)) (= |#t~string49.base| 0) (not (= ~rjh~0 2)) (not (= 0 |#t~string53.offset|)) (not (= 123 |old(~__ste_client_privateKey0~0)|)) (not (= |#t~string49.offset| 0))) [2018-11-18 10:39:20,002 INFO L421 ceAbstractionStarter]: At program point L581-1(line 581) the Hoare annotation is: (or (= 0 |#t~string51.base|) (not (= 3 ~chuck~0)) (not (= |#t~string51.offset| 0)) (not (= |setup_chuck_#in~chuck___0| 3)) (not (= |old(~__ste_client_idCounter0~0)| 1)) (= |#t~string53.base| 0) (and (= ~__ste_client_privateKey0~0 123) (= ~__ste_client_idCounter0~0 1) (= setup_chuck_~chuck___0 3)) (not (= 0 ~__ste_client_forwardReceiver0~0)) (not (= 1 ~bob~0)) (= |#t~string49.base| 0) (not (= ~rjh~0 2)) (not (= 0 |#t~string53.offset|)) (not (= 123 |old(~__ste_client_privateKey0~0)|)) (not (= |#t~string49.offset| 0))) [2018-11-18 10:39:20,003 INFO L425 ceAbstractionStarter]: For program point L1693(lines 1693 1709) no Hoare annotation was computed. [2018-11-18 10:39:20,003 INFO L425 ceAbstractionStarter]: For program point L1679(lines 1679 1710) no Hoare annotation was computed. [2018-11-18 10:39:20,003 INFO L425 ceAbstractionStarter]: For program point L1698(lines 1698 1704) no Hoare annotation was computed. [2018-11-18 10:39:20,003 INFO L425 ceAbstractionStarter]: For program point L1665(lines 1665 1711) no Hoare annotation was computed. [2018-11-18 10:39:20,003 INFO L425 ceAbstractionStarter]: For program point L1694(lines 1694 1705) no Hoare annotation was computed. [2018-11-18 10:39:20,003 INFO L425 ceAbstractionStarter]: For program point L1684(lines 1684 1690) no Hoare annotation was computed. [2018-11-18 10:39:20,003 INFO L425 ceAbstractionStarter]: For program point findPublicKeyFINAL(lines 1661 1714) no Hoare annotation was computed. [2018-11-18 10:39:20,003 INFO L425 ceAbstractionStarter]: For program point L1680(lines 1680 1691) no Hoare annotation was computed. [2018-11-18 10:39:20,003 INFO L425 ceAbstractionStarter]: For program point L1670(lines 1670 1676) no Hoare annotation was computed. [2018-11-18 10:39:20,003 INFO L425 ceAbstractionStarter]: For program point findPublicKeyEXIT(lines 1661 1714) no Hoare annotation was computed. [2018-11-18 10:39:20,003 INFO L428 ceAbstractionStarter]: At program point findPublicKeyENTRY(lines 1661 1714) the Hoare annotation is: true [2018-11-18 10:39:20,003 INFO L425 ceAbstractionStarter]: For program point L1666(lines 1666 1677) no Hoare annotation was computed. [2018-11-18 10:39:20,003 INFO L425 ceAbstractionStarter]: For program point sendEmailEXIT(lines 288 300) no Hoare annotation was computed. [2018-11-18 10:39:20,003 INFO L428 ceAbstractionStarter]: At program point sendEmailENTRY(lines 288 300) the Hoare annotation is: true [2018-11-18 10:39:20,003 INFO L425 ceAbstractionStarter]: For program point sendEmailFINAL(lines 288 300) no Hoare annotation was computed. [2018-11-18 10:39:20,003 INFO L421 ceAbstractionStarter]: At program point L296(line 296) the Hoare annotation is: (or (not (= 3 ~chuck~0)) (or (not (= |#t~string51.offset| 0)) (= 0 |#t~string51.base|) (not (= ~__ste_client_idCounter0~0 1)) (= |#t~string53.base| 0) (not (= 0 |#t~string53.offset|)) (not (= |#t~string49.offset| 0)) (= |#t~string49.base| 0) (not (= 1 ~bob~0))) (not (= |sendEmail_#in~receiver| 2)) (not (= 0 ~__ste_client_forwardReceiver0~0)) (and (= ~__ste_email_to0~0 2) (= sendEmail_~receiver 2) (= sendEmail_~sender 1)) (not (= ~rjh~0 2)) (not (= 123 ~__ste_client_privateKey0~0)) (not (= |sendEmail_#in~sender| 1))) [2018-11-18 10:39:20,003 INFO L421 ceAbstractionStarter]: At program point L294(line 294) the Hoare annotation is: (or (not (= 3 ~chuck~0)) (or (not (= |#t~string51.offset| 0)) (= 0 |#t~string51.base|) (not (= ~__ste_client_idCounter0~0 1)) (= |#t~string53.base| 0) (not (= 0 |#t~string53.offset|)) (not (= |#t~string49.offset| 0)) (= |#t~string49.base| 0) (not (= 1 ~bob~0))) (not (= |sendEmail_#in~receiver| 2)) (not (= 0 ~__ste_client_forwardReceiver0~0)) (not (= ~rjh~0 2)) (not (= 123 ~__ste_client_privateKey0~0)) (and (= sendEmail_~receiver 2) (= sendEmail_~sender 1)) (not (= |sendEmail_#in~sender| 1))) [2018-11-18 10:39:20,003 INFO L425 ceAbstractionStarter]: For program point L294-1(line 294) no Hoare annotation was computed. [2018-11-18 10:39:20,003 INFO L421 ceAbstractionStarter]: At program point L446(line 446) the Hoare annotation is: (or (or (not (= |#t~string51.offset| 0)) (= 0 |#t~string51.base|) (not (= ~__ste_client_idCounter0~0 1)) (= |#t~string53.base| 0) (not (= 0 |#t~string53.offset|)) (not (= |#t~string49.offset| 0)) (= |#t~string49.base| 0) (not (= 1 ~bob~0))) (not (= 0 ~__ste_client_forwardReceiver0~0)) (= verify_~tmp~9 1)) [2018-11-18 10:39:20,003 INFO L425 ceAbstractionStarter]: For program point L444(lines 444 450) no Hoare annotation was computed. [2018-11-18 10:39:20,003 INFO L421 ceAbstractionStarter]: At program point L442(line 442) the Hoare annotation is: (or (or (not (= |#t~string51.offset| 0)) (= 0 |#t~string51.base|) (not (= ~__ste_client_idCounter0~0 1)) (= |#t~string53.base| 0) (not (= 0 |#t~string53.offset|)) (not (= |#t~string49.offset| 0)) (= |#t~string49.base| 0) (not (= 1 ~bob~0))) (not (= 0 ~__ste_client_forwardReceiver0~0)) (= verify_~tmp~9 1)) [2018-11-18 10:39:20,003 INFO L425 ceAbstractionStarter]: For program point L442-1(line 442) no Hoare annotation was computed. [2018-11-18 10:39:20,004 INFO L421 ceAbstractionStarter]: At program point L436(line 436) the Hoare annotation is: (or (or (not (= |#t~string51.offset| 0)) (= 0 |#t~string51.base|) (not (= ~__ste_client_idCounter0~0 1)) (= |#t~string53.base| 0) (not (= 0 |#t~string53.offset|)) (not (= |#t~string49.offset| 0)) (= |#t~string49.base| 0) (not (= 1 ~bob~0))) (not (= 0 ~__ste_client_forwardReceiver0~0)) (= verify_~tmp~9 1)) [2018-11-18 10:39:20,004 INFO L425 ceAbstractionStarter]: For program point L436-1(line 436) no Hoare annotation was computed. [2018-11-18 10:39:20,004 INFO L425 ceAbstractionStarter]: For program point L426(lines 426 430) no Hoare annotation was computed. [2018-11-18 10:39:20,004 INFO L425 ceAbstractionStarter]: For program point verifyEXIT(lines 409 456) no Hoare annotation was computed. [2018-11-18 10:39:20,004 INFO L421 ceAbstractionStarter]: At program point L426-1(lines 422 433) the Hoare annotation is: (or (or (not (= |#t~string51.offset| 0)) (= 0 |#t~string51.base|) (not (= ~__ste_client_idCounter0~0 1)) (= |#t~string53.base| 0) (not (= 0 |#t~string53.offset|)) (not (= |#t~string49.offset| 0)) (= |#t~string49.base| 0) (not (= 1 ~bob~0))) (not (= 0 ~__ste_client_forwardReceiver0~0)) (= verify_~tmp~9 1)) [2018-11-18 10:39:20,004 INFO L421 ceAbstractionStarter]: At program point L424(line 424) the Hoare annotation is: (or (or (not (= |#t~string51.offset| 0)) (= 0 |#t~string51.base|) (not (= ~__ste_client_idCounter0~0 1)) (= |#t~string53.base| 0) (not (= 0 |#t~string53.offset|)) (not (= |#t~string49.offset| 0)) (= |#t~string49.base| 0) (not (= 1 ~bob~0))) (not (= 0 ~__ste_client_forwardReceiver0~0)) (= verify_~tmp~9 1)) [2018-11-18 10:39:20,004 INFO L425 ceAbstractionStarter]: For program point L424-1(line 424) no Hoare annotation was computed. [2018-11-18 10:39:20,004 INFO L428 ceAbstractionStarter]: At program point verifyENTRY(lines 409 456) the Hoare annotation is: true [2018-11-18 10:39:20,004 INFO L425 ceAbstractionStarter]: For program point L422(lines 422 433) no Hoare annotation was computed. [2018-11-18 10:39:20,004 INFO L428 ceAbstractionStarter]: At program point L420(line 420) the Hoare annotation is: true [2018-11-18 10:39:20,004 INFO L425 ceAbstractionStarter]: For program point L420-1(line 420) no Hoare annotation was computed. [2018-11-18 10:39:20,004 INFO L421 ceAbstractionStarter]: At program point L441(line 441) the Hoare annotation is: (or (or (not (= |#t~string51.offset| 0)) (= 0 |#t~string51.base|) (not (= ~__ste_client_idCounter0~0 1)) (= |#t~string53.base| 0) (not (= 0 |#t~string53.offset|)) (not (= |#t~string49.offset| 0)) (= |#t~string49.base| 0) (not (= 1 ~bob~0))) (not (= 0 ~__ste_client_forwardReceiver0~0)) (= verify_~tmp~9 1)) [2018-11-18 10:39:20,004 INFO L425 ceAbstractionStarter]: For program point L441-1(line 441) no Hoare annotation was computed. [2018-11-18 10:39:20,004 INFO L425 ceAbstractionStarter]: For program point L439(lines 439 453) no Hoare annotation was computed. [2018-11-18 10:39:20,005 INFO L425 ceAbstractionStarter]: For program point L439-1(lines 409 456) no Hoare annotation was computed. [2018-11-18 10:39:20,005 INFO L425 ceAbstractionStarter]: For program point L435(line 435) no Hoare annotation was computed. [2018-11-18 10:39:20,005 INFO L425 ceAbstractionStarter]: For program point L2814(lines 2814 2825) no Hoare annotation was computed. [2018-11-18 10:39:20,005 INFO L425 ceAbstractionStarter]: For program point getEmailSignKeyEXIT(lines 2810 2828) no Hoare annotation was computed. [2018-11-18 10:39:20,005 INFO L428 ceAbstractionStarter]: At program point getEmailSignKeyENTRY(lines 2810 2828) the Hoare annotation is: true [2018-11-18 10:39:20,005 INFO L425 ceAbstractionStarter]: For program point getEmailSignKeyFINAL(lines 2810 2828) no Hoare annotation was computed. [2018-11-18 10:39:20,005 INFO L425 ceAbstractionStarter]: For program point L2818(lines 2818 2824) no Hoare annotation was computed. [2018-11-18 10:39:20,005 INFO L421 ceAbstractionStarter]: At program point setClientPrivateKeyENTRY(lines 1399 1418) the Hoare annotation is: (let ((.cse1 (not (= |#t~string51.offset| 0))) (.cse0 (= 0 |#t~string51.base|)) (.cse2 (not (= ~__ste_client_idCounter0~0 1))) (.cse11 (= ~__ste_client_privateKey0~0 123)) (.cse3 (= |#t~string53.base| 0)) (.cse4 (not (= 0 ~__ste_client_forwardReceiver0~0))) (.cse6 (= |#t~string49.base| 0)) (.cse5 (not (= 1 ~bob~0))) (.cse7 (not (= ~rjh~0 2))) (.cse8 (not (= 0 |#t~string53.offset|))) (.cse10 (not (= |#t~string49.offset| 0))) (.cse9 (not (= 123 |old(~__ste_client_privateKey0~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 (not (= |setClientPrivateKey_#in~value| 456)) .cse4 (not (= |setClientPrivateKey_#in~handle| 2)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse1 .cse0 (not (= 3 ~chuck~0)) .cse2 .cse11 .cse3 .cse4 .cse6 .cse5 .cse7 .cse8 .cse10 .cse9))) [2018-11-18 10:39:20,005 INFO L425 ceAbstractionStarter]: For program point L1409(lines 1409 1413) no Hoare annotation was computed. [2018-11-18 10:39:20,005 INFO L425 ceAbstractionStarter]: For program point L1409-2(lines 1399 1418) no Hoare annotation was computed. [2018-11-18 10:39:20,005 INFO L425 ceAbstractionStarter]: For program point L1406(lines 1406 1414) no Hoare annotation was computed. [2018-11-18 10:39:20,005 INFO L425 ceAbstractionStarter]: For program point L1403(lines 1403 1415) no Hoare annotation was computed. [2018-11-18 10:39:20,005 INFO L425 ceAbstractionStarter]: For program point setClientPrivateKeyEXIT(lines 1399 1418) no Hoare annotation was computed. [2018-11-18 10:39:20,006 INFO L425 ceAbstractionStarter]: For program point chuckKeyAddEXIT(lines 723 734) no Hoare annotation was computed. [2018-11-18 10:39:20,006 INFO L428 ceAbstractionStarter]: At program point L729(line 729) the Hoare annotation is: true [2018-11-18 10:39:20,006 INFO L425 ceAbstractionStarter]: For program point L728(line 728) no Hoare annotation was computed. [2018-11-18 10:39:20,006 INFO L428 ceAbstractionStarter]: At program point L729-1(line 729) the Hoare annotation is: true [2018-11-18 10:39:20,006 INFO L428 ceAbstractionStarter]: At program point chuckKeyAddENTRY(lines 723 734) the Hoare annotation is: true [2018-11-18 10:39:20,006 INFO L425 ceAbstractionStarter]: For program point chuckKeyAddFINAL(lines 723 734) no Hoare annotation was computed. [2018-11-18 10:39:20,006 INFO L425 ceAbstractionStarter]: For program point printMailEXIT(lines 110 123) no Hoare annotation was computed. [2018-11-18 10:39:20,006 INFO L425 ceAbstractionStarter]: For program point L117(line 117) no Hoare annotation was computed. [2018-11-18 10:39:20,006 INFO L428 ceAbstractionStarter]: At program point L116(line 116) the Hoare annotation is: true [2018-11-18 10:39:20,008 INFO L428 ceAbstractionStarter]: At program point printMailENTRY(lines 110 123) the Hoare annotation is: true [2018-11-18 10:39:20,008 INFO L428 ceAbstractionStarter]: At program point L116-1(line 116) the Hoare annotation is: true [2018-11-18 10:39:20,008 INFO L425 ceAbstractionStarter]: For program point printMailFINAL(lines 110 123) no Hoare annotation was computed. [2018-11-18 10:39:20,009 INFO L428 ceAbstractionStarter]: At program point L401(line 401) the Hoare annotation is: true [2018-11-18 10:39:20,009 INFO L428 ceAbstractionStarter]: At program point forwardENTRY(lines 395 408) the Hoare annotation is: true [2018-11-18 10:39:20,009 INFO L425 ceAbstractionStarter]: For program point L401-1(line 401) no Hoare annotation was computed. [2018-11-18 10:39:20,009 INFO L425 ceAbstractionStarter]: For program point forwardEXIT(lines 395 408) no Hoare annotation was computed. [2018-11-18 10:39:20,009 INFO L425 ceAbstractionStarter]: For program point forwardFINAL(lines 395 408) no Hoare annotation was computed. [2018-11-18 10:39:20,009 INFO L428 ceAbstractionStarter]: At program point L403(line 403) the Hoare annotation is: true [2018-11-18 10:39:20,009 INFO L428 ceAbstractionStarter]: At program point L403-1(line 403) the Hoare annotation is: true [2018-11-18 10:39:20,009 INFO L428 ceAbstractionStarter]: At program point getClientKeyringSizeENTRY(lines 1422 1445) the Hoare annotation is: true [2018-11-18 10:39:20,009 INFO L425 ceAbstractionStarter]: For program point getClientKeyringSizeEXIT(lines 1422 1445) no Hoare annotation was computed. [2018-11-18 10:39:20,009 INFO L425 ceAbstractionStarter]: For program point L1434(lines 1434 1440) no Hoare annotation was computed. [2018-11-18 10:39:20,009 INFO L425 ceAbstractionStarter]: For program point getClientKeyringSizeFINAL(lines 1422 1445) no Hoare annotation was computed. [2018-11-18 10:39:20,009 INFO L425 ceAbstractionStarter]: For program point L1430(lines 1430 1441) no Hoare annotation was computed. [2018-11-18 10:39:20,009 INFO L425 ceAbstractionStarter]: For program point L1426(lines 1426 1442) no Hoare annotation was computed. [2018-11-18 10:39:20,009 INFO L425 ceAbstractionStarter]: For program point L2610-2(lines 2603 2618) no Hoare annotation was computed. [2018-11-18 10:39:20,010 INFO L425 ceAbstractionStarter]: For program point L2607(lines 2607 2615) no Hoare annotation was computed. [2018-11-18 10:39:20,010 INFO L425 ceAbstractionStarter]: For program point setEmailToEXIT(lines 2603 2618) no Hoare annotation was computed. [2018-11-18 10:39:20,010 INFO L425 ceAbstractionStarter]: For program point L2610(lines 2610 2614) no Hoare annotation was computed. [2018-11-18 10:39:20,010 INFO L421 ceAbstractionStarter]: At program point setEmailToENTRY(lines 2603 2618) the Hoare annotation is: (or (not (= 3 ~chuck~0)) (or (not (= |#t~string51.offset| 0)) (= 0 |#t~string51.base|) (not (= ~__ste_client_idCounter0~0 1)) (= |#t~string53.base| 0) (not (= 0 |#t~string53.offset|)) (not (= |#t~string49.offset| 0)) (= |#t~string49.base| 0) (not (= 1 ~bob~0))) (not (= 0 ~__ste_client_forwardReceiver0~0)) (= ~__ste_email_to0~0 2) (not (= ~rjh~0 2)) (not (= 123 ~__ste_client_privateKey0~0)) (not (= |old(~__ste_email_to0~0)| 2))) [2018-11-18 10:39:20,010 INFO L428 ceAbstractionStarter]: At program point setEmailIsSignatureVerifiedENTRY(lines 2866 2881) the Hoare annotation is: true [2018-11-18 10:39:20,010 INFO L425 ceAbstractionStarter]: For program point setEmailIsSignatureVerifiedEXIT(lines 2866 2881) no Hoare annotation was computed. [2018-11-18 10:39:20,010 INFO L425 ceAbstractionStarter]: For program point L2873(lines 2873 2877) no Hoare annotation was computed. [2018-11-18 10:39:20,010 INFO L425 ceAbstractionStarter]: For program point L2870(lines 2870 2878) no Hoare annotation was computed. [2018-11-18 10:39:20,010 INFO L425 ceAbstractionStarter]: For program point L2873-2(lines 2866 2881) no Hoare annotation was computed. [2018-11-18 10:39:20,016 INFO L425 ceAbstractionStarter]: For program point is_queue_emptyEXIT(lines 311 319) no Hoare annotation was computed. [2018-11-18 10:39:20,017 INFO L428 ceAbstractionStarter]: At program point is_queue_emptyENTRY(lines 311 319) the Hoare annotation is: true [2018-11-18 10:39:20,017 INFO L425 ceAbstractionStarter]: For program point is_queue_emptyFINAL(lines 311 319) no Hoare annotation was computed. [2018-11-18 10:39:20,017 INFO L428 ceAbstractionStarter]: At program point L673(line 673) the Hoare annotation is: true [2018-11-18 10:39:20,017 INFO L428 ceAbstractionStarter]: At program point L674-1(line 674) the Hoare annotation is: true [2018-11-18 10:39:20,017 INFO L425 ceAbstractionStarter]: For program point L673-1(line 673) no Hoare annotation was computed. [2018-11-18 10:39:20,017 INFO L428 ceAbstractionStarter]: At program point L680(line 680) the Hoare annotation is: true [2018-11-18 10:39:20,017 INFO L425 ceAbstractionStarter]: For program point L680-1(line 680) no Hoare annotation was computed. [2018-11-18 10:39:20,017 INFO L425 ceAbstractionStarter]: For program point bobKeyAddEXIT(lines 665 686) no Hoare annotation was computed. [2018-11-18 10:39:20,017 INFO L428 ceAbstractionStarter]: At program point L677(line 677) the Hoare annotation is: true [2018-11-18 10:39:20,017 INFO L425 ceAbstractionStarter]: For program point L677-1(line 677) no Hoare annotation was computed. [2018-11-18 10:39:20,017 INFO L428 ceAbstractionStarter]: At program point bobKeyAddENTRY(lines 665 686) the Hoare annotation is: true [2018-11-18 10:39:20,017 INFO L425 ceAbstractionStarter]: For program point L675(line 675) no Hoare annotation was computed. [2018-11-18 10:39:20,017 INFO L425 ceAbstractionStarter]: For program point bobKeyAddFINAL(lines 665 686) no Hoare annotation was computed. [2018-11-18 10:39:20,017 INFO L428 ceAbstractionStarter]: At program point L674(line 674) the Hoare annotation is: true [2018-11-18 10:39:20,017 INFO L425 ceAbstractionStarter]: For program point getClientKeyringPublicKeyEXIT(lines 1607 1660) no Hoare annotation was computed. [2018-11-18 10:39:20,017 INFO L425 ceAbstractionStarter]: For program point L1625(lines 1625 1656) no Hoare annotation was computed. [2018-11-18 10:39:20,017 INFO L425 ceAbstractionStarter]: For program point L1644(lines 1644 1650) no Hoare annotation was computed. [2018-11-18 10:39:20,017 INFO L425 ceAbstractionStarter]: For program point L1611(lines 1611 1657) no Hoare annotation was computed. [2018-11-18 10:39:20,017 INFO L425 ceAbstractionStarter]: For program point L1640(lines 1640 1651) no Hoare annotation was computed. [2018-11-18 10:39:20,017 INFO L425 ceAbstractionStarter]: For program point getClientKeyringPublicKeyFINAL(lines 1607 1660) no Hoare annotation was computed. [2018-11-18 10:39:20,017 INFO L425 ceAbstractionStarter]: For program point L1630(lines 1630 1636) no Hoare annotation was computed. [2018-11-18 10:39:20,017 INFO L425 ceAbstractionStarter]: For program point L1626(lines 1626 1637) no Hoare annotation was computed. [2018-11-18 10:39:20,017 INFO L428 ceAbstractionStarter]: At program point getClientKeyringPublicKeyENTRY(lines 1607 1660) the Hoare annotation is: true [2018-11-18 10:39:20,017 INFO L425 ceAbstractionStarter]: For program point L1616(lines 1616 1622) no Hoare annotation was computed. [2018-11-18 10:39:20,018 INFO L425 ceAbstractionStarter]: For program point L1612(lines 1612 1623) no Hoare annotation was computed. [2018-11-18 10:39:20,018 INFO L425 ceAbstractionStarter]: For program point L1639(lines 1639 1655) no Hoare annotation was computed. [2018-11-18 10:39:20,018 INFO L425 ceAbstractionStarter]: For program point L2833(lines 2833 2841) no Hoare annotation was computed. [2018-11-18 10:39:20,018 INFO L425 ceAbstractionStarter]: For program point setEmailSignKeyEXIT(lines 2829 2844) no Hoare annotation was computed. [2018-11-18 10:39:20,023 INFO L425 ceAbstractionStarter]: For program point L2836(lines 2836 2840) no Hoare annotation was computed. [2018-11-18 10:39:20,023 INFO L428 ceAbstractionStarter]: At program point setEmailSignKeyENTRY(lines 2829 2844) the Hoare annotation is: true [2018-11-18 10:39:20,023 INFO L425 ceAbstractionStarter]: For program point L2836-2(lines 2829 2844) no Hoare annotation was computed. [2018-11-18 10:39:20,023 INFO L425 ceAbstractionStarter]: For program point generateKeyPairFINAL(lines 363 372) no Hoare annotation was computed. [2018-11-18 10:39:20,023 INFO L421 ceAbstractionStarter]: At program point L368(line 368) the Hoare annotation is: (or (not (= |#t~string51.offset| 0)) (= 0 |#t~string51.base|) (not (= 3 ~chuck~0)) (not (= ~__ste_client_idCounter0~0 1)) (= ~__ste_client_privateKey0~0 123) (= |#t~string53.base| 0) (not (= 0 ~__ste_client_forwardReceiver0~0)) (= |#t~string49.base| 0) (not (= 1 ~bob~0)) (not (= ~rjh~0 2)) (not (= 0 |#t~string53.offset|)) (not (= |#t~string49.offset| 0)) (not (= 123 |old(~__ste_client_privateKey0~0)|))) [2018-11-18 10:39:20,023 INFO L421 ceAbstractionStarter]: At program point generateKeyPairENTRY(lines 363 372) the Hoare annotation is: (or (not (= |#t~string51.offset| 0)) (= 0 |#t~string51.base|) (not (= 3 ~chuck~0)) (not (= ~__ste_client_idCounter0~0 1)) (= ~__ste_client_privateKey0~0 123) (= |#t~string53.base| 0) (not (= 0 ~__ste_client_forwardReceiver0~0)) (= |#t~string49.base| 0) (not (= 1 ~bob~0)) (not (= ~rjh~0 2)) (not (= 0 |#t~string53.offset|)) (not (= |#t~string49.offset| 0)) (not (= 123 |old(~__ste_client_privateKey0~0)|))) [2018-11-18 10:39:20,023 INFO L425 ceAbstractionStarter]: For program point generateKeyPairEXIT(lines 363 372) no Hoare annotation was computed. [2018-11-18 10:39:20,023 INFO L421 ceAbstractionStarter]: At program point setup_chuck__wrappee__BaseENTRY(lines 566 575) the Hoare annotation is: (or (= 0 |#t~string51.base|) (not (= 3 ~chuck~0)) (not (= |setup_chuck__wrappee__Base_#in~chuck___0| 3)) (not (= |#t~string51.offset| 0)) (not (= |old(~__ste_client_idCounter0~0)| 1)) (= |#t~string53.base| 0) (not (= 0 ~__ste_client_forwardReceiver0~0)) (not (= 1 ~bob~0)) (= |#t~string49.base| 0) (= ~__ste_client_idCounter0~0 1) (not (= ~rjh~0 2)) (not (= 0 |#t~string53.offset|)) (not (= 123 ~__ste_client_privateKey0~0)) (not (= |#t~string49.offset| 0))) [2018-11-18 10:39:20,023 INFO L425 ceAbstractionStarter]: For program point setup_chuck__wrappee__BaseFINAL(lines 566 575) no Hoare annotation was computed. [2018-11-18 10:39:20,023 INFO L421 ceAbstractionStarter]: At program point L571(line 571) the Hoare annotation is: (or (= 0 |#t~string51.base|) (not (= 3 ~chuck~0)) (not (= |setup_chuck__wrappee__Base_#in~chuck___0| 3)) (not (= |#t~string51.offset| 0)) (not (= |old(~__ste_client_idCounter0~0)| 1)) (and (= setup_chuck__wrappee__Base_~chuck___0 3) (= ~__ste_client_idCounter0~0 1)) (= |#t~string53.base| 0) (not (= 0 ~__ste_client_forwardReceiver0~0)) (not (= 1 ~bob~0)) (= |#t~string49.base| 0) (not (= ~rjh~0 2)) (not (= 0 |#t~string53.offset|)) (not (= 123 ~__ste_client_privateKey0~0)) (not (= |#t~string49.offset| 0))) [2018-11-18 10:39:20,023 INFO L425 ceAbstractionStarter]: For program point setup_chuck__wrappee__BaseEXIT(lines 566 575) no Hoare annotation was computed. [2018-11-18 10:39:20,024 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-18 10:39:20,024 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-18 10:39:20,024 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-18 10:39:20,024 INFO L425 ceAbstractionStarter]: For program point chuckKeyAddRjhFINAL(lines 735 746) no Hoare annotation was computed. [2018-11-18 10:39:20,024 INFO L428 ceAbstractionStarter]: At program point chuckKeyAddRjhENTRY(lines 735 746) the Hoare annotation is: true [2018-11-18 10:39:20,026 INFO L428 ceAbstractionStarter]: At program point L741(line 741) the Hoare annotation is: true [2018-11-18 10:39:20,026 INFO L425 ceAbstractionStarter]: For program point L740(line 740) no Hoare annotation was computed. [2018-11-18 10:39:20,026 INFO L428 ceAbstractionStarter]: At program point L741-1(line 741) the Hoare annotation is: true [2018-11-18 10:39:20,026 INFO L425 ceAbstractionStarter]: For program point chuckKeyAddRjhEXIT(lines 735 746) no Hoare annotation was computed. [2018-11-18 10:39:20,027 INFO L425 ceAbstractionStarter]: For program point rjhEnableForwardingEXIT(lines 777 786) no Hoare annotation was computed. [2018-11-18 10:39:20,027 INFO L421 ceAbstractionStarter]: At program point rjhEnableForwardingENTRY(lines 777 786) the Hoare annotation is: (or (not (= |#t~string51.offset| 0)) (= 0 |#t~string51.base|) (not (= 3 ~chuck~0)) (not (= ~__ste_client_idCounter0~0 1)) (not (= ~rjh~0 2)) (= |#t~string53.base| 0) (not (= 0 |#t~string53.offset|)) (not (= |#t~string49.offset| 0)) (not (= 0 |old(~__ste_client_forwardReceiver0~0)|)) (= ~__ste_client_forwardReceiver0~0 0) (= |#t~string49.base| 0) (not (= 1 ~bob~0))) [2018-11-18 10:39:20,027 INFO L425 ceAbstractionStarter]: For program point rjhEnableForwardingFINAL(lines 777 786) no Hoare annotation was computed. [2018-11-18 10:39:20,027 INFO L425 ceAbstractionStarter]: For program point setupEXIT(lines 621 643) no Hoare annotation was computed. [2018-11-18 10:39:20,027 INFO L428 ceAbstractionStarter]: At program point setupENTRY(lines 621 643) the Hoare annotation is: true [2018-11-18 10:39:20,027 INFO L421 ceAbstractionStarter]: At program point L637(line 637) the Hoare annotation is: (or (not (= |#t~string51.offset| 0)) (= 0 |#t~string51.base|) (= |#t~string53.base| 0) (and (= ~bob~0 1) (= ~__ste_client_privateKey0~0 123) (= ~chuck~0 3) (= ~__ste_client_idCounter0~0 1) (= ~rjh~0 2)) (not (= 0 |#t~string53.offset|)) (not (= |#t~string49.offset| 0)) (not (= 0 ~__ste_client_forwardReceiver0~0)) (= |#t~string49.base| 0)) [2018-11-18 10:39:20,027 INFO L425 ceAbstractionStarter]: For program point L637-1(line 637) no Hoare annotation was computed. [2018-11-18 10:39:20,027 INFO L425 ceAbstractionStarter]: For program point setupFINAL(lines 621 643) no Hoare annotation was computed. [2018-11-18 10:39:20,027 INFO L421 ceAbstractionStarter]: At program point L633(line 633) the Hoare annotation is: (or (and (= ~bob~0 1) (= ~__ste_client_privateKey0~0 123) (= ~__ste_client_idCounter0~0 1) (= ~rjh~0 2)) (not (= |#t~string51.offset| 0)) (= 0 |#t~string51.base|) (= |#t~string53.base| 0) (not (= 0 |#t~string53.offset|)) (not (= |#t~string49.offset| 0)) (not (= 0 ~__ste_client_forwardReceiver0~0)) (= |#t~string49.base| 0)) [2018-11-18 10:39:20,027 INFO L425 ceAbstractionStarter]: For program point L633-1(line 633) no Hoare annotation was computed. [2018-11-18 10:39:20,027 INFO L421 ceAbstractionStarter]: At program point L629(line 629) the Hoare annotation is: (or (not (= |#t~string51.offset| 0)) (= 0 |#t~string51.base|) (= |#t~string53.base| 0) (not (= 0 |#t~string53.offset|)) (= ~bob~0 1) (not (= |#t~string49.offset| 0)) (not (= 0 ~__ste_client_forwardReceiver0~0)) (= |#t~string49.base| 0)) [2018-11-18 10:39:20,027 INFO L425 ceAbstractionStarter]: For program point L629-1(line 629) no Hoare annotation was computed. [2018-11-18 10:39:20,027 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-18 10:39:20,027 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= |#t~string51.offset| 0) (not (= |#t~string51.base| 0)) (not (= |#t~string53.base| 0)) (= |#t~string49.offset| 0) (not (= |#t~string49.base| 0)) (= ~__ste_client_forwardReceiver0~0 0) (= |#t~string53.offset| 0)) [2018-11-18 10:39:20,027 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-18 10:39:20,032 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-18 10:39:20,032 INFO L425 ceAbstractionStarter]: For program point __utac_acc__DecryptForward_spec__1EXIT(lines 2097 2114) no Hoare annotation was computed. [2018-11-18 10:39:20,032 INFO L425 ceAbstractionStarter]: For program point L2109-1(lines 2097 2114) no Hoare annotation was computed. [2018-11-18 10:39:20,032 INFO L421 ceAbstractionStarter]: At program point L2109(line 2109) the Hoare annotation is: (or (not (= |#t~string51.offset| 0)) (= 0 |#t~string51.base|) (not (= ~__ste_client_idCounter0~0 1)) (= |#t~string53.base| 0) (not (= 0 |#t~string53.offset|)) (not (= |#t~string49.offset| 0)) (= |#t~string49.base| 0) (not (= 1 ~bob~0))) [2018-11-18 10:39:20,032 INFO L425 ceAbstractionStarter]: For program point L2105(lines 2105 2111) no Hoare annotation was computed. [2018-11-18 10:39:20,032 INFO L425 ceAbstractionStarter]: For program point L2103-1(line 2103) no Hoare annotation was computed. [2018-11-18 10:39:20,032 INFO L428 ceAbstractionStarter]: At program point L2103(line 2103) the Hoare annotation is: true [2018-11-18 10:39:20,032 INFO L428 ceAbstractionStarter]: At program point __utac_acc__DecryptForward_spec__1ENTRY(lines 2097 2114) the Hoare annotation is: true [2018-11-18 10:39:20,032 INFO L425 ceAbstractionStarter]: For program point getEmailFromFINAL(lines 2547 2565) no Hoare annotation was computed. [2018-11-18 10:39:20,032 INFO L425 ceAbstractionStarter]: For program point getEmailFromEXIT(lines 2547 2565) no Hoare annotation was computed. [2018-11-18 10:39:20,032 INFO L425 ceAbstractionStarter]: For program point L2555(lines 2555 2561) no Hoare annotation was computed. [2018-11-18 10:39:20,032 INFO L428 ceAbstractionStarter]: At program point getEmailFromENTRY(lines 2547 2565) the Hoare annotation is: true [2018-11-18 10:39:20,032 INFO L425 ceAbstractionStarter]: For program point L2551(lines 2551 2562) no Hoare annotation was computed. [2018-11-18 10:39:20,032 INFO L425 ceAbstractionStarter]: For program point setClientKeyringSizeEXIT(lines 1446 1465) no Hoare annotation was computed. [2018-11-18 10:39:20,032 INFO L425 ceAbstractionStarter]: For program point L1456(lines 1456 1460) no Hoare annotation was computed. [2018-11-18 10:39:20,032 INFO L428 ceAbstractionStarter]: At program point setClientKeyringSizeENTRY(lines 1446 1465) the Hoare annotation is: true [2018-11-18 10:39:20,032 INFO L425 ceAbstractionStarter]: For program point L1456-2(lines 1446 1465) no Hoare annotation was computed. [2018-11-18 10:39:20,032 INFO L425 ceAbstractionStarter]: For program point L1453(lines 1453 1461) no Hoare annotation was computed. [2018-11-18 10:39:20,032 INFO L425 ceAbstractionStarter]: For program point L1450(lines 1450 1462) no Hoare annotation was computed. [2018-11-18 10:39:20,032 INFO L425 ceAbstractionStarter]: For program point queueFINAL(lines 301 310) no Hoare annotation was computed. [2018-11-18 10:39:20,032 INFO L428 ceAbstractionStarter]: At program point queueENTRY(lines 301 310) the Hoare annotation is: true [2018-11-18 10:39:20,033 INFO L425 ceAbstractionStarter]: For program point queueEXIT(lines 301 310) no Hoare annotation was computed. [2018-11-18 10:39:20,033 INFO L425 ceAbstractionStarter]: For program point L1844(lines 1844 1848) no Hoare annotation was computed. [2018-11-18 10:39:20,033 INFO L425 ceAbstractionStarter]: For program point L1844-2(lines 1834 1853) no Hoare annotation was computed. [2018-11-18 10:39:20,033 INFO L425 ceAbstractionStarter]: For program point L1841(lines 1841 1849) no Hoare annotation was computed. [2018-11-18 10:39:20,033 INFO L425 ceAbstractionStarter]: For program point L1838(lines 1838 1850) no Hoare annotation was computed. [2018-11-18 10:39:20,033 INFO L425 ceAbstractionStarter]: For program point setClientIdEXIT(lines 1834 1853) no Hoare annotation was computed. [2018-11-18 10:39:20,036 INFO L421 ceAbstractionStarter]: At program point setClientIdENTRY(lines 1834 1853) the Hoare annotation is: (let ((.cse0 (= 0 |#t~string51.base|)) (.cse1 (not (= |#t~string51.offset| 0))) (.cse2 (not (= |old(~__ste_client_idCounter0~0)| 1))) (.cse3 (= |#t~string53.base| 0)) (.cse4 (not (= 0 ~__ste_client_forwardReceiver0~0))) (.cse5 (not (= 1 ~bob~0))) (.cse6 (= |#t~string49.base| 0)) (.cse7 (not (= ~rjh~0 2))) (.cse8 (not (= 0 |#t~string53.offset|))) (.cse10 (not (= 123 ~__ste_client_privateKey0~0))) (.cse11 (not (= |#t~string49.offset| 0))) (.cse9 (= ~__ste_client_idCounter0~0 1))) (and (or .cse0 .cse1 .cse2 .cse3 (not (= |setClientId_#in~handle| 2)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (not (= |setClientId_#in~value| 2))) (or .cse0 (not (= 3 ~chuck~0)) .cse1 .cse2 .cse3 .cse4 (not (= |setClientId_#in~handle| 3)) .cse5 .cse6 .cse7 (not (= |setClientId_#in~value| 3)) .cse8 .cse10 .cse11 .cse9))) [2018-11-18 10:39:20,041 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 10:39:20 BoogieIcfgContainer [2018-11-18 10:39:20,041 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 10:39:20,041 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 10:39:20,041 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 10:39:20,041 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 10:39:20,042 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:28:02" (3/4) ... [2018-11-18 10:39:20,044 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-18 10:39:20,048 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure bobKeyChange [2018-11-18 10:39:20,048 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure valid_product [2018-11-18 10:39:20,048 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure mail [2018-11-18 10:39:20,048 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure isSigned [2018-11-18 10:39:20,048 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure get_queued_client [2018-11-18 10:39:20,048 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure incoming__wrappee__Forward [2018-11-18 10:39:20,048 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure isKeyPairValid [2018-11-18 10:39:20,048 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure sign [2018-11-18 10:39:20,048 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure getEmailId [2018-11-18 10:39:20,048 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-18 10:39:20,049 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure rjhKeyChange [2018-11-18 10:39:20,049 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure setup_rjh [2018-11-18 10:39:20,049 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure setEmailIsSigned [2018-11-18 10:39:20,049 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure getClientPrivateKey [2018-11-18 10:39:20,049 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure printMail__wrappee__Forward [2018-11-18 10:39:20,049 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure printMail__wrappee__Keys [2018-11-18 10:39:20,049 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure rjhKeyAdd [2018-11-18 10:39:20,049 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure bobToRjh [2018-11-18 10:39:20,049 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure setup_bob [2018-11-18 10:39:20,049 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure select_features [2018-11-18 10:39:20,049 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure setup_bob__wrappee__Base [2018-11-18 10:39:20,049 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure outgoing__wrappee__Keys [2018-11-18 10:39:20,049 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure getClientForwardReceiver [2018-11-18 10:39:20,049 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure incoming [2018-11-18 10:39:20,049 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure createEmail [2018-11-18 10:39:20,049 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure rjhDeletePrivateKey [2018-11-18 10:39:20,049 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure test [2018-11-18 10:39:20,049 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure getEmailTo [2018-11-18 10:39:20,049 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure get_queued_email [2018-11-18 10:39:20,049 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure incoming__wrappee__Sign [2018-11-18 10:39:20,049 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure getClientKeyringUser [2018-11-18 10:39:20,049 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure setClientKeyringUser [2018-11-18 10:39:20,049 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure setEmailFrom [2018-11-18 10:39:20,049 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure isReadable [2018-11-18 10:39:20,050 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure __automaton_fail [2018-11-18 10:39:20,050 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure setClientKeyringPublicKey [2018-11-18 10:39:20,050 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure setup_rjh__wrappee__Base [2018-11-18 10:39:20,050 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure setClientForwardReceiver [2018-11-18 10:39:20,050 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure outgoing [2018-11-18 10:39:20,050 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure select_helpers [2018-11-18 10:39:20,050 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure getClientId [2018-11-18 10:39:20,050 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure isVerified [2018-11-18 10:39:20,050 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure deliver [2018-11-18 10:39:20,050 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure createClientKeyringEntry [2018-11-18 10:39:20,050 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure setup_chuck [2018-11-18 10:39:20,050 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure findPublicKey [2018-11-18 10:39:20,050 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure sendEmail [2018-11-18 10:39:20,050 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure verify [2018-11-18 10:39:20,050 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure getEmailSignKey [2018-11-18 10:39:20,050 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure setClientPrivateKey [2018-11-18 10:39:20,050 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure chuckKeyAdd [2018-11-18 10:39:20,050 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure printMail [2018-11-18 10:39:20,050 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure forward [2018-11-18 10:39:20,050 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure getClientKeyringSize [2018-11-18 10:39:20,050 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure setEmailTo [2018-11-18 10:39:20,050 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure setEmailIsSignatureVerified [2018-11-18 10:39:20,050 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure is_queue_empty [2018-11-18 10:39:20,050 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure bobKeyAdd [2018-11-18 10:39:20,050 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure getClientKeyringPublicKey [2018-11-18 10:39:20,051 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure setEmailSignKey [2018-11-18 10:39:20,051 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure generateKeyPair [2018-11-18 10:39:20,051 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure setup_chuck__wrappee__Base [2018-11-18 10:39:20,051 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-18 10:39:20,051 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure chuckKeyAddRjh [2018-11-18 10:39:20,051 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure rjhEnableForwarding [2018-11-18 10:39:20,051 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure setup [2018-11-18 10:39:20,051 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure __utac_acc__DecryptForward_spec__1 [2018-11-18 10:39:20,051 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure getEmailFrom [2018-11-18 10:39:20,051 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure setClientKeyringSize [2018-11-18 10:39:20,051 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure queue [2018-11-18 10:39:20,051 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure setClientId [2018-11-18 10:39:20,065 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 85 nodes and edges [2018-11-18 10:39:20,067 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 40 nodes and edges [2018-11-18 10:39:20,068 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-11-18 10:39:20,187 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_d194db7a-2445-4436-9ab1-45e8c82eb792/bin-2019/utaipan/witness.graphml [2018-11-18 10:39:20,187 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 10:39:20,188 INFO L168 Benchmark]: Toolchain (without parser) took 679186.62 ms. Allocated memory was 1.0 GB in the beginning and 6.6 GB in the end (delta: 5.6 GB). Free memory was 957.6 MB in the beginning and 2.4 GB in the end (delta: -1.5 GB). Peak memory consumption was 4.1 GB. Max. memory is 11.5 GB. [2018-11-18 10:39:20,188 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 10:39:20,189 INFO L168 Benchmark]: CACSL2BoogieTranslator took 567.25 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 957.6 MB in the beginning and 1.1 GB in the end (delta: -145.2 MB). Peak memory consumption was 58.1 MB. Max. memory is 11.5 GB. [2018-11-18 10:39:20,189 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.27 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-18 10:39:20,189 INFO L168 Benchmark]: Boogie Preprocessor took 55.25 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-18 10:39:20,189 INFO L168 Benchmark]: RCFGBuilder took 844.35 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 945.2 MB in the end (delta: 149.6 MB). Peak memory consumption was 149.6 MB. Max. memory is 11.5 GB. [2018-11-18 10:39:20,189 INFO L168 Benchmark]: TraceAbstraction took 677536.19 ms. Allocated memory was 1.2 GB in the beginning and 6.6 GB in the end (delta: 5.4 GB). Free memory was 945.2 MB in the beginning and 2.4 GB in the end (delta: -1.5 GB). Peak memory consumption was 7.0 GB. Max. memory is 11.5 GB. [2018-11-18 10:39:20,190 INFO L168 Benchmark]: Witness Printer took 146.24 ms. Allocated memory is still 6.6 GB. Free memory was 2.4 GB in the beginning and 2.4 GB in the end (delta: 4.3 kB). Peak memory consumption was 4.3 kB. Max. memory is 11.5 GB. [2018-11-18 10:39:20,191 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 567.25 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 957.6 MB in the beginning and 1.1 GB in the end (delta: -145.2 MB). Peak memory consumption was 58.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 34.27 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 55.25 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 844.35 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 945.2 MB in the end (delta: 149.6 MB). Peak memory consumption was 149.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 677536.19 ms. Allocated memory was 1.2 GB in the beginning and 6.6 GB in the end (delta: 5.4 GB). Free memory was 945.2 MB in the beginning and 2.4 GB in the end (delta: -1.5 GB). Peak memory consumption was 7.0 GB. Max. memory is 11.5 GB. * Witness Printer took 146.24 ms. Allocated memory is still 6.6 GB. Free memory was 2.4 GB in the beginning and 2.4 GB in the end (delta: 4.3 kB). Peak memory consumption was 4.3 kB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1859]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1953]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2034]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2048]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1919]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1995]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2023]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1920]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2009]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1967]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1928]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1981]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1942]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 72 procedures, 480 locations, 1 error locations. SAFE Result, 677.4s OverallTime, 22 OverallIterations, 4 TraceHistogramMax, 275.5s AutomataDifference, 0.0s DeadEndRemovalTime, 354.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 14379 SDtfs, 21849 SDslu, 139000 SDs, 0 SdLazy, 1271 SolverSat, 8671 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 101.1s Time, PredicateUnifierStatistics: 16 DeclaredPredicates, 1913 GetRequests, 1308 SyntacticMatches, 0 SemanticMatches, 605 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13858 ImplicationChecksByTransitivity, 8.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=180495occurred in iteration=21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 6.1s AbstIntTime, 8 AbstIntIterations, 8 AbstIntStrong, 0.9987857173964969 AbsIntWeakeningRatio, 2.0767790262172285 AbsIntAvgWeakeningVarsNumRemoved, 150.58676654182273 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 31.5s AutomataMinimizationTime, 22 MinimizatonAttempts, 9304 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 172 LocationsWithAnnotation, 183402 PreInvPairs, 277565 NumberOfFragments, 4101 HoareAnnotationTreeSize, 183402 FomulaSimplifications, 6993823 FormulaSimplificationTreeSizeReduction, 347.1s HoareSimplificationTime, 172 FomulaSimplificationsInter, 58170 FormulaSimplificationTreeSizeReductionInter, 4.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 4462 NumberOfCodeBlocks, 4462 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 4440 ConstructedInterpolants, 0 QuantifiedInterpolants, 997230 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 14 PerfectInterpolantSequences, 821/837 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...