./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/product-lines/email_spec0_product11.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_4459a0f2-05db-436b-bdbd-2e669404c24c/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_4459a0f2-05db-436b-bdbd-2e669404c24c/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_4459a0f2-05db-436b-bdbd-2e669404c24c/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_4459a0f2-05db-436b-bdbd-2e669404c24c/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/product-lines/email_spec0_product11.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_4459a0f2-05db-436b-bdbd-2e669404c24c/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_4459a0f2-05db-436b-bdbd-2e669404c24c/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8636c856cee4a943114b47de6348e0f03ee97db1 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 11:24:56,881 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 11:24:56,883 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 11:24:56,897 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 11:24:56,897 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 11:24:56,898 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 11:24:56,899 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 11:24:56,900 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 11:24:56,902 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 11:24:56,902 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 11:24:56,903 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 11:24:56,907 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 11:24:56,907 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 11:24:56,908 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 11:24:56,909 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 11:24:56,910 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 11:24:56,910 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 11:24:56,918 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 11:24:56,920 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 11:24:56,921 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 11:24:56,923 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 11:24:56,927 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 11:24:56,929 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 11:24:56,929 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 11:24:56,931 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 11:24:56,934 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 11:24:56,934 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 11:24:56,935 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 11:24:56,935 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 11:24:56,936 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 11:24:56,936 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 11:24:56,937 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 11:24:56,938 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 11:24:56,939 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 11:24:56,942 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 11:24:56,942 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 11:24:56,942 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 11:24:56,943 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 11:24:56,943 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 11:24:56,944 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 11:24:56,944 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 11:24:56,945 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_4459a0f2-05db-436b-bdbd-2e669404c24c/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-10-22 11:24:56,961 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 11:24:56,961 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 11:24:56,962 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-22 11:24:56,962 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-22 11:24:56,962 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-22 11:24:56,962 INFO L138 SettingsManager]: * Explicit value domain=true [2019-10-22 11:24:56,963 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-10-22 11:24:56,963 INFO L138 SettingsManager]: * Octagon Domain=false [2019-10-22 11:24:56,963 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-10-22 11:24:56,963 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-10-22 11:24:56,975 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-10-22 11:24:56,976 INFO L138 SettingsManager]: * Interval Domain=false [2019-10-22 11:24:56,976 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 11:24:56,976 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 11:24:56,977 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 11:24:56,977 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 11:24:56,977 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 11:24:56,977 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 11:24:56,977 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 11:24:56,977 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 11:24:56,977 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 11:24:56,978 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 11:24:56,978 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 11:24:56,978 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 11:24:56,978 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 11:24:56,978 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 11:24:56,978 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 11:24:56,978 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:24:56,979 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 11:24:56,979 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 11:24:56,979 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 11:24:56,979 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-22 11:24:56,979 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 11:24:56,979 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 11:24:56,980 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-22 11:24:56,980 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_4459a0f2-05db-436b-bdbd-2e669404c24c/bin/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8636c856cee4a943114b47de6348e0f03ee97db1 [2019-10-22 11:24:57,015 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 11:24:57,026 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 11:24:57,029 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 11:24:57,030 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 11:24:57,031 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 11:24:57,032 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_4459a0f2-05db-436b-bdbd-2e669404c24c/bin/utaipan/../../sv-benchmarks/c/product-lines/email_spec0_product11.cil.c [2019-10-22 11:24:57,085 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4459a0f2-05db-436b-bdbd-2e669404c24c/bin/utaipan/data/ffced0cfd/335297a4c7f44fa5b454f2070351702e/FLAGee5caf026 [2019-10-22 11:24:57,601 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 11:24:57,602 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_4459a0f2-05db-436b-bdbd-2e669404c24c/sv-benchmarks/c/product-lines/email_spec0_product11.cil.c [2019-10-22 11:24:57,623 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4459a0f2-05db-436b-bdbd-2e669404c24c/bin/utaipan/data/ffced0cfd/335297a4c7f44fa5b454f2070351702e/FLAGee5caf026 [2019-10-22 11:24:57,853 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_4459a0f2-05db-436b-bdbd-2e669404c24c/bin/utaipan/data/ffced0cfd/335297a4c7f44fa5b454f2070351702e [2019-10-22 11:24:57,856 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 11:24:57,857 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 11:24:57,858 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 11:24:57,858 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 11:24:57,861 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 11:24:57,862 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:24:57" (1/1) ... [2019-10-22 11:24:57,864 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@630b61e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:57, skipping insertion in model container [2019-10-22 11:24:57,864 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:24:57" (1/1) ... [2019-10-22 11:24:57,871 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 11:24:57,930 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 11:24:58,446 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:24:58,461 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 11:24:58,619 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:24:58,679 INFO L192 MainTranslator]: Completed translation [2019-10-22 11:24:58,679 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:58 WrapperNode [2019-10-22 11:24:58,679 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 11:24:58,680 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 11:24:58,680 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 11:24:58,680 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 11:24:58,689 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:58" (1/1) ... [2019-10-22 11:24:58,710 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:58" (1/1) ... [2019-10-22 11:24:58,795 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 11:24:58,795 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 11:24:58,795 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 11:24:58,796 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 11:24:58,819 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:58" (1/1) ... [2019-10-22 11:24:58,819 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:58" (1/1) ... [2019-10-22 11:24:58,838 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:58" (1/1) ... [2019-10-22 11:24:58,838 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:58" (1/1) ... [2019-10-22 11:24:58,860 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:58" (1/1) ... [2019-10-22 11:24:58,880 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:58" (1/1) ... [2019-10-22 11:24:58,894 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:58" (1/1) ... [2019-10-22 11:24:58,904 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 11:24:58,906 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 11:24:58,906 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 11:24:58,907 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 11:24:58,908 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:58" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4459a0f2-05db-436b-bdbd-2e669404c24c/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:24:58,965 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-10-22 11:24:58,965 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 11:24:58,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-22 11:24:58,965 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 11:24:58,965 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 11:25:00,607 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 11:25:00,607 INFO L284 CfgBuilder]: Removed 219 assume(true) statements. [2019-10-22 11:25:00,609 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:25:00 BoogieIcfgContainer [2019-10-22 11:25:00,609 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 11:25:00,610 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 11:25:00,610 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 11:25:00,613 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 11:25:00,613 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 11:24:57" (1/3) ... [2019-10-22 11:25:00,614 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@134200e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:25:00, skipping insertion in model container [2019-10-22 11:25:00,614 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:58" (2/3) ... [2019-10-22 11:25:00,614 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@134200e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:25:00, skipping insertion in model container [2019-10-22 11:25:00,615 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:25:00" (3/3) ... [2019-10-22 11:25:00,616 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec0_product11.cil.c [2019-10-22 11:25:00,626 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 11:25:00,633 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-10-22 11:25:00,643 INFO L249 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-10-22 11:25:00,665 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 11:25:00,665 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 11:25:00,666 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 11:25:00,666 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 11:25:00,666 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 11:25:00,666 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 11:25:00,666 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 11:25:00,666 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 11:25:00,685 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states. [2019-10-22 11:25:00,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-10-22 11:25:00,697 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:00,698 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:25:00,699 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:25:00,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:00,704 INFO L82 PathProgramCache]: Analyzing trace with hash 48512962, now seen corresponding path program 1 times [2019-10-22 11:25:00,712 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:00,712 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198962893] [2019-10-22 11:25:00,712 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:00,713 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:00,713 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:00,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:00,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:25:00,988 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198962893] [2019-10-22 11:25:00,989 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:00,989 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:25:00,990 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849675393] [2019-10-22 11:25:00,994 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:25:00,995 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:01,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:25:01,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:25:01,012 INFO L87 Difference]: Start difference. First operand 329 states. Second operand 3 states. [2019-10-22 11:25:01,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:01,167 INFO L93 Difference]: Finished difference Result 952 states and 1658 transitions. [2019-10-22 11:25:01,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:25:01,172 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-10-22 11:25:01,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:01,192 INFO L225 Difference]: With dead ends: 952 [2019-10-22 11:25:01,193 INFO L226 Difference]: Without dead ends: 606 [2019-10-22 11:25:01,197 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:25:01,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2019-10-22 11:25:01,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 312. [2019-10-22 11:25:01,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2019-10-22 11:25:01,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 539 transitions. [2019-10-22 11:25:01,262 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 539 transitions. Word has length 40 [2019-10-22 11:25:01,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:01,262 INFO L462 AbstractCegarLoop]: Abstraction has 312 states and 539 transitions. [2019-10-22 11:25:01,263 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:25:01,263 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 539 transitions. [2019-10-22 11:25:01,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-10-22 11:25:01,265 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:01,265 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:25:01,265 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:25:01,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:01,265 INFO L82 PathProgramCache]: Analyzing trace with hash 802740885, now seen corresponding path program 1 times [2019-10-22 11:25:01,266 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:01,266 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571049054] [2019-10-22 11:25:01,266 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:01,266 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:01,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:01,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:01,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:25:01,373 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571049054] [2019-10-22 11:25:01,374 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:01,374 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:25:01,374 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725335449] [2019-10-22 11:25:01,376 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:25:01,376 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:01,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:25:01,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:25:01,377 INFO L87 Difference]: Start difference. First operand 312 states and 539 transitions. Second operand 5 states. [2019-10-22 11:25:01,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:01,555 INFO L93 Difference]: Finished difference Result 885 states and 1533 transitions. [2019-10-22 11:25:01,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 11:25:01,556 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2019-10-22 11:25:01,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:01,559 INFO L225 Difference]: With dead ends: 885 [2019-10-22 11:25:01,559 INFO L226 Difference]: Without dead ends: 592 [2019-10-22 11:25:01,568 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-22 11:25:01,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2019-10-22 11:25:01,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 312. [2019-10-22 11:25:01,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2019-10-22 11:25:01,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 538 transitions. [2019-10-22 11:25:01,616 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 538 transitions. Word has length 42 [2019-10-22 11:25:01,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:01,616 INFO L462 AbstractCegarLoop]: Abstraction has 312 states and 538 transitions. [2019-10-22 11:25:01,616 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:25:01,617 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 538 transitions. [2019-10-22 11:25:01,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-22 11:25:01,618 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:01,618 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:25:01,618 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:25:01,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:01,618 INFO L82 PathProgramCache]: Analyzing trace with hash -447724126, now seen corresponding path program 1 times [2019-10-22 11:25:01,619 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:01,619 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439654372] [2019-10-22 11:25:01,619 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:01,619 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:01,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:01,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:01,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:25:01,738 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439654372] [2019-10-22 11:25:01,738 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:01,739 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:25:01,739 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859231279] [2019-10-22 11:25:01,739 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:25:01,739 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:01,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:25:01,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:25:01,740 INFO L87 Difference]: Start difference. First operand 312 states and 538 transitions. Second operand 3 states. [2019-10-22 11:25:01,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:01,775 INFO L93 Difference]: Finished difference Result 606 states and 1050 transitions. [2019-10-22 11:25:01,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:25:01,776 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-10-22 11:25:01,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:01,778 INFO L225 Difference]: With dead ends: 606 [2019-10-22 11:25:01,778 INFO L226 Difference]: Without dead ends: 317 [2019-10-22 11:25:01,779 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:25:01,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2019-10-22 11:25:01,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 312. [2019-10-22 11:25:01,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2019-10-22 11:25:01,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 535 transitions. [2019-10-22 11:25:01,840 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 535 transitions. Word has length 43 [2019-10-22 11:25:01,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:01,841 INFO L462 AbstractCegarLoop]: Abstraction has 312 states and 535 transitions. [2019-10-22 11:25:01,841 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:25:01,841 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 535 transitions. [2019-10-22 11:25:01,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-22 11:25:01,843 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:01,848 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:25:01,848 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:25:01,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:01,849 INFO L82 PathProgramCache]: Analyzing trace with hash -806251715, now seen corresponding path program 1 times [2019-10-22 11:25:01,850 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:01,850 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827902807] [2019-10-22 11:25:01,850 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:01,850 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:01,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:01,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:01,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:25:01,920 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827902807] [2019-10-22 11:25:01,920 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:01,920 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:25:01,920 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877229627] [2019-10-22 11:25:01,921 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:25:01,921 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:01,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:25:01,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:25:01,921 INFO L87 Difference]: Start difference. First operand 312 states and 535 transitions. Second operand 5 states. [2019-10-22 11:25:02,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:02,058 INFO L93 Difference]: Finished difference Result 875 states and 1513 transitions. [2019-10-22 11:25:02,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:25:02,058 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-10-22 11:25:02,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:02,061 INFO L225 Difference]: With dead ends: 875 [2019-10-22 11:25:02,061 INFO L226 Difference]: Without dead ends: 590 [2019-10-22 11:25:02,062 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-22 11:25:02,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2019-10-22 11:25:02,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 312. [2019-10-22 11:25:02,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2019-10-22 11:25:02,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 534 transitions. [2019-10-22 11:25:02,076 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 534 transitions. Word has length 45 [2019-10-22 11:25:02,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:02,077 INFO L462 AbstractCegarLoop]: Abstraction has 312 states and 534 transitions. [2019-10-22 11:25:02,077 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:25:02,077 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 534 transitions. [2019-10-22 11:25:02,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-22 11:25:02,078 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:02,078 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:25:02,079 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:25:02,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:02,079 INFO L82 PathProgramCache]: Analyzing trace with hash -692287456, now seen corresponding path program 1 times [2019-10-22 11:25:02,079 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:02,080 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178599582] [2019-10-22 11:25:02,080 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:02,080 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:02,080 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:02,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:02,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:25:02,140 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178599582] [2019-10-22 11:25:02,140 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:02,141 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:25:02,141 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866105904] [2019-10-22 11:25:02,141 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:25:02,141 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:02,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:25:02,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:25:02,142 INFO L87 Difference]: Start difference. First operand 312 states and 534 transitions. Second operand 5 states. [2019-10-22 11:25:02,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:02,267 INFO L93 Difference]: Finished difference Result 880 states and 1517 transitions. [2019-10-22 11:25:02,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:25:02,268 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2019-10-22 11:25:02,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:02,272 INFO L225 Difference]: With dead ends: 880 [2019-10-22 11:25:02,272 INFO L226 Difference]: Without dead ends: 595 [2019-10-22 11:25:02,273 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-22 11:25:02,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2019-10-22 11:25:02,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 312. [2019-10-22 11:25:02,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2019-10-22 11:25:02,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 533 transitions. [2019-10-22 11:25:02,290 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 533 transitions. Word has length 46 [2019-10-22 11:25:02,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:02,290 INFO L462 AbstractCegarLoop]: Abstraction has 312 states and 533 transitions. [2019-10-22 11:25:02,290 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:25:02,290 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 533 transitions. [2019-10-22 11:25:02,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-22 11:25:02,291 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:02,291 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:25:02,292 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:25:02,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:02,292 INFO L82 PathProgramCache]: Analyzing trace with hash -1299263688, now seen corresponding path program 1 times [2019-10-22 11:25:02,292 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:02,292 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804520812] [2019-10-22 11:25:02,292 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:02,293 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:02,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:02,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:02,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:25:02,343 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804520812] [2019-10-22 11:25:02,344 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:02,344 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:25:02,344 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475817505] [2019-10-22 11:25:02,344 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:25:02,344 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:02,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:25:02,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:25:02,345 INFO L87 Difference]: Start difference. First operand 312 states and 533 transitions. Second operand 3 states. [2019-10-22 11:25:02,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:02,366 INFO L93 Difference]: Finished difference Result 386 states and 642 transitions. [2019-10-22 11:25:02,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:25:02,367 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2019-10-22 11:25:02,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:02,368 INFO L225 Difference]: With dead ends: 386 [2019-10-22 11:25:02,368 INFO L226 Difference]: Without dead ends: 315 [2019-10-22 11:25:02,369 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:25:02,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-10-22 11:25:02,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 314. [2019-10-22 11:25:02,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2019-10-22 11:25:02,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 535 transitions. [2019-10-22 11:25:02,385 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 535 transitions. Word has length 47 [2019-10-22 11:25:02,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:02,385 INFO L462 AbstractCegarLoop]: Abstraction has 314 states and 535 transitions. [2019-10-22 11:25:02,385 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:25:02,385 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 535 transitions. [2019-10-22 11:25:02,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-10-22 11:25:02,386 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:02,387 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:25:02,387 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:25:02,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:02,387 INFO L82 PathProgramCache]: Analyzing trace with hash -527622090, now seen corresponding path program 1 times [2019-10-22 11:25:02,387 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:02,388 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40587087] [2019-10-22 11:25:02,388 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:02,388 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:02,388 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:02,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:02,436 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:25:02,437 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40587087] [2019-10-22 11:25:02,437 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:02,437 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:25:02,437 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838983986] [2019-10-22 11:25:02,438 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:25:02,438 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:02,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:25:02,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:25:02,438 INFO L87 Difference]: Start difference. First operand 314 states and 535 transitions. Second operand 3 states. [2019-10-22 11:25:02,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:02,467 INFO L93 Difference]: Finished difference Result 828 states and 1429 transitions. [2019-10-22 11:25:02,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:25:02,467 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-10-22 11:25:02,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:02,469 INFO L225 Difference]: With dead ends: 828 [2019-10-22 11:25:02,470 INFO L226 Difference]: Without dead ends: 545 [2019-10-22 11:25:02,471 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:25:02,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2019-10-22 11:25:02,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 474. [2019-10-22 11:25:02,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 474 states. [2019-10-22 11:25:02,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 828 transitions. [2019-10-22 11:25:02,494 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 828 transitions. Word has length 53 [2019-10-22 11:25:02,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:02,494 INFO L462 AbstractCegarLoop]: Abstraction has 474 states and 828 transitions. [2019-10-22 11:25:02,494 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:25:02,494 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 828 transitions. [2019-10-22 11:25:02,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-22 11:25:02,495 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:02,495 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:25:02,495 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:25:02,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:02,496 INFO L82 PathProgramCache]: Analyzing trace with hash 424261333, now seen corresponding path program 1 times [2019-10-22 11:25:02,496 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:02,496 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412178365] [2019-10-22 11:25:02,496 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:02,496 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:02,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:02,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:02,605 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-22 11:25:02,605 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412178365] [2019-10-22 11:25:02,605 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:02,605 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-22 11:25:02,606 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270761950] [2019-10-22 11:25:02,606 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-22 11:25:02,606 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:02,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-22 11:25:02,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-22 11:25:02,607 INFO L87 Difference]: Start difference. First operand 474 states and 828 transitions. Second operand 10 states. [2019-10-22 11:25:03,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:03,332 INFO L93 Difference]: Finished difference Result 917 states and 1436 transitions. [2019-10-22 11:25:03,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-22 11:25:03,332 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 54 [2019-10-22 11:25:03,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:03,335 INFO L225 Difference]: With dead ends: 917 [2019-10-22 11:25:03,336 INFO L226 Difference]: Without dead ends: 868 [2019-10-22 11:25:03,337 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=290, Invalid=766, Unknown=0, NotChecked=0, Total=1056 [2019-10-22 11:25:03,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 868 states. [2019-10-22 11:25:03,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 868 to 508. [2019-10-22 11:25:03,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 508 states. [2019-10-22 11:25:03,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 875 transitions. [2019-10-22 11:25:03,369 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 875 transitions. Word has length 54 [2019-10-22 11:25:03,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:03,370 INFO L462 AbstractCegarLoop]: Abstraction has 508 states and 875 transitions. [2019-10-22 11:25:03,370 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-22 11:25:03,370 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 875 transitions. [2019-10-22 11:25:03,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-22 11:25:03,371 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:03,371 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:25:03,371 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:25:03,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:03,372 INFO L82 PathProgramCache]: Analyzing trace with hash -315862889, now seen corresponding path program 1 times [2019-10-22 11:25:03,372 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:03,372 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740930122] [2019-10-22 11:25:03,372 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:03,372 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:03,373 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:03,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:03,468 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-22 11:25:03,469 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740930122] [2019-10-22 11:25:03,469 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:03,469 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:25:03,469 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997701020] [2019-10-22 11:25:03,470 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:25:03,470 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:03,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:25:03,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:25:03,470 INFO L87 Difference]: Start difference. First operand 508 states and 875 transitions. Second operand 5 states. [2019-10-22 11:25:03,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:03,623 INFO L93 Difference]: Finished difference Result 1139 states and 1926 transitions. [2019-10-22 11:25:03,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-22 11:25:03,624 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2019-10-22 11:25:03,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:03,627 INFO L225 Difference]: With dead ends: 1139 [2019-10-22 11:25:03,628 INFO L226 Difference]: Without dead ends: 1057 [2019-10-22 11:25:03,629 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-22 11:25:03,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1057 states. [2019-10-22 11:25:03,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1057 to 977. [2019-10-22 11:25:03,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 977 states. [2019-10-22 11:25:03,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 1699 transitions. [2019-10-22 11:25:03,697 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 1699 transitions. Word has length 55 [2019-10-22 11:25:03,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:03,697 INFO L462 AbstractCegarLoop]: Abstraction has 977 states and 1699 transitions. [2019-10-22 11:25:03,697 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:25:03,697 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 1699 transitions. [2019-10-22 11:25:03,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-22 11:25:03,699 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:03,699 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:25:03,700 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:25:03,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:03,700 INFO L82 PathProgramCache]: Analyzing trace with hash -547065452, now seen corresponding path program 1 times [2019-10-22 11:25:03,700 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:03,700 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137527184] [2019-10-22 11:25:03,701 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:03,701 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:03,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:03,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:03,783 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-22 11:25:03,783 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137527184] [2019-10-22 11:25:03,784 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:03,784 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 11:25:03,784 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744715170] [2019-10-22 11:25:03,784 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 11:25:03,785 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:03,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 11:25:03,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:25:03,785 INFO L87 Difference]: Start difference. First operand 977 states and 1699 transitions. Second operand 6 states. [2019-10-22 11:25:03,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:03,948 INFO L93 Difference]: Finished difference Result 1223 states and 2036 transitions. [2019-10-22 11:25:03,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 11:25:03,949 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-10-22 11:25:03,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:03,953 INFO L225 Difference]: With dead ends: 1223 [2019-10-22 11:25:03,953 INFO L226 Difference]: Without dead ends: 1053 [2019-10-22 11:25:03,953 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-10-22 11:25:03,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1053 states. [2019-10-22 11:25:03,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1053 to 969. [2019-10-22 11:25:03,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 969 states. [2019-10-22 11:25:04,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 969 states to 969 states and 1685 transitions. [2019-10-22 11:25:04,001 INFO L78 Accepts]: Start accepts. Automaton has 969 states and 1685 transitions. Word has length 55 [2019-10-22 11:25:04,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:04,002 INFO L462 AbstractCegarLoop]: Abstraction has 969 states and 1685 transitions. [2019-10-22 11:25:04,002 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 11:25:04,002 INFO L276 IsEmpty]: Start isEmpty. Operand 969 states and 1685 transitions. [2019-10-22 11:25:04,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-22 11:25:04,003 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:04,003 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:25:04,004 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:25:04,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:04,004 INFO L82 PathProgramCache]: Analyzing trace with hash -1660760208, now seen corresponding path program 1 times [2019-10-22 11:25:04,004 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:04,004 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644713518] [2019-10-22 11:25:04,004 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:04,004 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:04,005 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:04,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:04,090 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-22 11:25:04,090 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644713518] [2019-10-22 11:25:04,091 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:04,091 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-22 11:25:04,091 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791486667] [2019-10-22 11:25:04,091 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-22 11:25:04,091 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:04,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-22 11:25:04,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-22 11:25:04,092 INFO L87 Difference]: Start difference. First operand 969 states and 1685 transitions. Second operand 9 states. [2019-10-22 11:25:04,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:04,604 INFO L93 Difference]: Finished difference Result 1498 states and 2409 transitions. [2019-10-22 11:25:04,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-22 11:25:04,604 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 56 [2019-10-22 11:25:04,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:04,608 INFO L225 Difference]: With dead ends: 1498 [2019-10-22 11:25:04,609 INFO L226 Difference]: Without dead ends: 1340 [2019-10-22 11:25:04,609 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=189, Invalid=411, Unknown=0, NotChecked=0, Total=600 [2019-10-22 11:25:04,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1340 states. [2019-10-22 11:25:04,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1340 to 1048. [2019-10-22 11:25:04,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1048 states. [2019-10-22 11:25:04,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1048 states to 1048 states and 1795 transitions. [2019-10-22 11:25:04,672 INFO L78 Accepts]: Start accepts. Automaton has 1048 states and 1795 transitions. Word has length 56 [2019-10-22 11:25:04,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:04,672 INFO L462 AbstractCegarLoop]: Abstraction has 1048 states and 1795 transitions. [2019-10-22 11:25:04,672 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-22 11:25:04,673 INFO L276 IsEmpty]: Start isEmpty. Operand 1048 states and 1795 transitions. [2019-10-22 11:25:04,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-22 11:25:04,674 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:04,674 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:25:04,674 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:25:04,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:04,674 INFO L82 PathProgramCache]: Analyzing trace with hash 505798560, now seen corresponding path program 1 times [2019-10-22 11:25:04,675 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:04,675 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585848332] [2019-10-22 11:25:04,675 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:04,675 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:04,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:04,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:04,726 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-22 11:25:04,726 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585848332] [2019-10-22 11:25:04,726 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:04,726 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:25:04,727 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029703395] [2019-10-22 11:25:04,727 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:25:04,727 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:04,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:25:04,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:25:04,728 INFO L87 Difference]: Start difference. First operand 1048 states and 1795 transitions. Second operand 4 states. [2019-10-22 11:25:04,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:04,791 INFO L93 Difference]: Finished difference Result 1139 states and 1911 transitions. [2019-10-22 11:25:04,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:25:04,793 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-10-22 11:25:04,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:04,796 INFO L225 Difference]: With dead ends: 1139 [2019-10-22 11:25:04,796 INFO L226 Difference]: Without dead ends: 955 [2019-10-22 11:25:04,797 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:25:04,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states. [2019-10-22 11:25:04,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 920. [2019-10-22 11:25:04,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 920 states. [2019-10-22 11:25:04,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 920 states to 920 states and 1604 transitions. [2019-10-22 11:25:04,843 INFO L78 Accepts]: Start accepts. Automaton has 920 states and 1604 transitions. Word has length 57 [2019-10-22 11:25:04,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:04,843 INFO L462 AbstractCegarLoop]: Abstraction has 920 states and 1604 transitions. [2019-10-22 11:25:04,843 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:25:04,843 INFO L276 IsEmpty]: Start isEmpty. Operand 920 states and 1604 transitions. [2019-10-22 11:25:04,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-10-22 11:25:04,847 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:04,847 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:25:04,848 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:25:04,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:04,848 INFO L82 PathProgramCache]: Analyzing trace with hash 1737575739, now seen corresponding path program 1 times [2019-10-22 11:25:04,848 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:04,848 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050270994] [2019-10-22 11:25:04,848 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:04,849 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:04,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:04,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:04,894 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:25:04,894 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050270994] [2019-10-22 11:25:04,894 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:04,894 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:25:04,894 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901199985] [2019-10-22 11:25:04,895 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:25:04,895 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:04,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:25:04,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:25:04,898 INFO L87 Difference]: Start difference. First operand 920 states and 1604 transitions. Second operand 3 states. [2019-10-22 11:25:04,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:04,984 INFO L93 Difference]: Finished difference Result 2694 states and 4724 transitions. [2019-10-22 11:25:04,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:25:04,984 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2019-10-22 11:25:04,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:04,990 INFO L225 Difference]: With dead ends: 2694 [2019-10-22 11:25:04,990 INFO L226 Difference]: Without dead ends: 1805 [2019-10-22 11:25:04,992 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:25:04,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1805 states. [2019-10-22 11:25:05,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1805 to 1660. [2019-10-22 11:25:05,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1660 states. [2019-10-22 11:25:05,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1660 states to 1660 states and 2958 transitions. [2019-10-22 11:25:05,073 INFO L78 Accepts]: Start accepts. Automaton has 1660 states and 2958 transitions. Word has length 62 [2019-10-22 11:25:05,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:05,073 INFO L462 AbstractCegarLoop]: Abstraction has 1660 states and 2958 transitions. [2019-10-22 11:25:05,073 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:25:05,073 INFO L276 IsEmpty]: Start isEmpty. Operand 1660 states and 2958 transitions. [2019-10-22 11:25:05,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-10-22 11:25:05,075 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:05,076 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:25:05,076 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:25:05,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:05,076 INFO L82 PathProgramCache]: Analyzing trace with hash -661936822, now seen corresponding path program 1 times [2019-10-22 11:25:05,076 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:05,076 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444770128] [2019-10-22 11:25:05,076 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:05,077 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:05,077 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:05,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:05,117 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:25:05,117 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444770128] [2019-10-22 11:25:05,118 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:05,118 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:25:05,118 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883383211] [2019-10-22 11:25:05,118 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:25:05,118 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:05,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:25:05,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:25:05,119 INFO L87 Difference]: Start difference. First operand 1660 states and 2958 transitions. Second operand 3 states. [2019-10-22 11:25:05,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:05,270 INFO L93 Difference]: Finished difference Result 4878 states and 8722 transitions. [2019-10-22 11:25:05,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:25:05,271 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2019-10-22 11:25:05,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:05,320 INFO L225 Difference]: With dead ends: 4878 [2019-10-22 11:25:05,320 INFO L226 Difference]: Without dead ends: 3249 [2019-10-22 11:25:05,322 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:25:05,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3249 states. [2019-10-22 11:25:05,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3249 to 3104. [2019-10-22 11:25:05,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3104 states. [2019-10-22 11:25:05,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3104 states to 3104 states and 5598 transitions. [2019-10-22 11:25:05,450 INFO L78 Accepts]: Start accepts. Automaton has 3104 states and 5598 transitions. Word has length 63 [2019-10-22 11:25:05,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:05,450 INFO L462 AbstractCegarLoop]: Abstraction has 3104 states and 5598 transitions. [2019-10-22 11:25:05,450 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:25:05,450 INFO L276 IsEmpty]: Start isEmpty. Operand 3104 states and 5598 transitions. [2019-10-22 11:25:05,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-10-22 11:25:05,454 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:05,454 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:25:05,454 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:25:05,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:05,454 INFO L82 PathProgramCache]: Analyzing trace with hash 1211094141, now seen corresponding path program 1 times [2019-10-22 11:25:05,454 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:05,455 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294009962] [2019-10-22 11:25:05,455 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:05,455 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:05,455 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:05,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:05,498 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:25:05,499 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294009962] [2019-10-22 11:25:05,499 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:05,499 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:25:05,499 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375906459] [2019-10-22 11:25:05,500 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:25:05,500 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:05,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:25:05,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:25:05,500 INFO L87 Difference]: Start difference. First operand 3104 states and 5598 transitions. Second operand 3 states. [2019-10-22 11:25:05,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:05,684 INFO L93 Difference]: Finished difference Result 8754 states and 15802 transitions. [2019-10-22 11:25:05,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:25:05,685 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-10-22 11:25:05,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:05,702 INFO L225 Difference]: With dead ends: 8754 [2019-10-22 11:25:05,703 INFO L226 Difference]: Without dead ends: 5681 [2019-10-22 11:25:05,707 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:25:05,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5681 states. [2019-10-22 11:25:05,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5681 to 5536. [2019-10-22 11:25:05,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5536 states. [2019-10-22 11:25:05,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5536 states to 5536 states and 10030 transitions. [2019-10-22 11:25:05,905 INFO L78 Accepts]: Start accepts. Automaton has 5536 states and 10030 transitions. Word has length 64 [2019-10-22 11:25:05,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:05,905 INFO L462 AbstractCegarLoop]: Abstraction has 5536 states and 10030 transitions. [2019-10-22 11:25:05,905 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:25:05,905 INFO L276 IsEmpty]: Start isEmpty. Operand 5536 states and 10030 transitions. [2019-10-22 11:25:05,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-10-22 11:25:05,908 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:05,908 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:25:05,909 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:25:05,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:05,909 INFO L82 PathProgramCache]: Analyzing trace with hash -1922447845, now seen corresponding path program 1 times [2019-10-22 11:25:05,909 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:05,909 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397476669] [2019-10-22 11:25:05,909 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:05,909 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:05,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:05,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:05,947 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:25:05,947 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397476669] [2019-10-22 11:25:05,948 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:05,948 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:25:05,948 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234220134] [2019-10-22 11:25:05,948 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:25:05,948 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:05,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:25:05,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:25:05,949 INFO L87 Difference]: Start difference. First operand 5536 states and 10030 transitions. Second operand 3 states. [2019-10-22 11:25:06,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:06,272 INFO L93 Difference]: Finished difference Result 15554 states and 28186 transitions. [2019-10-22 11:25:06,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:25:06,273 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-10-22 11:25:06,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:06,304 INFO L225 Difference]: With dead ends: 15554 [2019-10-22 11:25:06,304 INFO L226 Difference]: Without dead ends: 10049 [2019-10-22 11:25:06,310 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:25:06,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10049 states. [2019-10-22 11:25:06,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10049 to 9904. [2019-10-22 11:25:06,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9904 states. [2019-10-22 11:25:06,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9904 states to 9904 states and 17966 transitions. [2019-10-22 11:25:06,666 INFO L78 Accepts]: Start accepts. Automaton has 9904 states and 17966 transitions. Word has length 65 [2019-10-22 11:25:06,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:06,666 INFO L462 AbstractCegarLoop]: Abstraction has 9904 states and 17966 transitions. [2019-10-22 11:25:06,667 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:25:06,667 INFO L276 IsEmpty]: Start isEmpty. Operand 9904 states and 17966 transitions. [2019-10-22 11:25:06,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-10-22 11:25:06,670 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:06,670 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:25:06,671 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:25:06,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:06,671 INFO L82 PathProgramCache]: Analyzing trace with hash -459560082, now seen corresponding path program 1 times [2019-10-22 11:25:06,671 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:06,671 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239649666] [2019-10-22 11:25:06,672 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:06,672 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:06,672 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:06,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:06,719 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-22 11:25:06,719 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239649666] [2019-10-22 11:25:06,719 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:06,719 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:25:06,720 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839602118] [2019-10-22 11:25:06,720 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:25:06,720 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:06,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:25:06,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:25:06,721 INFO L87 Difference]: Start difference. First operand 9904 states and 17966 transitions. Second operand 4 states. [2019-10-22 11:25:06,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:06,963 INFO L93 Difference]: Finished difference Result 9935 states and 18008 transitions. [2019-10-22 11:25:06,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:25:06,964 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-10-22 11:25:06,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:06,964 INFO L225 Difference]: With dead ends: 9935 [2019-10-22 11:25:06,964 INFO L226 Difference]: Without dead ends: 0 [2019-10-22 11:25:06,972 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:25:06,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-22 11:25:06,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-22 11:25:06,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-22 11:25:06,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-22 11:25:06,973 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 66 [2019-10-22 11:25:06,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:06,974 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 11:25:06,974 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:25:06,974 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-22 11:25:06,974 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-22 11:25:06,978 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-22 11:25:07,164 WARN L191 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 106 [2019-10-22 11:25:07,481 WARN L191 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 106 [2019-10-22 11:25:07,634 WARN L191 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 74 [2019-10-22 11:25:07,883 WARN L191 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 106 [2019-10-22 11:25:08,103 WARN L191 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 153 [2019-10-22 11:25:08,289 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 106 [2019-10-22 11:25:08,419 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 106 [2019-10-22 11:25:08,669 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 106 [2019-10-22 11:25:08,790 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 106 [2019-10-22 11:25:08,958 WARN L191 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 152 [2019-10-22 11:25:09,276 WARN L191 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 106 [2019-10-22 11:25:09,385 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 106 [2019-10-22 11:25:09,530 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 106 [2019-10-22 11:25:09,735 WARN L191 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 153 [2019-10-22 11:25:09,898 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 109 [2019-10-22 11:25:10,318 WARN L191 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 215 DAG size of output: 209 [2019-10-22 11:25:10,539 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 106 [2019-10-22 11:25:10,750 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 152 [2019-10-22 11:25:10,897 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 119 [2019-10-22 11:25:12,267 WARN L191 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 201 DAG size of output: 195 [2019-10-22 11:25:12,677 WARN L191 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 17 [2019-10-22 11:25:12,831 WARN L191 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 20 [2019-10-22 11:25:13,186 WARN L191 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 43 [2019-10-22 11:25:13,356 WARN L191 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 17 [2019-10-22 11:25:13,458 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 20 [2019-10-22 11:25:13,704 WARN L191 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 17 [2019-10-22 11:25:14,230 WARN L191 SmtUtils]: Spent 521.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 40 [2019-10-22 11:25:14,350 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 20 [2019-10-22 11:25:14,585 WARN L191 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 17 [2019-10-22 11:25:14,845 WARN L191 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 17 [2019-10-22 11:25:15,189 WARN L191 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 41 [2019-10-22 11:25:15,492 WARN L191 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 17 [2019-10-22 11:25:15,694 WARN L191 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 17 [2019-10-22 11:25:16,219 WARN L191 SmtUtils]: Spent 523.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 38 [2019-10-22 11:25:16,514 WARN L191 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 41 [2019-10-22 11:25:16,651 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 32 [2019-10-22 11:25:16,792 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 25 [2019-10-22 11:25:16,956 WARN L191 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 17 [2019-10-22 11:25:17,131 WARN L191 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 17 [2019-10-22 11:25:17,385 WARN L191 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 17 [2019-10-22 11:25:17,909 WARN L191 SmtUtils]: Spent 437.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 40 [2019-10-22 11:25:18,220 WARN L191 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 43 [2019-10-22 11:25:18,391 WARN L191 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 17 [2019-10-22 11:25:18,560 WARN L191 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 17 [2019-10-22 11:25:18,734 WARN L191 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 17 [2019-10-22 11:25:19,573 WARN L191 SmtUtils]: Spent 741.00 ms on a formula simplification. DAG size of input: 208 DAG size of output: 22 [2019-10-22 11:25:19,807 WARN L191 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 41 [2019-10-22 11:25:20,050 WARN L191 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 43 [2019-10-22 11:25:20,285 WARN L191 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 41 [2019-10-22 11:25:20,478 WARN L191 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 17 [2019-10-22 11:25:20,645 WARN L191 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 17 [2019-10-22 11:25:21,085 WARN L191 SmtUtils]: Spent 439.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 38 [2019-10-22 11:25:21,477 WARN L191 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 32 [2019-10-22 11:25:21,936 WARN L191 SmtUtils]: Spent 458.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 40 [2019-10-22 11:25:22,117 WARN L191 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 36 [2019-10-22 11:25:22,547 WARN L191 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 17 [2019-10-22 11:25:22,722 WARN L191 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 17 [2019-10-22 11:25:22,896 WARN L191 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 17 [2019-10-22 11:25:23,065 WARN L191 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 17 [2019-10-22 11:25:23,230 WARN L191 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 17 [2019-10-22 11:25:23,392 WARN L191 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 17 [2019-10-22 11:25:24,176 WARN L191 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 17 [2019-10-22 11:25:24,361 WARN L191 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 17 [2019-10-22 11:25:24,797 WARN L191 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 34 [2019-10-22 11:25:24,981 WARN L191 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 22 [2019-10-22 11:25:25,273 WARN L191 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 17 [2019-10-22 11:25:25,718 WARN L191 SmtUtils]: Spent 444.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 40 [2019-10-22 11:25:26,314 WARN L191 SmtUtils]: Spent 594.00 ms on a formula simplification. DAG size of input: 194 DAG size of output: 22 [2019-10-22 11:25:26,454 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 26 [2019-10-22 11:25:26,693 WARN L191 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 37 [2019-10-22 11:25:26,899 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 20 [2019-10-22 11:25:26,920 INFO L443 ceAbstractionStarter]: For program point L1357(lines 1357 1364) no Hoare annotation was computed. [2019-10-22 11:25:26,920 INFO L443 ceAbstractionStarter]: For program point L2282(lines 2282 2290) no Hoare annotation was computed. [2019-10-22 11:25:26,920 INFO L443 ceAbstractionStarter]: For program point L2282-2(lines 2282 2290) no Hoare annotation was computed. [2019-10-22 11:25:26,920 INFO L443 ceAbstractionStarter]: For program point L2282-4(lines 2282 2290) no Hoare annotation was computed. [2019-10-22 11:25:26,920 INFO L443 ceAbstractionStarter]: For program point L2282-6(lines 2282 2290) no Hoare annotation was computed. [2019-10-22 11:25:26,920 INFO L443 ceAbstractionStarter]: For program point L2282-8(lines 2282 2290) no Hoare annotation was computed. [2019-10-22 11:25:26,920 INFO L443 ceAbstractionStarter]: For program point L2282-10(lines 2282 2290) no Hoare annotation was computed. [2019-10-22 11:25:26,921 INFO L439 ceAbstractionStarter]: At program point L763(lines 744 765) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (not (= 1 ULTIMATE.start_setup_rjh_~rjh___0)) (= 0 ULTIMATE.start_test_~op1~0) (= ULTIMATE.start_setClientId_~handle 3) (not (= ~__ste_email_to0~0 1)) (= ~rjh~0 2)) [2019-10-22 11:25:26,921 INFO L443 ceAbstractionStarter]: For program point L1424(lines 1424 1431) no Hoare annotation was computed. [2019-10-22 11:25:26,921 INFO L443 ceAbstractionStarter]: For program point L1293(lines 1292 1459) no Hoare annotation was computed. [2019-10-22 11:25:26,921 INFO L443 ceAbstractionStarter]: For program point L1294(lines 1294 1298) no Hoare annotation was computed. [2019-10-22 11:25:26,921 INFO L443 ceAbstractionStarter]: For program point L2285(lines 2285 2289) no Hoare annotation was computed. [2019-10-22 11:25:26,921 INFO L443 ceAbstractionStarter]: For program point L2285-3(lines 2285 2289) no Hoare annotation was computed. [2019-10-22 11:25:26,921 INFO L439 ceAbstractionStarter]: At program point L2285-2(lines 1 2755) the Hoare annotation is: (and (not (= ~rjh~0 1)) (= ~__ste_client_forwardReceiver1~0 0) (not (= ~__ste_email_to0~0 1))) [2019-10-22 11:25:26,921 INFO L439 ceAbstractionStarter]: At program point L2285-5(lines 1 2755) the Hoare annotation is: (and (= ~__ste_client_forwardReceiver1~0 0) (= ~rjh~0 ULTIMATE.start_setClientId_~handle) (not (= ULTIMATE.start_setClientPrivateKey_~handle 1)) (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_rjh_~rjh___0) (not (= ~__ste_email_to0~0 1)) (= ~rjh~0 2)) [2019-10-22 11:25:26,921 INFO L443 ceAbstractionStarter]: For program point L2285-6(lines 2285 2289) no Hoare annotation was computed. [2019-10-22 11:25:26,921 INFO L443 ceAbstractionStarter]: For program point L2285-9(lines 2285 2289) no Hoare annotation was computed. [2019-10-22 11:25:26,921 INFO L439 ceAbstractionStarter]: At program point L2285-8(lines 1 2755) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (not (= 1 ULTIMATE.start_setup_rjh_~rjh___0)) (= ULTIMATE.start_setClientId_~handle 3) (not (= ULTIMATE.start_setClientPrivateKey_~handle 2)) (= ~__ste_client_forwardReceiver1~0 0) (not (= ULTIMATE.start_setClientPrivateKey_~handle 1)) (not (= ~__ste_email_to0~0 1)) (= ~rjh~0 2)) [2019-10-22 11:25:26,922 INFO L439 ceAbstractionStarter]: At program point L2285-11(lines 1 2755) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (not (= 1 ULTIMATE.start_setup_rjh_~rjh___0)) (= ULTIMATE.start_setClientId_~handle 3) (= 0 ULTIMATE.start_test_~op3~0) (not (= ~__ste_email_to0~0 1)) (= ~rjh~0 2)) [2019-10-22 11:25:26,922 INFO L443 ceAbstractionStarter]: For program point L2285-12(lines 2285 2289) no Hoare annotation was computed. [2019-10-22 11:25:26,922 INFO L443 ceAbstractionStarter]: For program point L2285-15(lines 2285 2289) no Hoare annotation was computed. [2019-10-22 11:25:26,922 INFO L439 ceAbstractionStarter]: At program point L2285-14(lines 846 855) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (not (= 1 ULTIMATE.start_setup_rjh_~rjh___0)) (= ULTIMATE.start_setClientId_~handle 3) (not (= ~__ste_email_to0~0 1)) (= ~rjh~0 2)) [2019-10-22 11:25:26,922 INFO L439 ceAbstractionStarter]: At program point L2285-17(lines 836 845) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (not (= 1 ULTIMATE.start_setup_rjh_~rjh___0)) (= ULTIMATE.start_setClientId_~handle 3) (not (= ~__ste_email_to0~0 1)) (= ~rjh~0 2)) [2019-10-22 11:25:26,922 INFO L439 ceAbstractionStarter]: At program point L2617-1(lines 2591 2634) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (not (= 1 ULTIMATE.start_setup_rjh_~rjh___0)) (= 0 ULTIMATE.start_test_~op1~0) (= ULTIMATE.start_setClientId_~handle 3) (not (= ~__ste_email_to0~0 1)) (= ~rjh~0 2)) [2019-10-22 11:25:26,922 INFO L443 ceAbstractionStarter]: For program point L2617(lines 2617 2629) no Hoare annotation was computed. [2019-10-22 11:25:26,922 INFO L439 ceAbstractionStarter]: At program point L2617-3(lines 1 2755) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (not (= 1 ULTIMATE.start_setup_rjh_~rjh___0)) (= ULTIMATE.start_setClientId_~handle 3) (= 0 ULTIMATE.start_test_~op4~0) (not (= ~__ste_email_to0~0 1)) (= ~rjh~0 2)) [2019-10-22 11:25:26,922 INFO L443 ceAbstractionStarter]: For program point L2617-2(lines 2617 2629) no Hoare annotation was computed. [2019-10-22 11:25:26,922 INFO L439 ceAbstractionStarter]: At program point L2617-5(lines 1 2755) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (not (= 1 ULTIMATE.start_setup_rjh_~rjh___0)) (= ULTIMATE.start_setClientId_~handle 3) (= 0 ULTIMATE.start_test_~op5~0) (not (= ~__ste_email_to0~0 1)) (= ~rjh~0 2)) [2019-10-22 11:25:26,922 INFO L443 ceAbstractionStarter]: For program point L2617-4(lines 2617 2629) no Hoare annotation was computed. [2019-10-22 11:25:26,922 INFO L439 ceAbstractionStarter]: At program point L2617-7(lines 1 2755) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (not (= 1 ULTIMATE.start_setup_rjh_~rjh___0)) (= ULTIMATE.start_setClientId_~handle 3) (not (= ~__ste_email_to0~0 1)) (= ~rjh~0 2)) [2019-10-22 11:25:26,922 INFO L443 ceAbstractionStarter]: For program point L2617-6(lines 2617 2629) no Hoare annotation was computed. [2019-10-22 11:25:26,922 INFO L443 ceAbstractionStarter]: For program point L2353-1(lines 2353 2363) no Hoare annotation was computed. [2019-10-22 11:25:26,923 INFO L439 ceAbstractionStarter]: At program point L2617-9(lines 1 2755) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (not (= 1 ULTIMATE.start_setup_rjh_~rjh___0)) (= ULTIMATE.start_setClientId_~handle 3) (not (= ~__ste_email_to0~0 1)) (= ~rjh~0 2)) [2019-10-22 11:25:26,923 INFO L443 ceAbstractionStarter]: For program point L2353(lines 2353 2363) no Hoare annotation was computed. [2019-10-22 11:25:26,923 INFO L443 ceAbstractionStarter]: For program point L2617-8(lines 2617 2629) no Hoare annotation was computed. [2019-10-22 11:25:26,923 INFO L443 ceAbstractionStarter]: For program point L2353-3(lines 2353 2363) no Hoare annotation was computed. [2019-10-22 11:25:26,923 INFO L443 ceAbstractionStarter]: For program point L2353-2(lines 2353 2363) no Hoare annotation was computed. [2019-10-22 11:25:26,923 INFO L443 ceAbstractionStarter]: For program point L2353-4(lines 2353 2363) no Hoare annotation was computed. [2019-10-22 11:25:26,923 INFO L443 ceAbstractionStarter]: For program point L2618(lines 2618 2626) no Hoare annotation was computed. [2019-10-22 11:25:26,923 INFO L443 ceAbstractionStarter]: For program point L2618-2(lines 2618 2626) no Hoare annotation was computed. [2019-10-22 11:25:26,923 INFO L443 ceAbstractionStarter]: For program point L2618-4(lines 2618 2626) no Hoare annotation was computed. [2019-10-22 11:25:26,923 INFO L443 ceAbstractionStarter]: For program point L2618-6(lines 2618 2626) no Hoare annotation was computed. [2019-10-22 11:25:26,923 INFO L443 ceAbstractionStarter]: For program point L2618-8(lines 2618 2626) no Hoare annotation was computed. [2019-10-22 11:25:26,923 INFO L443 ceAbstractionStarter]: For program point L2487(lines 2487 2533) no Hoare annotation was computed. [2019-10-22 11:25:26,923 INFO L443 ceAbstractionStarter]: For program point L175(lines 175 183) no Hoare annotation was computed. [2019-10-22 11:25:26,923 INFO L443 ceAbstractionStarter]: For program point L175-2(lines 175 183) no Hoare annotation was computed. [2019-10-22 11:25:26,923 INFO L443 ceAbstractionStarter]: For program point L175-4(lines 175 183) no Hoare annotation was computed. [2019-10-22 11:25:26,924 INFO L443 ceAbstractionStarter]: For program point L2488(lines 2488 2499) no Hoare annotation was computed. [2019-10-22 11:25:26,924 INFO L443 ceAbstractionStarter]: For program point L2621(lines 2621 2625) no Hoare annotation was computed. [2019-10-22 11:25:26,924 INFO L443 ceAbstractionStarter]: For program point L2621-3(lines 2621 2625) no Hoare annotation was computed. [2019-10-22 11:25:26,924 INFO L439 ceAbstractionStarter]: At program point L2423(lines 2376 2429) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (not (= 1 ULTIMATE.start_setup_rjh_~rjh___0)) (= 0 ULTIMATE.start_test_~op1~0) (= ULTIMATE.start_setClientId_~handle 3) (not (= ~__ste_email_to0~0 1)) (= ~rjh~0 2)) [2019-10-22 11:25:26,924 INFO L443 ceAbstractionStarter]: For program point L2621-6(lines 2621 2625) no Hoare annotation was computed. [2019-10-22 11:25:26,924 INFO L439 ceAbstractionStarter]: At program point L1366(lines 1353 1454) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (not (= 1 ULTIMATE.start_setup_rjh_~rjh___0)) (= ULTIMATE.start_setClientId_~handle 3) (not (= ~__ste_email_to0~0 1)) (= ~rjh~0 2)) [2019-10-22 11:25:26,924 INFO L443 ceAbstractionStarter]: For program point L2621-9(lines 2621 2625) no Hoare annotation was computed. [2019-10-22 11:25:26,924 INFO L443 ceAbstractionStarter]: For program point L1300(lines 1300 1458) no Hoare annotation was computed. [2019-10-22 11:25:26,924 INFO L443 ceAbstractionStarter]: For program point L2621-12(lines 2621 2625) no Hoare annotation was computed. [2019-10-22 11:25:26,924 INFO L439 ceAbstractionStarter]: At program point L1433(lines 1420 1449) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (not (= 1 ULTIMATE.start_setup_rjh_~rjh___0)) (= ULTIMATE.start_setClientId_~handle 3) (not (= ~__ste_email_to0~0 1)) (= ~rjh~0 2)) [2019-10-22 11:25:26,924 INFO L443 ceAbstractionStarter]: For program point L178(lines 178 182) no Hoare annotation was computed. [2019-10-22 11:25:26,925 INFO L439 ceAbstractionStarter]: At program point L178-2(lines 171 186) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (not (= 1 ULTIMATE.start_setup_rjh_~rjh___0)) (= ~__ste_email_to0~0 2) (= ULTIMATE.start_setClientId_~handle 3) (= 1 ULTIMATE.start_setEmailTo_~handle) (= 2 ULTIMATE.start_createEmail_~to) (= ULTIMATE.start_setEmailTo_~value 2) (= 1 ULTIMATE.start_createEmail_~msg~0) (= ~rjh~0 2)) [2019-10-22 11:25:26,925 INFO L443 ceAbstractionStarter]: For program point L178-3(lines 178 182) no Hoare annotation was computed. [2019-10-22 11:25:26,925 INFO L439 ceAbstractionStarter]: At program point L178-5(lines 171 186) the Hoare annotation is: (let ((.cse0 (= 1 ULTIMATE.start_outgoing_~msg)) (.cse1 (= 1 ULTIMATE.start_getEmailTo_~handle)) (.cse2 (= |ULTIMATE.start_createEmail_#res| 1)) (.cse4 (= 2 ULTIMATE.start_createEmail_~to)) (.cse3 (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (not (= 1 ULTIMATE.start_setup_rjh_~rjh___0)) (= ULTIMATE.start_setClientId_~handle 3))) (.cse6 (= 1 ULTIMATE.start_createEmail_~msg~0)) (.cse5 (= ~rjh~0 2))) (or (and (= 1 ULTIMATE.start_setEmailTo_~handle) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) .cse6) (and .cse0 (= ~__ste_email_to0~0 2) .cse1 (= 2 ULTIMATE.start_getClientForwardReceiver_~handle) (= 2 |ULTIMATE.start_getEmailTo_#res|) (= 2 ULTIMATE.start_incoming_~client) .cse2 .cse4 .cse3 .cse6 .cse5))) [2019-10-22 11:25:26,925 INFO L443 ceAbstractionStarter]: For program point L178-6(lines 178 182) no Hoare annotation was computed. [2019-10-22 11:25:26,925 INFO L439 ceAbstractionStarter]: At program point L178-8(lines 171 186) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (not (= 1 ULTIMATE.start_setup_rjh_~rjh___0)) (= ULTIMATE.start_setClientId_~handle 3) (= |ULTIMATE.start_createEmail_#res| 1) (= 2 ULTIMATE.start_createEmail_~to) (= 1 ULTIMATE.start_createEmail_~msg~0) (= ~rjh~0 2)) [2019-10-22 11:25:26,925 INFO L443 ceAbstractionStarter]: For program point L2690(lines 2690 2706) no Hoare annotation was computed. [2019-10-22 11:25:26,925 INFO L443 ceAbstractionStarter]: For program point L2690-1(lines 2690 2706) no Hoare annotation was computed. [2019-10-22 11:25:26,925 INFO L443 ceAbstractionStarter]: For program point L2492(lines 2492 2498) no Hoare annotation was computed. [2019-10-22 11:25:26,925 INFO L443 ceAbstractionStarter]: For program point L1304(lines 1304 1311) no Hoare annotation was computed. [2019-10-22 11:25:26,925 INFO L439 ceAbstractionStarter]: At program point L2362(lines 2342 2366) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (not (= 1 ULTIMATE.start_setup_rjh_~rjh___0)) (= 0 ULTIMATE.start_test_~op1~0) (= ULTIMATE.start_setClientId_~handle 3) (not (= ~__ste_email_to0~0 1)) (= ~rjh~0 2)) [2019-10-22 11:25:26,925 INFO L443 ceAbstractionStarter]: For program point L1371(lines 1371 1378) no Hoare annotation was computed. [2019-10-22 11:25:26,925 INFO L439 ceAbstractionStarter]: At program point L2362-2(lines 2342 2366) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (not (= 1 ULTIMATE.start_setup_rjh_~rjh___0)) (= ULTIMATE.start_setClientId_~handle 3) (= 0 ULTIMATE.start_test_~op5~0) (not (= ~__ste_email_to0~0 1)) (= ~rjh~0 2)) [2019-10-22 11:25:26,925 INFO L439 ceAbstractionStarter]: At program point L2362-1(lines 2342 2366) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (not (= 1 ULTIMATE.start_setup_rjh_~rjh___0)) (= ULTIMATE.start_setClientId_~handle 3) (= 0 ULTIMATE.start_test_~op4~0) (not (= ~__ste_email_to0~0 1)) (= ~rjh~0 2)) [2019-10-22 11:25:26,925 INFO L439 ceAbstractionStarter]: At program point L2362-4(lines 2342 2366) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (not (= 1 ULTIMATE.start_setup_rjh_~rjh___0)) (= ULTIMATE.start_setClientId_~handle 3) (not (= ~__ste_email_to0~0 1)) (= ~rjh~0 2)) [2019-10-22 11:25:26,926 INFO L439 ceAbstractionStarter]: At program point L2362-3(lines 2342 2366) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (not (= 1 ULTIMATE.start_setup_rjh_~rjh___0)) (= ULTIMATE.start_setClientId_~handle 3) (not (= ~__ste_email_to0~0 1)) (= ~rjh~0 2)) [2019-10-22 11:25:26,926 INFO L443 ceAbstractionStarter]: For program point L1438(lines 1438 1445) no Hoare annotation was computed. [2019-10-22 11:25:26,926 INFO L439 ceAbstractionStarter]: At program point L1438-1(lines 1292 1459) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (not (= 1 ULTIMATE.start_setup_rjh_~rjh___0)) (= ULTIMATE.start_setClientId_~handle 3) (not (= ~__ste_email_to0~0 1)) (= ~rjh~0 2)) [2019-10-22 11:25:26,926 INFO L443 ceAbstractionStarter]: For program point L2694(lines 2694 2705) no Hoare annotation was computed. [2019-10-22 11:25:26,926 INFO L443 ceAbstractionStarter]: For program point L2694-1(lines 2694 2705) no Hoare annotation was computed. [2019-10-22 11:25:26,926 INFO L443 ceAbstractionStarter]: For program point L119(lines 119 130) no Hoare annotation was computed. [2019-10-22 11:25:26,926 INFO L443 ceAbstractionStarter]: For program point L119-1(lines 119 130) no Hoare annotation was computed. [2019-10-22 11:25:26,926 INFO L443 ceAbstractionStarter]: For program point L2698(lines 2698 2704) no Hoare annotation was computed. [2019-10-22 11:25:26,926 INFO L443 ceAbstractionStarter]: For program point L2698-1(lines 2698 2704) no Hoare annotation was computed. [2019-10-22 11:25:26,926 INFO L443 ceAbstractionStarter]: For program point L2434(lines 2434 2470) no Hoare annotation was computed. [2019-10-22 11:25:26,926 INFO L443 ceAbstractionStarter]: For program point L2434-2(lines 2434 2470) no Hoare annotation was computed. [2019-10-22 11:25:26,926 INFO L443 ceAbstractionStarter]: For program point L2434-1(lines 2434 2470) no Hoare annotation was computed. [2019-10-22 11:25:26,926 INFO L443 ceAbstractionStarter]: For program point L2302(lines 2302 2318) no Hoare annotation was computed. [2019-10-22 11:25:26,926 INFO L443 ceAbstractionStarter]: For program point L2434-4(lines 2434 2470) no Hoare annotation was computed. [2019-10-22 11:25:26,926 INFO L443 ceAbstractionStarter]: For program point L2434-3(lines 2434 2470) no Hoare annotation was computed. [2019-10-22 11:25:26,926 INFO L443 ceAbstractionStarter]: For program point L2302-2(lines 2302 2318) no Hoare annotation was computed. [2019-10-22 11:25:26,926 INFO L443 ceAbstractionStarter]: For program point L2302-1(lines 2302 2318) no Hoare annotation was computed. [2019-10-22 11:25:26,926 INFO L443 ceAbstractionStarter]: For program point L2302-4(lines 2302 2318) no Hoare annotation was computed. [2019-10-22 11:25:26,926 INFO L443 ceAbstractionStarter]: For program point L2302-3(lines 2302 2318) no Hoare annotation was computed. [2019-10-22 11:25:26,926 INFO L443 ceAbstractionStarter]: For program point L2501(lines 2501 2532) no Hoare annotation was computed. [2019-10-22 11:25:26,926 INFO L443 ceAbstractionStarter]: For program point L2435(lines 2435 2443) no Hoare annotation was computed. [2019-10-22 11:25:26,926 INFO L443 ceAbstractionStarter]: For program point L2435-2(lines 2435 2443) no Hoare annotation was computed. [2019-10-22 11:25:26,927 INFO L443 ceAbstractionStarter]: For program point L2435-4(lines 2435 2443) no Hoare annotation was computed. [2019-10-22 11:25:26,927 INFO L443 ceAbstractionStarter]: For program point L2435-6(lines 2435 2443) no Hoare annotation was computed. [2019-10-22 11:25:26,927 INFO L443 ceAbstractionStarter]: For program point L123(lines 123 129) no Hoare annotation was computed. [2019-10-22 11:25:26,927 INFO L443 ceAbstractionStarter]: For program point L2435-8(lines 2435 2443) no Hoare annotation was computed. [2019-10-22 11:25:26,927 INFO L443 ceAbstractionStarter]: For program point L123-1(lines 123 129) no Hoare annotation was computed. [2019-10-22 11:25:26,927 INFO L443 ceAbstractionStarter]: For program point L2502(lines 2502 2513) no Hoare annotation was computed. [2019-10-22 11:25:26,927 INFO L439 ceAbstractionStarter]: At program point L1313(lines 1300 1458) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (not (= 1 ULTIMATE.start_setup_rjh_~rjh___0)) (= ULTIMATE.start_setClientId_~handle 3) (not (= ~__ste_email_to0~0 1)) (= ~rjh~0 2)) [2019-10-22 11:25:26,927 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-22 11:25:26,927 INFO L439 ceAbstractionStarter]: At program point L1380(lines 1367 1453) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (not (= 1 ULTIMATE.start_setup_rjh_~rjh___0)) (= ULTIMATE.start_setClientId_~handle 3) (not (= ~__ste_email_to0~0 1)) (= ~rjh~0 2)) [2019-10-22 11:25:26,927 INFO L439 ceAbstractionStarter]: At program point L720(lines 700 722) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (not (= 1 ULTIMATE.start_setup_rjh_~rjh___0)) (= ULTIMATE.start_setClientId_~handle 3) (not (= ULTIMATE.start_setClientPrivateKey_~handle 2)) (= ~__ste_client_forwardReceiver1~0 0) (not (= ULTIMATE.start_setClientPrivateKey_~handle 1)) (not (= ~__ste_email_to0~0 1)) (= ~rjh~0 2)) [2019-10-22 11:25:26,928 INFO L439 ceAbstractionStarter]: At program point L1513(lines 1 2755) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 1 ULTIMATE.start_getEmailTo_~handle) (= ULTIMATE.start_setClientId_~handle 3) (= 2 ULTIMATE.start_incoming_~client) (= 1 ULTIMATE.start_setEmailTo_~handle) (= ULTIMATE.start_setEmailTo_~value 2) (not (= 1 ULTIMATE.start_setup_rjh_~rjh___0)) (= 1 ULTIMATE.start_outgoing_~msg) (= ~__ste_email_to0~0 2) (= 2 |ULTIMATE.start_getEmailTo_#res|) (= |ULTIMATE.start_createEmail_#res| 1) (= 2 ULTIMATE.start_createEmail_~to) (= 1 ULTIMATE.start_createEmail_~msg~0) (= ~rjh~0 2)) [2019-10-22 11:25:26,928 INFO L439 ceAbstractionStarter]: At program point L1513-1(lines 1 2755) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (not (= 1 ULTIMATE.start_setup_rjh_~rjh___0)) (= ULTIMATE.start_setClientId_~handle 3) (= |ULTIMATE.start_createEmail_#res| 1) (= 2 ULTIMATE.start_createEmail_~to) (= 1 ULTIMATE.start_createEmail_~msg~0) (= ~rjh~0 2)) [2019-10-22 11:25:26,928 INFO L443 ceAbstractionStarter]: For program point L2438(lines 2438 2442) no Hoare annotation was computed. [2019-10-22 11:25:26,928 INFO L443 ceAbstractionStarter]: For program point L2306(lines 2306 2317) no Hoare annotation was computed. [2019-10-22 11:25:26,928 INFO L443 ceAbstractionStarter]: For program point L2438-3(lines 2438 2442) no Hoare annotation was computed. [2019-10-22 11:25:26,928 INFO L443 ceAbstractionStarter]: For program point L2306-2(lines 2306 2317) no Hoare annotation was computed. [2019-10-22 11:25:26,928 INFO L443 ceAbstractionStarter]: For program point L2438-6(lines 2438 2442) no Hoare annotation was computed. [2019-10-22 11:25:26,928 INFO L443 ceAbstractionStarter]: For program point L2306-1(lines 2306 2317) no Hoare annotation was computed. [2019-10-22 11:25:26,928 INFO L443 ceAbstractionStarter]: For program point L2306-4(lines 2306 2317) no Hoare annotation was computed. [2019-10-22 11:25:26,928 INFO L443 ceAbstractionStarter]: For program point L2306-3(lines 2306 2317) no Hoare annotation was computed. [2019-10-22 11:25:26,929 INFO L443 ceAbstractionStarter]: For program point L2438-9(lines 2438 2442) no Hoare annotation was computed. [2019-10-22 11:25:26,929 INFO L443 ceAbstractionStarter]: For program point L2438-12(lines 2438 2442) no Hoare annotation was computed. [2019-10-22 11:25:26,929 INFO L439 ceAbstractionStarter]: At program point L2703-1(lines 2686 2709) the Hoare annotation is: (let ((.cse0 (and (= |ULTIMATE.start_createEmail_#res| 1) (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (not (= 1 ULTIMATE.start_setup_rjh_~rjh___0)) (= ULTIMATE.start_setClientId_~handle 3)))) (.cse1 (= 2 ULTIMATE.start_createEmail_~to)) (.cse2 (= ~rjh~0 2)) (.cse3 (= 1 ULTIMATE.start_createEmail_~msg~0))) (or (and (and (and .cse0 .cse1 .cse2) (= 1 ULTIMATE.start_setEmailTo_~handle) .cse3) (= |ULTIMATE.start_isReadable_#res| 1) (= 1 ULTIMATE.start___utac_acc__DecryptForward_spec__1_~tmp~4)) (and (and (= ~__ste_email_to0~0 2) (= 2 ULTIMATE.start_getClientForwardReceiver_~handle) .cse0 (= 2 ULTIMATE.start_incoming_~client) .cse1 .cse2) .cse3))) [2019-10-22 11:25:26,929 INFO L439 ceAbstractionStarter]: At program point L2703(lines 2686 2709) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (not (= 1 ULTIMATE.start_setup_rjh_~rjh___0)) (= 1 ULTIMATE.start_outgoing_~msg) (= ~__ste_email_to0~0 2) (= ULTIMATE.start_setClientId_~handle 3) (= |ULTIMATE.start_createEmail_#res| 1) (= 1 ULTIMATE.start_setEmailTo_~handle) (= 2 ULTIMATE.start_createEmail_~to) (= ULTIMATE.start_setEmailTo_~value 2) (= 1 ULTIMATE.start_createEmail_~msg~0) (= ~rjh~0 2)) [2019-10-22 11:25:26,929 INFO L443 ceAbstractionStarter]: For program point L2506(lines 2506 2512) no Hoare annotation was computed. [2019-10-22 11:25:26,929 INFO L439 ceAbstractionStarter]: At program point L128(lines 115 133) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_isReadable_#res| 1)) (.cse1 (= 1 ULTIMATE.start_outgoing_~msg)) (.cse2 (= 1 ULTIMATE.start_getEmailTo_~handle)) (.cse3 (= |ULTIMATE.start_createEmail_#res| 1)) (.cse5 (= 2 ULTIMATE.start_createEmail_~to)) (.cse4 (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (not (= 1 ULTIMATE.start_setup_rjh_~rjh___0)) (= ULTIMATE.start_setClientId_~handle 3))) (.cse7 (= 1 ULTIMATE.start_createEmail_~msg~0)) (.cse6 (= ~rjh~0 2)) (.cse8 (= 1 ULTIMATE.start___utac_acc__DecryptForward_spec__1_~tmp~4))) (or (and .cse0 (and (= 1 ULTIMATE.start_setEmailTo_~handle) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) .cse7) .cse8) (and .cse0 (and .cse1 (= ~__ste_email_to0~0 2) .cse2 (= 2 ULTIMATE.start_getClientForwardReceiver_~handle) (= 2 |ULTIMATE.start_getEmailTo_#res|) (= 2 ULTIMATE.start_incoming_~client) .cse3 .cse5 .cse4 .cse7 .cse6) .cse8))) [2019-10-22 11:25:26,929 INFO L446 ceAbstractionStarter]: At program point L128-1(lines 115 133) the Hoare annotation is: true [2019-10-22 11:25:26,929 INFO L443 ceAbstractionStarter]: For program point L1318(lines 1318 1322) no Hoare annotation was computed. [2019-10-22 11:25:26,929 INFO L443 ceAbstractionStarter]: For program point L1385(lines 1385 1392) no Hoare annotation was computed. [2019-10-22 11:25:26,929 INFO L443 ceAbstractionStarter]: For program point L2310(lines 2310 2316) no Hoare annotation was computed. [2019-10-22 11:25:26,930 INFO L443 ceAbstractionStarter]: For program point L2310-2(lines 2310 2316) no Hoare annotation was computed. [2019-10-22 11:25:26,930 INFO L443 ceAbstractionStarter]: For program point L2310-1(lines 2310 2316) no Hoare annotation was computed. [2019-10-22 11:25:26,930 INFO L443 ceAbstractionStarter]: For program point L2310-4(lines 2310 2316) no Hoare annotation was computed. [2019-10-22 11:25:26,930 INFO L443 ceAbstractionStarter]: For program point L2310-3(lines 2310 2316) no Hoare annotation was computed. [2019-10-22 11:25:26,930 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-10-22 11:25:26,930 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 2735) no Hoare annotation was computed. [2019-10-22 11:25:26,930 INFO L443 ceAbstractionStarter]: For program point L2643-1(lines 2643 2659) no Hoare annotation was computed. [2019-10-22 11:25:26,930 INFO L443 ceAbstractionStarter]: For program point L2643(lines 2643 2659) no Hoare annotation was computed. [2019-10-22 11:25:26,930 INFO L443 ceAbstractionStarter]: For program point L2445-1(lines 2445 2469) no Hoare annotation was computed. [2019-10-22 11:25:26,930 INFO L443 ceAbstractionStarter]: For program point L2445(lines 2445 2469) no Hoare annotation was computed. [2019-10-22 11:25:26,930 INFO L443 ceAbstractionStarter]: For program point L2445-3(lines 2445 2469) no Hoare annotation was computed. [2019-10-22 11:25:26,930 INFO L443 ceAbstractionStarter]: For program point L2445-2(lines 2445 2469) no Hoare annotation was computed. [2019-10-22 11:25:26,931 INFO L443 ceAbstractionStarter]: For program point L2445-4(lines 2445 2469) no Hoare annotation was computed. [2019-10-22 11:25:26,931 INFO L439 ceAbstractionStarter]: At program point L530(lines 505 532) the Hoare annotation is: (let ((.cse6 (= |ULTIMATE.start_isReadable_#res| 1)) (.cse1 (= 1 ULTIMATE.start_outgoing_~msg)) (.cse3 (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (not (= 1 ULTIMATE.start_setup_rjh_~rjh___0)) (= ULTIMATE.start_setClientId_~handle 3))) (.cse2 (= |ULTIMATE.start_createEmail_#res| 1)) (.cse5 (= 1 ULTIMATE.start_createEmail_~msg~0)) (.cse0 (= 2 ULTIMATE.start_createEmail_~to)) (.cse4 (= ~rjh~0 2)) (.cse7 (= 1 ULTIMATE.start___utac_acc__DecryptForward_spec__1_~tmp~4))) (or (and (and (and .cse0 (and .cse1 .cse2 .cse3) .cse4) (= 1 ULTIMATE.start_setEmailTo_~handle) .cse5) .cse6 .cse7) (and .cse6 (and (= ~__ste_email_to0~0 2) (and .cse1 .cse3 .cse2 .cse5) (= 2 ULTIMATE.start_getClientForwardReceiver_~handle) (= 2 ULTIMATE.start_incoming_~client) .cse0 .cse4) .cse7))) [2019-10-22 11:25:26,931 INFO L446 ceAbstractionStarter]: At program point L530-1(lines 505 532) the Hoare annotation is: true [2019-10-22 11:25:26,931 INFO L443 ceAbstractionStarter]: For program point L2446(lines 2446 2454) no Hoare annotation was computed. [2019-10-22 11:25:26,931 INFO L443 ceAbstractionStarter]: For program point L2380(lines 2380 2426) no Hoare annotation was computed. [2019-10-22 11:25:26,931 INFO L443 ceAbstractionStarter]: For program point L2446-2(lines 2446 2454) no Hoare annotation was computed. [2019-10-22 11:25:26,932 INFO L443 ceAbstractionStarter]: For program point L2446-4(lines 2446 2454) no Hoare annotation was computed. [2019-10-22 11:25:26,932 INFO L443 ceAbstractionStarter]: For program point L2446-6(lines 2446 2454) no Hoare annotation was computed. [2019-10-22 11:25:26,932 INFO L443 ceAbstractionStarter]: For program point L2446-8(lines 2446 2454) no Hoare annotation was computed. [2019-10-22 11:25:26,932 INFO L443 ceAbstractionStarter]: For program point L2381(lines 2381 2392) no Hoare annotation was computed. [2019-10-22 11:25:26,932 INFO L439 ceAbstractionStarter]: At program point L1324(lines 1314 1457) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (not (= 1 ULTIMATE.start_setup_rjh_~rjh___0)) (= ULTIMATE.start_setClientId_~handle 3) (not (= ~__ste_email_to0~0 1)) (= ~rjh~0 2)) [2019-10-22 11:25:26,932 INFO L439 ceAbstractionStarter]: At program point L2315-1(lines 2298 2321) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (not (= 1 ULTIMATE.start_setup_rjh_~rjh___0)) (= ULTIMATE.start_setClientId_~handle 3) (= 0 ULTIMATE.start_test_~op4~0) (not (= ~__ste_email_to0~0 1)) (= ~rjh~0 2)) [2019-10-22 11:25:26,933 INFO L439 ceAbstractionStarter]: At program point L2315(lines 2298 2321) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (not (= 1 ULTIMATE.start_setup_rjh_~rjh___0)) (= 0 ULTIMATE.start_test_~op1~0) (= ULTIMATE.start_setClientId_~handle 3) (not (= ~__ste_email_to0~0 1)) (= ~rjh~0 2)) [2019-10-22 11:25:26,933 INFO L439 ceAbstractionStarter]: At program point L2315-3(lines 2298 2321) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (not (= 1 ULTIMATE.start_setup_rjh_~rjh___0)) (= ULTIMATE.start_setClientId_~handle 3) (not (= ~__ste_email_to0~0 1)) (= ~rjh~0 2)) [2019-10-22 11:25:26,933 INFO L439 ceAbstractionStarter]: At program point L2315-2(lines 2298 2321) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (not (= 1 ULTIMATE.start_setup_rjh_~rjh___0)) (= ULTIMATE.start_setClientId_~handle 3) (= 0 ULTIMATE.start_test_~op5~0) (not (= ~__ste_email_to0~0 1)) (= ~rjh~0 2)) [2019-10-22 11:25:26,933 INFO L439 ceAbstractionStarter]: At program point L2315-4(lines 2298 2321) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (not (= 1 ULTIMATE.start_setup_rjh_~rjh___0)) (= ULTIMATE.start_setClientId_~handle 3) (not (= ~__ste_email_to0~0 1)) (= ~rjh~0 2)) [2019-10-22 11:25:26,933 INFO L443 ceAbstractionStarter]: For program point L2647-1(lines 2647 2658) no Hoare annotation was computed. [2019-10-22 11:25:26,933 INFO L443 ceAbstractionStarter]: For program point L2647(lines 2647 2658) no Hoare annotation was computed. [2019-10-22 11:25:26,933 INFO L439 ceAbstractionStarter]: At program point L1590(lines 1585 1593) the Hoare annotation is: (let ((.cse4 (= 2 ULTIMATE.start_createEmail_~to)) (.cse0 (= 1 ULTIMATE.start_outgoing_~msg)) (.cse1 (= |ULTIMATE.start_createEmail_#res| 1)) (.cse2 (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (not (= 1 ULTIMATE.start_setup_rjh_~rjh___0)) (= ULTIMATE.start_setClientId_~handle 3))) (.cse5 (= ~rjh~0 2)) (.cse3 (= 1 ULTIMATE.start_createEmail_~msg~0))) (or (and (= ~__ste_email_to0~0 2) (= 2 ULTIMATE.start_getClientForwardReceiver_~handle) (= 2 ULTIMATE.start_incoming_~client) (and .cse0 .cse1 .cse2 .cse3) .cse4 .cse5) (and (and (and .cse4 (and .cse0 .cse1 .cse2) .cse5) (= 1 ULTIMATE.start_setEmailTo_~handle) .cse3) (= |ULTIMATE.start_isReadable_#res| 1) (= 1 ULTIMATE.start___utac_acc__DecryptForward_spec__1_~tmp~4)))) [2019-10-22 11:25:26,933 INFO L443 ceAbstractionStarter]: For program point L2515(lines 2515 2531) no Hoare annotation was computed. [2019-10-22 11:25:26,933 INFO L443 ceAbstractionStarter]: For program point L2449(lines 2449 2453) no Hoare annotation was computed. [2019-10-22 11:25:26,934 INFO L443 ceAbstractionStarter]: For program point L2449-3(lines 2449 2453) no Hoare annotation was computed. [2019-10-22 11:25:26,934 INFO L443 ceAbstractionStarter]: For program point L2449-6(lines 2449 2453) no Hoare annotation was computed. [2019-10-22 11:25:26,934 INFO L443 ceAbstractionStarter]: For program point L2449-9(lines 2449 2453) no Hoare annotation was computed. [2019-10-22 11:25:26,934 INFO L443 ceAbstractionStarter]: For program point L2449-12(lines 2449 2453) no Hoare annotation was computed. [2019-10-22 11:25:26,934 INFO L443 ceAbstractionStarter]: For program point L2714(lines 2714 2726) no Hoare annotation was computed. [2019-10-22 11:25:26,934 INFO L443 ceAbstractionStarter]: For program point L2714-2(lines 2714 2726) no Hoare annotation was computed. [2019-10-22 11:25:26,934 INFO L443 ceAbstractionStarter]: For program point L2714-4(lines 2714 2726) no Hoare annotation was computed. [2019-10-22 11:25:26,934 INFO L443 ceAbstractionStarter]: For program point L2516(lines 2516 2527) no Hoare annotation was computed. [2019-10-22 11:25:26,934 INFO L443 ceAbstractionStarter]: For program point L138(lines 138 146) no Hoare annotation was computed. [2019-10-22 11:25:26,934 INFO L443 ceAbstractionStarter]: For program point L138-2(lines 138 146) no Hoare annotation was computed. [2019-10-22 11:25:26,934 INFO L443 ceAbstractionStarter]: For program point L138-4(lines 138 146) no Hoare annotation was computed. [2019-10-22 11:25:26,934 INFO L443 ceAbstractionStarter]: For program point L733(lines 733 740) no Hoare annotation was computed. [2019-10-22 11:25:26,934 INFO L446 ceAbstractionStarter]: At program point L733-1(lines 733 740) the Hoare annotation is: true [2019-10-22 11:25:26,935 INFO L439 ceAbstractionStarter]: At program point L1460(lines 1291 1461) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (not (= 1 ULTIMATE.start_setup_rjh_~rjh___0)) (= ULTIMATE.start_setClientId_~handle 3) (not (= ~__ste_email_to0~0 1)) (= ~rjh~0 2)) [2019-10-22 11:25:26,935 INFO L439 ceAbstractionStarter]: At program point L1394(lines 1381 1452) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (not (= 1 ULTIMATE.start_setup_rjh_~rjh___0)) (= ULTIMATE.start_setClientId_~handle 3) (not (= ~__ste_email_to0~0 1)) (= ~rjh~0 2)) [2019-10-22 11:25:26,935 INFO L443 ceAbstractionStarter]: For program point L2385(lines 2385 2391) no Hoare annotation was computed. [2019-10-22 11:25:26,935 INFO L443 ceAbstractionStarter]: For program point L1329(lines 1329 1336) no Hoare annotation was computed. [2019-10-22 11:25:26,935 INFO L443 ceAbstractionStarter]: For program point L2717(lines 2717 2725) no Hoare annotation was computed. [2019-10-22 11:25:26,936 INFO L443 ceAbstractionStarter]: For program point L2651-1(lines 2651 2657) no Hoare annotation was computed. [2019-10-22 11:25:26,936 INFO L443 ceAbstractionStarter]: For program point L2717-2(lines 2717 2725) no Hoare annotation was computed. [2019-10-22 11:25:26,936 INFO L443 ceAbstractionStarter]: For program point L2651(lines 2651 2657) no Hoare annotation was computed. [2019-10-22 11:25:26,936 INFO L443 ceAbstractionStarter]: For program point L2717-4(lines 2717 2725) no Hoare annotation was computed. [2019-10-22 11:25:26,936 INFO L443 ceAbstractionStarter]: For program point L141(lines 141 145) no Hoare annotation was computed. [2019-10-22 11:25:26,936 INFO L439 ceAbstractionStarter]: At program point L141-2(lines 134 149) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (not (= 1 ULTIMATE.start_setup_rjh_~rjh___0)) (= ULTIMATE.start_setClientId_~handle 3) (= 2 ULTIMATE.start_createEmail_~to) (not (= ~__ste_email_to0~0 1)) (= 1 ULTIMATE.start_createEmail_~msg~0) (= ~rjh~0 2)) [2019-10-22 11:25:26,936 INFO L443 ceAbstractionStarter]: For program point L141-3(lines 141 145) no Hoare annotation was computed. [2019-10-22 11:25:26,936 INFO L439 ceAbstractionStarter]: At program point L141-5(lines 134 149) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (not (= 1 ULTIMATE.start_setup_rjh_~rjh___0)) (= 1 ULTIMATE.start_outgoing_~msg) (= ~__ste_email_to0~0 2) (= ULTIMATE.start_setClientId_~handle 3) (= |ULTIMATE.start_createEmail_#res| 1) (= 1 ULTIMATE.start_setEmailTo_~handle) (= 2 ULTIMATE.start_createEmail_~to) (= ULTIMATE.start_setEmailTo_~value 2) (= 1 ULTIMATE.start_createEmail_~msg~0) (= ~rjh~0 2)) [2019-10-22 11:25:26,937 INFO L443 ceAbstractionStarter]: For program point L141-6(lines 141 145) no Hoare annotation was computed. [2019-10-22 11:25:26,937 INFO L439 ceAbstractionStarter]: At program point L141-8(lines 134 149) the Hoare annotation is: (let ((.cse0 (and (= |ULTIMATE.start_createEmail_#res| 1) (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (not (= 1 ULTIMATE.start_setup_rjh_~rjh___0)) (= ULTIMATE.start_setClientId_~handle 3)))) (.cse1 (= 2 ULTIMATE.start_createEmail_~to)) (.cse2 (= ~rjh~0 2)) (.cse3 (= 1 ULTIMATE.start_createEmail_~msg~0))) (or (and (and (and .cse0 .cse1 .cse2) (= 1 ULTIMATE.start_setEmailTo_~handle) .cse3) (= |ULTIMATE.start_isReadable_#res| 1) (= 1 ULTIMATE.start___utac_acc__DecryptForward_spec__1_~tmp~4)) (and (and (= ~__ste_email_to0~0 2) (= 2 ULTIMATE.start_getClientForwardReceiver_~handle) .cse0 (= 2 ULTIMATE.start_incoming_~client) .cse1 .cse2) .cse3))) [2019-10-22 11:25:26,937 INFO L439 ceAbstractionStarter]: At program point L538(lines 533 541) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_isReadable_#res| 1)) (.cse1 (= 1 ULTIMATE.start_outgoing_~msg)) (.cse2 (= 1 ULTIMATE.start_getEmailTo_~handle)) (.cse3 (= |ULTIMATE.start_createEmail_#res| 1)) (.cse5 (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (not (= 1 ULTIMATE.start_setup_rjh_~rjh___0)) (= ULTIMATE.start_setClientId_~handle 3))) (.cse4 (= 2 ULTIMATE.start_createEmail_~to)) (.cse7 (= ~rjh~0 2)) (.cse6 (= 1 ULTIMATE.start_createEmail_~msg~0))) (or (and .cse0 (and .cse1 (= ~__ste_email_to0~0 2) .cse2 (= 2 ULTIMATE.start_getClientForwardReceiver_~handle) (= 2 |ULTIMATE.start_getEmailTo_#res|) (= 2 ULTIMATE.start_incoming_~client) .cse3 .cse4 .cse5 .cse6 .cse7)) (and .cse0 (and (= 1 ULTIMATE.start_setEmailTo_~handle) (and .cse1 .cse2 .cse3 .cse5 .cse4 .cse7) .cse6)))) [2019-10-22 11:25:26,937 INFO L443 ceAbstractionStarter]: For program point L2520(lines 2520 2526) no Hoare annotation was computed. [2019-10-22 11:25:26,937 INFO L439 ceAbstractionStarter]: At program point L538-1(lines 533 541) the Hoare annotation is: (let ((.cse6 (= |ULTIMATE.start_isReadable_#res| 1)) (.cse1 (= 1 ULTIMATE.start_outgoing_~msg)) (.cse3 (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (not (= 1 ULTIMATE.start_setup_rjh_~rjh___0)) (= ULTIMATE.start_setClientId_~handle 3))) (.cse2 (= |ULTIMATE.start_createEmail_#res| 1)) (.cse5 (= 1 ULTIMATE.start_createEmail_~msg~0)) (.cse0 (= 2 ULTIMATE.start_createEmail_~to)) (.cse4 (= ~rjh~0 2)) (.cse7 (= 1 ULTIMATE.start___utac_acc__DecryptForward_spec__1_~tmp~4))) (or (and (and (and .cse0 (and .cse1 .cse2 .cse3) .cse4) (= 1 ULTIMATE.start_setEmailTo_~handle) .cse5) .cse6 .cse7) (and .cse6 (and (= ~__ste_email_to0~0 2) (and .cse1 .cse3 .cse2 .cse5) (= 2 ULTIMATE.start_getClientForwardReceiver_~handle) (= 2 ULTIMATE.start_incoming_~client) .cse0 .cse4) .cse7))) [2019-10-22 11:25:26,937 INFO L439 ceAbstractionStarter]: At program point L538-2(lines 533 541) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (not (= 1 ULTIMATE.start_setup_rjh_~rjh___0)) (= ULTIMATE.start_setClientId_~handle 3) (= |ULTIMATE.start_createEmail_#res| 1) (= |ULTIMATE.start_isReadable_#res| 1) (= 2 ULTIMATE.start_createEmail_~to) (= 1 ULTIMATE.start_createEmail_~msg~0) (= ~rjh~0 2)) [2019-10-22 11:25:26,937 INFO L446 ceAbstractionStarter]: At program point L538-3(lines 533 541) the Hoare annotation is: true [2019-10-22 11:25:26,937 INFO L443 ceAbstractionStarter]: For program point L2720(lines 2720 2724) no Hoare annotation was computed. [2019-10-22 11:25:26,938 INFO L439 ceAbstractionStarter]: At program point L2720-2(lines 1 2755) the Hoare annotation is: (and (not (= ~rjh~0 1)) (= ~__ste_client_forwardReceiver1~0 0) (not (= ~__ste_email_to0~0 1))) [2019-10-22 11:25:26,938 INFO L443 ceAbstractionStarter]: For program point L2720-3(lines 2720 2724) no Hoare annotation was computed. [2019-10-22 11:25:26,938 INFO L443 ceAbstractionStarter]: For program point L2720-6(lines 2720 2724) no Hoare annotation was computed. [2019-10-22 11:25:26,938 INFO L439 ceAbstractionStarter]: At program point L2720-5(lines 1 2755) the Hoare annotation is: (and (= ~__ste_client_forwardReceiver1~0 0) (= ~rjh~0 ULTIMATE.start_setClientId_~handle) (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_rjh_~rjh___0) (not (= ~__ste_email_to0~0 1)) (= ~rjh~0 2)) [2019-10-22 11:25:26,938 INFO L439 ceAbstractionStarter]: At program point L2720-8(lines 1 2755) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (not (= 1 ULTIMATE.start_setup_rjh_~rjh___0)) (= ULTIMATE.start_setClientId_~handle 3) (= ~__ste_client_forwardReceiver1~0 0) (not (= ULTIMATE.start_setClientPrivateKey_~handle 1)) (not (= ~__ste_email_to0~0 1)) (= ~rjh~0 2)) [2019-10-22 11:25:26,938 INFO L443 ceAbstractionStarter]: For program point L2456(lines 2456 2468) no Hoare annotation was computed. [2019-10-22 11:25:26,938 INFO L443 ceAbstractionStarter]: For program point L2456-2(lines 2456 2468) no Hoare annotation was computed. [2019-10-22 11:25:26,938 INFO L443 ceAbstractionStarter]: For program point L1399(lines 1399 1403) no Hoare annotation was computed. [2019-10-22 11:25:26,938 INFO L439 ceAbstractionStarter]: At program point L2456-1(lines 2430 2473) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (not (= 1 ULTIMATE.start_setup_rjh_~rjh___0)) (= 0 ULTIMATE.start_test_~op1~0) (= ULTIMATE.start_setClientId_~handle 3) (not (= ~__ste_email_to0~0 1)) (= ~rjh~0 2)) [2019-10-22 11:25:26,938 INFO L443 ceAbstractionStarter]: For program point L2456-4(lines 2456 2468) no Hoare annotation was computed. [2019-10-22 11:25:26,939 INFO L439 ceAbstractionStarter]: At program point L2456-3(lines 2430 2473) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (not (= 1 ULTIMATE.start_setup_rjh_~rjh___0)) (= ULTIMATE.start_setClientId_~handle 3) (= 0 ULTIMATE.start_test_~op4~0) (not (= ~__ste_email_to0~0 1)) (= ~rjh~0 2)) [2019-10-22 11:25:26,939 INFO L443 ceAbstractionStarter]: For program point L2456-6(lines 2456 2468) no Hoare annotation was computed. [2019-10-22 11:25:26,939 INFO L439 ceAbstractionStarter]: At program point L2456-5(lines 2430 2473) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (not (= 1 ULTIMATE.start_setup_rjh_~rjh___0)) (= ULTIMATE.start_setClientId_~handle 3) (= 0 ULTIMATE.start_test_~op5~0) (not (= ~__ste_email_to0~0 1)) (= ~rjh~0 2)) [2019-10-22 11:25:26,939 INFO L443 ceAbstractionStarter]: For program point L2456-8(lines 2456 2468) no Hoare annotation was computed. [2019-10-22 11:25:26,939 INFO L439 ceAbstractionStarter]: At program point L2456-7(lines 2430 2473) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (not (= 1 ULTIMATE.start_setup_rjh_~rjh___0)) (= ULTIMATE.start_setClientId_~handle 3) (not (= ~__ste_email_to0~0 1)) (= ~rjh~0 2)) [2019-10-22 11:25:26,940 INFO L439 ceAbstractionStarter]: At program point L2456-9(lines 2430 2473) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (not (= 1 ULTIMATE.start_setup_rjh_~rjh___0)) (= ULTIMATE.start_setClientId_~handle 3) (not (= ~__ste_email_to0~0 1)) (= ~rjh~0 2)) [2019-10-22 11:25:26,940 INFO L443 ceAbstractionStarter]: For program point L2457(lines 2457 2465) no Hoare annotation was computed. [2019-10-22 11:25:26,940 INFO L443 ceAbstractionStarter]: For program point L2457-2(lines 2457 2465) no Hoare annotation was computed. [2019-10-22 11:25:26,940 INFO L443 ceAbstractionStarter]: For program point L2457-4(lines 2457 2465) no Hoare annotation was computed. [2019-10-22 11:25:26,940 INFO L443 ceAbstractionStarter]: For program point L2457-6(lines 2457 2465) no Hoare annotation was computed. [2019-10-22 11:25:26,940 INFO L443 ceAbstractionStarter]: For program point L2457-8(lines 2457 2465) no Hoare annotation was computed. [2019-10-22 11:25:26,940 INFO L439 ceAbstractionStarter]: At program point L2656(lines 2639 2662) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 1 ULTIMATE.start_getEmailTo_~handle) (= ULTIMATE.start_setClientId_~handle 3) (= 2 ULTIMATE.start_incoming_~client) (= 1 ULTIMATE.start_setEmailTo_~handle) (= ULTIMATE.start_setEmailTo_~value 2) (= 1 ULTIMATE.start_outgoing_~msg) (not (= 1 ULTIMATE.start_setup_rjh_~rjh___0)) (= ~__ste_email_to0~0 2) (= 2 ULTIMATE.start_getClientForwardReceiver_~handle) (= 2 |ULTIMATE.start_getEmailTo_#res|) (= |ULTIMATE.start_createEmail_#res| 1) (= 2 ULTIMATE.start_createEmail_~to) (= 1 ULTIMATE.start_createEmail_~msg~0) (= ~rjh~0 2)) [2019-10-22 11:25:26,941 INFO L439 ceAbstractionStarter]: At program point L1599(lines 1594 1602) the Hoare annotation is: (let ((.cse4 (= 2 ULTIMATE.start_createEmail_~to)) (.cse0 (= 1 ULTIMATE.start_outgoing_~msg)) (.cse1 (= |ULTIMATE.start_createEmail_#res| 1)) (.cse2 (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (not (= 1 ULTIMATE.start_setup_rjh_~rjh___0)) (= ULTIMATE.start_setClientId_~handle 3))) (.cse5 (= ~rjh~0 2)) (.cse3 (= 1 ULTIMATE.start_createEmail_~msg~0))) (or (and (= ~__ste_email_to0~0 2) (= 2 ULTIMATE.start_getClientForwardReceiver_~handle) (= 2 ULTIMATE.start_incoming_~client) (and .cse0 .cse1 .cse2 .cse3) .cse4 .cse5) (and (and (and .cse4 (and .cse0 .cse1 .cse2) .cse5) (= 1 ULTIMATE.start_setEmailTo_~handle) .cse3) (= |ULTIMATE.start_isReadable_#res| 1) (= 1 ULTIMATE.start___utac_acc__DecryptForward_spec__1_~tmp~4)))) [2019-10-22 11:25:26,941 INFO L439 ceAbstractionStarter]: At program point L2656-1(lines 2639 2662) the Hoare annotation is: (let ((.cse0 (and (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (not (= 1 ULTIMATE.start_setup_rjh_~rjh___0)) (= ULTIMATE.start_setClientId_~handle 3)) (not (= ~rjh~0 1)) (not (= 1 ULTIMATE.start_createEmail_~to))))) (or (and (and (= 2 ULTIMATE.start_createEmail_~to) (and .cse0 (= |ULTIMATE.start_createEmail_#res| 1)) (= ~rjh~0 2)) (= 1 ULTIMATE.start_createEmail_~msg~0)) (and (= |ULTIMATE.start_getClientForwardReceiver_#res| 0) .cse0))) [2019-10-22 11:25:26,941 INFO L443 ceAbstractionStarter]: For program point L2326(lines 2326 2338) no Hoare annotation was computed. [2019-10-22 11:25:26,941 INFO L443 ceAbstractionStarter]: For program point L2326-2(lines 2326 2338) no Hoare annotation was computed. [2019-10-22 11:25:26,941 INFO L443 ceAbstractionStarter]: For program point L2326-4(lines 2326 2338) no Hoare annotation was computed. [2019-10-22 11:25:26,941 INFO L443 ceAbstractionStarter]: For program point L2326-6(lines 2326 2338) no Hoare annotation was computed. [2019-10-22 11:25:26,941 INFO L443 ceAbstractionStarter]: For program point L2326-8(lines 2326 2338) no Hoare annotation was computed. [2019-10-22 11:25:26,941 INFO L446 ceAbstractionStarter]: At program point L741(lines 723 743) the Hoare annotation is: true [2019-10-22 11:25:26,941 INFO L443 ceAbstractionStarter]: For program point L2460(lines 2460 2464) no Hoare annotation was computed. [2019-10-22 11:25:26,941 INFO L443 ceAbstractionStarter]: For program point L2394(lines 2394 2425) no Hoare annotation was computed. [2019-10-22 11:25:26,942 INFO L443 ceAbstractionStarter]: For program point L2460-3(lines 2460 2464) no Hoare annotation was computed. [2019-10-22 11:25:26,942 INFO L443 ceAbstractionStarter]: For program point L2460-6(lines 2460 2464) no Hoare annotation was computed. [2019-10-22 11:25:26,942 INFO L443 ceAbstractionStarter]: For program point L2460-9(lines 2460 2464) no Hoare annotation was computed. [2019-10-22 11:25:26,942 INFO L443 ceAbstractionStarter]: For program point L82(lines 82 93) no Hoare annotation was computed. [2019-10-22 11:25:26,942 INFO L443 ceAbstractionStarter]: For program point L2460-12(lines 2460 2464) no Hoare annotation was computed. [2019-10-22 11:25:26,942 INFO L443 ceAbstractionStarter]: For program point L82-1(lines 82 93) no Hoare annotation was computed. [2019-10-22 11:25:26,942 INFO L443 ceAbstractionStarter]: For program point L677(lines 677 685) no Hoare annotation was computed. [2019-10-22 11:25:26,942 INFO L443 ceAbstractionStarter]: For program point L1536(lines 1536 1543) no Hoare annotation was computed. [2019-10-22 11:25:26,942 INFO L439 ceAbstractionStarter]: At program point L1536-1(lines 1 2755) the Hoare annotation is: (let ((.cse4 (= 2 ULTIMATE.start_createEmail_~to)) (.cse0 (= 1 ULTIMATE.start_outgoing_~msg)) (.cse1 (= |ULTIMATE.start_createEmail_#res| 1)) (.cse2 (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (not (= 1 ULTIMATE.start_setup_rjh_~rjh___0)) (= ULTIMATE.start_setClientId_~handle 3))) (.cse5 (= ~rjh~0 2)) (.cse3 (= 1 ULTIMATE.start_createEmail_~msg~0))) (or (and (= ~__ste_email_to0~0 2) (= 2 ULTIMATE.start_getClientForwardReceiver_~handle) (= 2 ULTIMATE.start_incoming_~client) (and .cse0 .cse1 .cse2 .cse3) .cse4 .cse5) (and (and (and .cse4 (and .cse0 .cse1 .cse2) .cse5) (= 1 ULTIMATE.start_setEmailTo_~handle) .cse3) (= |ULTIMATE.start_isReadable_#res| 1) (= 1 ULTIMATE.start___utac_acc__DecryptForward_spec__1_~tmp~4)))) [2019-10-22 11:25:26,942 INFO L443 ceAbstractionStarter]: For program point L1536-2(lines 1536 1543) no Hoare annotation was computed. [2019-10-22 11:25:26,943 INFO L443 ceAbstractionStarter]: For program point L2395(lines 2395 2406) no Hoare annotation was computed. [2019-10-22 11:25:26,943 INFO L439 ceAbstractionStarter]: At program point L1338(lines 1325 1456) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (not (= 1 ULTIMATE.start_setup_rjh_~rjh___0)) (= ULTIMATE.start_setClientId_~handle 3) (not (= ~__ste_email_to0~0 1)) (= ~rjh~0 2)) [2019-10-22 11:25:26,943 INFO L443 ceAbstractionStarter]: For program point L2329(lines 2329 2337) no Hoare annotation was computed. [2019-10-22 11:25:26,943 INFO L443 ceAbstractionStarter]: For program point L2329-2(lines 2329 2337) no Hoare annotation was computed. [2019-10-22 11:25:26,943 INFO L443 ceAbstractionStarter]: For program point L2329-4(lines 2329 2337) no Hoare annotation was computed. [2019-10-22 11:25:26,943 INFO L443 ceAbstractionStarter]: For program point L2329-6(lines 2329 2337) no Hoare annotation was computed. [2019-10-22 11:25:26,943 INFO L443 ceAbstractionStarter]: For program point L2329-8(lines 2329 2337) no Hoare annotation was computed. [2019-10-22 11:25:26,944 INFO L443 ceAbstractionStarter]: For program point L876(lines 876 882) no Hoare annotation was computed. [2019-10-22 11:25:26,944 INFO L443 ceAbstractionStarter]: For program point L876-2(lines 876 882) no Hoare annotation was computed. [2019-10-22 11:25:26,944 INFO L439 ceAbstractionStarter]: At program point L1405(lines 1395 1451) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (not (= 1 ULTIMATE.start_setup_rjh_~rjh___0)) (= ULTIMATE.start_setClientId_~handle 3) (not (= ~__ste_email_to0~0 1)) (= ~rjh~0 2)) [2019-10-22 11:25:26,944 INFO L443 ceAbstractionStarter]: For program point L2595-1(lines 2595 2631) no Hoare annotation was computed. [2019-10-22 11:25:26,944 INFO L443 ceAbstractionStarter]: For program point L2595(lines 2595 2631) no Hoare annotation was computed. [2019-10-22 11:25:26,944 INFO L443 ceAbstractionStarter]: For program point L2595-3(lines 2595 2631) no Hoare annotation was computed. [2019-10-22 11:25:26,944 INFO L443 ceAbstractionStarter]: For program point L2595-2(lines 2595 2631) no Hoare annotation was computed. [2019-10-22 11:25:26,944 INFO L443 ceAbstractionStarter]: For program point L2595-4(lines 2595 2631) no Hoare annotation was computed. [2019-10-22 11:25:26,944 INFO L443 ceAbstractionStarter]: For program point L2596(lines 2596 2604) no Hoare annotation was computed. [2019-10-22 11:25:26,945 INFO L439 ceAbstractionStarter]: At program point L2530(lines 2483 2536) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (not (= 1 ULTIMATE.start_setup_rjh_~rjh___0)) (= 0 ULTIMATE.start_test_~op1~0) (= ULTIMATE.start_setClientId_~handle 3) (not (= ~__ste_email_to0~0 1)) (= ~rjh~0 2)) [2019-10-22 11:25:26,945 INFO L443 ceAbstractionStarter]: For program point L2596-2(lines 2596 2604) no Hoare annotation was computed. [2019-10-22 11:25:26,945 INFO L443 ceAbstractionStarter]: For program point L2596-4(lines 2596 2604) no Hoare annotation was computed. [2019-10-22 11:25:26,945 INFO L443 ceAbstractionStarter]: For program point L2596-6(lines 2596 2604) no Hoare annotation was computed. [2019-10-22 11:25:26,945 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-10-22 11:25:26,945 INFO L443 ceAbstractionStarter]: For program point L2332(lines 2332 2336) no Hoare annotation was computed. [2019-10-22 11:25:26,945 INFO L443 ceAbstractionStarter]: For program point L2596-8(lines 2596 2604) no Hoare annotation was computed. [2019-10-22 11:25:26,945 INFO L439 ceAbstractionStarter]: At program point L2332-2(lines 2322 2341) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (not (= 1 ULTIMATE.start_setup_rjh_~rjh___0)) (= 0 ULTIMATE.start_test_~op1~0) (= ULTIMATE.start_setClientId_~handle 3) (not (= ~__ste_email_to0~0 1)) (= ~rjh~0 2)) [2019-10-22 11:25:26,945 INFO L443 ceAbstractionStarter]: For program point L2332-3(lines 2332 2336) no Hoare annotation was computed. [2019-10-22 11:25:26,945 INFO L443 ceAbstractionStarter]: For program point L2332-6(lines 2332 2336) no Hoare annotation was computed. [2019-10-22 11:25:26,945 INFO L439 ceAbstractionStarter]: At program point L2332-5(lines 2322 2341) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (not (= 1 ULTIMATE.start_setup_rjh_~rjh___0)) (= ULTIMATE.start_setClientId_~handle 3) (= 0 ULTIMATE.start_test_~op4~0) (not (= ~__ste_email_to0~0 1)) (= ~rjh~0 2)) [2019-10-22 11:25:26,946 INFO L443 ceAbstractionStarter]: For program point L86(lines 86 92) no Hoare annotation was computed. [2019-10-22 11:25:26,946 INFO L439 ceAbstractionStarter]: At program point L2332-8(lines 2322 2341) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (not (= 1 ULTIMATE.start_setup_rjh_~rjh___0)) (= ULTIMATE.start_setClientId_~handle 3) (= 0 ULTIMATE.start_test_~op5~0) (not (= ~__ste_email_to0~0 1)) (= ~rjh~0 2)) [2019-10-22 11:25:26,946 INFO L443 ceAbstractionStarter]: For program point L86-1(lines 86 92) no Hoare annotation was computed. [2019-10-22 11:25:26,946 INFO L443 ceAbstractionStarter]: For program point L2332-9(lines 2332 2336) no Hoare annotation was computed. [2019-10-22 11:25:26,946 INFO L443 ceAbstractionStarter]: For program point L2332-12(lines 2332 2336) no Hoare annotation was computed. [2019-10-22 11:25:26,946 INFO L439 ceAbstractionStarter]: At program point L2332-11(lines 2322 2341) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (not (= 1 ULTIMATE.start_setup_rjh_~rjh___0)) (= ULTIMATE.start_setClientId_~handle 3) (not (= ~__ste_email_to0~0 1)) (= ~rjh~0 2)) [2019-10-22 11:25:26,946 INFO L439 ceAbstractionStarter]: At program point L2332-14(lines 2322 2341) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (not (= 1 ULTIMATE.start_setup_rjh_~rjh___0)) (= ULTIMATE.start_setClientId_~handle 3) (not (= ~__ste_email_to0~0 1)) (= ~rjh~0 2)) [2019-10-22 11:25:26,946 INFO L443 ceAbstractionStarter]: For program point L2399(lines 2399 2405) no Hoare annotation was computed. [2019-10-22 11:25:26,946 INFO L443 ceAbstractionStarter]: For program point L1343(lines 1343 1350) no Hoare annotation was computed. [2019-10-22 11:25:26,946 INFO L439 ceAbstractionStarter]: At program point L1608(lines 1603 1611) the Hoare annotation is: (let ((.cse4 (= 2 ULTIMATE.start_createEmail_~to)) (.cse0 (= 1 ULTIMATE.start_outgoing_~msg)) (.cse1 (= |ULTIMATE.start_createEmail_#res| 1)) (.cse2 (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (not (= 1 ULTIMATE.start_setup_rjh_~rjh___0)) (= ULTIMATE.start_setClientId_~handle 3))) (.cse5 (= ~rjh~0 2)) (.cse3 (= 1 ULTIMATE.start_createEmail_~msg~0))) (or (and (= ~__ste_email_to0~0 2) (= 2 ULTIMATE.start_getClientForwardReceiver_~handle) (= 2 ULTIMATE.start_incoming_~client) (and .cse0 .cse1 .cse2 .cse3) .cse4 .cse5) (and (and (and .cse4 (and .cse0 .cse1 .cse2) .cse5) (= 1 ULTIMATE.start_setEmailTo_~handle) .cse3) (= |ULTIMATE.start_isReadable_#res| 1) (= 1 ULTIMATE.start___utac_acc__DecryptForward_spec__1_~tmp~4)))) [2019-10-22 11:25:26,947 INFO L443 ceAbstractionStarter]: For program point L2599(lines 2599 2603) no Hoare annotation was computed. [2019-10-22 11:25:26,947 INFO L443 ceAbstractionStarter]: For program point L2599-3(lines 2599 2603) no Hoare annotation was computed. [2019-10-22 11:25:26,947 INFO L443 ceAbstractionStarter]: For program point L1410(lines 1410 1417) no Hoare annotation was computed. [2019-10-22 11:25:26,947 INFO L443 ceAbstractionStarter]: For program point L2599-6(lines 2599 2603) no Hoare annotation was computed. [2019-10-22 11:25:26,947 INFO L443 ceAbstractionStarter]: For program point L2599-9(lines 2599 2603) no Hoare annotation was computed. [2019-10-22 11:25:26,947 INFO L443 ceAbstractionStarter]: For program point L2599-12(lines 2599 2603) no Hoare annotation was computed. [2019-10-22 11:25:26,947 INFO L443 ceAbstractionStarter]: For program point L156(lines 156 167) no Hoare annotation was computed. [2019-10-22 11:25:26,948 INFO L443 ceAbstractionStarter]: For program point L156-1(lines 156 167) no Hoare annotation was computed. [2019-10-22 11:25:26,948 INFO L443 ceAbstractionStarter]: For program point L156-2(lines 156 167) no Hoare annotation was computed. [2019-10-22 11:25:26,948 INFO L443 ceAbstractionStarter]: For program point L156-3(lines 156 167) no Hoare annotation was computed. [2019-10-22 11:25:26,948 INFO L443 ceAbstractionStarter]: For program point L2667(lines 2667 2679) no Hoare annotation was computed. [2019-10-22 11:25:26,948 INFO L439 ceAbstractionStarter]: At program point L487(lines 1 2755) the Hoare annotation is: (and (not (= ~rjh~0 1)) (= ~__ste_client_forwardReceiver1~0 0) (not (= ~__ste_email_to0~0 1))) [2019-10-22 11:25:26,948 INFO L439 ceAbstractionStarter]: At program point L91(lines 78 96) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_isReadable_#res| 1)) (.cse1 (= 1 ULTIMATE.start_outgoing_~msg)) (.cse2 (= 1 ULTIMATE.start_getEmailTo_~handle)) (.cse3 (= |ULTIMATE.start_createEmail_#res| 1)) (.cse5 (= 2 ULTIMATE.start_createEmail_~to)) (.cse4 (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (not (= 1 ULTIMATE.start_setup_rjh_~rjh___0)) (= ULTIMATE.start_setClientId_~handle 3))) (.cse7 (= 1 ULTIMATE.start_createEmail_~msg~0)) (.cse6 (= ~rjh~0 2)) (.cse8 (= 1 ULTIMATE.start___utac_acc__DecryptForward_spec__1_~tmp~4))) (or (and .cse0 (and (= 1 ULTIMATE.start_setEmailTo_~handle) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) .cse7) .cse8) (and .cse0 (and .cse1 (= ~__ste_email_to0~0 2) .cse2 (= 2 ULTIMATE.start_getClientForwardReceiver_~handle) (= 2 |ULTIMATE.start_getEmailTo_#res|) (= 2 ULTIMATE.start_incoming_~client) .cse3 .cse5 .cse4 .cse7 .cse6) .cse8))) [2019-10-22 11:25:26,949 INFO L446 ceAbstractionStarter]: At program point L91-1(lines 78 96) the Hoare annotation is: true [2019-10-22 11:25:26,949 INFO L443 ceAbstractionStarter]: For program point L2735-1(line 2735) no Hoare annotation was computed. [2019-10-22 11:25:26,949 INFO L443 ceAbstractionStarter]: For program point L2735(line 2735) no Hoare annotation was computed. [2019-10-22 11:25:26,949 INFO L439 ceAbstractionStarter]: At program point L2736(lines 868 885) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_isReadable_#res| 1)) (.cse1 (= 1 ULTIMATE.start_outgoing_~msg)) (.cse2 (= 1 ULTIMATE.start_getEmailTo_~handle)) (.cse3 (= |ULTIMATE.start_createEmail_#res| 1)) (.cse5 (= 2 ULTIMATE.start_createEmail_~to)) (.cse4 (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (not (= 1 ULTIMATE.start_setup_rjh_~rjh___0)) (= ULTIMATE.start_setClientId_~handle 3))) (.cse7 (= 1 ULTIMATE.start_createEmail_~msg~0)) (.cse6 (= ~rjh~0 2)) (.cse8 (= 1 ULTIMATE.start___utac_acc__DecryptForward_spec__1_~tmp~4))) (or (and .cse0 (and (= 1 ULTIMATE.start_setEmailTo_~handle) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) .cse7) .cse8) (and .cse0 (and .cse1 (= ~__ste_email_to0~0 2) .cse2 (= 2 ULTIMATE.start_getClientForwardReceiver_~handle) (= 2 |ULTIMATE.start_getEmailTo_#res|) (= 2 ULTIMATE.start_incoming_~client) .cse3 .cse5 .cse4 .cse7 .cse6) .cse8))) [2019-10-22 11:25:26,949 INFO L443 ceAbstractionStarter]: For program point L2670(lines 2670 2678) no Hoare annotation was computed. [2019-10-22 11:25:26,949 INFO L446 ceAbstractionStarter]: At program point L2736-1(lines 868 885) the Hoare annotation is: true [2019-10-22 11:25:26,949 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 2735) no Hoare annotation was computed. [2019-10-22 11:25:26,949 INFO L443 ceAbstractionStarter]: For program point L160(lines 160 166) no Hoare annotation was computed. [2019-10-22 11:25:26,949 INFO L443 ceAbstractionStarter]: For program point L160-1(lines 160 166) no Hoare annotation was computed. [2019-10-22 11:25:26,950 INFO L443 ceAbstractionStarter]: For program point L160-2(lines 160 166) no Hoare annotation was computed. [2019-10-22 11:25:26,950 INFO L443 ceAbstractionStarter]: For program point L160-3(lines 160 166) no Hoare annotation was computed. [2019-10-22 11:25:26,950 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-22 11:25:26,950 INFO L443 ceAbstractionStarter]: For program point L2606(lines 2606 2630) no Hoare annotation was computed. [2019-10-22 11:25:26,950 INFO L443 ceAbstractionStarter]: For program point L2606-2(lines 2606 2630) no Hoare annotation was computed. [2019-10-22 11:25:26,950 INFO L443 ceAbstractionStarter]: For program point L2606-1(lines 2606 2630) no Hoare annotation was computed. [2019-10-22 11:25:26,950 INFO L443 ceAbstractionStarter]: For program point L2606-4(lines 2606 2630) no Hoare annotation was computed. [2019-10-22 11:25:26,950 INFO L443 ceAbstractionStarter]: For program point L2606-3(lines 2606 2630) no Hoare annotation was computed. [2019-10-22 11:25:26,950 INFO L443 ceAbstractionStarter]: For program point L2408(lines 2408 2424) no Hoare annotation was computed. [2019-10-22 11:25:26,950 INFO L443 ceAbstractionStarter]: For program point L2673(lines 2673 2677) no Hoare annotation was computed. [2019-10-22 11:25:26,950 INFO L443 ceAbstractionStarter]: For program point L2607(lines 2607 2615) no Hoare annotation was computed. [2019-10-22 11:25:26,950 INFO L439 ceAbstractionStarter]: At program point L2673-2(lines 1 2755) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (not (= 1 ULTIMATE.start_setup_rjh_~rjh___0)) (= ULTIMATE.start_setClientId_~handle 3) (not (= ~__ste_email_to0~0 1)) (= ~rjh~0 2)) [2019-10-22 11:25:26,951 INFO L443 ceAbstractionStarter]: For program point L2607-2(lines 2607 2615) no Hoare annotation was computed. [2019-10-22 11:25:26,951 INFO L443 ceAbstractionStarter]: For program point L2607-4(lines 2607 2615) no Hoare annotation was computed. [2019-10-22 11:25:26,951 INFO L443 ceAbstractionStarter]: For program point L2409(lines 2409 2420) no Hoare annotation was computed. [2019-10-22 11:25:26,951 INFO L439 ceAbstractionStarter]: At program point L1352(lines 1339 1455) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (not (= 1 ULTIMATE.start_setup_rjh_~rjh___0)) (= ULTIMATE.start_setClientId_~handle 3) (not (= ~__ste_email_to0~0 1)) (= ~rjh~0 2)) [2019-10-22 11:25:26,951 INFO L443 ceAbstractionStarter]: For program point L2607-6(lines 2607 2615) no Hoare annotation was computed. [2019-10-22 11:25:26,951 INFO L443 ceAbstractionStarter]: For program point L2607-8(lines 2607 2615) no Hoare annotation was computed. [2019-10-22 11:25:26,952 INFO L439 ceAbstractionStarter]: At program point L1419(lines 1406 1450) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (not (= 1 ULTIMATE.start_setup_rjh_~rjh___0)) (= ULTIMATE.start_setClientId_~handle 3) (not (= ~__ste_email_to0~0 1)) (= ~rjh~0 2)) [2019-10-22 11:25:26,952 INFO L439 ceAbstractionStarter]: At program point L495(lines 490 498) the Hoare annotation is: (and (not (= ~rjh~0 1)) (= ~__ste_client_forwardReceiver1~0 0) (not (= ~__ste_email_to0~0 1))) [2019-10-22 11:25:26,952 INFO L443 ceAbstractionStarter]: For program point L2279(lines 2279 2291) no Hoare annotation was computed. [2019-10-22 11:25:26,952 INFO L439 ceAbstractionStarter]: At program point L165(lines 152 170) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 1 ULTIMATE.start_getEmailTo_~handle) (= ULTIMATE.start_setClientId_~handle 3) (= 1 ULTIMATE.start_setEmailTo_~handle) (= ULTIMATE.start_setEmailTo_~value 2) (not (= 1 ULTIMATE.start_setup_rjh_~rjh___0)) (= 1 ULTIMATE.start_outgoing_~msg) (= ~__ste_email_to0~0 2) (= 2 |ULTIMATE.start_getEmailTo_#res|) (= |ULTIMATE.start_createEmail_#res| 1) (= 2 ULTIMATE.start_createEmail_~to) (= 1 ULTIMATE.start_createEmail_~msg~0) (= ~rjh~0 2)) [2019-10-22 11:25:26,952 INFO L443 ceAbstractionStarter]: For program point L2279-2(lines 2279 2291) no Hoare annotation was computed. [2019-10-22 11:25:26,952 INFO L439 ceAbstractionStarter]: At program point L165-1(lines 152 170) the Hoare annotation is: (let ((.cse6 (= |ULTIMATE.start_isReadable_#res| 1)) (.cse1 (= 1 ULTIMATE.start_outgoing_~msg)) (.cse3 (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (not (= 1 ULTIMATE.start_setup_rjh_~rjh___0)) (= ULTIMATE.start_setClientId_~handle 3))) (.cse2 (= |ULTIMATE.start_createEmail_#res| 1)) (.cse5 (= 1 ULTIMATE.start_createEmail_~msg~0)) (.cse0 (= 2 ULTIMATE.start_createEmail_~to)) (.cse4 (= ~rjh~0 2)) (.cse7 (= 1 ULTIMATE.start___utac_acc__DecryptForward_spec__1_~tmp~4))) (or (and (and (and .cse0 (and .cse1 .cse2 .cse3) .cse4) (= 1 ULTIMATE.start_setEmailTo_~handle) .cse5) .cse6 .cse7) (and .cse6 (and (= ~__ste_email_to0~0 2) (and .cse1 .cse3 .cse2 .cse5) (= 2 ULTIMATE.start_getClientForwardReceiver_~handle) (= 2 ULTIMATE.start_incoming_~client) .cse0 .cse4) .cse7))) [2019-10-22 11:25:26,952 INFO L439 ceAbstractionStarter]: At program point L165-2(lines 152 170) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (not (= 1 ULTIMATE.start_setup_rjh_~rjh___0)) (= ULTIMATE.start_setClientId_~handle 3) (= |ULTIMATE.start_createEmail_#res| 1) (= 2 ULTIMATE.start_createEmail_~to) (= 1 ULTIMATE.start_createEmail_~msg~0) (= ~rjh~0 2)) [2019-10-22 11:25:26,953 INFO L443 ceAbstractionStarter]: For program point L2279-4(lines 2279 2291) no Hoare annotation was computed. [2019-10-22 11:25:26,953 INFO L446 ceAbstractionStarter]: At program point L165-3(lines 152 170) the Hoare annotation is: true [2019-10-22 11:25:26,953 INFO L443 ceAbstractionStarter]: For program point L2279-6(lines 2279 2291) no Hoare annotation was computed. [2019-10-22 11:25:26,953 INFO L443 ceAbstractionStarter]: For program point L2279-8(lines 2279 2291) no Hoare annotation was computed. [2019-10-22 11:25:26,953 INFO L443 ceAbstractionStarter]: For program point L2279-10(lines 2279 2291) no Hoare annotation was computed. [2019-10-22 11:25:26,953 INFO L443 ceAbstractionStarter]: For program point L2610(lines 2610 2614) no Hoare annotation was computed. [2019-10-22 11:25:26,953 INFO L439 ceAbstractionStarter]: At program point L562(lines 551 565) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (not (= 1 ULTIMATE.start_setup_rjh_~rjh___0)) (= ~__ste_email_to0~0 2) (= ULTIMATE.start_setClientId_~handle 3) (= |ULTIMATE.start_createEmail_#res| 1) (= 1 ULTIMATE.start_setEmailTo_~handle) (= 2 ULTIMATE.start_createEmail_~to) (= ULTIMATE.start_setEmailTo_~value 2) (= 1 ULTIMATE.start_createEmail_~msg~0) (= ~rjh~0 2)) [2019-10-22 11:25:26,953 INFO L443 ceAbstractionStarter]: For program point L2610-3(lines 2610 2614) no Hoare annotation was computed. [2019-10-22 11:25:26,953 INFO L443 ceAbstractionStarter]: For program point L2610-6(lines 2610 2614) no Hoare annotation was computed. [2019-10-22 11:25:26,953 INFO L443 ceAbstractionStarter]: For program point L2610-9(lines 2610 2614) no Hoare annotation was computed. [2019-10-22 11:25:26,953 INFO L443 ceAbstractionStarter]: For program point L2610-12(lines 2610 2614) no Hoare annotation was computed. [2019-10-22 11:25:26,953 INFO L443 ceAbstractionStarter]: For program point L2413(lines 2413 2419) no Hoare annotation was computed. [2019-10-22 11:25:26,995 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 11:25:26 BoogieIcfgContainer [2019-10-22 11:25:26,996 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 11:25:26,996 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 11:25:26,996 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 11:25:26,996 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 11:25:26,997 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:25:00" (3/4) ... [2019-10-22 11:25:27,000 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-10-22 11:25:27,024 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 123 nodes and edges [2019-10-22 11:25:27,026 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 64 nodes and edges [2019-10-22 11:25:27,028 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2019-10-22 11:25:27,029 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-10-22 11:25:27,030 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-10-22 11:25:27,063 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((handle == chuck___0 && !(1 == rjh___0)) && __ste_email_to0 == 2) && handle == 3) && \result == 1) && 1 == handle) && 2 == to) && value == 2) && 1 == msg) && rjh == 2 [2019-10-22 11:25:27,065 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((handle == chuck___0 && !(1 == rjh___0)) && 1 == msg) && __ste_email_to0 == 2) && handle == 3) && \result == 1) && 1 == handle) && 2 == to) && value == 2) && 1 == msg) && rjh == 2 [2019-10-22 11:25:27,066 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((handle == chuck___0 && !(1 == rjh___0)) && 1 == msg) && __ste_email_to0 == 2) && handle == 3) && \result == 1) && 1 == handle) && 2 == to) && value == 2) && 1 == msg) && rjh == 2 [2019-10-22 11:25:27,067 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((handle == chuck___0 && 1 == handle) && handle == 3) && 1 == handle) && value == 2) && !(1 == rjh___0)) && 1 == msg) && __ste_email_to0 == 2) && 2 == \result) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2 [2019-10-22 11:25:27,068 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((handle == chuck___0 && 1 == handle) && handle == 3) && 2 == client) && 1 == handle) && value == 2) && !(1 == rjh___0)) && 1 == msg) && __ste_email_to0 == 2) && 2 == \result) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2 [2019-10-22 11:25:27,068 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((handle == chuck___0 && 1 == handle) && handle == 3) && 2 == client) && 1 == handle) && value == 2) && 1 == msg) && !(1 == rjh___0)) && __ste_email_to0 == 2) && 2 == handle) && 2 == \result) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2 [2019-10-22 11:25:27,068 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((__ste_email_to0 == 2 && 2 == handle) && 2 == client) && ((1 == msg && \result == 1) && (handle == chuck___0 && !(1 == rjh___0)) && handle == 3) && 1 == msg) && 2 == to) && rjh == 2) || ((((((2 == to && (1 == msg && \result == 1) && (handle == chuck___0 && !(1 == rjh___0)) && handle == 3) && rjh == 2) && 1 == handle) && 1 == msg) && \result == 1) && 1 == tmp) [2019-10-22 11:25:27,068 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((1 == handle && ((((1 == msg && 1 == handle) && \result == 1) && (handle == chuck___0 && !(1 == rjh___0)) && handle == 3) && 2 == to) && rjh == 2) && 1 == msg) || ((((((((((1 == msg && __ste_email_to0 == 2) && 1 == handle) && 2 == handle) && 2 == \result) && 2 == client) && \result == 1) && 2 == to) && (handle == chuck___0 && !(1 == rjh___0)) && handle == 3) && 1 == msg) && rjh == 2) [2019-10-22 11:25:27,068 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((__ste_email_to0 == 2 && 2 == handle) && 2 == client) && ((1 == msg && \result == 1) && (handle == chuck___0 && !(1 == rjh___0)) && handle == 3) && 1 == msg) && 2 == to) && rjh == 2) || ((((((2 == to && (1 == msg && \result == 1) && (handle == chuck___0 && !(1 == rjh___0)) && handle == 3) && rjh == 2) && 1 == handle) && 1 == msg) && \result == 1) && 1 == tmp) [2019-10-22 11:25:27,069 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((__ste_email_to0 == 2 && 2 == handle) && 2 == client) && ((1 == msg && \result == 1) && (handle == chuck___0 && !(1 == rjh___0)) && handle == 3) && 1 == msg) && 2 == to) && rjh == 2) || ((((((2 == to && (1 == msg && \result == 1) && (handle == chuck___0 && !(1 == rjh___0)) && handle == 3) && rjh == 2) && 1 == handle) && 1 == msg) && \result == 1) && 1 == tmp) [2019-10-22 11:25:27,069 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\result == 1 && (((((((((1 == msg && __ste_email_to0 == 2) && 1 == handle) && 2 == handle) && 2 == \result) && 2 == client) && \result == 1) && 2 == to) && (handle == chuck___0 && !(1 == rjh___0)) && handle == 3) && 1 == msg) && rjh == 2) || (\result == 1 && (1 == handle && ((((1 == msg && 1 == handle) && \result == 1) && (handle == chuck___0 && !(1 == rjh___0)) && handle == 3) && 2 == to) && rjh == 2) && 1 == msg) [2019-10-22 11:25:27,069 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((__ste_email_to0 == 2 && 2 == handle) && 2 == client) && ((1 == msg && \result == 1) && (handle == chuck___0 && !(1 == rjh___0)) && handle == 3) && 1 == msg) && 2 == to) && rjh == 2) || ((((((2 == to && (1 == msg && \result == 1) && (handle == chuck___0 && !(1 == rjh___0)) && handle == 3) && rjh == 2) && 1 == handle) && 1 == msg) && \result == 1) && 1 == tmp) [2019-10-22 11:25:27,069 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\result == 1 && (1 == handle && ((((1 == msg && 1 == handle) && \result == 1) && (handle == chuck___0 && !(1 == rjh___0)) && handle == 3) && 2 == to) && rjh == 2) && 1 == msg) && 1 == tmp) || ((\result == 1 && (((((((((1 == msg && __ste_email_to0 == 2) && 1 == handle) && 2 == handle) && 2 == \result) && 2 == client) && \result == 1) && 2 == to) && (handle == chuck___0 && !(1 == rjh___0)) && handle == 3) && 1 == msg) && rjh == 2) && 1 == tmp) [2019-10-22 11:25:27,069 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((\result == 1 && (handle == chuck___0 && !(1 == rjh___0)) && handle == 3) && 2 == to) && rjh == 2) && 1 == handle) && 1 == msg) && \result == 1) && 1 == tmp) || ((((((__ste_email_to0 == 2 && 2 == handle) && \result == 1 && (handle == chuck___0 && !(1 == rjh___0)) && handle == 3) && 2 == client) && 2 == to) && rjh == 2) && 1 == msg) [2019-10-22 11:25:27,069 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\result == 1 && (1 == handle && ((((1 == msg && 1 == handle) && \result == 1) && (handle == chuck___0 && !(1 == rjh___0)) && handle == 3) && 2 == to) && rjh == 2) && 1 == msg) && 1 == tmp) || ((\result == 1 && (((((((((1 == msg && __ste_email_to0 == 2) && 1 == handle) && 2 == handle) && 2 == \result) && 2 == client) && \result == 1) && 2 == to) && (handle == chuck___0 && !(1 == rjh___0)) && handle == 3) && 1 == msg) && rjh == 2) && 1 == tmp) [2019-10-22 11:25:27,069 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((\result == 1 && (handle == chuck___0 && !(1 == rjh___0)) && handle == 3) && 2 == to) && rjh == 2) && 1 == handle) && 1 == msg) && \result == 1) && 1 == tmp) || ((((((__ste_email_to0 == 2 && 2 == handle) && \result == 1 && (handle == chuck___0 && !(1 == rjh___0)) && handle == 3) && 2 == client) && 2 == to) && rjh == 2) && 1 == msg) [2019-10-22 11:25:27,070 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\result == 1 && (1 == handle && ((((1 == msg && 1 == handle) && \result == 1) && (handle == chuck___0 && !(1 == rjh___0)) && handle == 3) && 2 == to) && rjh == 2) && 1 == msg) && 1 == tmp) || ((\result == 1 && (((((((((1 == msg && __ste_email_to0 == 2) && 1 == handle) && 2 == handle) && 2 == \result) && 2 == client) && \result == 1) && 2 == to) && (handle == chuck___0 && !(1 == rjh___0)) && handle == 3) && 1 == msg) && rjh == 2) && 1 == tmp) [2019-10-22 11:25:27,070 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((handle == chuck___0 && !(1 == rjh___0)) && handle == 3) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2 [2019-10-22 11:25:27,070 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((2 == to && (1 == msg && \result == 1) && (handle == chuck___0 && !(1 == rjh___0)) && handle == 3) && rjh == 2) && 1 == handle) && 1 == msg) && \result == 1) && 1 == tmp) || ((\result == 1 && ((((__ste_email_to0 == 2 && ((1 == msg && (handle == chuck___0 && !(1 == rjh___0)) && handle == 3) && \result == 1) && 1 == msg) && 2 == handle) && 2 == client) && 2 == to) && rjh == 2) && 1 == tmp) [2019-10-22 11:25:27,070 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((handle == chuck___0 && !(1 == rjh___0)) && handle == 3) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2 [2019-10-22 11:25:27,070 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((2 == to && ((((handle == chuck___0 && !(1 == rjh___0)) && handle == 3) && !(rjh == 1)) && !(1 == to)) && \result == 1) && rjh == 2) && 1 == msg) || (\result == 0 && (((handle == chuck___0 && !(1 == rjh___0)) && handle == 3) && !(rjh == 1)) && !(1 == to)) [2019-10-22 11:25:27,070 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((2 == to && (1 == msg && \result == 1) && (handle == chuck___0 && !(1 == rjh___0)) && handle == 3) && rjh == 2) && 1 == handle) && 1 == msg) && \result == 1) && 1 == tmp) || ((\result == 1 && ((((__ste_email_to0 == 2 && ((1 == msg && (handle == chuck___0 && !(1 == rjh___0)) && handle == 3) && \result == 1) && 1 == msg) && 2 == handle) && 2 == client) && 2 == to) && rjh == 2) && 1 == tmp) [2019-10-22 11:25:27,070 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((2 == to && (1 == msg && \result == 1) && (handle == chuck___0 && !(1 == rjh___0)) && handle == 3) && rjh == 2) && 1 == handle) && 1 == msg) && \result == 1) && 1 == tmp) || ((\result == 1 && ((((__ste_email_to0 == 2 && ((1 == msg && (handle == chuck___0 && !(1 == rjh___0)) && handle == 3) && \result == 1) && 1 == msg) && 2 == handle) && 2 == client) && 2 == to) && rjh == 2) && 1 == tmp) [2019-10-22 11:25:27,071 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((handle == chuck___0 && !(1 == rjh___0)) && handle == 3) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2 [2019-10-22 11:25:27,071 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((handle == chuck___0 && !(1 == rjh___0)) && handle == 3) && \result == 1) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2 [2019-10-22 11:25:27,168 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_4459a0f2-05db-436b-bdbd-2e669404c24c/bin/utaipan/witness.graphml [2019-10-22 11:25:27,168 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 11:25:27,170 INFO L168 Benchmark]: Toolchain (without parser) took 29313.32 ms. Allocated memory was 1.0 GB in the beginning and 2.4 GB in the end (delta: 1.4 GB). Free memory was 940.7 MB in the beginning and 1.8 GB in the end (delta: -846.0 MB). Peak memory consumption was 572.7 MB. Max. memory is 11.5 GB. [2019-10-22 11:25:27,170 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 962.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:25:27,170 INFO L168 Benchmark]: CACSL2BoogieTranslator took 822.26 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 105.9 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -111.3 MB). Peak memory consumption was 31.6 MB. Max. memory is 11.5 GB. [2019-10-22 11:25:27,171 INFO L168 Benchmark]: Boogie Procedure Inliner took 114.95 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2019-10-22 11:25:27,171 INFO L168 Benchmark]: Boogie Preprocessor took 110.03 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2019-10-22 11:25:27,171 INFO L168 Benchmark]: RCFGBuilder took 1703.27 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 874.4 MB in the end (delta: 163.5 MB). Peak memory consumption was 163.5 MB. Max. memory is 11.5 GB. [2019-10-22 11:25:27,172 INFO L168 Benchmark]: TraceAbstraction took 26385.96 ms. Allocated memory was 1.1 GB in the beginning and 2.4 GB in the end (delta: 1.3 GB). Free memory was 874.4 MB in the beginning and 1.8 GB in the end (delta: -955.0 MB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. [2019-10-22 11:25:27,172 INFO L168 Benchmark]: Witness Printer took 172.57 ms. Allocated memory is still 2.4 GB. Free memory was 1.8 GB in the beginning and 1.8 GB in the end (delta: 42.7 MB). Peak memory consumption was 42.7 MB. Max. memory is 11.5 GB. [2019-10-22 11:25:27,173 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 962.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 822.26 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 105.9 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -111.3 MB). Peak memory consumption was 31.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 114.95 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 110.03 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1703.27 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 874.4 MB in the end (delta: 163.5 MB). Peak memory consumption was 163.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 26385.96 ms. Allocated memory was 1.1 GB in the beginning and 2.4 GB in the end (delta: 1.3 GB). Free memory was 874.4 MB in the beginning and 1.8 GB in the end (delta: -955.0 MB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. * Witness Printer took 172.57 ms. Allocated memory is still 2.4 GB. Free memory was 1.8 GB in the beginning and 1.8 GB in the end (delta: 42.7 MB). Peak memory consumption was 42.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 2735]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 2735]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - InvariantResult [Line: 1420]: Loop Invariant Derived loop invariant: (((handle == chuck___0 && !(1 == rjh___0)) && handle == 3) && !(__ste_email_to0 == 1)) && rjh == 2 - InvariantResult [Line: 78]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2342]: Loop Invariant Derived loop invariant: ((((handle == chuck___0 && !(1 == rjh___0)) && handle == 3) && 0 == op4) && !(__ste_email_to0 == 1)) && rjh == 2 - InvariantResult [Line: 78]: Loop Invariant Derived loop invariant: ((\result == 1 && (1 == handle && ((((1 == msg && 1 == handle) && \result == 1) && (handle == chuck___0 && !(1 == rjh___0)) && handle == 3) && 2 == to) && rjh == 2) && 1 == msg) && 1 == tmp) || ((\result == 1 && (((((((((1 == msg && __ste_email_to0 == 2) && 1 == handle) && 2 == handle) && 2 == \result) && 2 == client) && \result == 1) && 2 == to) && (handle == chuck___0 && !(1 == rjh___0)) && handle == 3) && 1 == msg) && rjh == 2) && 1 == tmp) - InvariantResult [Line: 2342]: Loop Invariant Derived loop invariant: (((handle == chuck___0 && !(1 == rjh___0)) && handle == 3) && !(__ste_email_to0 == 1)) && rjh == 2 - InvariantResult [Line: 2483]: Loop Invariant Derived loop invariant: ((((handle == chuck___0 && !(1 == rjh___0)) && 0 == op1) && handle == 3) && !(__ste_email_to0 == 1)) && rjh == 2 - InvariantResult [Line: 2342]: Loop Invariant Derived loop invariant: ((((handle == chuck___0 && !(1 == rjh___0)) && handle == 3) && 0 == op5) && !(__ste_email_to0 == 1)) && rjh == 2 - InvariantResult [Line: 2342]: Loop Invariant Derived loop invariant: (((handle == chuck___0 && !(1 == rjh___0)) && handle == 3) && !(__ste_email_to0 == 1)) && rjh == 2 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (!(rjh == 1) && __ste_client_forwardReceiver1 == 0) && !(__ste_email_to0 == 1) - InvariantResult [Line: 1585]: Loop Invariant Derived loop invariant: (((((__ste_email_to0 == 2 && 2 == handle) && 2 == client) && ((1 == msg && \result == 1) && (handle == chuck___0 && !(1 == rjh___0)) && handle == 3) && 1 == msg) && 2 == to) && rjh == 2) || ((((((2 == to && (1 == msg && \result == 1) && (handle == chuck___0 && !(1 == rjh___0)) && handle == 3) && rjh == 2) && 1 == handle) && 1 == msg) && \result == 1) && 1 == tmp) - InvariantResult [Line: 2298]: Loop Invariant Derived loop invariant: ((((handle == chuck___0 && !(1 == rjh___0)) && handle == 3) && 0 == op5) && !(__ste_email_to0 == 1)) && rjh == 2 - InvariantResult [Line: 2298]: Loop Invariant Derived loop invariant: (((handle == chuck___0 && !(1 == rjh___0)) && handle == 3) && !(__ste_email_to0 == 1)) && rjh == 2 - InvariantResult [Line: 2298]: Loop Invariant Derived loop invariant: (((handle == chuck___0 && !(1 == rjh___0)) && handle == 3) && !(__ste_email_to0 == 1)) && rjh == 2 - InvariantResult [Line: 505]: Loop Invariant Derived loop invariant: ((((((2 == to && (1 == msg && \result == 1) && (handle == chuck___0 && !(1 == rjh___0)) && handle == 3) && rjh == 2) && 1 == handle) && 1 == msg) && \result == 1) && 1 == tmp) || ((\result == 1 && ((((__ste_email_to0 == 2 && ((1 == msg && (handle == chuck___0 && !(1 == rjh___0)) && handle == 3) && \result == 1) && 1 == msg) && 2 == handle) && 2 == client) && 2 == to) && rjh == 2) && 1 == tmp) - InvariantResult [Line: 505]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 700]: Loop Invariant Derived loop invariant: ((((((handle == chuck___0 && !(1 == rjh___0)) && handle == 3) && !(handle == 2)) && __ste_client_forwardReceiver1 == 0) && !(handle == 1)) && !(__ste_email_to0 == 1)) && rjh == 2 - InvariantResult [Line: 2342]: Loop Invariant Derived loop invariant: ((((handle == chuck___0 && !(1 == rjh___0)) && 0 == op1) && handle == 3) && !(__ste_email_to0 == 1)) && rjh == 2 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((handle == chuck___0 && !(1 == rjh___0)) && handle == 3) && !(__ste_email_to0 == 1)) && rjh == 2 - InvariantResult [Line: 1325]: Loop Invariant Derived loop invariant: (((handle == chuck___0 && !(1 == rjh___0)) && handle == 3) && !(__ste_email_to0 == 1)) && rjh == 2 - InvariantResult [Line: 2686]: Loop Invariant Derived loop invariant: (((((((\result == 1 && (handle == chuck___0 && !(1 == rjh___0)) && handle == 3) && 2 == to) && rjh == 2) && 1 == handle) && 1 == msg) && \result == 1) && 1 == tmp) || ((((((__ste_email_to0 == 2 && 2 == handle) && \result == 1 && (handle == chuck___0 && !(1 == rjh___0)) && handle == 3) && 2 == client) && 2 == to) && rjh == 2) && 1 == msg) - InvariantResult [Line: 533]: Loop Invariant Derived loop invariant: ((((((2 == to && (1 == msg && \result == 1) && (handle == chuck___0 && !(1 == rjh___0)) && handle == 3) && rjh == 2) && 1 == handle) && 1 == msg) && \result == 1) && 1 == tmp) || ((\result == 1 && ((((__ste_email_to0 == 2 && ((1 == msg && (handle == chuck___0 && !(1 == rjh___0)) && handle == 3) && \result == 1) && 1 == msg) && 2 == handle) && 2 == client) && 2 == to) && rjh == 2) && 1 == tmp) - InvariantResult [Line: 152]: Loop Invariant Derived loop invariant: (((((((((((handle == chuck___0 && 1 == handle) && handle == 3) && 1 == handle) && value == 2) && !(1 == rjh___0)) && 1 == msg) && __ste_email_to0 == 2) && 2 == \result) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2 - InvariantResult [Line: 533]: Loop Invariant Derived loop invariant: ((((((handle == chuck___0 && !(1 == rjh___0)) && handle == 3) && \result == 1) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2 - InvariantResult [Line: 533]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1300]: Loop Invariant Derived loop invariant: (((handle == chuck___0 && !(1 == rjh___0)) && handle == 3) && !(__ste_email_to0 == 1)) && rjh == 2 - InvariantResult [Line: 1314]: Loop Invariant Derived loop invariant: (((handle == chuck___0 && !(1 == rjh___0)) && handle == 3) && !(__ste_email_to0 == 1)) && rjh == 2 - InvariantResult [Line: 2298]: Loop Invariant Derived loop invariant: ((((handle == chuck___0 && !(1 == rjh___0)) && 0 == op1) && handle == 3) && !(__ste_email_to0 == 1)) && rjh == 2 - InvariantResult [Line: 1406]: Loop Invariant Derived loop invariant: (((handle == chuck___0 && !(1 == rjh___0)) && handle == 3) && !(__ste_email_to0 == 1)) && rjh == 2 - InvariantResult [Line: 2298]: Loop Invariant Derived loop invariant: ((((handle == chuck___0 && !(1 == rjh___0)) && handle == 3) && 0 == op4) && !(__ste_email_to0 == 1)) && rjh == 2 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((__ste_email_to0 == 2 && 2 == handle) && 2 == client) && ((1 == msg && \result == 1) && (handle == chuck___0 && !(1 == rjh___0)) && handle == 3) && 1 == msg) && 2 == to) && rjh == 2) || ((((((2 == to && (1 == msg && \result == 1) && (handle == chuck___0 && !(1 == rjh___0)) && handle == 3) && rjh == 2) && 1 == handle) && 1 == msg) && \result == 1) && 1 == tmp) - InvariantResult [Line: 115]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1291]: Loop Invariant Derived loop invariant: (((handle == chuck___0 && !(1 == rjh___0)) && handle == 3) && !(__ste_email_to0 == 1)) && rjh == 2 - InvariantResult [Line: 115]: Loop Invariant Derived loop invariant: ((\result == 1 && (1 == handle && ((((1 == msg && 1 == handle) && \result == 1) && (handle == chuck___0 && !(1 == rjh___0)) && handle == 3) && 2 == to) && rjh == 2) && 1 == msg) && 1 == tmp) || ((\result == 1 && (((((((((1 == msg && __ste_email_to0 == 2) && 1 == handle) && 2 == handle) && 2 == \result) && 2 == client) && \result == 1) && 2 == to) && (handle == chuck___0 && !(1 == rjh___0)) && handle == 3) && 1 == msg) && rjh == 2) && 1 == tmp) - InvariantResult [Line: 1395]: Loop Invariant Derived loop invariant: (((handle == chuck___0 && !(1 == rjh___0)) && handle == 3) && !(__ste_email_to0 == 1)) && rjh == 2 - InvariantResult [Line: 1292]: Loop Invariant Derived loop invariant: (((handle == chuck___0 && !(1 == rjh___0)) && handle == 3) && !(__ste_email_to0 == 1)) && rjh == 2 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (!(rjh == 1) && __ste_client_forwardReceiver1 == 0) && !(__ste_email_to0 == 1) - InvariantResult [Line: 1381]: Loop Invariant Derived loop invariant: (((handle == chuck___0 && !(1 == rjh___0)) && handle == 3) && !(__ste_email_to0 == 1)) && rjh == 2 - InvariantResult [Line: 152]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2686]: Loop Invariant Derived loop invariant: (((((((((handle == chuck___0 && !(1 == rjh___0)) && 1 == msg) && __ste_email_to0 == 2) && handle == 3) && \result == 1) && 1 == handle) && 2 == to) && value == 2) && 1 == msg) && rjh == 2 - InvariantResult [Line: 152]: Loop Invariant Derived loop invariant: (((((handle == chuck___0 && !(1 == rjh___0)) && handle == 3) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2 - InvariantResult [Line: 868]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 533]: Loop Invariant Derived loop invariant: (\result == 1 && (((((((((1 == msg && __ste_email_to0 == 2) && 1 == handle) && 2 == handle) && 2 == \result) && 2 == client) && \result == 1) && 2 == to) && (handle == chuck___0 && !(1 == rjh___0)) && handle == 3) && 1 == msg) && rjh == 2) || (\result == 1 && (1 == handle && ((((1 == msg && 1 == handle) && \result == 1) && (handle == chuck___0 && !(1 == rjh___0)) && handle == 3) && 2 == to) && rjh == 2) && 1 == msg) - InvariantResult [Line: 868]: Loop Invariant Derived loop invariant: ((\result == 1 && (1 == handle && ((((1 == msg && 1 == handle) && \result == 1) && (handle == chuck___0 && !(1 == rjh___0)) && handle == 3) && 2 == to) && rjh == 2) && 1 == msg) && 1 == tmp) || ((\result == 1 && (((((((((1 == msg && __ste_email_to0 == 2) && 1 == handle) && 2 == handle) && 2 == \result) && 2 == client) && \result == 1) && 2 == to) && (handle == chuck___0 && !(1 == rjh___0)) && handle == 3) && 1 == msg) && rjh == 2) && 1 == tmp) - InvariantResult [Line: 152]: Loop Invariant Derived loop invariant: ((((((2 == to && (1 == msg && \result == 1) && (handle == chuck___0 && !(1 == rjh___0)) && handle == 3) && rjh == 2) && 1 == handle) && 1 == msg) && \result == 1) && 1 == tmp) || ((\result == 1 && ((((__ste_email_to0 == 2 && ((1 == msg && (handle == chuck___0 && !(1 == rjh___0)) && handle == 3) && \result == 1) && 1 == msg) && 2 == handle) && 2 == client) && 2 == to) && rjh == 2) && 1 == tmp) - InvariantResult [Line: 2322]: Loop Invariant Derived loop invariant: (((handle == chuck___0 && !(1 == rjh___0)) && handle == 3) && !(__ste_email_to0 == 1)) && rjh == 2 - InvariantResult [Line: 1367]: Loop Invariant Derived loop invariant: (((handle == chuck___0 && !(1 == rjh___0)) && handle == 3) && !(__ste_email_to0 == 1)) && rjh == 2 - InvariantResult [Line: 134]: Loop Invariant Derived loop invariant: (((((((\result == 1 && (handle == chuck___0 && !(1 == rjh___0)) && handle == 3) && 2 == to) && rjh == 2) && 1 == handle) && 1 == msg) && \result == 1) && 1 == tmp) || ((((((__ste_email_to0 == 2 && 2 == handle) && \result == 1 && (handle == chuck___0 && !(1 == rjh___0)) && handle == 3) && 2 == client) && 2 == to) && rjh == 2) && 1 == msg) - InvariantResult [Line: 134]: Loop Invariant Derived loop invariant: (((((((((handle == chuck___0 && !(1 == rjh___0)) && 1 == msg) && __ste_email_to0 == 2) && handle == 3) && \result == 1) && 1 == handle) && 2 == to) && value == 2) && 1 == msg) && rjh == 2 - InvariantResult [Line: 2639]: Loop Invariant Derived loop invariant: (((2 == to && ((((handle == chuck___0 && !(1 == rjh___0)) && handle == 3) && !(rjh == 1)) && !(1 == to)) && \result == 1) && rjh == 2) && 1 == msg) || (\result == 0 && (((handle == chuck___0 && !(1 == rjh___0)) && handle == 3) && !(rjh == 1)) && !(1 == to)) - InvariantResult [Line: 1594]: Loop Invariant Derived loop invariant: (((((__ste_email_to0 == 2 && 2 == handle) && 2 == client) && ((1 == msg && \result == 1) && (handle == chuck___0 && !(1 == rjh___0)) && handle == 3) && 1 == msg) && 2 == to) && rjh == 2) || ((((((2 == to && (1 == msg && \result == 1) && (handle == chuck___0 && !(1 == rjh___0)) && handle == 3) && rjh == 2) && 1 == handle) && 1 == msg) && \result == 1) && 1 == tmp) - InvariantResult [Line: 2639]: Loop Invariant Derived loop invariant: (((((((((((((handle == chuck___0 && 1 == handle) && handle == 3) && 2 == client) && 1 == handle) && value == 2) && 1 == msg) && !(1 == rjh___0)) && __ste_email_to0 == 2) && 2 == handle) && 2 == \result) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2 - InvariantResult [Line: 2430]: Loop Invariant Derived loop invariant: ((((handle == chuck___0 && !(1 == rjh___0)) && handle == 3) && 0 == op5) && !(__ste_email_to0 == 1)) && rjh == 2 - InvariantResult [Line: 2322]: Loop Invariant Derived loop invariant: ((((handle == chuck___0 && !(1 == rjh___0)) && handle == 3) && 0 == op5) && !(__ste_email_to0 == 1)) && rjh == 2 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((handle == chuck___0 && !(1 == rjh___0)) && handle == 3) && 0 == op5) && !(__ste_email_to0 == 1)) && rjh == 2 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((handle == chuck___0 && !(1 == rjh___0)) && handle == 3) && !(__ste_email_to0 == 1)) && rjh == 2 - InvariantResult [Line: 733]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 836]: Loop Invariant Derived loop invariant: (((handle == chuck___0 && !(1 == rjh___0)) && handle == 3) && !(__ste_email_to0 == 1)) && rjh == 2 - InvariantResult [Line: 2430]: Loop Invariant Derived loop invariant: (((handle == chuck___0 && !(1 == rjh___0)) && handle == 3) && !(__ste_email_to0 == 1)) && rjh == 2 - InvariantResult [Line: 2322]: Loop Invariant Derived loop invariant: (((handle == chuck___0 && !(1 == rjh___0)) && handle == 3) && !(__ste_email_to0 == 1)) && rjh == 2 - InvariantResult [Line: 2430]: Loop Invariant Derived loop invariant: (((handle == chuck___0 && !(1 == rjh___0)) && handle == 3) && !(__ste_email_to0 == 1)) && rjh == 2 - InvariantResult [Line: 490]: Loop Invariant Derived loop invariant: (!(rjh == 1) && __ste_client_forwardReceiver1 == 0) && !(__ste_email_to0 == 1) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((handle == chuck___0 && !(1 == rjh___0)) && handle == 3) && !(__ste_email_to0 == 1)) && rjh == 2 - InvariantResult [Line: 171]: Loop Invariant Derived loop invariant: (((((((handle == chuck___0 && !(1 == rjh___0)) && __ste_email_to0 == 2) && handle == 3) && 1 == handle) && 2 == to) && value == 2) && 1 == msg) && rjh == 2 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((handle == chuck___0 && !(1 == rjh___0)) && handle == 3) && 0 == op3) && !(__ste_email_to0 == 1)) && rjh == 2 - InvariantResult [Line: 2430]: Loop Invariant Derived loop invariant: ((((handle == chuck___0 && !(1 == rjh___0)) && 0 == op1) && handle == 3) && !(__ste_email_to0 == 1)) && rjh == 2 - InvariantResult [Line: 2376]: Loop Invariant Derived loop invariant: ((((handle == chuck___0 && !(1 == rjh___0)) && 0 == op1) && handle == 3) && !(__ste_email_to0 == 1)) && rjh == 2 - InvariantResult [Line: 2322]: Loop Invariant Derived loop invariant: ((((handle == chuck___0 && !(1 == rjh___0)) && handle == 3) && 0 == op4) && !(__ste_email_to0 == 1)) && rjh == 2 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((handle == chuck___0 && !(1 == rjh___0)) && handle == 3) && __ste_client_forwardReceiver1 == 0) && !(handle == 1)) && !(__ste_email_to0 == 1)) && rjh == 2 - InvariantResult [Line: 2591]: Loop Invariant Derived loop invariant: ((((handle == chuck___0 && !(1 == rjh___0)) && 0 == op1) && handle == 3) && !(__ste_email_to0 == 1)) && rjh == 2 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((handle == chuck___0 && !(1 == rjh___0)) && handle == 3) && 0 == op4) && !(__ste_email_to0 == 1)) && rjh == 2 - InvariantResult [Line: 1353]: Loop Invariant Derived loop invariant: (((handle == chuck___0 && !(1 == rjh___0)) && handle == 3) && !(__ste_email_to0 == 1)) && rjh == 2 - InvariantResult [Line: 846]: Loop Invariant Derived loop invariant: (((handle == chuck___0 && !(1 == rjh___0)) && handle == 3) && !(__ste_email_to0 == 1)) && rjh == 2 - InvariantResult [Line: 2430]: Loop Invariant Derived loop invariant: ((((handle == chuck___0 && !(1 == rjh___0)) && handle == 3) && 0 == op4) && !(__ste_email_to0 == 1)) && rjh == 2 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((((((handle == chuck___0 && 1 == handle) && handle == 3) && 2 == client) && 1 == handle) && value == 2) && !(1 == rjh___0)) && 1 == msg) && __ste_email_to0 == 2) && 2 == \result) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (!(rjh == 1) && __ste_client_forwardReceiver1 == 0) && !(__ste_email_to0 == 1) - InvariantResult [Line: 171]: Loop Invariant Derived loop invariant: (((((handle == chuck___0 && !(1 == rjh___0)) && handle == 3) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2 - InvariantResult [Line: 134]: Loop Invariant Derived loop invariant: (((((handle == chuck___0 && !(1 == rjh___0)) && handle == 3) && 2 == to) && !(__ste_email_to0 == 1)) && 1 == msg) && rjh == 2 - InvariantResult [Line: 1339]: Loop Invariant Derived loop invariant: (((handle == chuck___0 && !(1 == rjh___0)) && handle == 3) && !(__ste_email_to0 == 1)) && rjh == 2 - InvariantResult [Line: 1603]: Loop Invariant Derived loop invariant: (((((__ste_email_to0 == 2 && 2 == handle) && 2 == client) && ((1 == msg && \result == 1) && (handle == chuck___0 && !(1 == rjh___0)) && handle == 3) && 1 == msg) && 2 == to) && rjh == 2) || ((((((2 == to && (1 == msg && \result == 1) && (handle == chuck___0 && !(1 == rjh___0)) && handle == 3) && rjh == 2) && 1 == handle) && 1 == msg) && \result == 1) && 1 == tmp) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((handle == chuck___0 && !(1 == rjh___0)) && handle == 3) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((__ste_client_forwardReceiver1 == 0 && rjh == handle) && !(handle == 1)) && handle == rjh___0) && !(__ste_email_to0 == 1)) && rjh == 2 - InvariantResult [Line: 551]: Loop Invariant Derived loop invariant: ((((((((handle == chuck___0 && !(1 == rjh___0)) && __ste_email_to0 == 2) && handle == 3) && \result == 1) && 1 == handle) && 2 == to) && value == 2) && 1 == msg) && rjh == 2 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((__ste_client_forwardReceiver1 == 0 && rjh == handle) && handle == rjh___0) && !(__ste_email_to0 == 1)) && rjh == 2 - InvariantResult [Line: 171]: Loop Invariant Derived loop invariant: ((1 == handle && ((((1 == msg && 1 == handle) && \result == 1) && (handle == chuck___0 && !(1 == rjh___0)) && handle == 3) && 2 == to) && rjh == 2) && 1 == msg) || ((((((((((1 == msg && __ste_email_to0 == 2) && 1 == handle) && 2 == handle) && 2 == \result) && 2 == client) && \result == 1) && 2 == to) && (handle == chuck___0 && !(1 == rjh___0)) && handle == 3) && 1 == msg) && rjh == 2) - InvariantResult [Line: 744]: Loop Invariant Derived loop invariant: ((((handle == chuck___0 && !(1 == rjh___0)) && 0 == op1) && handle == 3) && !(__ste_email_to0 == 1)) && rjh == 2 - InvariantResult [Line: 2322]: Loop Invariant Derived loop invariant: ((((handle == chuck___0 && !(1 == rjh___0)) && 0 == op1) && handle == 3) && !(__ste_email_to0 == 1)) && rjh == 2 - InvariantResult [Line: 723]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((handle == chuck___0 && !(1 == rjh___0)) && handle == 3) && !(handle == 2)) && __ste_client_forwardReceiver1 == 0) && !(handle == 1)) && !(__ste_email_to0 == 1)) && rjh == 2 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 329 locations, 2 error locations. Result: SAFE, OverallTime: 26.2s, OverallIterations: 17, TraceHistogramMax: 2, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 19.9s, HoareTripleCheckerStatistics: 10111 SDtfs, 14239 SDslu, 17973 SDs, 0 SdLazy, 738 SolverSat, 133 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 133 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 302 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9904occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 17 MinimizatonAttempts, 2643 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 88 LocationsWithAnnotation, 88 PreInvPairs, 2337 NumberOfFragments, 2672 HoareAnnotationTreeSize, 88 FomulaSimplifications, 34402110 FormulaSimplificationTreeSizeReduction, 5.3s HoareSimplificationTime, 88 FomulaSimplificationsInter, 22042796 FormulaSimplificationTreeSizeReductionInter, 14.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 913 NumberOfCodeBlocks, 913 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 896 ConstructedInterpolants, 0 QuantifiedInterpolants, 72720 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 22/22 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...