./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/product-lines/email_spec0_product36_true-unreach-call_true-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_30caf65f-286e-4901-ae18-8cd7ce47ce79/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_30caf65f-286e-4901-ae18-8cd7ce47ce79/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_30caf65f-286e-4901-ae18-8cd7ce47ce79/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_30caf65f-286e-4901-ae18-8cd7ce47ce79/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/product-lines/email_spec0_product36_true-unreach-call_true-termination.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_30caf65f-286e-4901-ae18-8cd7ce47ce79/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_30caf65f-286e-4901-ae18-8cd7ce47ce79/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 ae3b367cf5d6182b9fc2a52b7b845972627c8a86 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 03:28:17,628 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 03:28:17,630 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 03:28:17,636 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 03:28:17,636 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 03:28:17,636 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 03:28:17,637 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 03:28:17,639 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 03:28:17,640 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 03:28:17,640 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 03:28:17,641 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 03:28:17,641 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 03:28:17,642 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 03:28:17,643 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 03:28:17,643 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 03:28:17,644 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 03:28:17,645 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 03:28:17,646 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 03:28:17,647 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 03:28:17,648 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 03:28:17,649 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 03:28:17,650 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 03:28:17,652 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 03:28:17,652 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 03:28:17,652 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 03:28:17,653 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 03:28:17,653 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 03:28:17,654 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 03:28:17,654 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 03:28:17,655 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 03:28:17,655 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 03:28:17,656 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 03:28:17,656 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 03:28:17,656 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 03:28:17,657 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 03:28:17,657 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 03:28:17,658 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_30caf65f-286e-4901-ae18-8cd7ce47ce79/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-10 03:28:17,668 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 03:28:17,668 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 03:28:17,669 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 03:28:17,669 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-10 03:28:17,669 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-10 03:28:17,669 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-10 03:28:17,670 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-10 03:28:17,670 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-10 03:28:17,670 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-10 03:28:17,670 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-10 03:28:17,670 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-10 03:28:17,671 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 03:28:17,671 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 03:28:17,671 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 03:28:17,671 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 03:28:17,671 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 03:28:17,671 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 03:28:17,672 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 03:28:17,672 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 03:28:17,672 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 03:28:17,672 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 03:28:17,672 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 03:28:17,672 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 03:28:17,672 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 03:28:17,673 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 03:28:17,673 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 03:28:17,673 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 03:28:17,673 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 03:28:17,673 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 03:28:17,673 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 03:28:17,673 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-10 03:28:17,674 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 03:28:17,674 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 03:28:17,674 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-10 03:28:17,674 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_30caf65f-286e-4901-ae18-8cd7ce47ce79/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 -> ae3b367cf5d6182b9fc2a52b7b845972627c8a86 [2018-11-10 03:28:17,696 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 03:28:17,705 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 03:28:17,707 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 03:28:17,709 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 03:28:17,709 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 03:28:17,709 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_30caf65f-286e-4901-ae18-8cd7ce47ce79/bin-2019/utaipan/../../sv-benchmarks/c/product-lines/email_spec0_product36_true-unreach-call_true-termination.cil.c [2018-11-10 03:28:17,755 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_30caf65f-286e-4901-ae18-8cd7ce47ce79/bin-2019/utaipan/data/4c66a56ab/094eff80de2f47a28e3fdc8e4c6f1b1c/FLAG9a3fc195f [2018-11-10 03:28:18,170 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 03:28:18,170 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_30caf65f-286e-4901-ae18-8cd7ce47ce79/sv-benchmarks/c/product-lines/email_spec0_product36_true-unreach-call_true-termination.cil.c [2018-11-10 03:28:18,184 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_30caf65f-286e-4901-ae18-8cd7ce47ce79/bin-2019/utaipan/data/4c66a56ab/094eff80de2f47a28e3fdc8e4c6f1b1c/FLAG9a3fc195f [2018-11-10 03:28:18,195 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_30caf65f-286e-4901-ae18-8cd7ce47ce79/bin-2019/utaipan/data/4c66a56ab/094eff80de2f47a28e3fdc8e4c6f1b1c [2018-11-10 03:28:18,197 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 03:28:18,198 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 03:28:18,198 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 03:28:18,198 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 03:28:18,201 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 03:28:18,201 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:28:18" (1/1) ... [2018-11-10 03:28:18,203 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23082619 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:28:18, skipping insertion in model container [2018-11-10 03:28:18,203 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:28:18" (1/1) ... [2018-11-10 03:28:18,212 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 03:28:18,257 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 03:28:18,564 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 03:28:18,573 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 03:28:18,726 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 03:28:18,762 INFO L193 MainTranslator]: Completed translation [2018-11-10 03:28:18,762 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:28:18 WrapperNode [2018-11-10 03:28:18,762 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 03:28:18,763 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 03:28:18,763 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 03:28:18,763 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 03:28:18,768 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:28:18" (1/1) ... [2018-11-10 03:28:18,783 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:28:18" (1/1) ... [2018-11-10 03:28:18,811 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 03:28:18,811 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 03:28:18,811 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 03:28:18,812 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 03:28:18,820 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:28:18" (1/1) ... [2018-11-10 03:28:18,820 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:28:18" (1/1) ... [2018-11-10 03:28:18,827 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:28:18" (1/1) ... [2018-11-10 03:28:18,827 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:28:18" (1/1) ... [2018-11-10 03:28:18,842 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:28:18" (1/1) ... [2018-11-10 03:28:18,850 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:28:18" (1/1) ... [2018-11-10 03:28:18,856 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:28:18" (1/1) ... [2018-11-10 03:28:18,862 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 03:28:18,862 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 03:28:18,863 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 03:28:18,863 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 03:28:18,863 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:28:18" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_30caf65f-286e-4901-ae18-8cd7ce47ce79/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-10 03:28:18,914 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_client [2018-11-10 03:28:18,914 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_client [2018-11-10 03:28:18,914 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2018-11-10 03:28:18,914 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2018-11-10 03:28:18,915 INFO L130 BoogieDeclarations]: Found specification of procedure bobToRjh [2018-11-10 03:28:18,915 INFO L138 BoogieDeclarations]: Found implementation of procedure bobToRjh [2018-11-10 03:28:18,915 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob [2018-11-10 03:28:18,915 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob [2018-11-10 03:28:18,915 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2018-11-10 03:28:18,916 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2018-11-10 03:28:18,916 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2018-11-10 03:28:18,916 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2018-11-10 03:28:18,916 INFO L130 BoogieDeclarations]: Found specification of procedure createEmail [2018-11-10 03:28:18,916 INFO L138 BoogieDeclarations]: Found implementation of procedure createEmail [2018-11-10 03:28:18,916 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2018-11-10 03:28:18,916 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2018-11-10 03:28:18,917 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_email [2018-11-10 03:28:18,917 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_email [2018-11-10 03:28:18,917 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AutoResponder [2018-11-10 03:28:18,917 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AutoResponder [2018-11-10 03:28:18,917 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2018-11-10 03:28:18,917 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2018-11-10 03:28:18,917 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2018-11-10 03:28:18,917 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2018-11-10 03:28:18,917 INFO L130 BoogieDeclarations]: Found specification of procedure getClientId [2018-11-10 03:28:18,917 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientId [2018-11-10 03:28:18,918 INFO L130 BoogieDeclarations]: Found specification of procedure deliver [2018-11-10 03:28:18,918 INFO L138 BoogieDeclarations]: Found implementation of procedure deliver [2018-11-10 03:28:18,918 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__AddressBook [2018-11-10 03:28:18,918 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__AddressBook [2018-11-10 03:28:18,918 INFO L130 BoogieDeclarations]: Found specification of procedure rjhSetAutoRespond [2018-11-10 03:28:18,918 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhSetAutoRespond [2018-11-10 03:28:18,918 INFO L130 BoogieDeclarations]: Found specification of procedure forward [2018-11-10 03:28:18,918 INFO L138 BoogieDeclarations]: Found implementation of procedure forward [2018-11-10 03:28:18,918 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 03:28:18,918 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 03:28:18,919 INFO L130 BoogieDeclarations]: Found specification of procedure rjhEnableForwarding [2018-11-10 03:28:18,919 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhEnableForwarding [2018-11-10 03:28:18,919 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2018-11-10 03:28:18,919 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2018-11-10 03:28:18,919 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__DecryptForward_spec__1 [2018-11-10 03:28:18,919 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__DecryptForward_spec__1 [2018-11-10 03:28:18,919 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2018-11-10 03:28:18,919 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2018-11-10 03:28:18,920 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2018-11-10 03:28:18,920 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2018-11-10 03:28:18,920 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2018-11-10 03:28:18,920 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2018-11-10 03:28:18,920 INFO L130 BoogieDeclarations]: Found specification of procedure mail [2018-11-10 03:28:18,920 INFO L138 BoogieDeclarations]: Found implementation of procedure mail [2018-11-10 03:28:18,920 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 03:28:18,920 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 03:28:18,920 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailId [2018-11-10 03:28:18,920 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailId [2018-11-10 03:28:18,925 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh [2018-11-10 03:28:18,925 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh [2018-11-10 03:28:18,925 INFO L130 BoogieDeclarations]: Found specification of procedure autoRespond [2018-11-10 03:28:18,925 INFO L138 BoogieDeclarations]: Found implementation of procedure autoRespond [2018-11-10 03:28:18,925 INFO L130 BoogieDeclarations]: Found specification of procedure getClientForwardReceiver [2018-11-10 03:28:18,925 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientForwardReceiver [2018-11-10 03:28:18,925 INFO L130 BoogieDeclarations]: Found specification of procedure incoming [2018-11-10 03:28:18,925 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming [2018-11-10 03:28:18,925 INFO L130 BoogieDeclarations]: Found specification of procedure test [2018-11-10 03:28:18,926 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2018-11-10 03:28:18,926 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAutoResponse [2018-11-10 03:28:18,926 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAutoResponse [2018-11-10 03:28:18,926 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2018-11-10 03:28:18,926 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2018-11-10 03:28:18,926 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2018-11-10 03:28:18,926 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2018-11-10 03:28:18,926 INFO L130 BoogieDeclarations]: Found specification of procedure setClientForwardReceiver [2018-11-10 03:28:18,926 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientForwardReceiver [2018-11-10 03:28:18,927 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2018-11-10 03:28:18,928 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2018-11-10 03:28:18,928 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2018-11-10 03:28:18,928 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2018-11-10 03:28:18,928 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck [2018-11-10 03:28:18,928 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck [2018-11-10 03:28:18,928 INFO L130 BoogieDeclarations]: Found specification of procedure sendToAddressBook [2018-11-10 03:28:18,928 INFO L138 BoogieDeclarations]: Found implementation of procedure sendToAddressBook [2018-11-10 03:28:18,929 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2018-11-10 03:28:18,929 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2018-11-10 03:28:18,929 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAlias [2018-11-10 03:28:18,929 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAlias [2018-11-10 03:28:18,929 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAutoResponse [2018-11-10 03:28:18,929 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAutoResponse [2018-11-10 03:28:18,929 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Base [2018-11-10 03:28:18,929 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Base [2018-11-10 03:28:18,929 INFO L130 BoogieDeclarations]: Found specification of procedure printMail [2018-11-10 03:28:18,929 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail [2018-11-10 03:28:18,930 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2018-11-10 03:28:18,930 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2018-11-10 03:28:18,930 INFO L130 BoogieDeclarations]: Found specification of procedure is_queue_empty [2018-11-10 03:28:18,930 INFO L138 BoogieDeclarations]: Found implementation of procedure is_queue_empty [2018-11-10 03:28:18,930 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2018-11-10 03:28:18,930 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2018-11-10 03:28:18,930 INFO L130 BoogieDeclarations]: Found specification of procedure bobSetAddressBook [2018-11-10 03:28:18,930 INFO L138 BoogieDeclarations]: Found implementation of procedure bobSetAddressBook [2018-11-10 03:28:18,930 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 03:28:18,931 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 03:28:18,931 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2018-11-10 03:28:18,931 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2018-11-10 03:28:19,939 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 03:28:19,940 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 03:28:19 BoogieIcfgContainer [2018-11-10 03:28:19,940 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 03:28:19,941 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 03:28:19,941 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 03:28:19,944 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 03:28:19,944 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 03:28:18" (1/3) ... [2018-11-10 03:28:19,945 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32352ca8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:28:19, skipping insertion in model container [2018-11-10 03:28:19,945 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:28:18" (2/3) ... [2018-11-10 03:28:19,945 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32352ca8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:28:19, skipping insertion in model container [2018-11-10 03:28:19,945 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 03:28:19" (3/3) ... [2018-11-10 03:28:19,947 INFO L112 eAbstractionObserver]: Analyzing ICFG email_spec0_product36_true-unreach-call_true-termination.cil.c [2018-11-10 03:28:19,955 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 03:28:19,963 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 03:28:19,976 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 03:28:20,004 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 03:28:20,005 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 03:28:20,005 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 03:28:20,005 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 03:28:20,005 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 03:28:20,005 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 03:28:20,005 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 03:28:20,006 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 03:28:20,028 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states. [2018-11-10 03:28:20,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-11-10 03:28:20,042 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:28:20,043 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2018-11-10 03:28:20,046 INFO L424 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:28:20,051 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:28:20,052 INFO L82 PathProgramCache]: Analyzing trace with hash -1943237178, now seen corresponding path program 1 times [2018-11-10 03:28:20,054 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 03:28:20,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:28:20,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:28:20,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:28:20,088 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 03:28:20,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:28:20,370 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-10 03:28:20,372 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:28:20,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 03:28:20,372 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 03:28:20,376 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-10 03:28:20,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-10 03:28:20,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 03:28:20,386 INFO L87 Difference]: Start difference. First operand 346 states. Second operand 2 states. [2018-11-10 03:28:20,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:28:20,432 INFO L93 Difference]: Finished difference Result 550 states and 731 transitions. [2018-11-10 03:28:20,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 03:28:20,433 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 150 [2018-11-10 03:28:20,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:28:20,443 INFO L225 Difference]: With dead ends: 550 [2018-11-10 03:28:20,443 INFO L226 Difference]: Without dead ends: 335 [2018-11-10 03:28:20,446 INFO L605 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-10 03:28:20,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2018-11-10 03:28:20,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 335. [2018-11-10 03:28:20,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2018-11-10 03:28:20,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 447 transitions. [2018-11-10 03:28:20,497 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 447 transitions. Word has length 150 [2018-11-10 03:28:20,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:28:20,499 INFO L481 AbstractCegarLoop]: Abstraction has 335 states and 447 transitions. [2018-11-10 03:28:20,499 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-10 03:28:20,499 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 447 transitions. [2018-11-10 03:28:20,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-11-10 03:28:20,503 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:28:20,503 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2018-11-10 03:28:20,504 INFO L424 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:28:20,504 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:28:20,504 INFO L82 PathProgramCache]: Analyzing trace with hash 446664762, now seen corresponding path program 1 times [2018-11-10 03:28:20,504 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 03:28:20,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:28:20,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:28:20,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:28:20,506 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 03:28:20,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:28:20,663 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-10 03:28:20,663 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:28:20,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 03:28:20,664 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 03:28:20,665 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 03:28:20,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 03:28:20,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 03:28:20,666 INFO L87 Difference]: Start difference. First operand 335 states and 447 transitions. Second operand 3 states. [2018-11-10 03:28:20,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:28:20,724 INFO L93 Difference]: Finished difference Result 534 states and 697 transitions. [2018-11-10 03:28:20,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 03:28:20,725 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 152 [2018-11-10 03:28:20,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:28:20,727 INFO L225 Difference]: With dead ends: 534 [2018-11-10 03:28:20,727 INFO L226 Difference]: Without dead ends: 339 [2018-11-10 03:28:20,728 INFO L605 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-10 03:28:20,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2018-11-10 03:28:20,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 338. [2018-11-10 03:28:20,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2018-11-10 03:28:20,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 450 transitions. [2018-11-10 03:28:20,751 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 450 transitions. Word has length 152 [2018-11-10 03:28:20,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:28:20,752 INFO L481 AbstractCegarLoop]: Abstraction has 338 states and 450 transitions. [2018-11-10 03:28:20,752 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 03:28:20,752 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 450 transitions. [2018-11-10 03:28:20,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-11-10 03:28:20,754 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:28:20,754 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-10 03:28:20,754 INFO L424 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:28:20,754 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:28:20,755 INFO L82 PathProgramCache]: Analyzing trace with hash 317957319, now seen corresponding path program 1 times [2018-11-10 03:28:20,755 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 03:28:20,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:28:20,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:28:20,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:28:20,756 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 03:28:20,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:28:20,942 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-10 03:28:20,942 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:28:20,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 03:28:20,942 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 03:28:20,943 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 03:28:20,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 03:28:20,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 03:28:20,943 INFO L87 Difference]: Start difference. First operand 338 states and 450 transitions. Second operand 6 states. [2018-11-10 03:28:21,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:28:21,361 INFO L93 Difference]: Finished difference Result 817 states and 1092 transitions. [2018-11-10 03:28:21,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 03:28:21,362 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 158 [2018-11-10 03:28:21,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:28:21,367 INFO L225 Difference]: With dead ends: 817 [2018-11-10 03:28:21,367 INFO L226 Difference]: Without dead ends: 635 [2018-11-10 03:28:21,368 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-10 03:28:21,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2018-11-10 03:28:21,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 626. [2018-11-10 03:28:21,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2018-11-10 03:28:21,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 848 transitions. [2018-11-10 03:28:21,405 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 848 transitions. Word has length 158 [2018-11-10 03:28:21,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:28:21,406 INFO L481 AbstractCegarLoop]: Abstraction has 626 states and 848 transitions. [2018-11-10 03:28:21,406 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 03:28:21,406 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 848 transitions. [2018-11-10 03:28:21,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-11-10 03:28:21,410 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:28:21,410 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-10 03:28:21,410 INFO L424 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:28:21,410 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:28:21,410 INFO L82 PathProgramCache]: Analyzing trace with hash 300886112, now seen corresponding path program 1 times [2018-11-10 03:28:21,410 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 03:28:21,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:28:21,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:28:21,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:28:21,411 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 03:28:21,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:28:21,582 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-10 03:28:21,582 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:28:21,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-10 03:28:21,583 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 03:28:21,583 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 03:28:21,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 03:28:21,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-10 03:28:21,584 INFO L87 Difference]: Start difference. First operand 626 states and 848 transitions. Second operand 9 states. [2018-11-10 03:28:21,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:28:21,719 INFO L93 Difference]: Finished difference Result 1021 states and 1362 transitions. [2018-11-10 03:28:21,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 03:28:21,720 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 159 [2018-11-10 03:28:21,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:28:21,723 INFO L225 Difference]: With dead ends: 1021 [2018-11-10 03:28:21,724 INFO L226 Difference]: Without dead ends: 656 [2018-11-10 03:28:21,725 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-11-10 03:28:21,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2018-11-10 03:28:21,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 646. [2018-11-10 03:28:21,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2018-11-10 03:28:21,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 874 transitions. [2018-11-10 03:28:21,754 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 874 transitions. Word has length 159 [2018-11-10 03:28:21,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:28:21,754 INFO L481 AbstractCegarLoop]: Abstraction has 646 states and 874 transitions. [2018-11-10 03:28:21,754 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 03:28:21,754 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 874 transitions. [2018-11-10 03:28:21,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-11-10 03:28:21,757 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:28:21,757 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-10 03:28:21,757 INFO L424 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:28:21,757 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:28:21,757 INFO L82 PathProgramCache]: Analyzing trace with hash -106397737, now seen corresponding path program 1 times [2018-11-10 03:28:21,758 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 03:28:21,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:28:21,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:28:21,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:28:21,759 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 03:28:21,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:28:21,868 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-10 03:28:21,868 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:28:21,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 03:28:21,868 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 03:28:21,869 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 03:28:21,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 03:28:21,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 03:28:21,869 INFO L87 Difference]: Start difference. First operand 646 states and 874 transitions. Second operand 6 states. [2018-11-10 03:28:22,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:28:22,115 INFO L93 Difference]: Finished difference Result 1648 states and 2218 transitions. [2018-11-10 03:28:22,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 03:28:22,116 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 160 [2018-11-10 03:28:22,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:28:22,120 INFO L225 Difference]: With dead ends: 1648 [2018-11-10 03:28:22,120 INFO L226 Difference]: Without dead ends: 1263 [2018-11-10 03:28:22,123 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-10 03:28:22,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1263 states. [2018-11-10 03:28:22,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1263 to 1242. [2018-11-10 03:28:22,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1242 states. [2018-11-10 03:28:22,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1242 states to 1242 states and 1698 transitions. [2018-11-10 03:28:22,179 INFO L78 Accepts]: Start accepts. Automaton has 1242 states and 1698 transitions. Word has length 160 [2018-11-10 03:28:22,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:28:22,180 INFO L481 AbstractCegarLoop]: Abstraction has 1242 states and 1698 transitions. [2018-11-10 03:28:22,180 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 03:28:22,180 INFO L276 IsEmpty]: Start isEmpty. Operand 1242 states and 1698 transitions. [2018-11-10 03:28:22,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-11-10 03:28:22,183 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:28:22,183 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-10 03:28:22,184 INFO L424 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:28:22,184 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:28:22,184 INFO L82 PathProgramCache]: Analyzing trace with hash 468490700, now seen corresponding path program 1 times [2018-11-10 03:28:22,184 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 03:28:22,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:28:22,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:28:22,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:28:22,185 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 03:28:22,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:28:22,315 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-10 03:28:22,315 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:28:22,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-10 03:28:22,315 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 03:28:22,316 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 03:28:22,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 03:28:22,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-10 03:28:22,316 INFO L87 Difference]: Start difference. First operand 1242 states and 1698 transitions. Second operand 9 states. [2018-11-10 03:28:22,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:28:22,476 INFO L93 Difference]: Finished difference Result 2073 states and 2785 transitions. [2018-11-10 03:28:22,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 03:28:22,477 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 161 [2018-11-10 03:28:22,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:28:22,481 INFO L225 Difference]: With dead ends: 2073 [2018-11-10 03:28:22,481 INFO L226 Difference]: Without dead ends: 1302 [2018-11-10 03:28:22,483 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-11-10 03:28:22,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1302 states. [2018-11-10 03:28:22,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1302 to 1282. [2018-11-10 03:28:22,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1282 states. [2018-11-10 03:28:22,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1282 states to 1282 states and 1750 transitions. [2018-11-10 03:28:22,520 INFO L78 Accepts]: Start accepts. Automaton has 1282 states and 1750 transitions. Word has length 161 [2018-11-10 03:28:22,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:28:22,521 INFO L481 AbstractCegarLoop]: Abstraction has 1282 states and 1750 transitions. [2018-11-10 03:28:22,521 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 03:28:22,521 INFO L276 IsEmpty]: Start isEmpty. Operand 1282 states and 1750 transitions. [2018-11-10 03:28:22,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-11-10 03:28:22,524 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:28:22,524 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-10 03:28:22,525 INFO L424 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:28:22,525 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:28:22,525 INFO L82 PathProgramCache]: Analyzing trace with hash -234037369, now seen corresponding path program 1 times [2018-11-10 03:28:22,525 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 03:28:22,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:28:22,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:28:22,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:28:22,526 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 03:28:22,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:28:22,620 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-10 03:28:22,620 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:28:22,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 03:28:22,620 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 03:28:22,621 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 03:28:22,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 03:28:22,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 03:28:22,621 INFO L87 Difference]: Start difference. First operand 1282 states and 1750 transitions. Second operand 6 states. [2018-11-10 03:28:22,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:28:22,857 INFO L93 Difference]: Finished difference Result 3318 states and 4491 transitions. [2018-11-10 03:28:22,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 03:28:22,857 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 162 [2018-11-10 03:28:22,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:28:22,865 INFO L225 Difference]: With dead ends: 3318 [2018-11-10 03:28:22,865 INFO L226 Difference]: Without dead ends: 2323 [2018-11-10 03:28:22,867 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-10 03:28:22,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2323 states. [2018-11-10 03:28:22,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2323 to 2289. [2018-11-10 03:28:22,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2289 states. [2018-11-10 03:28:22,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2289 states to 2289 states and 3169 transitions. [2018-11-10 03:28:22,939 INFO L78 Accepts]: Start accepts. Automaton has 2289 states and 3169 transitions. Word has length 162 [2018-11-10 03:28:22,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:28:22,939 INFO L481 AbstractCegarLoop]: Abstraction has 2289 states and 3169 transitions. [2018-11-10 03:28:22,939 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 03:28:22,939 INFO L276 IsEmpty]: Start isEmpty. Operand 2289 states and 3169 transitions. [2018-11-10 03:28:22,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-11-10 03:28:22,943 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:28:22,943 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-10 03:28:22,943 INFO L424 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:28:22,943 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:28:22,944 INFO L82 PathProgramCache]: Analyzing trace with hash 1997136444, now seen corresponding path program 1 times [2018-11-10 03:28:22,944 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 03:28:22,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:28:22,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:28:22,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:28:22,945 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 03:28:22,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:28:23,016 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-10 03:28:23,017 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:28:23,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 03:28:23,017 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 03:28:23,017 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 03:28:23,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 03:28:23,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 03:28:23,018 INFO L87 Difference]: Start difference. First operand 2289 states and 3169 transitions. Second operand 3 states. [2018-11-10 03:28:23,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:28:23,075 INFO L93 Difference]: Finished difference Result 4785 states and 6749 transitions. [2018-11-10 03:28:23,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 03:28:23,076 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 172 [2018-11-10 03:28:23,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:28:23,083 INFO L225 Difference]: With dead ends: 4785 [2018-11-10 03:28:23,083 INFO L226 Difference]: Without dead ends: 2544 [2018-11-10 03:28:23,087 INFO L605 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-10 03:28:23,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2544 states. [2018-11-10 03:28:23,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2544 to 2537. [2018-11-10 03:28:23,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2537 states. [2018-11-10 03:28:23,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2537 states to 2537 states and 3618 transitions. [2018-11-10 03:28:23,160 INFO L78 Accepts]: Start accepts. Automaton has 2537 states and 3618 transitions. Word has length 172 [2018-11-10 03:28:23,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:28:23,161 INFO L481 AbstractCegarLoop]: Abstraction has 2537 states and 3618 transitions. [2018-11-10 03:28:23,161 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 03:28:23,161 INFO L276 IsEmpty]: Start isEmpty. Operand 2537 states and 3618 transitions. [2018-11-10 03:28:23,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-11-10 03:28:23,166 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:28:23,166 INFO L375 BasicCegarLoop]: trace histogram [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-10 03:28:23,166 INFO L424 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:28:23,166 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:28:23,167 INFO L82 PathProgramCache]: Analyzing trace with hash -1931559203, now seen corresponding path program 1 times [2018-11-10 03:28:23,167 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 03:28:23,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:28:23,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:28:23,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:28:23,168 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 03:28:23,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:28:23,250 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-10 03:28:23,251 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:28:23,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 03:28:23,251 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 03:28:23,251 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 03:28:23,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 03:28:23,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 03:28:23,252 INFO L87 Difference]: Start difference. First operand 2537 states and 3618 transitions. Second operand 3 states. [2018-11-10 03:28:23,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:28:23,345 INFO L93 Difference]: Finished difference Result 5489 states and 8032 transitions. [2018-11-10 03:28:23,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 03:28:23,345 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 173 [2018-11-10 03:28:23,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:28:23,353 INFO L225 Difference]: With dead ends: 5489 [2018-11-10 03:28:23,353 INFO L226 Difference]: Without dead ends: 3000 [2018-11-10 03:28:23,357 INFO L605 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-10 03:28:23,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3000 states. [2018-11-10 03:28:23,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3000 to 2993. [2018-11-10 03:28:23,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2993 states. [2018-11-10 03:28:23,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2993 states to 2993 states and 4444 transitions. [2018-11-10 03:28:23,432 INFO L78 Accepts]: Start accepts. Automaton has 2993 states and 4444 transitions. Word has length 173 [2018-11-10 03:28:23,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:28:23,432 INFO L481 AbstractCegarLoop]: Abstraction has 2993 states and 4444 transitions. [2018-11-10 03:28:23,433 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 03:28:23,433 INFO L276 IsEmpty]: Start isEmpty. Operand 2993 states and 4444 transitions. [2018-11-10 03:28:23,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-11-10 03:28:23,438 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:28:23,438 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-10 03:28:23,438 INFO L424 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:28:23,438 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:28:23,438 INFO L82 PathProgramCache]: Analyzing trace with hash 79638842, now seen corresponding path program 1 times [2018-11-10 03:28:23,438 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 03:28:23,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:28:23,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:28:23,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:28:23,439 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 03:28:23,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:28:23,500 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-10 03:28:23,500 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:28:23,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 03:28:23,500 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 03:28:23,501 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 03:28:23,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 03:28:23,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 03:28:23,501 INFO L87 Difference]: Start difference. First operand 2993 states and 4444 transitions. Second operand 3 states. [2018-11-10 03:28:23,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:28:23,587 INFO L93 Difference]: Finished difference Result 6873 states and 10526 transitions. [2018-11-10 03:28:23,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 03:28:23,587 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 174 [2018-11-10 03:28:23,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:28:23,598 INFO L225 Difference]: With dead ends: 6873 [2018-11-10 03:28:23,598 INFO L226 Difference]: Without dead ends: 3928 [2018-11-10 03:28:23,604 INFO L605 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-10 03:28:23,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3928 states. [2018-11-10 03:28:23,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3928 to 3921. [2018-11-10 03:28:23,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3921 states. [2018-11-10 03:28:23,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3921 states to 3921 states and 6096 transitions. [2018-11-10 03:28:23,719 INFO L78 Accepts]: Start accepts. Automaton has 3921 states and 6096 transitions. Word has length 174 [2018-11-10 03:28:23,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:28:23,719 INFO L481 AbstractCegarLoop]: Abstraction has 3921 states and 6096 transitions. [2018-11-10 03:28:23,719 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 03:28:23,719 INFO L276 IsEmpty]: Start isEmpty. Operand 3921 states and 6096 transitions. [2018-11-10 03:28:23,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-11-10 03:28:23,725 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:28:23,726 INFO L375 BasicCegarLoop]: trace histogram [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-10 03:28:23,726 INFO L424 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:28:23,726 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:28:23,726 INFO L82 PathProgramCache]: Analyzing trace with hash -1682712547, now seen corresponding path program 1 times [2018-11-10 03:28:23,726 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 03:28:23,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:28:23,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:28:23,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:28:23,727 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 03:28:23,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:28:23,789 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-10 03:28:23,789 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:28:23,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 03:28:23,789 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 03:28:23,789 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 03:28:23,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 03:28:23,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 03:28:23,790 INFO L87 Difference]: Start difference. First operand 3921 states and 6096 transitions. Second operand 3 states. [2018-11-10 03:28:23,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:28:23,931 INFO L93 Difference]: Finished difference Result 9625 states and 15418 transitions. [2018-11-10 03:28:23,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 03:28:23,932 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 175 [2018-11-10 03:28:23,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:28:23,948 INFO L225 Difference]: With dead ends: 9625 [2018-11-10 03:28:23,948 INFO L226 Difference]: Without dead ends: 5752 [2018-11-10 03:28:23,957 INFO L605 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-10 03:28:23,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5752 states. [2018-11-10 03:28:24,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5752 to 5745. [2018-11-10 03:28:24,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5745 states. [2018-11-10 03:28:24,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5745 states to 5745 states and 9304 transitions. [2018-11-10 03:28:24,219 INFO L78 Accepts]: Start accepts. Automaton has 5745 states and 9304 transitions. Word has length 175 [2018-11-10 03:28:24,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:28:24,220 INFO L481 AbstractCegarLoop]: Abstraction has 5745 states and 9304 transitions. [2018-11-10 03:28:24,220 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 03:28:24,220 INFO L276 IsEmpty]: Start isEmpty. Operand 5745 states and 9304 transitions. [2018-11-10 03:28:24,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-11-10 03:28:24,235 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:28:24,235 INFO L375 BasicCegarLoop]: trace histogram [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, 1] [2018-11-10 03:28:24,235 INFO L424 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:28:24,236 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:28:24,236 INFO L82 PathProgramCache]: Analyzing trace with hash 1958406136, now seen corresponding path program 1 times [2018-11-10 03:28:24,236 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 03:28:24,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:28:24,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:28:24,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:28:24,237 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 03:28:24,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:28:24,329 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-10 03:28:24,329 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:28:24,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 03:28:24,329 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 03:28:24,330 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 03:28:24,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 03:28:24,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 03:28:24,330 INFO L87 Difference]: Start difference. First operand 5745 states and 9304 transitions. Second operand 3 states. [2018-11-10 03:28:24,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:28:24,642 INFO L93 Difference]: Finished difference Result 15033 states and 24914 transitions. [2018-11-10 03:28:24,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 03:28:24,642 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 176 [2018-11-10 03:28:24,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:28:24,681 INFO L225 Difference]: With dead ends: 15033 [2018-11-10 03:28:24,681 INFO L226 Difference]: Without dead ends: 9336 [2018-11-10 03:28:24,696 INFO L605 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-10 03:28:24,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9336 states. [2018-11-10 03:28:25,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9336 to 9329. [2018-11-10 03:28:25,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9329 states. [2018-11-10 03:28:25,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9329 states to 9329 states and 15528 transitions. [2018-11-10 03:28:25,090 INFO L78 Accepts]: Start accepts. Automaton has 9329 states and 15528 transitions. Word has length 176 [2018-11-10 03:28:25,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:28:25,091 INFO L481 AbstractCegarLoop]: Abstraction has 9329 states and 15528 transitions. [2018-11-10 03:28:25,091 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 03:28:25,091 INFO L276 IsEmpty]: Start isEmpty. Operand 9329 states and 15528 transitions. [2018-11-10 03:28:25,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-11-10 03:28:25,120 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:28:25,121 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1] [2018-11-10 03:28:25,121 INFO L424 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:28:25,121 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:28:25,121 INFO L82 PathProgramCache]: Analyzing trace with hash 333133151, now seen corresponding path program 1 times [2018-11-10 03:28:25,121 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 03:28:25,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:28:25,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:28:25,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:28:25,122 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 03:28:25,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:28:25,267 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-10 03:28:25,268 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:28:25,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-10 03:28:25,268 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 03:28:25,268 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 03:28:25,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 03:28:25,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-10 03:28:25,269 INFO L87 Difference]: Start difference. First operand 9329 states and 15528 transitions. Second operand 8 states. [2018-11-10 03:28:25,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:28:25,611 INFO L93 Difference]: Finished difference Result 9329 states and 15528 transitions. [2018-11-10 03:28:25,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 03:28:25,612 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 177 [2018-11-10 03:28:25,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:28:25,612 INFO L225 Difference]: With dead ends: 9329 [2018-11-10 03:28:25,612 INFO L226 Difference]: Without dead ends: 0 [2018-11-10 03:28:25,628 INFO L605 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-10 03:28:25,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-10 03:28:25,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-10 03:28:25,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-10 03:28:25,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-10 03:28:25,630 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 177 [2018-11-10 03:28:25,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:28:25,630 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 03:28:25,630 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 03:28:25,630 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-10 03:28:25,630 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-10 03:28:25,634 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-10 03:28:27,433 INFO L425 ceAbstractionStarter]: For program point valid_productEXIT(lines 78 86) no Hoare annotation was computed. [2018-11-10 03:28:27,433 INFO L428 ceAbstractionStarter]: At program point valid_productENTRY(lines 78 86) the Hoare annotation is: true [2018-11-10 03:28:27,433 INFO L425 ceAbstractionStarter]: For program point valid_productFINAL(lines 78 86) no Hoare annotation was computed. [2018-11-10 03:28:27,433 INFO L428 ceAbstractionStarter]: At program point mailENTRY(lines 1649 1660) the Hoare annotation is: true [2018-11-10 03:28:27,433 INFO L425 ceAbstractionStarter]: For program point mailEXIT(lines 1649 1660) no Hoare annotation was computed. [2018-11-10 03:28:27,433 INFO L428 ceAbstractionStarter]: At program point L1656(line 1656) the Hoare annotation is: true [2018-11-10 03:28:27,433 INFO L428 ceAbstractionStarter]: At program point L1655(line 1655) the Hoare annotation is: true [2018-11-10 03:28:27,433 INFO L425 ceAbstractionStarter]: For program point mailFINAL(lines 1649 1660) no Hoare annotation was computed. [2018-11-10 03:28:27,433 INFO L425 ceAbstractionStarter]: For program point L1655-1(line 1655) no Hoare annotation was computed. [2018-11-10 03:28:27,433 INFO L425 ceAbstractionStarter]: For program point get_queued_clientEXIT(lines 1816 1824) no Hoare annotation was computed. [2018-11-10 03:28:27,434 INFO L428 ceAbstractionStarter]: At program point get_queued_clientENTRY(lines 1816 1824) the Hoare annotation is: true [2018-11-10 03:28:27,434 INFO L425 ceAbstractionStarter]: For program point get_queued_clientFINAL(lines 1816 1824) no Hoare annotation was computed. [2018-11-10 03:28:27,434 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 2596 2616) the Hoare annotation is: (or (not (= 0 |old(~__ste_client_forwardReceiver1~0)|)) (and (= 0 ~__ste_client_forwardReceiver2~0) (= 0 ~__ste_client_forwardReceiver1~0) (= 0 ~__ste_client_forwardReceiver0~0)) (not (= 0 |old(~__ste_client_forwardReceiver2~0)|)) (not (= 0 |old(~__ste_client_forwardReceiver0~0)|))) [2018-11-10 03:28:27,434 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 2596 2616) no Hoare annotation was computed. [2018-11-10 03:28:27,434 INFO L421 ceAbstractionStarter]: At program point L2608(line 2608) the Hoare annotation is: (or (and (= 0 ~__ste_client_forwardReceiver2~0) (= 0 ~__ste_client_forwardReceiver1~0) (= 0 ~__ste_client_forwardReceiver0~0) (= main_~tmp~17 1)) (not (= 0 |old(~__ste_client_forwardReceiver1~0)|)) (not (= 0 |old(~__ste_client_forwardReceiver2~0)|)) (not (= 0 |old(~__ste_client_forwardReceiver0~0)|))) [2018-11-10 03:28:27,434 INFO L425 ceAbstractionStarter]: For program point L2606(lines 2606 2613) no Hoare annotation was computed. [2018-11-10 03:28:27,434 INFO L421 ceAbstractionStarter]: At program point L2608-1(line 2608) the Hoare annotation is: (or (and (= 0 ~__ste_client_forwardReceiver2~0) (= 0 ~__ste_client_forwardReceiver1~0) (= 0 ~__ste_client_forwardReceiver0~0) (= main_~tmp~17 1)) (not (= 0 |old(~__ste_client_forwardReceiver1~0)|)) (not (= 0 |old(~__ste_client_forwardReceiver2~0)|)) (not (= 0 |old(~__ste_client_forwardReceiver0~0)|))) [2018-11-10 03:28:27,434 INFO L425 ceAbstractionStarter]: For program point L2604(line 2604) no Hoare annotation was computed. [2018-11-10 03:28:27,434 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 2596 2616) no Hoare annotation was computed. [2018-11-10 03:28:27,434 INFO L425 ceAbstractionStarter]: For program point L2606-1(lines 2606 2613) no Hoare annotation was computed. [2018-11-10 03:28:27,434 INFO L421 ceAbstractionStarter]: At program point L2602(line 2602) the Hoare annotation is: (or (not (= 0 |old(~__ste_client_forwardReceiver1~0)|)) (and (= 0 ~__ste_client_forwardReceiver2~0) (= 0 ~__ste_client_forwardReceiver1~0) (= 0 ~__ste_client_forwardReceiver0~0)) (not (= 0 |old(~__ste_client_forwardReceiver2~0)|)) (not (= 0 |old(~__ste_client_forwardReceiver0~0)|))) [2018-11-10 03:28:27,435 INFO L421 ceAbstractionStarter]: At program point L2603(line 2603) the Hoare annotation is: (or (not (= 0 |old(~__ste_client_forwardReceiver1~0)|)) (and (= 0 ~__ste_client_forwardReceiver2~0) (= 0 ~__ste_client_forwardReceiver1~0) (= 0 ~__ste_client_forwardReceiver0~0)) (not (= 0 |old(~__ste_client_forwardReceiver2~0)|)) (not (= 0 |old(~__ste_client_forwardReceiver0~0)|))) [2018-11-10 03:28:27,435 INFO L421 ceAbstractionStarter]: At program point L2602-1(line 2602) the Hoare annotation is: (or (not (= 0 |old(~__ste_client_forwardReceiver1~0)|)) (and (= 0 ~__ste_client_forwardReceiver2~0) (= 0 ~__ste_client_forwardReceiver1~0) (= 0 ~__ste_client_forwardReceiver0~0)) (not (= 0 |old(~__ste_client_forwardReceiver2~0)|)) (not (= 0 |old(~__ste_client_forwardReceiver0~0)|))) [2018-11-10 03:28:27,435 INFO L425 ceAbstractionStarter]: For program point getEmailIdFINAL(lines 1906 1924) no Hoare annotation was computed. [2018-11-10 03:28:27,435 INFO L425 ceAbstractionStarter]: For program point getEmailIdEXIT(lines 1906 1924) no Hoare annotation was computed. [2018-11-10 03:28:27,435 INFO L425 ceAbstractionStarter]: For program point L1914(lines 1914 1920) no Hoare annotation was computed. [2018-11-10 03:28:27,435 INFO L428 ceAbstractionStarter]: At program point getEmailIdENTRY(lines 1906 1924) the Hoare annotation is: true [2018-11-10 03:28:27,435 INFO L425 ceAbstractionStarter]: For program point L1910(lines 1910 1921) no Hoare annotation was computed. [2018-11-10 03:28:27,435 INFO L425 ceAbstractionStarter]: For program point setup_rjhFINAL(lines 2519 2528) no Hoare annotation was computed. [2018-11-10 03:28:27,435 INFO L428 ceAbstractionStarter]: At program point L2524(line 2524) the Hoare annotation is: true [2018-11-10 03:28:27,435 INFO L428 ceAbstractionStarter]: At program point setup_rjhENTRY(lines 2519 2528) the Hoare annotation is: true [2018-11-10 03:28:27,435 INFO L425 ceAbstractionStarter]: For program point setup_rjhEXIT(lines 2519 2528) no Hoare annotation was computed. [2018-11-10 03:28:27,435 INFO L425 ceAbstractionStarter]: For program point getClientAddressBookSizeFINAL(lines 625 648) no Hoare annotation was computed. [2018-11-10 03:28:27,435 INFO L425 ceAbstractionStarter]: For program point L637(lines 637 643) no Hoare annotation was computed. [2018-11-10 03:28:27,435 INFO L428 ceAbstractionStarter]: At program point getClientAddressBookSizeENTRY(lines 625 648) the Hoare annotation is: true [2018-11-10 03:28:27,436 INFO L425 ceAbstractionStarter]: For program point L633(lines 633 644) no Hoare annotation was computed. [2018-11-10 03:28:27,436 INFO L425 ceAbstractionStarter]: For program point L629(lines 629 645) no Hoare annotation was computed. [2018-11-10 03:28:27,436 INFO L425 ceAbstractionStarter]: For program point getClientAddressBookSizeEXIT(lines 625 648) no Hoare annotation was computed. [2018-11-10 03:28:27,436 INFO L428 ceAbstractionStarter]: At program point L2556(line 2556) the Hoare annotation is: true [2018-11-10 03:28:27,436 INFO L428 ceAbstractionStarter]: At program point L2554(line 2554) the Hoare annotation is: true [2018-11-10 03:28:27,436 INFO L425 ceAbstractionStarter]: For program point L2555-1(line 2555) no Hoare annotation was computed. [2018-11-10 03:28:27,436 INFO L428 ceAbstractionStarter]: At program point L2555(line 2555) the Hoare annotation is: true [2018-11-10 03:28:27,436 INFO L425 ceAbstractionStarter]: For program point L2556-1(lines 2539 2561) no Hoare annotation was computed. [2018-11-10 03:28:27,436 INFO L425 ceAbstractionStarter]: For program point L2554-1(line 2554) no Hoare annotation was computed. [2018-11-10 03:28:27,436 INFO L425 ceAbstractionStarter]: For program point L2550(lines 2550 2558) no Hoare annotation was computed. [2018-11-10 03:28:27,436 INFO L425 ceAbstractionStarter]: For program point L2548(line 2548) no Hoare annotation was computed. [2018-11-10 03:28:27,436 INFO L425 ceAbstractionStarter]: For program point bobToRjhEXIT(lines 2539 2561) no Hoare annotation was computed. [2018-11-10 03:28:27,436 INFO L428 ceAbstractionStarter]: At program point L2547-1(line 2547) the Hoare annotation is: true [2018-11-10 03:28:27,436 INFO L428 ceAbstractionStarter]: At program point L2547(line 2547) the Hoare annotation is: true [2018-11-10 03:28:27,436 INFO L428 ceAbstractionStarter]: At program point bobToRjhENTRY(lines 2539 2561) the Hoare annotation is: true [2018-11-10 03:28:27,436 INFO L428 ceAbstractionStarter]: At program point setup_bobENTRY(lines 2509 2518) the Hoare annotation is: true [2018-11-10 03:28:27,437 INFO L425 ceAbstractionStarter]: For program point setup_bobFINAL(lines 2509 2518) no Hoare annotation was computed. [2018-11-10 03:28:27,437 INFO L425 ceAbstractionStarter]: For program point setup_bobEXIT(lines 2509 2518) no Hoare annotation was computed. [2018-11-10 03:28:27,437 INFO L428 ceAbstractionStarter]: At program point L2514(line 2514) the Hoare annotation is: true [2018-11-10 03:28:27,437 INFO L425 ceAbstractionStarter]: For program point select_featuresEXIT(lines 64 70) no Hoare annotation was computed. [2018-11-10 03:28:27,437 INFO L428 ceAbstractionStarter]: At program point select_featuresFINAL(lines 64 70) the Hoare annotation is: true [2018-11-10 03:28:27,437 INFO L428 ceAbstractionStarter]: At program point L1841(line 1841) the Hoare annotation is: true [2018-11-10 03:28:27,437 INFO L425 ceAbstractionStarter]: For program point L1841-1(line 1841) no Hoare annotation was computed. [2018-11-10 03:28:27,437 INFO L425 ceAbstractionStarter]: For program point autoRespondEXIT(lines 1834 1848) no Hoare annotation was computed. [2018-11-10 03:28:27,437 INFO L428 ceAbstractionStarter]: At program point autoRespondENTRY(lines 1834 1848) the Hoare annotation is: true [2018-11-10 03:28:27,437 INFO L425 ceAbstractionStarter]: For program point autoRespondFINAL(lines 1834 1848) no Hoare annotation was computed. [2018-11-10 03:28:27,437 INFO L428 ceAbstractionStarter]: At program point L1843(line 1843) the Hoare annotation is: true [2018-11-10 03:28:27,437 INFO L428 ceAbstractionStarter]: At program point L1843-1(line 1843) the Hoare annotation is: true [2018-11-10 03:28:27,437 INFO L425 ceAbstractionStarter]: For program point L1010(lines 1010 1022) no Hoare annotation was computed. [2018-11-10 03:28:27,437 INFO L425 ceAbstractionStarter]: For program point L998(lines 998 1006) no Hoare annotation was computed. [2018-11-10 03:28:27,438 INFO L425 ceAbstractionStarter]: For program point L994(lines 994 1026) no Hoare annotation was computed. [2018-11-10 03:28:27,438 INFO L425 ceAbstractionStarter]: For program point L986(lines 986 990) no Hoare annotation was computed. [2018-11-10 03:28:27,438 INFO L425 ceAbstractionStarter]: For program point L995(lines 995 1007) no Hoare annotation was computed. [2018-11-10 03:28:27,438 INFO L425 ceAbstractionStarter]: For program point L1016(lines 1016 1020) no Hoare annotation was computed. [2018-11-10 03:28:27,438 INFO L425 ceAbstractionStarter]: For program point L983(lines 983 991) no Hoare annotation was computed. [2018-11-10 03:28:27,438 INFO L425 ceAbstractionStarter]: For program point L979(lines 979 1027) no Hoare annotation was computed. [2018-11-10 03:28:27,438 INFO L428 ceAbstractionStarter]: At program point setClientAddressBookAddressENTRY(lines 975 1030) the Hoare annotation is: true [2018-11-10 03:28:27,438 INFO L425 ceAbstractionStarter]: For program point setClientAddressBookAddressEXIT(lines 975 1030) no Hoare annotation was computed. [2018-11-10 03:28:27,438 INFO L425 ceAbstractionStarter]: For program point L1013(lines 1013 1021) no Hoare annotation was computed. [2018-11-10 03:28:27,438 INFO L425 ceAbstractionStarter]: For program point L980(lines 980 992) no Hoare annotation was computed. [2018-11-10 03:28:27,438 INFO L425 ceAbstractionStarter]: For program point L1009(lines 1009 1025) no Hoare annotation was computed. [2018-11-10 03:28:27,438 INFO L425 ceAbstractionStarter]: For program point L1009-1(lines 975 1030) no Hoare annotation was computed. [2018-11-10 03:28:27,438 INFO L425 ceAbstractionStarter]: For program point L1001(lines 1001 1005) no Hoare annotation was computed. [2018-11-10 03:28:27,438 INFO L425 ceAbstractionStarter]: For program point L1473(lines 1473 1489) no Hoare annotation was computed. [2018-11-10 03:28:27,438 INFO L425 ceAbstractionStarter]: For program point getClientForwardReceiverFINAL(lines 1469 1492) no Hoare annotation was computed. [2018-11-10 03:28:27,438 INFO L425 ceAbstractionStarter]: For program point getClientForwardReceiverEXIT(lines 1469 1492) no Hoare annotation was computed. [2018-11-10 03:28:27,438 INFO L425 ceAbstractionStarter]: For program point L1481(lines 1481 1487) no Hoare annotation was computed. [2018-11-10 03:28:27,439 INFO L428 ceAbstractionStarter]: At program point getClientForwardReceiverENTRY(lines 1469 1492) the Hoare annotation is: true [2018-11-10 03:28:27,439 INFO L425 ceAbstractionStarter]: For program point L1477(lines 1477 1488) no Hoare annotation was computed. [2018-11-10 03:28:27,439 INFO L421 ceAbstractionStarter]: At program point L1760(line 1760) the Hoare annotation is: (or (not (= 0 ~__ste_client_forwardReceiver1~0)) (not (= 0 ~__ste_client_forwardReceiver2~0)) (not (= 0 ~__ste_client_forwardReceiver0~0))) [2018-11-10 03:28:27,439 INFO L421 ceAbstractionStarter]: At program point L1760-1(line 1760) the Hoare annotation is: (or (not (= 0 ~__ste_client_forwardReceiver1~0)) (not (= 0 ~__ste_client_forwardReceiver2~0)) (not (= 0 ~__ste_client_forwardReceiver0~0))) [2018-11-10 03:28:27,439 INFO L425 ceAbstractionStarter]: For program point L1758(lines 1758 1765) no Hoare annotation was computed. [2018-11-10 03:28:27,439 INFO L425 ceAbstractionStarter]: For program point L1758-1(lines 1748 1768) no Hoare annotation was computed. [2018-11-10 03:28:27,439 INFO L428 ceAbstractionStarter]: At program point incomingENTRY(lines 1748 1768) the Hoare annotation is: true [2018-11-10 03:28:27,439 INFO L425 ceAbstractionStarter]: For program point L1755(line 1755) no Hoare annotation was computed. [2018-11-10 03:28:27,439 INFO L428 ceAbstractionStarter]: At program point L1754(line 1754) the Hoare annotation is: true [2018-11-10 03:28:27,439 INFO L428 ceAbstractionStarter]: At program point L1754-1(line 1754) the Hoare annotation is: true [2018-11-10 03:28:27,439 INFO L425 ceAbstractionStarter]: For program point incomingEXIT(lines 1748 1768) no Hoare annotation was computed. [2018-11-10 03:28:27,439 INFO L425 ceAbstractionStarter]: For program point createEmailEXIT(lines 1616 1630) no Hoare annotation was computed. [2018-11-10 03:28:27,439 INFO L425 ceAbstractionStarter]: For program point L1624(line 1624) no Hoare annotation was computed. [2018-11-10 03:28:27,439 INFO L428 ceAbstractionStarter]: At program point L1623(line 1623) the Hoare annotation is: true [2018-11-10 03:28:27,440 INFO L428 ceAbstractionStarter]: At program point L1623-1(line 1623) the Hoare annotation is: true [2018-11-10 03:28:27,440 INFO L428 ceAbstractionStarter]: At program point createEmailENTRY(lines 1616 1630) the Hoare annotation is: true [2018-11-10 03:28:27,440 INFO L425 ceAbstractionStarter]: For program point createEmailFINAL(lines 1616 1630) no Hoare annotation was computed. [2018-11-10 03:28:27,440 INFO L425 ceAbstractionStarter]: For program point L2364(lines 2364 2371) no Hoare annotation was computed. [2018-11-10 03:28:27,440 INFO L425 ceAbstractionStarter]: For program point L2389(lines 2389 2393) no Hoare annotation was computed. [2018-11-10 03:28:27,440 INFO L425 ceAbstractionStarter]: For program point L2472(lines 2472 2476) no Hoare annotation was computed. [2018-11-10 03:28:27,440 INFO L428 ceAbstractionStarter]: At program point L2406(lines 2396 2485) the Hoare annotation is: true [2018-11-10 03:28:27,440 INFO L428 ceAbstractionStarter]: At program point L2472-1(lines 2341 2490) the Hoare annotation is: true [2018-11-10 03:28:27,440 INFO L428 ceAbstractionStarter]: At program point L2373(lines 2360 2488) the Hoare annotation is: true [2018-11-10 03:28:27,440 INFO L428 ceAbstractionStarter]: At program point L2431(lines 2421 2483) the Hoare annotation is: true [2018-11-10 03:28:27,440 INFO L428 ceAbstractionStarter]: At program point L2456(lines 2446 2481) the Hoare annotation is: true [2018-11-10 03:28:27,440 INFO L425 ceAbstractionStarter]: For program point L2349(lines 2349 2489) no Hoare annotation was computed. [2018-11-10 03:28:27,440 INFO L425 ceAbstractionStarter]: For program point L2341-1(lines 2341 2490) no Hoare annotation was computed. [2018-11-10 03:28:27,440 INFO L425 ceAbstractionStarter]: For program point testEXIT(lines 2302 2498) no Hoare annotation was computed. [2018-11-10 03:28:27,441 INFO L421 ceAbstractionStarter]: At program point testENTRY(lines 2302 2498) the Hoare annotation is: (or (not (= 0 |old(~__ste_client_forwardReceiver1~0)|)) (and (= 0 ~__ste_client_forwardReceiver2~0) (= 0 ~__ste_client_forwardReceiver1~0) (= 0 ~__ste_client_forwardReceiver0~0)) (not (= 0 |old(~__ste_client_forwardReceiver2~0)|)) (not (= 0 |old(~__ste_client_forwardReceiver0~0)|))) [2018-11-10 03:28:27,441 INFO L421 ceAbstractionStarter]: At program point L2366(line 2366) the Hoare annotation is: (or (= test_~op2~0 0) (not (= 0 |old(~__ste_client_forwardReceiver1~0)|)) (not (= 0 |old(~__ste_client_forwardReceiver2~0)|)) (not (= 0 |old(~__ste_client_forwardReceiver0~0)|))) [2018-11-10 03:28:27,441 INFO L425 ceAbstractionStarter]: For program point L2366-1(line 2366) no Hoare annotation was computed. [2018-11-10 03:28:27,441 INFO L425 ceAbstractionStarter]: For program point testFINAL(lines 2302 2498) no Hoare annotation was computed. [2018-11-10 03:28:27,441 INFO L425 ceAbstractionStarter]: For program point L2342(lines 2341 2490) no Hoare annotation was computed. [2018-11-10 03:28:27,441 INFO L425 ceAbstractionStarter]: For program point L2400(lines 2400 2404) no Hoare annotation was computed. [2018-11-10 03:28:27,441 INFO L428 ceAbstractionStarter]: At program point L2491(lines 2340 2492) the Hoare annotation is: true [2018-11-10 03:28:27,441 INFO L425 ceAbstractionStarter]: For program point L2425(lines 2425 2429) no Hoare annotation was computed. [2018-11-10 03:28:27,441 INFO L428 ceAbstractionStarter]: At program point L2359(lines 2349 2489) the Hoare annotation is: true [2018-11-10 03:28:27,441 INFO L425 ceAbstractionStarter]: For program point L2450(lines 2450 2454) no Hoare annotation was computed. [2018-11-10 03:28:27,441 INFO L428 ceAbstractionStarter]: At program point L2384(lines 2374 2487) the Hoare annotation is: true [2018-11-10 03:28:27,441 INFO L425 ceAbstractionStarter]: For program point L2343(lines 2343 2347) no Hoare annotation was computed. [2018-11-10 03:28:27,441 INFO L428 ceAbstractionStarter]: At program point L2467(lines 2457 2480) the Hoare annotation is: true [2018-11-10 03:28:27,441 INFO L425 ceAbstractionStarter]: For program point L2353(lines 2353 2357) no Hoare annotation was computed. [2018-11-10 03:28:27,441 INFO L425 ceAbstractionStarter]: For program point L2378(lines 2378 2382) no Hoare annotation was computed. [2018-11-10 03:28:27,441 INFO L425 ceAbstractionStarter]: For program point L2411(lines 2411 2418) no Hoare annotation was computed. [2018-11-10 03:28:27,442 INFO L425 ceAbstractionStarter]: For program point L2436(lines 2436 2443) no Hoare annotation was computed. [2018-11-10 03:28:27,442 INFO L425 ceAbstractionStarter]: For program point L2461(lines 2461 2465) no Hoare annotation was computed. [2018-11-10 03:28:27,442 INFO L428 ceAbstractionStarter]: At program point L2395(lines 2385 2486) the Hoare annotation is: true [2018-11-10 03:28:27,442 INFO L428 ceAbstractionStarter]: At program point L2420(lines 2407 2484) the Hoare annotation is: true [2018-11-10 03:28:27,442 INFO L428 ceAbstractionStarter]: At program point L2445(lines 2432 2482) the Hoare annotation is: true [2018-11-10 03:28:27,442 INFO L425 ceAbstractionStarter]: For program point L2413-1(line 2413) no Hoare annotation was computed. [2018-11-10 03:28:27,442 INFO L428 ceAbstractionStarter]: At program point L2413(line 2413) the Hoare annotation is: true [2018-11-10 03:28:27,442 INFO L428 ceAbstractionStarter]: At program point L2438(line 2438) the Hoare annotation is: true [2018-11-10 03:28:27,442 INFO L425 ceAbstractionStarter]: For program point L2438-1(line 2438) no Hoare annotation was computed. [2018-11-10 03:28:27,442 INFO L425 ceAbstractionStarter]: For program point L1984(lines 1984 1995) no Hoare annotation was computed. [2018-11-10 03:28:27,442 INFO L425 ceAbstractionStarter]: For program point getEmailToFINAL(lines 1980 1998) no Hoare annotation was computed. [2018-11-10 03:28:27,442 INFO L425 ceAbstractionStarter]: For program point getEmailToEXIT(lines 1980 1998) no Hoare annotation was computed. [2018-11-10 03:28:27,442 INFO L428 ceAbstractionStarter]: At program point getEmailToENTRY(lines 1980 1998) the Hoare annotation is: true [2018-11-10 03:28:27,442 INFO L425 ceAbstractionStarter]: For program point L1988(lines 1988 1994) no Hoare annotation was computed. [2018-11-10 03:28:27,442 INFO L428 ceAbstractionStarter]: At program point get_queued_emailENTRY(lines 1825 1833) the Hoare annotation is: true [2018-11-10 03:28:27,443 INFO L425 ceAbstractionStarter]: For program point get_queued_emailFINAL(lines 1825 1833) no Hoare annotation was computed. [2018-11-10 03:28:27,443 INFO L425 ceAbstractionStarter]: For program point get_queued_emailEXIT(lines 1825 1833) no Hoare annotation was computed. [2018-11-10 03:28:27,443 INFO L425 ceAbstractionStarter]: For program point setClientAutoResponseEXIT(lines 1058 1077) no Hoare annotation was computed. [2018-11-10 03:28:27,443 INFO L425 ceAbstractionStarter]: For program point L1068(lines 1068 1072) no Hoare annotation was computed. [2018-11-10 03:28:27,443 INFO L428 ceAbstractionStarter]: At program point setClientAutoResponseENTRY(lines 1058 1077) the Hoare annotation is: true [2018-11-10 03:28:27,443 INFO L425 ceAbstractionStarter]: For program point L1068-2(lines 1058 1077) no Hoare annotation was computed. [2018-11-10 03:28:27,443 INFO L425 ceAbstractionStarter]: For program point L1065(lines 1065 1073) no Hoare annotation was computed. [2018-11-10 03:28:27,443 INFO L425 ceAbstractionStarter]: For program point L1062(lines 1062 1074) no Hoare annotation was computed. [2018-11-10 03:28:27,443 INFO L428 ceAbstractionStarter]: At program point setClientAddressBookSizeENTRY(lines 649 668) the Hoare annotation is: true [2018-11-10 03:28:27,443 INFO L425 ceAbstractionStarter]: For program point L659(lines 659 663) no Hoare annotation was computed. [2018-11-10 03:28:27,443 INFO L425 ceAbstractionStarter]: For program point L659-2(lines 649 668) no Hoare annotation was computed. [2018-11-10 03:28:27,443 INFO L425 ceAbstractionStarter]: For program point L656(lines 656 664) no Hoare annotation was computed. [2018-11-10 03:28:27,443 INFO L425 ceAbstractionStarter]: For program point L653(lines 653 665) no Hoare annotation was computed. [2018-11-10 03:28:27,443 INFO L425 ceAbstractionStarter]: For program point setClientAddressBookSizeEXIT(lines 649 668) no Hoare annotation was computed. [2018-11-10 03:28:27,443 INFO L425 ceAbstractionStarter]: For program point L1666-1(line 1666) no Hoare annotation was computed. [2018-11-10 03:28:27,443 INFO L425 ceAbstractionStarter]: For program point outgoing__wrappee__AutoResponderEXIT(lines 1661 1672) no Hoare annotation was computed. [2018-11-10 03:28:27,444 INFO L428 ceAbstractionStarter]: At program point L1667(line 1667) the Hoare annotation is: true [2018-11-10 03:28:27,444 INFO L425 ceAbstractionStarter]: For program point outgoing__wrappee__AutoResponderFINAL(lines 1661 1672) no Hoare annotation was computed. [2018-11-10 03:28:27,444 INFO L428 ceAbstractionStarter]: At program point outgoing__wrappee__AutoResponderENTRY(lines 1661 1672) the Hoare annotation is: true [2018-11-10 03:28:27,444 INFO L428 ceAbstractionStarter]: At program point L1666(line 1666) the Hoare annotation is: true [2018-11-10 03:28:27,444 INFO L428 ceAbstractionStarter]: At program point L1667-1(line 1667) the Hoare annotation is: true [2018-11-10 03:28:27,444 INFO L425 ceAbstractionStarter]: For program point L1969(lines 1969 1973) no Hoare annotation was computed. [2018-11-10 03:28:27,444 INFO L428 ceAbstractionStarter]: At program point setEmailFromENTRY(lines 1962 1977) the Hoare annotation is: true [2018-11-10 03:28:27,444 INFO L425 ceAbstractionStarter]: For program point L1969-2(lines 1962 1977) no Hoare annotation was computed. [2018-11-10 03:28:27,444 INFO L425 ceAbstractionStarter]: For program point L1966(lines 1966 1974) no Hoare annotation was computed. [2018-11-10 03:28:27,444 INFO L425 ceAbstractionStarter]: For program point setEmailFromEXIT(lines 1962 1977) no Hoare annotation was computed. [2018-11-10 03:28:27,444 INFO L425 ceAbstractionStarter]: For program point isReadableEXIT(lines 1598 1606) no Hoare annotation was computed. [2018-11-10 03:28:27,444 INFO L428 ceAbstractionStarter]: At program point isReadableENTRY(lines 1598 1606) the Hoare annotation is: true [2018-11-10 03:28:27,444 INFO L425 ceAbstractionStarter]: For program point isReadableFINAL(lines 1598 1606) no Hoare annotation was computed. [2018-11-10 03:28:27,444 INFO L425 ceAbstractionStarter]: For program point __automaton_failFINAL(lines 472 479) no Hoare annotation was computed. [2018-11-10 03:28:27,445 INFO L425 ceAbstractionStarter]: For program point __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION(line 476) no Hoare annotation was computed. [2018-11-10 03:28:27,445 INFO L428 ceAbstractionStarter]: At program point __automaton_failENTRY(lines 472 479) the Hoare annotation is: true [2018-11-10 03:28:27,445 INFO L425 ceAbstractionStarter]: For program point __automaton_failEXIT(lines 472 479) no Hoare annotation was computed. [2018-11-10 03:28:27,445 INFO L425 ceAbstractionStarter]: For program point L1503(lines 1503 1507) no Hoare annotation was computed. [2018-11-10 03:28:27,445 INFO L421 ceAbstractionStarter]: At program point setClientForwardReceiverENTRY(lines 1493 1512) the Hoare annotation is: (and (or (not (= 0 |old(~__ste_client_forwardReceiver2~0)|)) (= 0 ~__ste_client_forwardReceiver2~0)) (or (not (= 0 |old(~__ste_client_forwardReceiver0~0)|)) (= 0 ~__ste_client_forwardReceiver0~0)) (or (not (= 0 |old(~__ste_client_forwardReceiver1~0)|)) (= 0 ~__ste_client_forwardReceiver1~0))) [2018-11-10 03:28:27,445 INFO L425 ceAbstractionStarter]: For program point L1503-2(lines 1493 1512) no Hoare annotation was computed. [2018-11-10 03:28:27,445 INFO L425 ceAbstractionStarter]: For program point L1500(lines 1500 1508) no Hoare annotation was computed. [2018-11-10 03:28:27,445 INFO L425 ceAbstractionStarter]: For program point setClientForwardReceiverEXIT(lines 1493 1512) no Hoare annotation was computed. [2018-11-10 03:28:27,445 INFO L425 ceAbstractionStarter]: For program point L1497(lines 1497 1509) no Hoare annotation was computed. [2018-11-10 03:28:27,445 INFO L428 ceAbstractionStarter]: At program point L1697(line 1697) the Hoare annotation is: true [2018-11-10 03:28:27,445 INFO L428 ceAbstractionStarter]: At program point L1696(line 1696) the Hoare annotation is: true [2018-11-10 03:28:27,445 INFO L428 ceAbstractionStarter]: At program point L1696-1(line 1696) the Hoare annotation is: true [2018-11-10 03:28:27,446 INFO L428 ceAbstractionStarter]: At program point L1694(line 1694) the Hoare annotation is: true [2018-11-10 03:28:27,446 INFO L425 ceAbstractionStarter]: For program point L1694-1(line 1694) no Hoare annotation was computed. [2018-11-10 03:28:27,446 INFO L428 ceAbstractionStarter]: At program point L1691(line 1691) the Hoare annotation is: true [2018-11-10 03:28:27,446 INFO L425 ceAbstractionStarter]: For program point L1691-1(line 1691) no Hoare annotation was computed. [2018-11-10 03:28:27,446 INFO L428 ceAbstractionStarter]: At program point L1689(line 1689) the Hoare annotation is: true [2018-11-10 03:28:27,446 INFO L425 ceAbstractionStarter]: For program point L1689-1(line 1689) no Hoare annotation was computed. [2018-11-10 03:28:27,446 INFO L425 ceAbstractionStarter]: For program point L1687(lines 1687 1706) no Hoare annotation was computed. [2018-11-10 03:28:27,446 INFO L425 ceAbstractionStarter]: For program point outgoingEXIT(lines 1673 1709) no Hoare annotation was computed. [2018-11-10 03:28:27,446 INFO L428 ceAbstractionStarter]: At program point outgoingENTRY(lines 1673 1709) the Hoare annotation is: true [2018-11-10 03:28:27,446 INFO L428 ceAbstractionStarter]: At program point L1684(line 1684) the Hoare annotation is: true [2018-11-10 03:28:27,446 INFO L425 ceAbstractionStarter]: For program point L1684-1(line 1684) no Hoare annotation was computed. [2018-11-10 03:28:27,446 INFO L428 ceAbstractionStarter]: At program point L1704(line 1704) the Hoare annotation is: true [2018-11-10 03:28:27,446 INFO L425 ceAbstractionStarter]: For program point L1704-1(lines 1673 1709) no Hoare annotation was computed. [2018-11-10 03:28:27,446 INFO L428 ceAbstractionStarter]: At program point L1699(line 1699) the Hoare annotation is: true [2018-11-10 03:28:27,446 INFO L425 ceAbstractionStarter]: For program point L1698(line 1698) no Hoare annotation was computed. [2018-11-10 03:28:27,446 INFO L428 ceAbstractionStarter]: At program point L1699-1(line 1699) the Hoare annotation is: true [2018-11-10 03:28:27,447 INFO L428 ceAbstractionStarter]: At program point select_helpersFINAL(lines 71 77) the Hoare annotation is: true [2018-11-10 03:28:27,447 INFO L425 ceAbstractionStarter]: For program point select_helpersEXIT(lines 71 77) no Hoare annotation was computed. [2018-11-10 03:28:27,447 INFO L425 ceAbstractionStarter]: For program point getClientIdFINAL(lines 1516 1539) no Hoare annotation was computed. [2018-11-10 03:28:27,447 INFO L425 ceAbstractionStarter]: For program point L1520(lines 1520 1536) no Hoare annotation was computed. [2018-11-10 03:28:27,447 INFO L428 ceAbstractionStarter]: At program point getClientIdENTRY(lines 1516 1539) the Hoare annotation is: true [2018-11-10 03:28:27,447 INFO L425 ceAbstractionStarter]: For program point L1528(lines 1528 1534) no Hoare annotation was computed. [2018-11-10 03:28:27,447 INFO L425 ceAbstractionStarter]: For program point getClientIdEXIT(lines 1516 1539) no Hoare annotation was computed. [2018-11-10 03:28:27,447 INFO L425 ceAbstractionStarter]: For program point L1524(lines 1524 1535) no Hoare annotation was computed. [2018-11-10 03:28:27,447 INFO L425 ceAbstractionStarter]: For program point deliverFINAL(lines 1710 1719) no Hoare annotation was computed. [2018-11-10 03:28:27,447 INFO L428 ceAbstractionStarter]: At program point deliverENTRY(lines 1710 1719) the Hoare annotation is: true [2018-11-10 03:28:27,447 INFO L425 ceAbstractionStarter]: For program point deliverEXIT(lines 1710 1719) no Hoare annotation was computed. [2018-11-10 03:28:27,447 INFO L425 ceAbstractionStarter]: For program point setup_chuckEXIT(lines 2529 2538) no Hoare annotation was computed. [2018-11-10 03:28:27,447 INFO L428 ceAbstractionStarter]: At program point setup_chuckENTRY(lines 2529 2538) the Hoare annotation is: true [2018-11-10 03:28:27,447 INFO L425 ceAbstractionStarter]: For program point setup_chuckFINAL(lines 2529 2538) no Hoare annotation was computed. [2018-11-10 03:28:27,447 INFO L428 ceAbstractionStarter]: At program point L2534(line 2534) the Hoare annotation is: true [2018-11-10 03:28:27,447 INFO L428 ceAbstractionStarter]: At program point sendToAddressBookENTRY(lines 1849 1855) the Hoare annotation is: true [2018-11-10 03:28:27,448 INFO L425 ceAbstractionStarter]: For program point sendToAddressBookEXIT(lines 1849 1855) no Hoare annotation was computed. [2018-11-10 03:28:27,448 INFO L425 ceAbstractionStarter]: For program point sendToAddressBookFINAL(lines 1849 1855) no Hoare annotation was computed. [2018-11-10 03:28:27,448 INFO L428 ceAbstractionStarter]: At program point L1792(line 1792) the Hoare annotation is: true [2018-11-10 03:28:27,448 INFO L425 ceAbstractionStarter]: For program point sendEmailEXIT(lines 1784 1796) no Hoare annotation was computed. [2018-11-10 03:28:27,448 INFO L428 ceAbstractionStarter]: At program point L1790(line 1790) the Hoare annotation is: true [2018-11-10 03:28:27,448 INFO L428 ceAbstractionStarter]: At program point sendEmailENTRY(lines 1784 1796) the Hoare annotation is: true [2018-11-10 03:28:27,448 INFO L425 ceAbstractionStarter]: For program point L1790-1(line 1790) no Hoare annotation was computed. [2018-11-10 03:28:27,448 INFO L425 ceAbstractionStarter]: For program point sendEmailFINAL(lines 1784 1796) no Hoare annotation was computed. [2018-11-10 03:28:27,448 INFO L425 ceAbstractionStarter]: For program point L861(lines 861 873) no Hoare annotation was computed. [2018-11-10 03:28:27,448 INFO L425 ceAbstractionStarter]: For program point L882(lines 882 886) no Hoare annotation was computed. [2018-11-10 03:28:27,448 INFO L425 ceAbstractionStarter]: For program point L849(lines 849 857) no Hoare annotation was computed. [2018-11-10 03:28:27,448 INFO L425 ceAbstractionStarter]: For program point L845(lines 845 893) no Hoare annotation was computed. [2018-11-10 03:28:27,448 INFO L428 ceAbstractionStarter]: At program point setClientAddressBookAliasENTRY(lines 841 896) the Hoare annotation is: true [2018-11-10 03:28:27,448 INFO L425 ceAbstractionStarter]: For program point L879(lines 879 887) no Hoare annotation was computed. [2018-11-10 03:28:27,448 INFO L425 ceAbstractionStarter]: For program point L846(lines 846 858) no Hoare annotation was computed. [2018-11-10 03:28:27,448 INFO L425 ceAbstractionStarter]: For program point L875(lines 875 891) no Hoare annotation was computed. [2018-11-10 03:28:27,449 INFO L425 ceAbstractionStarter]: For program point L875-1(lines 841 896) no Hoare annotation was computed. [2018-11-10 03:28:27,449 INFO L425 ceAbstractionStarter]: For program point setClientAddressBookAliasEXIT(lines 841 896) no Hoare annotation was computed. [2018-11-10 03:28:27,449 INFO L425 ceAbstractionStarter]: For program point L867(lines 867 871) no Hoare annotation was computed. [2018-11-10 03:28:27,449 INFO L425 ceAbstractionStarter]: For program point L876(lines 876 888) no Hoare annotation was computed. [2018-11-10 03:28:27,449 INFO L425 ceAbstractionStarter]: For program point L864(lines 864 872) no Hoare annotation was computed. [2018-11-10 03:28:27,449 INFO L425 ceAbstractionStarter]: For program point L860(lines 860 892) no Hoare annotation was computed. [2018-11-10 03:28:27,449 INFO L425 ceAbstractionStarter]: For program point L852(lines 852 856) no Hoare annotation was computed. [2018-11-10 03:28:27,449 INFO L421 ceAbstractionStarter]: At program point L1740(line 1740) the Hoare annotation is: (= |incoming__wrappee__AddressBook_#in~client| incoming__wrappee__AddressBook_~client) [2018-11-10 03:28:27,449 INFO L428 ceAbstractionStarter]: At program point incoming__wrappee__AddressBookENTRY(lines 1730 1747) the Hoare annotation is: true [2018-11-10 03:28:27,449 INFO L425 ceAbstractionStarter]: For program point L1738(lines 1738 1744) no Hoare annotation was computed. [2018-11-10 03:28:27,449 INFO L425 ceAbstractionStarter]: For program point L1738-1(lines 1730 1747) no Hoare annotation was computed. [2018-11-10 03:28:27,449 INFO L425 ceAbstractionStarter]: For program point L1736(line 1736) no Hoare annotation was computed. [2018-11-10 03:28:27,449 INFO L421 ceAbstractionStarter]: At program point L1735(line 1735) the Hoare annotation is: (= |incoming__wrappee__AddressBook_#in~client| incoming__wrappee__AddressBook_~client) [2018-11-10 03:28:27,449 INFO L421 ceAbstractionStarter]: At program point L1735-1(line 1735) the Hoare annotation is: (= |incoming__wrappee__AddressBook_#in~client| incoming__wrappee__AddressBook_~client) [2018-11-10 03:28:27,450 INFO L425 ceAbstractionStarter]: For program point incoming__wrappee__AddressBookEXIT(lines 1730 1747) no Hoare annotation was computed. [2018-11-10 03:28:27,450 INFO L425 ceAbstractionStarter]: For program point getClientAutoResponseFINAL(lines 1034 1057) no Hoare annotation was computed. [2018-11-10 03:28:27,450 INFO L425 ceAbstractionStarter]: For program point L1038(lines 1038 1054) no Hoare annotation was computed. [2018-11-10 03:28:27,450 INFO L425 ceAbstractionStarter]: For program point getClientAutoResponseEXIT(lines 1034 1057) no Hoare annotation was computed. [2018-11-10 03:28:27,450 INFO L428 ceAbstractionStarter]: At program point getClientAutoResponseENTRY(lines 1034 1057) the Hoare annotation is: true [2018-11-10 03:28:27,450 INFO L425 ceAbstractionStarter]: For program point L1046(lines 1046 1052) no Hoare annotation was computed. [2018-11-10 03:28:27,450 INFO L425 ceAbstractionStarter]: For program point L1042(lines 1042 1053) no Hoare annotation was computed. [2018-11-10 03:28:27,450 INFO L428 ceAbstractionStarter]: At program point rjhSetAutoRespondENTRY(lines 2617 2626) the Hoare annotation is: true [2018-11-10 03:28:27,450 INFO L425 ceAbstractionStarter]: For program point rjhSetAutoRespondFINAL(lines 2617 2626) no Hoare annotation was computed. [2018-11-10 03:28:27,450 INFO L425 ceAbstractionStarter]: For program point rjhSetAutoRespondEXIT(lines 2617 2626) no Hoare annotation was computed. [2018-11-10 03:28:27,450 INFO L428 ceAbstractionStarter]: At program point incoming__wrappee__BaseENTRY(lines 1720 1729) the Hoare annotation is: true [2018-11-10 03:28:27,450 INFO L428 ceAbstractionStarter]: At program point L1725(line 1725) the Hoare annotation is: true [2018-11-10 03:28:27,451 INFO L425 ceAbstractionStarter]: For program point incoming__wrappee__BaseFINAL(lines 1720 1729) no Hoare annotation was computed. [2018-11-10 03:28:27,451 INFO L425 ceAbstractionStarter]: For program point incoming__wrappee__BaseEXIT(lines 1720 1729) no Hoare annotation was computed. [2018-11-10 03:28:27,451 INFO L428 ceAbstractionStarter]: At program point L1585(line 1585) the Hoare annotation is: true [2018-11-10 03:28:27,451 INFO L425 ceAbstractionStarter]: For program point L1585-1(line 1585) no Hoare annotation was computed. [2018-11-10 03:28:27,451 INFO L428 ceAbstractionStarter]: At program point L1582(line 1582) the Hoare annotation is: true [2018-11-10 03:28:27,451 INFO L425 ceAbstractionStarter]: For program point L1582-1(line 1582) no Hoare annotation was computed. [2018-11-10 03:28:27,451 INFO L428 ceAbstractionStarter]: At program point L1591(line 1591) the Hoare annotation is: true [2018-11-10 03:28:27,451 INFO L425 ceAbstractionStarter]: For program point printMailEXIT(lines 1570 1597) no Hoare annotation was computed. [2018-11-10 03:28:27,451 INFO L425 ceAbstractionStarter]: For program point L1591-1(line 1591) no Hoare annotation was computed. [2018-11-10 03:28:27,451 INFO L428 ceAbstractionStarter]: At program point L1588(line 1588) the Hoare annotation is: true [2018-11-10 03:28:27,451 INFO L428 ceAbstractionStarter]: At program point printMailENTRY(lines 1570 1597) the Hoare annotation is: true [2018-11-10 03:28:27,451 INFO L425 ceAbstractionStarter]: For program point L1588-1(line 1588) no Hoare annotation was computed. [2018-11-10 03:28:27,451 INFO L425 ceAbstractionStarter]: For program point printMailFINAL(lines 1570 1597) no Hoare annotation was computed. [2018-11-10 03:28:27,451 INFO L428 ceAbstractionStarter]: At program point forwardENTRY(lines 1857 1870) the Hoare annotation is: true [2018-11-10 03:28:27,452 INFO L425 ceAbstractionStarter]: For program point forwardEXIT(lines 1857 1870) no Hoare annotation was computed. [2018-11-10 03:28:27,452 INFO L428 ceAbstractionStarter]: At program point L1865(line 1865) the Hoare annotation is: true [2018-11-10 03:28:27,452 INFO L428 ceAbstractionStarter]: At program point L1865-1(line 1865) the Hoare annotation is: true [2018-11-10 03:28:27,452 INFO L425 ceAbstractionStarter]: For program point forwardFINAL(lines 1857 1870) no Hoare annotation was computed. [2018-11-10 03:28:27,452 INFO L428 ceAbstractionStarter]: At program point L1863(line 1863) the Hoare annotation is: true [2018-11-10 03:28:27,452 INFO L425 ceAbstractionStarter]: For program point L1863-1(line 1863) no Hoare annotation was computed. [2018-11-10 03:28:27,452 INFO L425 ceAbstractionStarter]: For program point L2006(lines 2006 2010) no Hoare annotation was computed. [2018-11-10 03:28:27,452 INFO L425 ceAbstractionStarter]: For program point setEmailToEXIT(lines 1999 2014) no Hoare annotation was computed. [2018-11-10 03:28:27,452 INFO L425 ceAbstractionStarter]: For program point L2006-2(lines 1999 2014) no Hoare annotation was computed. [2018-11-10 03:28:27,452 INFO L425 ceAbstractionStarter]: For program point L2003(lines 2003 2011) no Hoare annotation was computed. [2018-11-10 03:28:27,452 INFO L428 ceAbstractionStarter]: At program point setEmailToENTRY(lines 1999 2014) the Hoare annotation is: true [2018-11-10 03:28:27,452 INFO L425 ceAbstractionStarter]: For program point is_queue_emptyEXIT(lines 1807 1815) no Hoare annotation was computed. [2018-11-10 03:28:27,453 INFO L428 ceAbstractionStarter]: At program point is_queue_emptyENTRY(lines 1807 1815) the Hoare annotation is: true [2018-11-10 03:28:27,453 INFO L425 ceAbstractionStarter]: For program point is_queue_emptyFINAL(lines 1807 1815) no Hoare annotation was computed. [2018-11-10 03:28:27,453 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-10 03:28:27,453 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-10 03:28:27,453 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-10 03:28:27,453 INFO L425 ceAbstractionStarter]: For program point L929(lines 929 970) no Hoare annotation was computed. [2018-11-10 03:28:27,453 INFO L425 ceAbstractionStarter]: For program point getClientAddressBookAddressFINAL(lines 906 974) no Hoare annotation was computed. [2018-11-10 03:28:27,453 INFO L428 ceAbstractionStarter]: At program point getClientAddressBookAddressENTRY(lines 906 974) the Hoare annotation is: true [2018-11-10 03:28:27,453 INFO L425 ceAbstractionStarter]: For program point L919(lines 919 925) no Hoare annotation was computed. [2018-11-10 03:28:27,453 INFO L425 ceAbstractionStarter]: For program point L948(lines 948 969) no Hoare annotation was computed. [2018-11-10 03:28:27,453 INFO L425 ceAbstractionStarter]: For program point L915(lines 915 926) no Hoare annotation was computed. [2018-11-10 03:28:27,453 INFO L425 ceAbstractionStarter]: For program point L911(lines 911 927) no Hoare annotation was computed. [2018-11-10 03:28:27,453 INFO L425 ceAbstractionStarter]: For program point L938(lines 938 944) no Hoare annotation was computed. [2018-11-10 03:28:27,453 INFO L425 ceAbstractionStarter]: For program point L934(lines 934 945) no Hoare annotation was computed. [2018-11-10 03:28:27,453 INFO L425 ceAbstractionStarter]: For program point L930(lines 930 946) no Hoare annotation was computed. [2018-11-10 03:28:27,453 INFO L425 ceAbstractionStarter]: For program point L957(lines 957 963) no Hoare annotation was computed. [2018-11-10 03:28:27,454 INFO L425 ceAbstractionStarter]: For program point getClientAddressBookAddressEXIT(lines 906 974) no Hoare annotation was computed. [2018-11-10 03:28:27,454 INFO L425 ceAbstractionStarter]: For program point L953(lines 953 964) no Hoare annotation was computed. [2018-11-10 03:28:27,454 INFO L425 ceAbstractionStarter]: For program point L949(lines 949 965) no Hoare annotation was computed. [2018-11-10 03:28:27,454 INFO L425 ceAbstractionStarter]: For program point L910(lines 910 971) no Hoare annotation was computed. [2018-11-10 03:28:27,454 INFO L425 ceAbstractionStarter]: For program point bobSetAddressBookFINAL(lines 2627 2639) no Hoare annotation was computed. [2018-11-10 03:28:27,454 INFO L425 ceAbstractionStarter]: For program point bobSetAddressBookEXIT(lines 2627 2639) no Hoare annotation was computed. [2018-11-10 03:28:27,454 INFO L428 ceAbstractionStarter]: At program point L2634(line 2634) the Hoare annotation is: true [2018-11-10 03:28:27,454 INFO L428 ceAbstractionStarter]: At program point L2632(line 2632) the Hoare annotation is: true [2018-11-10 03:28:27,454 INFO L428 ceAbstractionStarter]: At program point L2633(line 2633) the Hoare annotation is: true [2018-11-10 03:28:27,454 INFO L428 ceAbstractionStarter]: At program point bobSetAddressBookENTRY(lines 2627 2639) the Hoare annotation is: true [2018-11-10 03:28:27,454 INFO L425 ceAbstractionStarter]: For program point rjhEnableForwardingEXIT(lines 2640 2649) no Hoare annotation was computed. [2018-11-10 03:28:27,454 INFO L421 ceAbstractionStarter]: At program point rjhEnableForwardingENTRY(lines 2640 2649) the Hoare annotation is: (and (or (not (= 0 |old(~__ste_client_forwardReceiver2~0)|)) (= 0 ~__ste_client_forwardReceiver2~0)) (or (not (= 0 |old(~__ste_client_forwardReceiver0~0)|)) (= 0 ~__ste_client_forwardReceiver0~0)) (or (not (= 0 |old(~__ste_client_forwardReceiver1~0)|)) (= 0 ~__ste_client_forwardReceiver1~0))) [2018-11-10 03:28:27,454 INFO L425 ceAbstractionStarter]: For program point rjhEnableForwardingFINAL(lines 2640 2649) no Hoare annotation was computed. [2018-11-10 03:28:27,454 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-10 03:28:27,454 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= 0 ~__ste_client_forwardReceiver2~0) (= 0 ~__ste_client_forwardReceiver1~0) (= 0 ~__ste_client_forwardReceiver0~0)) [2018-11-10 03:28:27,454 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-10 03:28:27,455 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-10 03:28:27,455 INFO L425 ceAbstractionStarter]: For program point setupEXIT(lines 2573 2595) no Hoare annotation was computed. [2018-11-10 03:28:27,455 INFO L428 ceAbstractionStarter]: At program point setupENTRY(lines 2573 2595) the Hoare annotation is: true [2018-11-10 03:28:27,455 INFO L425 ceAbstractionStarter]: For program point L2589-1(line 2589) no Hoare annotation was computed. [2018-11-10 03:28:27,455 INFO L428 ceAbstractionStarter]: At program point L2589(line 2589) the Hoare annotation is: true [2018-11-10 03:28:27,455 INFO L425 ceAbstractionStarter]: For program point setupFINAL(lines 2573 2595) no Hoare annotation was computed. [2018-11-10 03:28:27,455 INFO L425 ceAbstractionStarter]: For program point L2585-1(line 2585) no Hoare annotation was computed. [2018-11-10 03:28:27,455 INFO L428 ceAbstractionStarter]: At program point L2585(line 2585) the Hoare annotation is: true [2018-11-10 03:28:27,455 INFO L425 ceAbstractionStarter]: For program point L2581-1(line 2581) no Hoare annotation was computed. [2018-11-10 03:28:27,455 INFO L428 ceAbstractionStarter]: At program point L2581(line 2581) the Hoare annotation is: true [2018-11-10 03:28:27,455 INFO L425 ceAbstractionStarter]: For program point getEmailFromFINAL(lines 1943 1961) no Hoare annotation was computed. [2018-11-10 03:28:27,455 INFO L425 ceAbstractionStarter]: For program point L1951(lines 1951 1957) no Hoare annotation was computed. [2018-11-10 03:28:27,455 INFO L425 ceAbstractionStarter]: For program point L1947(lines 1947 1958) no Hoare annotation was computed. [2018-11-10 03:28:27,455 INFO L425 ceAbstractionStarter]: For program point getEmailFromEXIT(lines 1943 1961) no Hoare annotation was computed. [2018-11-10 03:28:27,455 INFO L428 ceAbstractionStarter]: At program point getEmailFromENTRY(lines 1943 1961) the Hoare annotation is: true [2018-11-10 03:28:27,456 INFO L425 ceAbstractionStarter]: For program point __utac_acc__DecryptForward_spec__1EXIT(lines 2279 2296) no Hoare annotation was computed. [2018-11-10 03:28:27,456 INFO L425 ceAbstractionStarter]: For program point L2287(lines 2287 2293) no Hoare annotation was computed. [2018-11-10 03:28:27,456 INFO L425 ceAbstractionStarter]: For program point L2285-1(line 2285) no Hoare annotation was computed. [2018-11-10 03:28:27,456 INFO L428 ceAbstractionStarter]: At program point L2285(line 2285) the Hoare annotation is: true [2018-11-10 03:28:27,456 INFO L428 ceAbstractionStarter]: At program point __utac_acc__DecryptForward_spec__1ENTRY(lines 2279 2296) the Hoare annotation is: true [2018-11-10 03:28:27,456 INFO L425 ceAbstractionStarter]: For program point L2291-1(lines 2279 2296) no Hoare annotation was computed. [2018-11-10 03:28:27,456 INFO L421 ceAbstractionStarter]: At program point L2291(line 2291) the Hoare annotation is: false [2018-11-10 03:28:27,456 INFO L425 ceAbstractionStarter]: For program point queueFINAL(lines 1797 1806) no Hoare annotation was computed. [2018-11-10 03:28:27,456 INFO L428 ceAbstractionStarter]: At program point queueENTRY(lines 1797 1806) the Hoare annotation is: true [2018-11-10 03:28:27,456 INFO L425 ceAbstractionStarter]: For program point queueEXIT(lines 1797 1806) no Hoare annotation was computed. [2018-11-10 03:28:27,456 INFO L425 ceAbstractionStarter]: For program point L1550(lines 1550 1554) no Hoare annotation was computed. [2018-11-10 03:28:27,456 INFO L425 ceAbstractionStarter]: For program point setClientIdEXIT(lines 1540 1559) no Hoare annotation was computed. [2018-11-10 03:28:27,456 INFO L425 ceAbstractionStarter]: For program point L1550-2(lines 1540 1559) no Hoare annotation was computed. [2018-11-10 03:28:27,456 INFO L425 ceAbstractionStarter]: For program point L1547(lines 1547 1555) no Hoare annotation was computed. [2018-11-10 03:28:27,456 INFO L428 ceAbstractionStarter]: At program point setClientIdENTRY(lines 1540 1559) the Hoare annotation is: true [2018-11-10 03:28:27,456 INFO L425 ceAbstractionStarter]: For program point L1544(lines 1544 1556) no Hoare annotation was computed. [2018-11-10 03:28:27,466 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 03:28:27 BoogieIcfgContainer [2018-11-10 03:28:27,466 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 03:28:27,467 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 03:28:27,467 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 03:28:27,467 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 03:28:27,467 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 03:28:19" (3/4) ... [2018-11-10 03:28:27,472 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-10 03:28:27,479 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure valid_product [2018-11-10 03:28:27,479 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure mail [2018-11-10 03:28:27,479 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure get_queued_client [2018-11-10 03:28:27,479 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-10 03:28:27,479 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure getEmailId [2018-11-10 03:28:27,479 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure setup_rjh [2018-11-10 03:28:27,479 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure getClientAddressBookSize [2018-11-10 03:28:27,479 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure bobToRjh [2018-11-10 03:28:27,479 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure setup_bob [2018-11-10 03:28:27,479 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure select_features [2018-11-10 03:28:27,479 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure autoRespond [2018-11-10 03:28:27,479 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure setClientAddressBookAddress [2018-11-10 03:28:27,479 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure getClientForwardReceiver [2018-11-10 03:28:27,480 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure incoming [2018-11-10 03:28:27,480 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure createEmail [2018-11-10 03:28:27,480 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure test [2018-11-10 03:28:27,480 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure getEmailTo [2018-11-10 03:28:27,480 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure get_queued_email [2018-11-10 03:28:27,480 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure setClientAutoResponse [2018-11-10 03:28:27,480 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure setClientAddressBookSize [2018-11-10 03:28:27,480 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure outgoing__wrappee__AutoResponder [2018-11-10 03:28:27,480 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure setEmailFrom [2018-11-10 03:28:27,480 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure isReadable [2018-11-10 03:28:27,480 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure __automaton_fail [2018-11-10 03:28:27,480 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure setClientForwardReceiver [2018-11-10 03:28:27,480 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure outgoing [2018-11-10 03:28:27,480 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure select_helpers [2018-11-10 03:28:27,480 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure getClientId [2018-11-10 03:28:27,481 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure deliver [2018-11-10 03:28:27,481 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure setup_chuck [2018-11-10 03:28:27,481 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure sendToAddressBook [2018-11-10 03:28:27,481 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure sendEmail [2018-11-10 03:28:27,481 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure setClientAddressBookAlias [2018-11-10 03:28:27,481 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure incoming__wrappee__AddressBook [2018-11-10 03:28:27,481 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure getClientAutoResponse [2018-11-10 03:28:27,481 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure rjhSetAutoRespond [2018-11-10 03:28:27,481 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure incoming__wrappee__Base [2018-11-10 03:28:27,481 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure printMail [2018-11-10 03:28:27,481 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure forward [2018-11-10 03:28:27,481 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure setEmailTo [2018-11-10 03:28:27,481 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure is_queue_empty [2018-11-10 03:28:27,481 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-10 03:28:27,481 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure getClientAddressBookAddress [2018-11-10 03:28:27,482 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure bobSetAddressBook [2018-11-10 03:28:27,482 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure rjhEnableForwarding [2018-11-10 03:28:27,482 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure setup [2018-11-10 03:28:27,482 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure getEmailFrom [2018-11-10 03:28:27,482 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure __utac_acc__DecryptForward_spec__1 [2018-11-10 03:28:27,482 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure queue [2018-11-10 03:28:27,482 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure setClientId [2018-11-10 03:28:27,503 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 201 nodes and edges [2018-11-10 03:28:27,504 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 83 nodes and edges [2018-11-10 03:28:27,509 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 30 nodes and edges [2018-11-10 03:28:27,606 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_30caf65f-286e-4901-ae18-8cd7ce47ce79/bin-2019/utaipan/witness.graphml [2018-11-10 03:28:27,606 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 03:28:27,607 INFO L168 Benchmark]: Toolchain (without parser) took 9409.66 ms. Allocated memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: 709.4 MB). Free memory was 957.5 MB in the beginning and 1.6 GB in the end (delta: -629.2 MB). Peak memory consumption was 80.2 MB. Max. memory is 11.5 GB. [2018-11-10 03:28:27,608 INFO L168 Benchmark]: CDTParser took 0.42 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 03:28:27,608 INFO L168 Benchmark]: CACSL2BoogieTranslator took 564.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 174.6 MB). Free memory was 957.5 MB in the beginning and 1.2 GB in the end (delta: -193.4 MB). Peak memory consumption was 66.9 MB. Max. memory is 11.5 GB. [2018-11-10 03:28:27,608 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.34 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-11-10 03:28:27,608 INFO L168 Benchmark]: Boogie Preprocessor took 50.94 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-11-10 03:28:27,608 INFO L168 Benchmark]: RCFGBuilder took 1077.69 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 982.3 MB in the end (delta: 155.1 MB). Peak memory consumption was 155.1 MB. Max. memory is 11.5 GB. [2018-11-10 03:28:27,609 INFO L168 Benchmark]: TraceAbstraction took 7525.47 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 534.8 MB). Free memory was 982.3 MB in the beginning and 1.6 GB in the end (delta: -621.6 MB). Peak memory consumption was 470.2 MB. Max. memory is 11.5 GB. [2018-11-10 03:28:27,609 INFO L168 Benchmark]: Witness Printer took 139.47 ms. Allocated memory is still 1.7 GB. Free memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 11.5 GB. [2018-11-10 03:28:27,610 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.42 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 564.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 174.6 MB). Free memory was 957.5 MB in the beginning and 1.2 GB in the end (delta: -193.4 MB). Peak memory consumption was 66.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 48.34 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 50.94 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1077.69 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 982.3 MB in the end (delta: 155.1 MB). Peak memory consumption was 155.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 7525.47 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 534.8 MB). Free memory was 982.3 MB in the beginning and 1.6 GB in the end (delta: -621.6 MB). Peak memory consumption was 470.2 MB. Max. memory is 11.5 GB. * Witness Printer took 139.47 ms. Allocated memory is still 1.7 GB. Free memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 476]: 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: 2421]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2407]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2432]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2457]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2446]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2396]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2349]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2341]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2360]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2340]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2385]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2374]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 51 procedures, 346 locations, 1 error locations. SAFE Result, 7.4s OverallTime, 13 OverallIterations, 3 TraceHistogramMax, 2.5s AutomataDifference, 0.0s DeadEndRemovalTime, 1.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 5976 SDtfs, 1486 SDslu, 16667 SDs, 0 SdLazy, 764 SolverSat, 20 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 86 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9329occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 13 MinimizatonAttempts, 130 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 125 LocationsWithAnnotation, 9314 PreInvPairs, 12918 NumberOfFragments, 387 HoareAnnotationTreeSize, 9314 FomulaSimplifications, 2212 FormulaSimplificationTreeSizeReduction, 0.9s HoareSimplificationTime, 125 FomulaSimplificationsInter, 7972 FormulaSimplificationTreeSizeReductionInter, 0.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 2149 NumberOfCodeBlocks, 2149 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2136 ConstructedInterpolants, 0 QuantifiedInterpolants, 428976 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 293/293 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...