./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/product-lines/email_spec0_product10_true-unreach-call_true-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_f82ce3df-e58b-4def-ab81-e7dff9c6ba2b/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_f82ce3df-e58b-4def-ab81-e7dff9c6ba2b/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_f82ce3df-e58b-4def-ab81-e7dff9c6ba2b/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_f82ce3df-e58b-4def-ab81-e7dff9c6ba2b/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/product-lines/email_spec0_product10_true-unreach-call_true-termination.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_f82ce3df-e58b-4def-ab81-e7dff9c6ba2b/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_f82ce3df-e58b-4def-ab81-e7dff9c6ba2b/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 34ea1153081835871d2d8c4250456d7ca577de25 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 13:28:33,946 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 13:28:33,948 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 13:28:33,954 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 13:28:33,955 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 13:28:33,955 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 13:28:33,956 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 13:28:33,958 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 13:28:33,959 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 13:28:33,959 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 13:28:33,960 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 13:28:33,960 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 13:28:33,961 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 13:28:33,961 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 13:28:33,962 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 13:28:33,962 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 13:28:33,962 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 13:28:33,963 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 13:28:33,964 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 13:28:33,966 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 13:28:33,967 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 13:28:33,968 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 13:28:33,969 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 13:28:33,969 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 13:28:33,969 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 13:28:33,970 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 13:28:33,970 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 13:28:33,971 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 13:28:33,971 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 13:28:33,972 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 13:28:33,972 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 13:28:33,973 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 13:28:33,973 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 13:28:33,973 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 13:28:33,974 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 13:28:33,974 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 13:28:33,974 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_f82ce3df-e58b-4def-ab81-e7dff9c6ba2b/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-10 13:28:33,982 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 13:28:33,982 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 13:28:33,986 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 13:28:33,986 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-10 13:28:33,986 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-10 13:28:33,987 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-10 13:28:33,987 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-10 13:28:33,987 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-10 13:28:33,987 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-10 13:28:33,987 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-10 13:28:33,987 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-10 13:28:33,988 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 13:28:33,988 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 13:28:33,988 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 13:28:33,988 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 13:28:33,988 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 13:28:33,988 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 13:28:33,988 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 13:28:33,988 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 13:28:33,988 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 13:28:33,988 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 13:28:33,988 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 13:28:33,989 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 13:28:33,989 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 13:28:33,989 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 13:28:33,989 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 13:28:33,989 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 13:28:33,989 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 13:28:33,989 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 13:28:33,989 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 13:28:33,989 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-10 13:28:33,989 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 13:28:33,989 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 13:28:33,990 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-10 13:28:33,990 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_f82ce3df-e58b-4def-ab81-e7dff9c6ba2b/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 34ea1153081835871d2d8c4250456d7ca577de25 [2018-11-10 13:28:34,013 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 13:28:34,021 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 13:28:34,023 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 13:28:34,024 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 13:28:34,025 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 13:28:34,026 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_f82ce3df-e58b-4def-ab81-e7dff9c6ba2b/bin-2019/utaipan/../../sv-benchmarks/c/product-lines/email_spec0_product10_true-unreach-call_true-termination.cil.c [2018-11-10 13:28:34,064 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f82ce3df-e58b-4def-ab81-e7dff9c6ba2b/bin-2019/utaipan/data/1c790113a/f3af19a72b084ea7ab5095e64b63386d/FLAG08b661d29 [2018-11-10 13:28:34,551 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 13:28:34,552 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_f82ce3df-e58b-4def-ab81-e7dff9c6ba2b/sv-benchmarks/c/product-lines/email_spec0_product10_true-unreach-call_true-termination.cil.c [2018-11-10 13:28:34,564 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f82ce3df-e58b-4def-ab81-e7dff9c6ba2b/bin-2019/utaipan/data/1c790113a/f3af19a72b084ea7ab5095e64b63386d/FLAG08b661d29 [2018-11-10 13:28:34,573 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_f82ce3df-e58b-4def-ab81-e7dff9c6ba2b/bin-2019/utaipan/data/1c790113a/f3af19a72b084ea7ab5095e64b63386d [2018-11-10 13:28:34,575 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 13:28:34,576 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 13:28:34,577 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 13:28:34,577 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 13:28:34,579 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 13:28:34,580 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:28:34" (1/1) ... [2018-11-10 13:28:34,582 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4441de1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:28:34, skipping insertion in model container [2018-11-10 13:28:34,582 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:28:34" (1/1) ... [2018-11-10 13:28:34,588 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 13:28:34,627 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 13:28:34,919 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 13:28:34,928 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 13:28:35,062 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 13:28:35,091 INFO L193 MainTranslator]: Completed translation [2018-11-10 13:28:35,092 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:28:35 WrapperNode [2018-11-10 13:28:35,092 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 13:28:35,092 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 13:28:35,092 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 13:28:35,092 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 13:28:35,097 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:28:35" (1/1) ... [2018-11-10 13:28:35,117 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:28:35" (1/1) ... [2018-11-10 13:28:35,140 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 13:28:35,140 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 13:28:35,140 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 13:28:35,141 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 13:28:35,146 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:28:35" (1/1) ... [2018-11-10 13:28:35,146 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:28:35" (1/1) ... [2018-11-10 13:28:35,151 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:28:35" (1/1) ... [2018-11-10 13:28:35,152 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:28:35" (1/1) ... [2018-11-10 13:28:35,164 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:28:35" (1/1) ... [2018-11-10 13:28:35,171 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:28:35" (1/1) ... [2018-11-10 13:28:35,176 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:28:35" (1/1) ... [2018-11-10 13:28:35,181 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 13:28:35,182 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 13:28:35,182 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 13:28:35,182 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 13:28:35,183 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:28:35" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f82ce3df-e58b-4def-ab81-e7dff9c6ba2b/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 13:28:35,221 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_client [2018-11-10 13:28:35,221 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_client [2018-11-10 13:28:35,221 INFO L130 BoogieDeclarations]: Found specification of procedure bobToRjh [2018-11-10 13:28:35,221 INFO L138 BoogieDeclarations]: Found implementation of procedure bobToRjh [2018-11-10 13:28:35,221 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob [2018-11-10 13:28:35,221 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob [2018-11-10 13:28:35,221 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2018-11-10 13:28:35,221 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2018-11-10 13:28:35,222 INFO L130 BoogieDeclarations]: Found specification of procedure createEmail [2018-11-10 13:28:35,222 INFO L138 BoogieDeclarations]: Found implementation of procedure createEmail [2018-11-10 13:28:35,222 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2018-11-10 13:28:35,223 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2018-11-10 13:28:35,223 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_email [2018-11-10 13:28:35,223 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_email [2018-11-10 13:28:35,223 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2018-11-10 13:28:35,223 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2018-11-10 13:28:35,223 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2018-11-10 13:28:35,223 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2018-11-10 13:28:35,223 INFO L130 BoogieDeclarations]: Found specification of procedure getClientId [2018-11-10 13:28:35,223 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientId [2018-11-10 13:28:35,224 INFO L130 BoogieDeclarations]: Found specification of procedure deliver [2018-11-10 13:28:35,224 INFO L138 BoogieDeclarations]: Found implementation of procedure deliver [2018-11-10 13:28:35,224 INFO L130 BoogieDeclarations]: Found specification of procedure rjhSetAutoRespond [2018-11-10 13:28:35,224 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhSetAutoRespond [2018-11-10 13:28:35,224 INFO L130 BoogieDeclarations]: Found specification of procedure forward [2018-11-10 13:28:35,224 INFO L138 BoogieDeclarations]: Found implementation of procedure forward [2018-11-10 13:28:35,224 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 13:28:35,224 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 13:28:35,224 INFO L130 BoogieDeclarations]: Found specification of procedure rjhEnableForwarding [2018-11-10 13:28:35,225 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhEnableForwarding [2018-11-10 13:28:35,225 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__DecryptForward_spec__1 [2018-11-10 13:28:35,225 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__DecryptForward_spec__1 [2018-11-10 13:28:35,225 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2018-11-10 13:28:35,225 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2018-11-10 13:28:35,225 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2018-11-10 13:28:35,225 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2018-11-10 13:28:35,225 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2018-11-10 13:28:35,225 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2018-11-10 13:28:35,226 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2018-11-10 13:28:35,226 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2018-11-10 13:28:35,226 INFO L130 BoogieDeclarations]: Found specification of procedure mail [2018-11-10 13:28:35,226 INFO L138 BoogieDeclarations]: Found implementation of procedure mail [2018-11-10 13:28:35,226 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 13:28:35,226 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 13:28:35,226 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailId [2018-11-10 13:28:35,226 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailId [2018-11-10 13:28:35,226 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh [2018-11-10 13:28:35,227 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh [2018-11-10 13:28:35,227 INFO L130 BoogieDeclarations]: Found specification of procedure autoRespond [2018-11-10 13:28:35,227 INFO L138 BoogieDeclarations]: Found implementation of procedure autoRespond [2018-11-10 13:28:35,227 INFO L130 BoogieDeclarations]: Found specification of procedure getClientForwardReceiver [2018-11-10 13:28:35,227 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientForwardReceiver [2018-11-10 13:28:35,227 INFO L130 BoogieDeclarations]: Found specification of procedure incoming [2018-11-10 13:28:35,227 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming [2018-11-10 13:28:35,227 INFO L130 BoogieDeclarations]: Found specification of procedure test [2018-11-10 13:28:35,228 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2018-11-10 13:28:35,228 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAutoResponse [2018-11-10 13:28:35,228 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAutoResponse [2018-11-10 13:28:35,228 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2018-11-10 13:28:35,228 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2018-11-10 13:28:35,228 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2018-11-10 13:28:35,228 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2018-11-10 13:28:35,228 INFO L130 BoogieDeclarations]: Found specification of procedure setClientForwardReceiver [2018-11-10 13:28:35,228 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientForwardReceiver [2018-11-10 13:28:35,228 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2018-11-10 13:28:35,229 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2018-11-10 13:28:35,229 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__AutoResponder [2018-11-10 13:28:35,229 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__AutoResponder [2018-11-10 13:28:35,229 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck [2018-11-10 13:28:35,229 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck [2018-11-10 13:28:35,229 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2018-11-10 13:28:35,229 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2018-11-10 13:28:35,229 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAutoResponse [2018-11-10 13:28:35,229 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAutoResponse [2018-11-10 13:28:35,229 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Base [2018-11-10 13:28:35,230 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Base [2018-11-10 13:28:35,230 INFO L130 BoogieDeclarations]: Found specification of procedure printMail [2018-11-10 13:28:35,230 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail [2018-11-10 13:28:35,230 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2018-11-10 13:28:35,230 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2018-11-10 13:28:35,230 INFO L130 BoogieDeclarations]: Found specification of procedure is_queue_empty [2018-11-10 13:28:35,230 INFO L138 BoogieDeclarations]: Found implementation of procedure is_queue_empty [2018-11-10 13:28:35,230 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 13:28:35,230 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 13:28:35,230 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2018-11-10 13:28:35,231 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2018-11-10 13:28:35,963 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 13:28:35,963 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:28:35 BoogieIcfgContainer [2018-11-10 13:28:35,963 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 13:28:35,964 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 13:28:35,964 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 13:28:35,967 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 13:28:35,967 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 01:28:34" (1/3) ... [2018-11-10 13:28:35,968 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@312c6033 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 01:28:35, skipping insertion in model container [2018-11-10 13:28:35,968 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:28:35" (2/3) ... [2018-11-10 13:28:35,968 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@312c6033 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 01:28:35, skipping insertion in model container [2018-11-10 13:28:35,969 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:28:35" (3/3) ... [2018-11-10 13:28:35,970 INFO L112 eAbstractionObserver]: Analyzing ICFG email_spec0_product10_true-unreach-call_true-termination.cil.c [2018-11-10 13:28:35,978 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 13:28:35,987 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 13:28:35,999 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 13:28:36,026 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 13:28:36,027 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 13:28:36,027 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 13:28:36,027 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 13:28:36,027 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 13:28:36,027 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 13:28:36,027 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 13:28:36,027 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 13:28:36,046 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states. [2018-11-10 13:28:36,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-11-10 13:28:36,057 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:28:36,057 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:28:36,060 INFO L424 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:28:36,064 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:28:36,064 INFO L82 PathProgramCache]: Analyzing trace with hash -893221408, now seen corresponding path program 1 times [2018-11-10 13:28:36,066 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:28:36,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:28:36,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:28:36,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:28:36,110 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:28:36,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:28:36,384 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-10 13:28:36,386 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:28:36,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 13:28:36,386 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:28:36,391 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-10 13:28:36,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-10 13:28:36,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 13:28:36,403 INFO L87 Difference]: Start difference. First operand 259 states. Second operand 2 states. [2018-11-10 13:28:36,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:28:36,435 INFO L93 Difference]: Finished difference Result 420 states and 526 transitions. [2018-11-10 13:28:36,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 13:28:36,436 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 141 [2018-11-10 13:28:36,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:28:36,447 INFO L225 Difference]: With dead ends: 420 [2018-11-10 13:28:36,447 INFO L226 Difference]: Without dead ends: 248 [2018-11-10 13:28:36,451 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 13:28:36,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-11-10 13:28:36,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 248. [2018-11-10 13:28:36,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-11-10 13:28:36,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 310 transitions. [2018-11-10 13:28:36,499 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 310 transitions. Word has length 141 [2018-11-10 13:28:36,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:28:36,501 INFO L481 AbstractCegarLoop]: Abstraction has 248 states and 310 transitions. [2018-11-10 13:28:36,501 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-10 13:28:36,501 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 310 transitions. [2018-11-10 13:28:36,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-11-10 13:28:36,503 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:28:36,503 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:28:36,503 INFO L424 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:28:36,504 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:28:36,504 INFO L82 PathProgramCache]: Analyzing trace with hash 2052789550, now seen corresponding path program 1 times [2018-11-10 13:28:36,504 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:28:36,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:28:36,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:28:36,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:28:36,506 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:28:36,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:28:36,677 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-10 13:28:36,677 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:28:36,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 13:28:36,677 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:28:36,679 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 13:28:36,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 13:28:36,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 13:28:36,680 INFO L87 Difference]: Start difference. First operand 248 states and 310 transitions. Second operand 3 states. [2018-11-10 13:28:36,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:28:36,722 INFO L93 Difference]: Finished difference Result 404 states and 495 transitions. [2018-11-10 13:28:36,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 13:28:36,722 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 143 [2018-11-10 13:28:36,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:28:36,725 INFO L225 Difference]: With dead ends: 404 [2018-11-10 13:28:36,725 INFO L226 Difference]: Without dead ends: 252 [2018-11-10 13:28:36,726 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 13:28:36,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2018-11-10 13:28:36,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 251. [2018-11-10 13:28:36,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-11-10 13:28:36,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 313 transitions. [2018-11-10 13:28:36,743 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 313 transitions. Word has length 143 [2018-11-10 13:28:36,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:28:36,743 INFO L481 AbstractCegarLoop]: Abstraction has 251 states and 313 transitions. [2018-11-10 13:28:36,743 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 13:28:36,743 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 313 transitions. [2018-11-10 13:28:36,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-11-10 13:28:36,746 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:28:36,746 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:28:36,746 INFO L424 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:28:36,746 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:28:36,747 INFO L82 PathProgramCache]: Analyzing trace with hash -1761156287, now seen corresponding path program 1 times [2018-11-10 13:28:36,747 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:28:36,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:28:36,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:28:36,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:28:36,748 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:28:36,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:28:36,880 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-10 13:28:36,880 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:28:36,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 13:28:36,880 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:28:36,881 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 13:28:36,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 13:28:36,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 13:28:36,881 INFO L87 Difference]: Start difference. First operand 251 states and 313 transitions. Second operand 6 states. [2018-11-10 13:28:37,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:28:37,189 INFO L93 Difference]: Finished difference Result 600 states and 750 transitions. [2018-11-10 13:28:37,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 13:28:37,189 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 149 [2018-11-10 13:28:37,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:28:37,194 INFO L225 Difference]: With dead ends: 600 [2018-11-10 13:28:37,194 INFO L226 Difference]: Without dead ends: 461 [2018-11-10 13:28:37,196 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-10 13:28:37,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2018-11-10 13:28:37,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 452. [2018-11-10 13:28:37,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2018-11-10 13:28:37,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 574 transitions. [2018-11-10 13:28:37,223 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 574 transitions. Word has length 149 [2018-11-10 13:28:37,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:28:37,223 INFO L481 AbstractCegarLoop]: Abstraction has 452 states and 574 transitions. [2018-11-10 13:28:37,223 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 13:28:37,223 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 574 transitions. [2018-11-10 13:28:37,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-11-10 13:28:37,226 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:28:37,226 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:28:37,226 INFO L424 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:28:37,227 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:28:37,227 INFO L82 PathProgramCache]: Analyzing trace with hash -1280066642, now seen corresponding path program 1 times [2018-11-10 13:28:37,227 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:28:37,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:28:37,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:28:37,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:28:37,228 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:28:37,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:28:37,355 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-10 13:28:37,355 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:28:37,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-10 13:28:37,355 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:28:37,356 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 13:28:37,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 13:28:37,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-10 13:28:37,356 INFO L87 Difference]: Start difference. First operand 452 states and 574 transitions. Second operand 9 states. [2018-11-10 13:28:37,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:28:37,491 INFO L93 Difference]: Finished difference Result 761 states and 952 transitions. [2018-11-10 13:28:37,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 13:28:37,492 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 150 [2018-11-10 13:28:37,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:28:37,494 INFO L225 Difference]: With dead ends: 761 [2018-11-10 13:28:37,495 INFO L226 Difference]: Without dead ends: 482 [2018-11-10 13:28:37,496 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-11-10 13:28:37,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2018-11-10 13:28:37,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 472. [2018-11-10 13:28:37,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 472 states. [2018-11-10 13:28:37,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 600 transitions. [2018-11-10 13:28:37,522 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 600 transitions. Word has length 150 [2018-11-10 13:28:37,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:28:37,522 INFO L481 AbstractCegarLoop]: Abstraction has 472 states and 600 transitions. [2018-11-10 13:28:37,523 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 13:28:37,523 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 600 transitions. [2018-11-10 13:28:37,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-11-10 13:28:37,525 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:28:37,525 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:28:37,525 INFO L424 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:28:37,525 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:28:37,525 INFO L82 PathProgramCache]: Analyzing trace with hash -670599007, now seen corresponding path program 1 times [2018-11-10 13:28:37,525 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:28:37,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:28:37,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:28:37,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:28:37,526 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:28:37,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:28:37,661 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-10 13:28:37,661 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:28:37,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 13:28:37,662 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:28:37,662 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 13:28:37,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 13:28:37,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 13:28:37,663 INFO L87 Difference]: Start difference. First operand 472 states and 600 transitions. Second operand 6 states. [2018-11-10 13:28:37,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:28:37,898 INFO L93 Difference]: Finished difference Result 1214 states and 1534 transitions. [2018-11-10 13:28:37,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 13:28:37,898 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 151 [2018-11-10 13:28:37,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:28:37,901 INFO L225 Difference]: With dead ends: 1214 [2018-11-10 13:28:37,901 INFO L226 Difference]: Without dead ends: 915 [2018-11-10 13:28:37,902 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-10 13:28:37,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 915 states. [2018-11-10 13:28:37,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 915 to 894. [2018-11-10 13:28:37,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 894 states. [2018-11-10 13:28:37,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 894 states to 894 states and 1150 transitions. [2018-11-10 13:28:37,939 INFO L78 Accepts]: Start accepts. Automaton has 894 states and 1150 transitions. Word has length 151 [2018-11-10 13:28:37,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:28:37,939 INFO L481 AbstractCegarLoop]: Abstraction has 894 states and 1150 transitions. [2018-11-10 13:28:37,939 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 13:28:37,939 INFO L276 IsEmpty]: Start isEmpty. Operand 894 states and 1150 transitions. [2018-11-10 13:28:37,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-11-10 13:28:37,941 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:28:37,942 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:28:37,942 INFO L424 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:28:37,942 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:28:37,942 INFO L82 PathProgramCache]: Analyzing trace with hash -1394819894, now seen corresponding path program 1 times [2018-11-10 13:28:37,942 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:28:37,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:28:37,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:28:37,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:28:37,943 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:28:37,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:28:38,038 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-10 13:28:38,038 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:28:38,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-10 13:28:38,038 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:28:38,039 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 13:28:38,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 13:28:38,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-10 13:28:38,039 INFO L87 Difference]: Start difference. First operand 894 states and 1150 transitions. Second operand 9 states. [2018-11-10 13:28:38,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:28:38,138 INFO L93 Difference]: Finished difference Result 1553 states and 1965 transitions. [2018-11-10 13:28:38,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 13:28:38,139 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 152 [2018-11-10 13:28:38,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:28:38,141 INFO L225 Difference]: With dead ends: 1553 [2018-11-10 13:28:38,142 INFO L226 Difference]: Without dead ends: 954 [2018-11-10 13:28:38,143 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-11-10 13:28:38,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2018-11-10 13:28:38,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 934. [2018-11-10 13:28:38,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 934 states. [2018-11-10 13:28:38,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 934 states to 934 states and 1202 transitions. [2018-11-10 13:28:38,169 INFO L78 Accepts]: Start accepts. Automaton has 934 states and 1202 transitions. Word has length 152 [2018-11-10 13:28:38,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:28:38,170 INFO L481 AbstractCegarLoop]: Abstraction has 934 states and 1202 transitions. [2018-11-10 13:28:38,170 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 13:28:38,170 INFO L276 IsEmpty]: Start isEmpty. Operand 934 states and 1202 transitions. [2018-11-10 13:28:38,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-11-10 13:28:38,172 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:28:38,172 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:28:38,172 INFO L424 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:28:38,173 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:28:38,173 INFO L82 PathProgramCache]: Analyzing trace with hash 43251969, now seen corresponding path program 1 times [2018-11-10 13:28:38,173 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:28:38,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:28:38,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:28:38,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:28:38,174 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:28:38,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:28:38,254 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-10 13:28:38,255 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:28:38,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 13:28:38,255 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:28:38,255 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 13:28:38,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 13:28:38,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 13:28:38,256 INFO L87 Difference]: Start difference. First operand 934 states and 1202 transitions. Second operand 6 states. [2018-11-10 13:28:38,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:28:38,432 INFO L93 Difference]: Finished difference Result 2450 states and 3123 transitions. [2018-11-10 13:28:38,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 13:28:38,432 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 153 [2018-11-10 13:28:38,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:28:38,437 INFO L225 Difference]: With dead ends: 2450 [2018-11-10 13:28:38,437 INFO L226 Difference]: Without dead ends: 1670 [2018-11-10 13:28:38,439 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-10 13:28:38,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1670 states. [2018-11-10 13:28:38,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1670 to 1636. [2018-11-10 13:28:38,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1636 states. [2018-11-10 13:28:38,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1636 states to 1636 states and 2138 transitions. [2018-11-10 13:28:38,521 INFO L78 Accepts]: Start accepts. Automaton has 1636 states and 2138 transitions. Word has length 153 [2018-11-10 13:28:38,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:28:38,521 INFO L481 AbstractCegarLoop]: Abstraction has 1636 states and 2138 transitions. [2018-11-10 13:28:38,521 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 13:28:38,521 INFO L276 IsEmpty]: Start isEmpty. Operand 1636 states and 2138 transitions. [2018-11-10 13:28:38,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-11-10 13:28:38,524 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:28:38,524 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:28:38,524 INFO L424 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:28:38,524 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:28:38,524 INFO L82 PathProgramCache]: Analyzing trace with hash -775380321, now seen corresponding path program 1 times [2018-11-10 13:28:38,524 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:28:38,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:28:38,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:28:38,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:28:38,525 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:28:38,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:28:38,571 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-10 13:28:38,572 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:28:38,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 13:28:38,572 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:28:38,572 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 13:28:38,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 13:28:38,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 13:28:38,573 INFO L87 Difference]: Start difference. First operand 1636 states and 2138 transitions. Second operand 3 states. [2018-11-10 13:28:38,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:28:38,624 INFO L93 Difference]: Finished difference Result 3463 states and 4663 transitions. [2018-11-10 13:28:38,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 13:28:38,625 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 163 [2018-11-10 13:28:38,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:28:38,630 INFO L225 Difference]: With dead ends: 3463 [2018-11-10 13:28:38,630 INFO L226 Difference]: Without dead ends: 1875 [2018-11-10 13:28:38,633 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 13:28:38,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1875 states. [2018-11-10 13:28:38,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1875 to 1868. [2018-11-10 13:28:38,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1868 states. [2018-11-10 13:28:38,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1868 states to 1868 states and 2563 transitions. [2018-11-10 13:28:38,679 INFO L78 Accepts]: Start accepts. Automaton has 1868 states and 2563 transitions. Word has length 163 [2018-11-10 13:28:38,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:28:38,680 INFO L481 AbstractCegarLoop]: Abstraction has 1868 states and 2563 transitions. [2018-11-10 13:28:38,680 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 13:28:38,680 INFO L276 IsEmpty]: Start isEmpty. Operand 1868 states and 2563 transitions. [2018-11-10 13:28:38,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-11-10 13:28:38,682 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:28:38,683 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:28:38,683 INFO L424 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:28:38,683 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:28:38,683 INFO L82 PathProgramCache]: Analyzing trace with hash -2053268372, now seen corresponding path program 1 times [2018-11-10 13:28:38,683 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:28:38,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:28:38,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:28:38,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:28:38,684 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:28:38,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:28:38,744 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-10 13:28:38,744 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:28:38,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 13:28:38,744 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:28:38,744 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 13:28:38,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 13:28:38,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 13:28:38,745 INFO L87 Difference]: Start difference. First operand 1868 states and 2563 transitions. Second operand 3 states. [2018-11-10 13:28:38,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:28:38,797 INFO L93 Difference]: Finished difference Result 4119 states and 5874 transitions. [2018-11-10 13:28:38,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 13:28:38,797 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 164 [2018-11-10 13:28:38,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:28:38,803 INFO L225 Difference]: With dead ends: 4119 [2018-11-10 13:28:38,803 INFO L226 Difference]: Without dead ends: 2299 [2018-11-10 13:28:38,806 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 13:28:38,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2299 states. [2018-11-10 13:28:38,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2299 to 2292. [2018-11-10 13:28:38,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2292 states. [2018-11-10 13:28:38,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2292 states to 2292 states and 3341 transitions. [2018-11-10 13:28:38,864 INFO L78 Accepts]: Start accepts. Automaton has 2292 states and 3341 transitions. Word has length 164 [2018-11-10 13:28:38,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:28:38,864 INFO L481 AbstractCegarLoop]: Abstraction has 2292 states and 3341 transitions. [2018-11-10 13:28:38,864 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 13:28:38,864 INFO L276 IsEmpty]: Start isEmpty. Operand 2292 states and 3341 transitions. [2018-11-10 13:28:38,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-11-10 13:28:38,867 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:28:38,868 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:28:38,868 INFO L424 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:28:38,868 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:28:38,868 INFO L82 PathProgramCache]: Analyzing trace with hash 1414320033, now seen corresponding path program 1 times [2018-11-10 13:28:38,868 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:28:38,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:28:38,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:28:38,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:28:38,869 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:28:38,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:28:38,924 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-10 13:28:38,924 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:28:38,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 13:28:38,924 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:28:38,925 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 13:28:38,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 13:28:38,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 13:28:38,925 INFO L87 Difference]: Start difference. First operand 2292 states and 3341 transitions. Second operand 3 states. [2018-11-10 13:28:39,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:28:39,016 INFO L93 Difference]: Finished difference Result 5407 states and 8224 transitions. [2018-11-10 13:28:39,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 13:28:39,016 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 165 [2018-11-10 13:28:39,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:28:39,024 INFO L225 Difference]: With dead ends: 5407 [2018-11-10 13:28:39,024 INFO L226 Difference]: Without dead ends: 3163 [2018-11-10 13:28:39,027 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 13:28:39,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3163 states. [2018-11-10 13:28:39,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3163 to 3156. [2018-11-10 13:28:39,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3156 states. [2018-11-10 13:28:39,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3156 states to 3156 states and 4897 transitions. [2018-11-10 13:28:39,103 INFO L78 Accepts]: Start accepts. Automaton has 3156 states and 4897 transitions. Word has length 165 [2018-11-10 13:28:39,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:28:39,103 INFO L481 AbstractCegarLoop]: Abstraction has 3156 states and 4897 transitions. [2018-11-10 13:28:39,103 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 13:28:39,103 INFO L276 IsEmpty]: Start isEmpty. Operand 3156 states and 4897 transitions. [2018-11-10 13:28:39,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-11-10 13:28:39,108 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:28:39,108 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:28:39,108 INFO L424 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:28:39,108 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:28:39,108 INFO L82 PathProgramCache]: Analyzing trace with hash -697212564, now seen corresponding path program 1 times [2018-11-10 13:28:39,109 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:28:39,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:28:39,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:28:39,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:28:39,109 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:28:39,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:28:39,160 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-10 13:28:39,160 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:28:39,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 13:28:39,160 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:28:39,161 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 13:28:39,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 13:28:39,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 13:28:39,161 INFO L87 Difference]: Start difference. First operand 3156 states and 4897 transitions. Second operand 3 states. [2018-11-10 13:28:39,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:28:39,268 INFO L93 Difference]: Finished difference Result 7967 states and 12828 transitions. [2018-11-10 13:28:39,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 13:28:39,268 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 166 [2018-11-10 13:28:39,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:28:39,280 INFO L225 Difference]: With dead ends: 7967 [2018-11-10 13:28:39,280 INFO L226 Difference]: Without dead ends: 4859 [2018-11-10 13:28:39,285 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 13:28:39,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4859 states. [2018-11-10 13:28:39,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4859 to 4852. [2018-11-10 13:28:39,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4852 states. [2018-11-10 13:28:39,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4852 states to 4852 states and 7913 transitions. [2018-11-10 13:28:39,415 INFO L78 Accepts]: Start accepts. Automaton has 4852 states and 7913 transitions. Word has length 166 [2018-11-10 13:28:39,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:28:39,415 INFO L481 AbstractCegarLoop]: Abstraction has 4852 states and 7913 transitions. [2018-11-10 13:28:39,415 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 13:28:39,415 INFO L276 IsEmpty]: Start isEmpty. Operand 4852 states and 7913 transitions. [2018-11-10 13:28:39,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-11-10 13:28:39,422 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:28:39,422 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:28:39,422 INFO L424 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:28:39,422 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:28:39,423 INFO L82 PathProgramCache]: Analyzing trace with hash 1657629923, now seen corresponding path program 1 times [2018-11-10 13:28:39,423 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:28:39,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:28:39,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:28:39,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:28:39,423 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:28:39,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:28:39,480 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-10 13:28:39,480 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:28:39,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 13:28:39,480 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:28:39,481 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 13:28:39,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 13:28:39,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 13:28:39,481 INFO L87 Difference]: Start difference. First operand 4852 states and 7913 transitions. Second operand 3 states. [2018-11-10 13:28:39,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:28:39,729 INFO L93 Difference]: Finished difference Result 12991 states and 21748 transitions. [2018-11-10 13:28:39,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 13:28:39,729 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 167 [2018-11-10 13:28:39,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:28:39,748 INFO L225 Difference]: With dead ends: 12991 [2018-11-10 13:28:39,748 INFO L226 Difference]: Without dead ends: 8187 [2018-11-10 13:28:39,755 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 13:28:39,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8187 states. [2018-11-10 13:28:39,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8187 to 8180. [2018-11-10 13:28:39,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8180 states. [2018-11-10 13:28:39,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8180 states to 8180 states and 13753 transitions. [2018-11-10 13:28:39,958 INFO L78 Accepts]: Start accepts. Automaton has 8180 states and 13753 transitions. Word has length 167 [2018-11-10 13:28:39,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:28:39,958 INFO L481 AbstractCegarLoop]: Abstraction has 8180 states and 13753 transitions. [2018-11-10 13:28:39,958 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 13:28:39,958 INFO L276 IsEmpty]: Start isEmpty. Operand 8180 states and 13753 transitions. [2018-11-10 13:28:39,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-11-10 13:28:39,970 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:28:39,970 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:28:39,970 INFO L424 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:28:39,971 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:28:39,971 INFO L82 PathProgramCache]: Analyzing trace with hash -325621718, now seen corresponding path program 1 times [2018-11-10 13:28:39,971 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:28:39,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:28:39,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:28:39,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:28:39,972 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:28:39,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:28:40,059 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-10 13:28:40,060 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:28:40,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-10 13:28:40,060 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:28:40,060 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 13:28:40,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 13:28:40,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-10 13:28:40,061 INFO L87 Difference]: Start difference. First operand 8180 states and 13753 transitions. Second operand 8 states. [2018-11-10 13:28:40,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:28:40,207 INFO L93 Difference]: Finished difference Result 8180 states and 13753 transitions. [2018-11-10 13:28:40,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 13:28:40,208 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 168 [2018-11-10 13:28:40,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:28:40,209 INFO L225 Difference]: With dead ends: 8180 [2018-11-10 13:28:40,209 INFO L226 Difference]: Without dead ends: 0 [2018-11-10 13:28:40,217 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-10 13:28:40,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-10 13:28:40,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-10 13:28:40,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-10 13:28:40,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-10 13:28:40,218 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 168 [2018-11-10 13:28:40,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:28:40,218 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 13:28:40,218 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 13:28:40,218 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-10 13:28:40,218 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-10 13:28:40,221 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-10 13:28:41,151 INFO L428 ceAbstractionStarter]: At program point L545(line 545) the Hoare annotation is: true [2018-11-10 13:28:41,151 INFO L428 ceAbstractionStarter]: At program point L544(line 544) the Hoare annotation is: true [2018-11-10 13:28:41,151 INFO L428 ceAbstractionStarter]: At program point L545-1(line 545) the Hoare annotation is: true [2018-11-10 13:28:41,151 INFO L425 ceAbstractionStarter]: For program point L544-1(line 544) no Hoare annotation was computed. [2018-11-10 13:28:41,151 INFO L425 ceAbstractionStarter]: For program point outgoingEXIT(lines 539 550) no Hoare annotation was computed. [2018-11-10 13:28:41,151 INFO L428 ceAbstractionStarter]: At program point outgoingENTRY(lines 539 550) the Hoare annotation is: true [2018-11-10 13:28:41,151 INFO L425 ceAbstractionStarter]: For program point outgoingFINAL(lines 539 550) no Hoare annotation was computed. [2018-11-10 13:28:41,151 INFO L425 ceAbstractionStarter]: For program point L2528(lines 2528 2536) no Hoare annotation was computed. [2018-11-10 13:28:41,151 INFO L425 ceAbstractionStarter]: For program point L2531-2(lines 2521 2540) no Hoare annotation was computed. [2018-11-10 13:28:41,152 INFO L421 ceAbstractionStarter]: At program point setClientForwardReceiverENTRY(lines 2521 2540) the Hoare annotation is: (and (or (not (= 0 |old(~__ste_client_forwardReceiver2~0)|)) (= 0 ~__ste_client_forwardReceiver2~0)) (or (not (= 0 |old(~__ste_client_forwardReceiver0~0)|)) (= 0 ~__ste_client_forwardReceiver0~0)) (or (not (= 0 |old(~__ste_client_forwardReceiver1~0)|)) (= 0 ~__ste_client_forwardReceiver1~0))) [2018-11-10 13:28:41,152 INFO L425 ceAbstractionStarter]: For program point L2525(lines 2525 2537) no Hoare annotation was computed. [2018-11-10 13:28:41,152 INFO L425 ceAbstractionStarter]: For program point setClientForwardReceiverEXIT(lines 2521 2540) no Hoare annotation was computed. [2018-11-10 13:28:41,152 INFO L425 ceAbstractionStarter]: For program point L2531(lines 2531 2535) no Hoare annotation was computed. [2018-11-10 13:28:41,152 INFO L428 ceAbstractionStarter]: At program point select_helpersFINAL(lines 89 95) the Hoare annotation is: true [2018-11-10 13:28:41,152 INFO L425 ceAbstractionStarter]: For program point select_helpersEXIT(lines 89 95) no Hoare annotation was computed. [2018-11-10 13:28:41,152 INFO L425 ceAbstractionStarter]: For program point getClientIdFINAL(lines 2544 2567) no Hoare annotation was computed. [2018-11-10 13:28:41,152 INFO L425 ceAbstractionStarter]: For program point L2556(lines 2556 2562) no Hoare annotation was computed. [2018-11-10 13:28:41,152 INFO L428 ceAbstractionStarter]: At program point getClientIdENTRY(lines 2544 2567) the Hoare annotation is: true [2018-11-10 13:28:41,152 INFO L425 ceAbstractionStarter]: For program point L2552(lines 2552 2563) no Hoare annotation was computed. [2018-11-10 13:28:41,152 INFO L425 ceAbstractionStarter]: For program point L2548(lines 2548 2564) no Hoare annotation was computed. [2018-11-10 13:28:41,152 INFO L425 ceAbstractionStarter]: For program point getClientIdEXIT(lines 2544 2567) no Hoare annotation was computed. [2018-11-10 13:28:41,152 INFO L425 ceAbstractionStarter]: For program point valid_productEXIT(lines 96 104) no Hoare annotation was computed. [2018-11-10 13:28:41,152 INFO L428 ceAbstractionStarter]: At program point valid_productENTRY(lines 96 104) the Hoare annotation is: true [2018-11-10 13:28:41,152 INFO L425 ceAbstractionStarter]: For program point valid_productFINAL(lines 96 104) no Hoare annotation was computed. [2018-11-10 13:28:41,153 INFO L428 ceAbstractionStarter]: At program point mailENTRY(lines 527 538) the Hoare annotation is: true [2018-11-10 13:28:41,153 INFO L425 ceAbstractionStarter]: For program point mailEXIT(lines 527 538) no Hoare annotation was computed. [2018-11-10 13:28:41,153 INFO L425 ceAbstractionStarter]: For program point mailFINAL(lines 527 538) no Hoare annotation was computed. [2018-11-10 13:28:41,153 INFO L428 ceAbstractionStarter]: At program point L534(line 534) the Hoare annotation is: true [2018-11-10 13:28:41,153 INFO L428 ceAbstractionStarter]: At program point L533(line 533) the Hoare annotation is: true [2018-11-10 13:28:41,153 INFO L425 ceAbstractionStarter]: For program point L533-1(line 533) no Hoare annotation was computed. [2018-11-10 13:28:41,153 INFO L425 ceAbstractionStarter]: For program point get_queued_clientEXIT(lines 657 665) no Hoare annotation was computed. [2018-11-10 13:28:41,153 INFO L428 ceAbstractionStarter]: At program point get_queued_clientENTRY(lines 657 665) the Hoare annotation is: true [2018-11-10 13:28:41,153 INFO L425 ceAbstractionStarter]: For program point get_queued_clientFINAL(lines 657 665) no Hoare annotation was computed. [2018-11-10 13:28:41,153 INFO L425 ceAbstractionStarter]: For program point L577(line 577) no Hoare annotation was computed. [2018-11-10 13:28:41,153 INFO L421 ceAbstractionStarter]: At program point L576(line 576) the Hoare annotation is: (= |incoming__wrappee__AutoResponder_#in~client| incoming__wrappee__AutoResponder_~client) [2018-11-10 13:28:41,153 INFO L421 ceAbstractionStarter]: At program point L576-1(line 576) the Hoare annotation is: (= |incoming__wrappee__AutoResponder_#in~client| incoming__wrappee__AutoResponder_~client) [2018-11-10 13:28:41,153 INFO L428 ceAbstractionStarter]: At program point incoming__wrappee__AutoResponderENTRY(lines 571 588) the Hoare annotation is: true [2018-11-10 13:28:41,154 INFO L425 ceAbstractionStarter]: For program point incoming__wrappee__AutoResponderEXIT(lines 571 588) no Hoare annotation was computed. [2018-11-10 13:28:41,154 INFO L421 ceAbstractionStarter]: At program point L581(line 581) the Hoare annotation is: (= |incoming__wrappee__AutoResponder_#in~client| incoming__wrappee__AutoResponder_~client) [2018-11-10 13:28:41,154 INFO L425 ceAbstractionStarter]: For program point L579(lines 579 585) no Hoare annotation was computed. [2018-11-10 13:28:41,154 INFO L425 ceAbstractionStarter]: For program point L579-1(lines 571 588) no Hoare annotation was computed. [2018-11-10 13:28:41,154 INFO L425 ceAbstractionStarter]: For program point deliverFINAL(lines 551 560) no Hoare annotation was computed. [2018-11-10 13:28:41,154 INFO L428 ceAbstractionStarter]: At program point deliverENTRY(lines 551 560) the Hoare annotation is: true [2018-11-10 13:28:41,154 INFO L425 ceAbstractionStarter]: For program point deliverEXIT(lines 551 560) no Hoare annotation was computed. [2018-11-10 13:28:41,154 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 808 828) the Hoare annotation is: (or (not (= 0 |old(~__ste_client_forwardReceiver1~0)|)) (and (= 0 ~__ste_client_forwardReceiver2~0) (= 0 ~__ste_client_forwardReceiver1~0) (= 0 ~__ste_client_forwardReceiver0~0)) (not (= 0 |old(~__ste_client_forwardReceiver2~0)|)) (not (= 0 |old(~__ste_client_forwardReceiver0~0)|))) [2018-11-10 13:28:41,154 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 808 828) no Hoare annotation was computed. [2018-11-10 13:28:41,154 INFO L421 ceAbstractionStarter]: At program point L820(line 820) the Hoare annotation is: (or (not (= 0 |old(~__ste_client_forwardReceiver1~0)|)) (and (= 0 ~__ste_client_forwardReceiver2~0) (= 0 ~__ste_client_forwardReceiver1~0) (= 0 ~__ste_client_forwardReceiver0~0) (= main_~tmp~12 1)) (not (= 0 |old(~__ste_client_forwardReceiver2~0)|)) (not (= 0 |old(~__ste_client_forwardReceiver0~0)|))) [2018-11-10 13:28:41,154 INFO L421 ceAbstractionStarter]: At program point L820-1(line 820) the Hoare annotation is: (or (not (= 0 |old(~__ste_client_forwardReceiver1~0)|)) (and (= 0 ~__ste_client_forwardReceiver2~0) (= 0 ~__ste_client_forwardReceiver1~0) (= 0 ~__ste_client_forwardReceiver0~0) (= main_~tmp~12 1)) (not (= 0 |old(~__ste_client_forwardReceiver2~0)|)) (not (= 0 |old(~__ste_client_forwardReceiver0~0)|))) [2018-11-10 13:28:41,154 INFO L425 ceAbstractionStarter]: For program point L818(lines 818 825) no Hoare annotation was computed. [2018-11-10 13:28:41,154 INFO L425 ceAbstractionStarter]: For program point L818-1(lines 818 825) no Hoare annotation was computed. [2018-11-10 13:28:41,155 INFO L425 ceAbstractionStarter]: For program point L816(line 816) no Hoare annotation was computed. [2018-11-10 13:28:41,155 INFO L421 ceAbstractionStarter]: At program point L815(line 815) the Hoare annotation is: (or (not (= 0 |old(~__ste_client_forwardReceiver1~0)|)) (and (= 0 ~__ste_client_forwardReceiver2~0) (= 0 ~__ste_client_forwardReceiver1~0) (= 0 ~__ste_client_forwardReceiver0~0)) (not (= 0 |old(~__ste_client_forwardReceiver2~0)|)) (not (= 0 |old(~__ste_client_forwardReceiver0~0)|))) [2018-11-10 13:28:41,155 INFO L421 ceAbstractionStarter]: At program point L814(line 814) the Hoare annotation is: (or (not (= 0 |old(~__ste_client_forwardReceiver1~0)|)) (and (= 0 ~__ste_client_forwardReceiver2~0) (= 0 ~__ste_client_forwardReceiver1~0) (= 0 ~__ste_client_forwardReceiver0~0)) (not (= 0 |old(~__ste_client_forwardReceiver2~0)|)) (not (= 0 |old(~__ste_client_forwardReceiver0~0)|))) [2018-11-10 13:28:41,155 INFO L421 ceAbstractionStarter]: At program point L814-1(line 814) the Hoare annotation is: (or (not (= 0 |old(~__ste_client_forwardReceiver1~0)|)) (and (= 0 ~__ste_client_forwardReceiver2~0) (= 0 ~__ste_client_forwardReceiver1~0) (= 0 ~__ste_client_forwardReceiver0~0)) (not (= 0 |old(~__ste_client_forwardReceiver2~0)|)) (not (= 0 |old(~__ste_client_forwardReceiver0~0)|))) [2018-11-10 13:28:41,155 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 808 828) no Hoare annotation was computed. [2018-11-10 13:28:41,155 INFO L425 ceAbstractionStarter]: For program point getEmailIdFINAL(lines 885 903) no Hoare annotation was computed. [2018-11-10 13:28:41,155 INFO L425 ceAbstractionStarter]: For program point L893(lines 893 899) no Hoare annotation was computed. [2018-11-10 13:28:41,155 INFO L425 ceAbstractionStarter]: For program point getEmailIdEXIT(lines 885 903) no Hoare annotation was computed. [2018-11-10 13:28:41,155 INFO L425 ceAbstractionStarter]: For program point L889(lines 889 900) no Hoare annotation was computed. [2018-11-10 13:28:41,155 INFO L428 ceAbstractionStarter]: At program point getEmailIdENTRY(lines 885 903) the Hoare annotation is: true [2018-11-10 13:28:41,155 INFO L425 ceAbstractionStarter]: For program point setup_chuckEXIT(lines 741 750) no Hoare annotation was computed. [2018-11-10 13:28:41,155 INFO L428 ceAbstractionStarter]: At program point setup_chuckENTRY(lines 741 750) the Hoare annotation is: true [2018-11-10 13:28:41,155 INFO L428 ceAbstractionStarter]: At program point L746(line 746) the Hoare annotation is: true [2018-11-10 13:28:41,156 INFO L425 ceAbstractionStarter]: For program point setup_chuckFINAL(lines 741 750) no Hoare annotation was computed. [2018-11-10 13:28:41,156 INFO L428 ceAbstractionStarter]: At program point L736(line 736) the Hoare annotation is: true [2018-11-10 13:28:41,156 INFO L425 ceAbstractionStarter]: For program point setup_rjhFINAL(lines 731 740) no Hoare annotation was computed. [2018-11-10 13:28:41,156 INFO L428 ceAbstractionStarter]: At program point setup_rjhENTRY(lines 731 740) the Hoare annotation is: true [2018-11-10 13:28:41,156 INFO L425 ceAbstractionStarter]: For program point setup_rjhEXIT(lines 731 740) no Hoare annotation was computed. [2018-11-10 13:28:41,156 INFO L425 ceAbstractionStarter]: For program point sendEmailEXIT(lines 625 637) no Hoare annotation was computed. [2018-11-10 13:28:41,156 INFO L428 ceAbstractionStarter]: At program point sendEmailENTRY(lines 625 637) the Hoare annotation is: true [2018-11-10 13:28:41,156 INFO L425 ceAbstractionStarter]: For program point sendEmailFINAL(lines 625 637) no Hoare annotation was computed. [2018-11-10 13:28:41,156 INFO L428 ceAbstractionStarter]: At program point L633(line 633) the Hoare annotation is: true [2018-11-10 13:28:41,156 INFO L428 ceAbstractionStarter]: At program point L631(line 631) the Hoare annotation is: true [2018-11-10 13:28:41,156 INFO L425 ceAbstractionStarter]: For program point L631-1(line 631) no Hoare annotation was computed. [2018-11-10 13:28:41,156 INFO L428 ceAbstractionStarter]: At program point L768(line 768) the Hoare annotation is: true [2018-11-10 13:28:41,156 INFO L428 ceAbstractionStarter]: At program point L767(line 767) the Hoare annotation is: true [2018-11-10 13:28:41,156 INFO L425 ceAbstractionStarter]: For program point L768-1(lines 751 773) no Hoare annotation was computed. [2018-11-10 13:28:41,156 INFO L428 ceAbstractionStarter]: At program point L766(line 766) the Hoare annotation is: true [2018-11-10 13:28:41,156 INFO L425 ceAbstractionStarter]: For program point L767-1(line 767) no Hoare annotation was computed. [2018-11-10 13:28:41,157 INFO L425 ceAbstractionStarter]: For program point L766-1(line 766) no Hoare annotation was computed. [2018-11-10 13:28:41,157 INFO L425 ceAbstractionStarter]: For program point L762(lines 762 770) no Hoare annotation was computed. [2018-11-10 13:28:41,157 INFO L425 ceAbstractionStarter]: For program point L760(line 760) no Hoare annotation was computed. [2018-11-10 13:28:41,157 INFO L428 ceAbstractionStarter]: At program point L759(line 759) the Hoare annotation is: true [2018-11-10 13:28:41,157 INFO L428 ceAbstractionStarter]: At program point L759-1(line 759) the Hoare annotation is: true [2018-11-10 13:28:41,157 INFO L425 ceAbstractionStarter]: For program point bobToRjhEXIT(lines 751 773) no Hoare annotation was computed. [2018-11-10 13:28:41,157 INFO L428 ceAbstractionStarter]: At program point bobToRjhENTRY(lines 751 773) the Hoare annotation is: true [2018-11-10 13:28:41,157 INFO L428 ceAbstractionStarter]: At program point setup_bobENTRY(lines 721 730) the Hoare annotation is: true [2018-11-10 13:28:41,157 INFO L425 ceAbstractionStarter]: For program point setup_bobFINAL(lines 721 730) no Hoare annotation was computed. [2018-11-10 13:28:41,157 INFO L428 ceAbstractionStarter]: At program point L726(line 726) the Hoare annotation is: true [2018-11-10 13:28:41,157 INFO L425 ceAbstractionStarter]: For program point setup_bobEXIT(lines 721 730) no Hoare annotation was computed. [2018-11-10 13:28:41,157 INFO L425 ceAbstractionStarter]: For program point getClientAutoResponseFINAL(lines 2062 2085) no Hoare annotation was computed. [2018-11-10 13:28:41,157 INFO L425 ceAbstractionStarter]: For program point getClientAutoResponseEXIT(lines 2062 2085) no Hoare annotation was computed. [2018-11-10 13:28:41,157 INFO L425 ceAbstractionStarter]: For program point L2074(lines 2074 2080) no Hoare annotation was computed. [2018-11-10 13:28:41,157 INFO L428 ceAbstractionStarter]: At program point getClientAutoResponseENTRY(lines 2062 2085) the Hoare annotation is: true [2018-11-10 13:28:41,158 INFO L425 ceAbstractionStarter]: For program point L2070(lines 2070 2081) no Hoare annotation was computed. [2018-11-10 13:28:41,158 INFO L425 ceAbstractionStarter]: For program point L2066(lines 2066 2082) no Hoare annotation was computed. [2018-11-10 13:28:41,158 INFO L425 ceAbstractionStarter]: For program point select_featuresEXIT(lines 82 88) no Hoare annotation was computed. [2018-11-10 13:28:41,158 INFO L428 ceAbstractionStarter]: At program point select_featuresFINAL(lines 82 88) the Hoare annotation is: true [2018-11-10 13:28:41,158 INFO L425 ceAbstractionStarter]: For program point autoRespondEXIT(lines 675 689) no Hoare annotation was computed. [2018-11-10 13:28:41,158 INFO L428 ceAbstractionStarter]: At program point L684(line 684) the Hoare annotation is: true [2018-11-10 13:28:41,158 INFO L428 ceAbstractionStarter]: At program point autoRespondENTRY(lines 675 689) the Hoare annotation is: true [2018-11-10 13:28:41,158 INFO L428 ceAbstractionStarter]: At program point L684-1(line 684) the Hoare annotation is: true [2018-11-10 13:28:41,158 INFO L425 ceAbstractionStarter]: For program point autoRespondFINAL(lines 675 689) no Hoare annotation was computed. [2018-11-10 13:28:41,158 INFO L428 ceAbstractionStarter]: At program point L682(line 682) the Hoare annotation is: true [2018-11-10 13:28:41,158 INFO L425 ceAbstractionStarter]: For program point L682-1(line 682) no Hoare annotation was computed. [2018-11-10 13:28:41,158 INFO L428 ceAbstractionStarter]: At program point rjhSetAutoRespondENTRY(lines 829 838) the Hoare annotation is: true [2018-11-10 13:28:41,158 INFO L425 ceAbstractionStarter]: For program point rjhSetAutoRespondFINAL(lines 829 838) no Hoare annotation was computed. [2018-11-10 13:28:41,159 INFO L425 ceAbstractionStarter]: For program point rjhSetAutoRespondEXIT(lines 829 838) no Hoare annotation was computed. [2018-11-10 13:28:41,159 INFO L428 ceAbstractionStarter]: At program point incoming__wrappee__BaseENTRY(lines 561 570) the Hoare annotation is: true [2018-11-10 13:28:41,159 INFO L428 ceAbstractionStarter]: At program point L566(line 566) the Hoare annotation is: true [2018-11-10 13:28:41,159 INFO L425 ceAbstractionStarter]: For program point incoming__wrappee__BaseFINAL(lines 561 570) no Hoare annotation was computed. [2018-11-10 13:28:41,159 INFO L425 ceAbstractionStarter]: For program point incoming__wrappee__BaseEXIT(lines 561 570) no Hoare annotation was computed. [2018-11-10 13:28:41,159 INFO L425 ceAbstractionStarter]: For program point getClientForwardReceiverFINAL(lines 2497 2520) no Hoare annotation was computed. [2018-11-10 13:28:41,159 INFO L425 ceAbstractionStarter]: For program point L2509(lines 2509 2515) no Hoare annotation was computed. [2018-11-10 13:28:41,159 INFO L425 ceAbstractionStarter]: For program point getClientForwardReceiverEXIT(lines 2497 2520) no Hoare annotation was computed. [2018-11-10 13:28:41,159 INFO L425 ceAbstractionStarter]: For program point L2505(lines 2505 2516) no Hoare annotation was computed. [2018-11-10 13:28:41,159 INFO L428 ceAbstractionStarter]: At program point getClientForwardReceiverENTRY(lines 2497 2520) the Hoare annotation is: true [2018-11-10 13:28:41,159 INFO L425 ceAbstractionStarter]: For program point L2501(lines 2501 2517) no Hoare annotation was computed. [2018-11-10 13:28:41,159 INFO L428 ceAbstractionStarter]: At program point incomingENTRY(lines 589 609) the Hoare annotation is: true [2018-11-10 13:28:41,159 INFO L421 ceAbstractionStarter]: At program point L601(line 601) the Hoare annotation is: (or (not (= 0 ~__ste_client_forwardReceiver1~0)) (not (= 0 ~__ste_client_forwardReceiver2~0)) (not (= 0 ~__ste_client_forwardReceiver0~0))) [2018-11-10 13:28:41,160 INFO L421 ceAbstractionStarter]: At program point L601-1(line 601) the Hoare annotation is: (or (not (= 0 ~__ste_client_forwardReceiver1~0)) (not (= 0 ~__ste_client_forwardReceiver2~0)) (not (= 0 ~__ste_client_forwardReceiver0~0))) [2018-11-10 13:28:41,160 INFO L425 ceAbstractionStarter]: For program point L599(lines 599 606) no Hoare annotation was computed. [2018-11-10 13:28:41,160 INFO L425 ceAbstractionStarter]: For program point L599-1(lines 589 609) no Hoare annotation was computed. [2018-11-10 13:28:41,160 INFO L425 ceAbstractionStarter]: For program point L596(line 596) no Hoare annotation was computed. [2018-11-10 13:28:41,160 INFO L428 ceAbstractionStarter]: At program point L595(line 595) the Hoare annotation is: true [2018-11-10 13:28:41,160 INFO L425 ceAbstractionStarter]: For program point incomingEXIT(lines 589 609) no Hoare annotation was computed. [2018-11-10 13:28:41,160 INFO L428 ceAbstractionStarter]: At program point L595-1(line 595) the Hoare annotation is: true [2018-11-10 13:28:41,160 INFO L425 ceAbstractionStarter]: For program point createEmailEXIT(lines 1500 1514) no Hoare annotation was computed. [2018-11-10 13:28:41,160 INFO L425 ceAbstractionStarter]: For program point L1508(line 1508) no Hoare annotation was computed. [2018-11-10 13:28:41,160 INFO L428 ceAbstractionStarter]: At program point createEmailENTRY(lines 1500 1514) the Hoare annotation is: true [2018-11-10 13:28:41,160 INFO L428 ceAbstractionStarter]: At program point L1507(line 1507) the Hoare annotation is: true [2018-11-10 13:28:41,160 INFO L428 ceAbstractionStarter]: At program point L1507-1(line 1507) the Hoare annotation is: true [2018-11-10 13:28:41,160 INFO L425 ceAbstractionStarter]: For program point createEmailFINAL(lines 1500 1514) no Hoare annotation was computed. [2018-11-10 13:28:41,160 INFO L428 ceAbstractionStarter]: At program point L1340(lines 1330 1440) the Hoare annotation is: true [2018-11-10 13:28:41,161 INFO L428 ceAbstractionStarter]: At program point L1398(lines 1388 1435) the Hoare annotation is: true [2018-11-10 13:28:41,161 INFO L425 ceAbstractionStarter]: For program point L1299(lines 1299 1303) no Hoare annotation was computed. [2018-11-10 13:28:41,161 INFO L425 ceAbstractionStarter]: For program point testEXIT(lines 1258 1451) no Hoare annotation was computed. [2018-11-10 13:28:41,161 INFO L421 ceAbstractionStarter]: At program point testENTRY(lines 1258 1451) the Hoare annotation is: (or (not (= 0 |old(~__ste_client_forwardReceiver1~0)|)) (and (= 0 ~__ste_client_forwardReceiver2~0) (= 0 ~__ste_client_forwardReceiver1~0) (= 0 ~__ste_client_forwardReceiver0~0)) (not (= 0 |old(~__ste_client_forwardReceiver2~0)|)) (not (= 0 |old(~__ste_client_forwardReceiver0~0)|))) [2018-11-10 13:28:41,161 INFO L425 ceAbstractionStarter]: For program point L1309(lines 1309 1313) no Hoare annotation was computed. [2018-11-10 13:28:41,161 INFO L425 ceAbstractionStarter]: For program point L1367(lines 1367 1374) no Hoare annotation was computed. [2018-11-10 13:28:41,161 INFO L425 ceAbstractionStarter]: For program point testFINAL(lines 1258 1451) no Hoare annotation was computed. [2018-11-10 13:28:41,161 INFO L425 ceAbstractionStarter]: For program point L1334(lines 1334 1338) no Hoare annotation was computed. [2018-11-10 13:28:41,161 INFO L425 ceAbstractionStarter]: For program point L1425(lines 1425 1429) no Hoare annotation was computed. [2018-11-10 13:28:41,161 INFO L425 ceAbstractionStarter]: For program point L1392(lines 1392 1396) no Hoare annotation was computed. [2018-11-10 13:28:41,161 INFO L428 ceAbstractionStarter]: At program point L1425-1(lines 1297 1443) the Hoare annotation is: true [2018-11-10 13:28:41,161 INFO L428 ceAbstractionStarter]: At program point L1351(lines 1341 1439) the Hoare annotation is: true [2018-11-10 13:28:41,161 INFO L428 ceAbstractionStarter]: At program point L1409(lines 1399 1434) the Hoare annotation is: true [2018-11-10 13:28:41,161 INFO L428 ceAbstractionStarter]: At program point L1376(lines 1363 1437) the Hoare annotation is: true [2018-11-10 13:28:41,161 INFO L428 ceAbstractionStarter]: At program point L1369(line 1369) the Hoare annotation is: true [2018-11-10 13:28:41,162 INFO L425 ceAbstractionStarter]: For program point L1369-1(line 1369) no Hoare annotation was computed. [2018-11-10 13:28:41,162 INFO L425 ceAbstractionStarter]: For program point L1320(lines 1320 1327) no Hoare annotation was computed. [2018-11-10 13:28:41,162 INFO L428 ceAbstractionStarter]: At program point L1444(lines 1296 1445) the Hoare annotation is: true [2018-11-10 13:28:41,162 INFO L425 ceAbstractionStarter]: For program point L1345(lines 1345 1349) no Hoare annotation was computed. [2018-11-10 13:28:41,162 INFO L425 ceAbstractionStarter]: For program point L1403(lines 1403 1407) no Hoare annotation was computed. [2018-11-10 13:28:41,162 INFO L428 ceAbstractionStarter]: At program point L1362(lines 1352 1438) the Hoare annotation is: true [2018-11-10 13:28:41,162 INFO L428 ceAbstractionStarter]: At program point L1329(lines 1316 1441) the Hoare annotation is: true [2018-11-10 13:28:41,162 INFO L428 ceAbstractionStarter]: At program point L1420(lines 1410 1433) the Hoare annotation is: true [2018-11-10 13:28:41,162 INFO L428 ceAbstractionStarter]: At program point L1387(lines 1377 1436) the Hoare annotation is: true [2018-11-10 13:28:41,162 INFO L425 ceAbstractionStarter]: For program point L1305(lines 1305 1442) no Hoare annotation was computed. [2018-11-10 13:28:41,162 INFO L425 ceAbstractionStarter]: For program point L1297-1(lines 1297 1443) no Hoare annotation was computed. [2018-11-10 13:28:41,162 INFO L421 ceAbstractionStarter]: At program point L1322(line 1322) the Hoare annotation is: (or (= test_~op2~0 0) (not (= 0 |old(~__ste_client_forwardReceiver1~0)|)) (not (= 0 |old(~__ste_client_forwardReceiver2~0)|)) (not (= 0 |old(~__ste_client_forwardReceiver0~0)|))) [2018-11-10 13:28:41,162 INFO L425 ceAbstractionStarter]: For program point L1322-1(line 1322) no Hoare annotation was computed. [2018-11-10 13:28:41,162 INFO L425 ceAbstractionStarter]: For program point L1298(lines 1297 1443) no Hoare annotation was computed. [2018-11-10 13:28:41,162 INFO L425 ceAbstractionStarter]: For program point L1356(lines 1356 1360) no Hoare annotation was computed. [2018-11-10 13:28:41,163 INFO L425 ceAbstractionStarter]: For program point L1414(lines 1414 1418) no Hoare annotation was computed. [2018-11-10 13:28:41,163 INFO L425 ceAbstractionStarter]: For program point L1381(lines 1381 1385) no Hoare annotation was computed. [2018-11-10 13:28:41,163 INFO L428 ceAbstractionStarter]: At program point L1315(lines 1305 1442) the Hoare annotation is: true [2018-11-10 13:28:41,163 INFO L428 ceAbstractionStarter]: At program point L1472(line 1472) the Hoare annotation is: true [2018-11-10 13:28:41,163 INFO L425 ceAbstractionStarter]: For program point L1472-1(line 1472) no Hoare annotation was computed. [2018-11-10 13:28:41,163 INFO L428 ceAbstractionStarter]: At program point L1469(line 1469) the Hoare annotation is: true [2018-11-10 13:28:41,163 INFO L425 ceAbstractionStarter]: For program point L1469-1(line 1469) no Hoare annotation was computed. [2018-11-10 13:28:41,163 INFO L428 ceAbstractionStarter]: At program point L1466(line 1466) the Hoare annotation is: true [2018-11-10 13:28:41,163 INFO L425 ceAbstractionStarter]: For program point L1466-1(line 1466) no Hoare annotation was computed. [2018-11-10 13:28:41,163 INFO L425 ceAbstractionStarter]: For program point printMailEXIT(lines 1454 1481) no Hoare annotation was computed. [2018-11-10 13:28:41,163 INFO L428 ceAbstractionStarter]: At program point printMailENTRY(lines 1454 1481) the Hoare annotation is: true [2018-11-10 13:28:41,163 INFO L428 ceAbstractionStarter]: At program point L1475(line 1475) the Hoare annotation is: true [2018-11-10 13:28:41,163 INFO L425 ceAbstractionStarter]: For program point printMailFINAL(lines 1454 1481) no Hoare annotation was computed. [2018-11-10 13:28:41,163 INFO L425 ceAbstractionStarter]: For program point L1475-1(line 1475) no Hoare annotation was computed. [2018-11-10 13:28:41,163 INFO L428 ceAbstractionStarter]: At program point forwardENTRY(lines 690 703) the Hoare annotation is: true [2018-11-10 13:28:41,164 INFO L425 ceAbstractionStarter]: For program point forwardEXIT(lines 690 703) no Hoare annotation was computed. [2018-11-10 13:28:41,164 INFO L428 ceAbstractionStarter]: At program point L698(line 698) the Hoare annotation is: true [2018-11-10 13:28:41,164 INFO L428 ceAbstractionStarter]: At program point L698-1(line 698) the Hoare annotation is: true [2018-11-10 13:28:41,164 INFO L428 ceAbstractionStarter]: At program point L696(line 696) the Hoare annotation is: true [2018-11-10 13:28:41,164 INFO L425 ceAbstractionStarter]: For program point forwardFINAL(lines 690 703) no Hoare annotation was computed. [2018-11-10 13:28:41,164 INFO L425 ceAbstractionStarter]: For program point L696-1(line 696) no Hoare annotation was computed. [2018-11-10 13:28:41,164 INFO L425 ceAbstractionStarter]: For program point L985(lines 985 989) no Hoare annotation was computed. [2018-11-10 13:28:41,164 INFO L425 ceAbstractionStarter]: For program point L985-2(lines 978 993) no Hoare annotation was computed. [2018-11-10 13:28:41,164 INFO L425 ceAbstractionStarter]: For program point L982(lines 982 990) no Hoare annotation was computed. [2018-11-10 13:28:41,164 INFO L425 ceAbstractionStarter]: For program point setEmailToEXIT(lines 978 993) no Hoare annotation was computed. [2018-11-10 13:28:41,164 INFO L428 ceAbstractionStarter]: At program point setEmailToENTRY(lines 978 993) the Hoare annotation is: true [2018-11-10 13:28:41,164 INFO L425 ceAbstractionStarter]: For program point getEmailToFINAL(lines 959 977) no Hoare annotation was computed. [2018-11-10 13:28:41,164 INFO L425 ceAbstractionStarter]: For program point getEmailToEXIT(lines 959 977) no Hoare annotation was computed. [2018-11-10 13:28:41,164 INFO L425 ceAbstractionStarter]: For program point L967(lines 967 973) no Hoare annotation was computed. [2018-11-10 13:28:41,164 INFO L428 ceAbstractionStarter]: At program point getEmailToENTRY(lines 959 977) the Hoare annotation is: true [2018-11-10 13:28:41,164 INFO L425 ceAbstractionStarter]: For program point L963(lines 963 974) no Hoare annotation was computed. [2018-11-10 13:28:41,165 INFO L425 ceAbstractionStarter]: For program point is_queue_emptyEXIT(lines 648 656) no Hoare annotation was computed. [2018-11-10 13:28:41,165 INFO L428 ceAbstractionStarter]: At program point is_queue_emptyENTRY(lines 648 656) the Hoare annotation is: true [2018-11-10 13:28:41,165 INFO L425 ceAbstractionStarter]: For program point is_queue_emptyFINAL(lines 648 656) no Hoare annotation was computed. [2018-11-10 13:28:41,165 INFO L428 ceAbstractionStarter]: At program point get_queued_emailENTRY(lines 666 674) the Hoare annotation is: true [2018-11-10 13:28:41,165 INFO L425 ceAbstractionStarter]: For program point get_queued_emailFINAL(lines 666 674) no Hoare annotation was computed. [2018-11-10 13:28:41,165 INFO L425 ceAbstractionStarter]: For program point get_queued_emailEXIT(lines 666 674) no Hoare annotation was computed. [2018-11-10 13:28:41,165 INFO L425 ceAbstractionStarter]: For program point setClientAutoResponseEXIT(lines 2086 2105) no Hoare annotation was computed. [2018-11-10 13:28:41,165 INFO L425 ceAbstractionStarter]: For program point L2096(lines 2096 2100) no Hoare annotation was computed. [2018-11-10 13:28:41,165 INFO L425 ceAbstractionStarter]: For program point L2096-2(lines 2086 2105) no Hoare annotation was computed. [2018-11-10 13:28:41,165 INFO L425 ceAbstractionStarter]: For program point L2093(lines 2093 2101) no Hoare annotation was computed. [2018-11-10 13:28:41,165 INFO L428 ceAbstractionStarter]: At program point setClientAutoResponseENTRY(lines 2086 2105) the Hoare annotation is: true [2018-11-10 13:28:41,165 INFO L425 ceAbstractionStarter]: For program point L2090(lines 2090 2102) no Hoare annotation was computed. [2018-11-10 13:28:41,165 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-10 13:28:41,165 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-10 13:28:41,165 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-10 13:28:41,166 INFO L425 ceAbstractionStarter]: For program point rjhEnableForwardingEXIT(lines 839 848) no Hoare annotation was computed. [2018-11-10 13:28:41,166 INFO L421 ceAbstractionStarter]: At program point rjhEnableForwardingENTRY(lines 839 848) the Hoare annotation is: (and (or (not (= 0 |old(~__ste_client_forwardReceiver2~0)|)) (= 0 ~__ste_client_forwardReceiver2~0)) (or (not (= 0 |old(~__ste_client_forwardReceiver0~0)|)) (= 0 ~__ste_client_forwardReceiver0~0)) (or (not (= 0 |old(~__ste_client_forwardReceiver1~0)|)) (= 0 ~__ste_client_forwardReceiver1~0))) [2018-11-10 13:28:41,166 INFO L425 ceAbstractionStarter]: For program point rjhEnableForwardingFINAL(lines 839 848) no Hoare annotation was computed. [2018-11-10 13:28:41,166 INFO L425 ceAbstractionStarter]: For program point L945(lines 945 953) no Hoare annotation was computed. [2018-11-10 13:28:41,166 INFO L428 ceAbstractionStarter]: At program point setEmailFromENTRY(lines 941 956) the Hoare annotation is: true [2018-11-10 13:28:41,166 INFO L425 ceAbstractionStarter]: For program point setEmailFromEXIT(lines 941 956) no Hoare annotation was computed. [2018-11-10 13:28:41,166 INFO L425 ceAbstractionStarter]: For program point L948(lines 948 952) no Hoare annotation was computed. [2018-11-10 13:28:41,166 INFO L425 ceAbstractionStarter]: For program point L948-2(lines 941 956) no Hoare annotation was computed. [2018-11-10 13:28:41,166 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-10 13:28:41,166 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= 0 ~__ste_client_forwardReceiver2~0) (= 0 ~__ste_client_forwardReceiver1~0) (= 0 ~__ste_client_forwardReceiver0~0)) [2018-11-10 13:28:41,166 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-10 13:28:41,167 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-10 13:28:41,167 INFO L428 ceAbstractionStarter]: At program point L801(line 801) the Hoare annotation is: true [2018-11-10 13:28:41,167 INFO L425 ceAbstractionStarter]: For program point L801-1(line 801) no Hoare annotation was computed. [2018-11-10 13:28:41,167 INFO L425 ceAbstractionStarter]: For program point setupEXIT(lines 785 807) no Hoare annotation was computed. [2018-11-10 13:28:41,167 INFO L428 ceAbstractionStarter]: At program point setupENTRY(lines 785 807) the Hoare annotation is: true [2018-11-10 13:28:41,167 INFO L428 ceAbstractionStarter]: At program point L797(line 797) the Hoare annotation is: true [2018-11-10 13:28:41,167 INFO L425 ceAbstractionStarter]: For program point L797-1(line 797) no Hoare annotation was computed. [2018-11-10 13:28:41,167 INFO L425 ceAbstractionStarter]: For program point setupFINAL(lines 785 807) no Hoare annotation was computed. [2018-11-10 13:28:41,167 INFO L428 ceAbstractionStarter]: At program point L793(line 793) the Hoare annotation is: true [2018-11-10 13:28:41,167 INFO L425 ceAbstractionStarter]: For program point L793-1(line 793) no Hoare annotation was computed. [2018-11-10 13:28:41,167 INFO L421 ceAbstractionStarter]: At program point L129(line 129) the Hoare annotation is: false [2018-11-10 13:28:41,167 INFO L425 ceAbstractionStarter]: For program point L129-1(lines 117 134) no Hoare annotation was computed. [2018-11-10 13:28:41,167 INFO L425 ceAbstractionStarter]: For program point __utac_acc__DecryptForward_spec__1EXIT(lines 117 134) no Hoare annotation was computed. [2018-11-10 13:28:41,168 INFO L425 ceAbstractionStarter]: For program point L125(lines 125 131) no Hoare annotation was computed. [2018-11-10 13:28:41,168 INFO L428 ceAbstractionStarter]: At program point L123(line 123) the Hoare annotation is: true [2018-11-10 13:28:41,168 INFO L425 ceAbstractionStarter]: For program point L123-1(line 123) no Hoare annotation was computed. [2018-11-10 13:28:41,168 INFO L428 ceAbstractionStarter]: At program point __utac_acc__DecryptForward_spec__1ENTRY(lines 117 134) the Hoare annotation is: true [2018-11-10 13:28:41,168 INFO L425 ceAbstractionStarter]: For program point getEmailFromFINAL(lines 922 940) no Hoare annotation was computed. [2018-11-10 13:28:41,168 INFO L425 ceAbstractionStarter]: For program point L926(lines 926 937) no Hoare annotation was computed. [2018-11-10 13:28:41,168 INFO L425 ceAbstractionStarter]: For program point getEmailFromEXIT(lines 922 940) no Hoare annotation was computed. [2018-11-10 13:28:41,168 INFO L428 ceAbstractionStarter]: At program point getEmailFromENTRY(lines 922 940) the Hoare annotation is: true [2018-11-10 13:28:41,168 INFO L425 ceAbstractionStarter]: For program point L930(lines 930 936) no Hoare annotation was computed. [2018-11-10 13:28:41,168 INFO L425 ceAbstractionStarter]: For program point isReadableEXIT(lines 1482 1490) no Hoare annotation was computed. [2018-11-10 13:28:41,168 INFO L428 ceAbstractionStarter]: At program point isReadableENTRY(lines 1482 1490) the Hoare annotation is: true [2018-11-10 13:28:41,168 INFO L425 ceAbstractionStarter]: For program point isReadableFINAL(lines 1482 1490) no Hoare annotation was computed. [2018-11-10 13:28:41,168 INFO L425 ceAbstractionStarter]: For program point __automaton_failFINAL(lines 106 113) no Hoare annotation was computed. [2018-11-10 13:28:41,168 INFO L425 ceAbstractionStarter]: For program point __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION(line 110) no Hoare annotation was computed. [2018-11-10 13:28:41,168 INFO L428 ceAbstractionStarter]: At program point __automaton_failENTRY(lines 106 113) the Hoare annotation is: true [2018-11-10 13:28:41,169 INFO L425 ceAbstractionStarter]: For program point __automaton_failEXIT(lines 106 113) no Hoare annotation was computed. [2018-11-10 13:28:41,169 INFO L425 ceAbstractionStarter]: For program point queueFINAL(lines 638 647) no Hoare annotation was computed. [2018-11-10 13:28:41,169 INFO L428 ceAbstractionStarter]: At program point queueENTRY(lines 638 647) the Hoare annotation is: true [2018-11-10 13:28:41,169 INFO L425 ceAbstractionStarter]: For program point queueEXIT(lines 638 647) no Hoare annotation was computed. [2018-11-10 13:28:41,169 INFO L425 ceAbstractionStarter]: For program point L2578(lines 2578 2582) no Hoare annotation was computed. [2018-11-10 13:28:41,169 INFO L425 ceAbstractionStarter]: For program point L2578-2(lines 2568 2587) no Hoare annotation was computed. [2018-11-10 13:28:41,169 INFO L425 ceAbstractionStarter]: For program point L2575(lines 2575 2583) no Hoare annotation was computed. [2018-11-10 13:28:41,169 INFO L425 ceAbstractionStarter]: For program point L2572(lines 2572 2584) no Hoare annotation was computed. [2018-11-10 13:28:41,169 INFO L425 ceAbstractionStarter]: For program point setClientIdEXIT(lines 2568 2587) no Hoare annotation was computed. [2018-11-10 13:28:41,169 INFO L428 ceAbstractionStarter]: At program point setClientIdENTRY(lines 2568 2587) the Hoare annotation is: true [2018-11-10 13:28:41,175 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 01:28:41 BoogieIcfgContainer [2018-11-10 13:28:41,175 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 13:28:41,175 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 13:28:41,175 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 13:28:41,175 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 13:28:41,176 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:28:35" (3/4) ... [2018-11-10 13:28:41,179 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-10 13:28:41,185 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure outgoing [2018-11-10 13:28:41,186 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure setClientForwardReceiver [2018-11-10 13:28:41,186 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure select_helpers [2018-11-10 13:28:41,186 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure getClientId [2018-11-10 13:28:41,186 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure valid_product [2018-11-10 13:28:41,186 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure mail [2018-11-10 13:28:41,186 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure get_queued_client [2018-11-10 13:28:41,186 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure incoming__wrappee__AutoResponder [2018-11-10 13:28:41,186 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure deliver [2018-11-10 13:28:41,186 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-10 13:28:41,186 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure getEmailId [2018-11-10 13:28:41,186 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure setup_chuck [2018-11-10 13:28:41,186 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure setup_rjh [2018-11-10 13:28:41,186 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure sendEmail [2018-11-10 13:28:41,186 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure bobToRjh [2018-11-10 13:28:41,187 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure setup_bob [2018-11-10 13:28:41,187 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure getClientAutoResponse [2018-11-10 13:28:41,187 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure select_features [2018-11-10 13:28:41,187 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure autoRespond [2018-11-10 13:28:41,187 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure rjhSetAutoRespond [2018-11-10 13:28:41,187 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure incoming__wrappee__Base [2018-11-10 13:28:41,187 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure getClientForwardReceiver [2018-11-10 13:28:41,187 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure incoming [2018-11-10 13:28:41,187 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure createEmail [2018-11-10 13:28:41,187 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure test [2018-11-10 13:28:41,187 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure printMail [2018-11-10 13:28:41,187 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure forward [2018-11-10 13:28:41,187 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure setEmailTo [2018-11-10 13:28:41,187 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure getEmailTo [2018-11-10 13:28:41,187 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure is_queue_empty [2018-11-10 13:28:41,188 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure get_queued_email [2018-11-10 13:28:41,188 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure setClientAutoResponse [2018-11-10 13:28:41,188 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-10 13:28:41,188 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure rjhEnableForwarding [2018-11-10 13:28:41,188 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure setEmailFrom [2018-11-10 13:28:41,188 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure setup [2018-11-10 13:28:41,188 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure __utac_acc__DecryptForward_spec__1 [2018-11-10 13:28:41,188 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure getEmailFrom [2018-11-10 13:28:41,189 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure isReadable [2018-11-10 13:28:41,189 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure __automaton_fail [2018-11-10 13:28:41,189 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure queue [2018-11-10 13:28:41,189 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure setClientId [2018-11-10 13:28:41,200 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 179 nodes and edges [2018-11-10 13:28:41,201 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 73 nodes and edges [2018-11-10 13:28:41,201 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 28 nodes and edges [2018-11-10 13:28:41,293 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_f82ce3df-e58b-4def-ab81-e7dff9c6ba2b/bin-2019/utaipan/witness.graphml [2018-11-10 13:28:41,293 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 13:28:41,294 INFO L168 Benchmark]: Toolchain (without parser) took 6717.94 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 507.0 MB). Free memory was 956.5 MB in the beginning and 1.1 GB in the end (delta: -166.0 MB). Peak memory consumption was 341.0 MB. Max. memory is 11.5 GB. [2018-11-10 13:28:41,294 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 13:28:41,295 INFO L168 Benchmark]: CACSL2BoogieTranslator took 515.41 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 956.5 MB in the beginning and 1.1 GB in the end (delta: -160.8 MB). Peak memory consumption was 55.2 MB. Max. memory is 11.5 GB. [2018-11-10 13:28:41,295 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.03 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-10 13:28:41,295 INFO L168 Benchmark]: Boogie Preprocessor took 41.21 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 13:28:41,295 INFO L168 Benchmark]: RCFGBuilder took 781.45 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 979.3 MB in the end (delta: 127.2 MB). Peak memory consumption was 127.2 MB. Max. memory is 11.5 GB. [2018-11-10 13:28:41,295 INFO L168 Benchmark]: TraceAbstraction took 5210.82 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 364.4 MB). Free memory was 979.3 MB in the beginning and 1.1 GB in the end (delta: -168.1 MB). Peak memory consumption was 308.6 MB. Max. memory is 11.5 GB. [2018-11-10 13:28:41,296 INFO L168 Benchmark]: Witness Printer took 117.80 ms. Allocated memory is still 1.5 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.9 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. [2018-11-10 13:28:41,297 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 515.41 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 956.5 MB in the beginning and 1.1 GB in the end (delta: -160.8 MB). Peak memory consumption was 55.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 48.03 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 41.21 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 781.45 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 979.3 MB in the end (delta: 127.2 MB). Peak memory consumption was 127.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5210.82 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 364.4 MB). Free memory was 979.3 MB in the beginning and 1.1 GB in the end (delta: -168.1 MB). Peak memory consumption was 308.6 MB. Max. memory is 11.5 GB. * Witness Printer took 117.80 ms. Allocated memory is still 1.5 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.9 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 110]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1296]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1305]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1352]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1330]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1410]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1341]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1388]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1316]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1399]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1363]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1297]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1377]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 43 procedures, 259 locations, 1 error locations. SAFE Result, 5.1s OverallTime, 13 OverallIterations, 3 TraceHistogramMax, 1.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 4147 SDtfs, 1085 SDslu, 11417 SDs, 0 SdLazy, 674 SolverSat, 20 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 86 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8180occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 13 MinimizatonAttempts, 130 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 103 LocationsWithAnnotation, 5282 PreInvPairs, 8582 NumberOfFragments, 365 HoareAnnotationTreeSize, 5282 FomulaSimplifications, 2212 FormulaSimplificationTreeSizeReduction, 0.5s HoareSimplificationTime, 103 FomulaSimplificationsInter, 5977 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 2032 NumberOfCodeBlocks, 2032 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2019 ConstructedInterpolants, 0 QuantifiedInterpolants, 382815 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 293/293 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...